UVA Problem 640 ( Self Numbers): Is a basic UVa problem. Details link:   Problem Details: This is a Straightforward problem.   problem solution: #include <stdio.h> #include <math.h> int d[1000010]; int generator(int num) { int sum = num;...

#include<bits/stdc++.h> #define PI acos(-1) using namespace std; int main () { double dis_of_sate ,angle,r; char s[4]; while(cin>>dis_of_sate>>angle>>s) // circle (arc) length s=r*theta. (chord) length = 2*rsin(C/2) { if(s[0]=='m') angle/=60;...

  #include <bits/stdc++.h> #include <math.h> #define pi acos(0.0) //#define pi 3.1416 int main() { double n; while(scanf("%lf",&n) != EOF ) { //poligon_inte_angle = (3/5)*180=(108 degree)as figure sides n=5; //square_inte_angle = (2/4)*90=(63...

  #include <bits/stdc++.h> #include <math.h> using namespace std; int main() { double a,b,c,ans,s; while(scanf("%lf %lf %lf",&a,&b,&c) == 3 ) { s=(a+b+c)/2; ans=sqrt(s*(s-a)*(s-b)*(s-c)); if(ans>0) printf("%.3lf\n",ans*(4.0/3.0)); else...

    #include <bits/stdc++.h> #include<iostream> #include<math.h> #define pi 2*acos(0.0) using namespace std; int main() { double n,x,y,a,R,r,A,A1,A2,spect,offic; int c=0; while(scanf("%lf %lf",&n,&A)==2 && n>=3) {...

    #include <bits/stdc++.h> #include <cmath> using namespace std; int main() { int tc; cin>>tc; while (tc) { double ha, hb, hc,a,b,c;//s,s1,a1,b1,c1,a,b,c; scanf("%lf%lf%lf", &ha, &hb, &hc); a=1/ha,b=1/hb,c=1/hc; double s1=(a +...

    #include <bits/stdc++.h> #define PI 2*acos(0) using namespace std; int main() { int n,tc,i,j; char t[2]; cin>>tc; while(tc--) { int a,b; cin>>a; if(getchar()=='\n') { printf("%.4lf\n", (2*a*a*PI)/16); } else { cin>>b;...

    #include <bits/stdc++.h> using namespace std; int main() { int N,a,M,rr; double x,y; while(scanf("%d %d",&N,&a)!=EOF && N) { bool f = true; M = 0; rr = a*a; for(int i = 0;i<N;++i) { scanf("%lf %lf",&x,&y); f = true;...

    #include <bits/stdc++.h> #define PI 2*acos(0) using namespace std; int main() { double d,l,D,L,i,r1,r2; int tc; double ans; cin>>tc; while(tc--) { cin>>D>>L; d=D/2.0; l=L/2.0; r1=sqrt((L/2 * L/2) - (D/2 * D/2));...

    #include<bits/stdc++.h> #include <iostream> #include<math.h> using namespace std; int main() { double c1,c2,c3,a,b,c,s,ang1,ang2,ang3,arc1,arc2,arc3,area,area1,area2; int tc; scanf("%d",&tc); while(tc--){...

    #include <bits/stdc++.h> using namespace std; int main() { int s,n; int first_term,last_term; while (scanf("%d", &s), s != -1) { int n_sum =(int)sqrt(2*s); for (n = n_sum ; n > 0; n--) { if ( (2 * s + n - n * n) % (2 * n) == 0 ) { first_term...

    #include <stdio.h> long int arr[1000002]; void array () { long int k=0,i; arr[3]=0; for( i = 4; i <= 1000000; i++) { k = k + ((i-2)/2); arr[i] = arr[i-1] + k; } } int main() { //array(); long int n; array(); while(scanf("%ld",&n) &&...

#include <cstdio> #include <cmath> using namespace std; int main() { int T,p,q,r,s,t,u; double lo,hi,mi,f; while(scanf("%d %d %d %d %d %d",&p,&q,&r,&s,&t,&u)==6) { if(p*exp(-1)+q*sin(1)+r*cos(1)+s*tan(1)+t+u>1e-9 || p+r+u<0) {...

    #include <bits/stdc++.h> using namespace std; long double func_tion (long double n) { long double i,r = 1; for ( i = 2; i <= n; i++) { r *= i; } return r; } int main () { long double M, N,r,n,m; while (cin>>N>>M) { if( N==0 and M==0...

    #include <bits/stdc++.h> using namespace std; int main() { int tc; char s[2000],l; cin>>tc; while (tc--) { scanf("%s", s); l = strlen(s); if (strcmp(s, "1") == 0 || strcmp(s, "4") == 0 || strcmp(s, "78") == 0) printf("+\n"); else if ( s[l -...

#include<bits/stdc++.h> using namespace std; int main() { double n; int cases; int cont=0; while(cin>>n){ cont=0; for(cases=1;;) { if((cases%2)==1) { n/=9; cont++; } else { n/=2; cont++; } if(n<=1) { break; } cases++; } if(cont%2==1) printf("Stan...

    #include<stdio.h> #include<string.h> int main() { int l,i,j,count=0; char s[100000]; while(gets(s)) { l=strlen(s); for(i=0;i<l;i++) { switch(s[i]) { case 'b': { for(j=0;j<count;j++) printf(" "); count=0; break; } case '1':...