Count the number of possible triangles

-
1. geeksforgeeks.org/find-number-of-triangles-possible/

Comments

Post a Comment

Popular posts from this blog

VR app

-
1. Moving and camera https://www.youtube.com/watch?v=ecYezSD4qPg https://www.youtube.com/watch?v=u5Wp1pXmkCE 2. Sun https://www.youtube.com/watch?v=BUi2PpR4u6o&t=239s 3. Blender https://gamedevacademy.org/how-to-import-blender-models-into-unity-your-one-stop-guide/ 4. Skybox https://www.youtube.com/watch?v=VCW_T3ZDcBc stars making using blender https://www.youtube.com/watch?v=nLMmnFAx-pE
Read more

UVA 573

-
#include<bits/stdc++.h> using namespace std; int main() {     double a,b,c,d,e=0,f=0,sum=0;     while(cin>>a>>b>>c>>d)     {         if(a+b+c+d==0)         {             break;         }         e=d/100.0;         e=e*b;         while(f>0 || f<=a)         {             if(sum>=1)             {                 b=b-e;             }             if(b<0)             {                 b=0;             }             f=f+b;       ...
Read more

UVA 294

-
Don't copy without trying. # include <bits/stdc++.h> using namespace std ; int status[ 100000000 / 32 ]; bool Check ( int N, int pos) { return ( bool )(N & ( 1 <<pos));} int Set ( int N, int pos) { return N=N | ( 1 <<pos);} long long int arr[ 10000000 ]; long long int l= 0 ,a,b= 31700 ,n; void sieve () { long long int i,j,sqrtN; sqrtN = int ( sqrt ( b ) ); for ( i= 3 ; i<=sqrtN; i+= 2 ) { if ( Check(status[i/ 32 ],i% 32 )== 0 ) { for (j=i*i; j<=b; j+= 2 *i) { status[j/ 32 ]=Set(status[j/ 32 ],j% 32 ); } } } arr[ 0 ]= 2 ; l= 1 ; for (i= 3 ;i<=b;i+= 2 ){ if (Check(status[i/ 32 ],i% 32 )== 0 ){ arr[l]=i; l++; } } } long long int p[ 1000000 ]; long long int e[ 1000000 ]; int nk= 0 ; void decomp ( long long int a) { long long int sqrtA= sqrt (a); for ( long long int i= 0 ; i<l ...
Read more