#include <bits/stdc++.h> using namespace std; int main() { long long int n; while(cin>>n) { if(n==0) break; long long int n1=sqrt(n); if((n1*n1)==n) { cout<<"yes"<<endl; } else cout<<"no"<<endl; } return 0; }...

#include <bits/stdc++.h> using namespace std; int main() { long long s,d,size,sum; while(cin>>s>>d) { sum=0; for(size=s;size<=d;size++) { sum=sum+size; if(sum>=d) { printf("%lld\n",size); break; } } } return 0; }...

#include <bits/stdc++.h> using namespace std; int main() { long long s,d,size,sum; while(cin>>s>>d) { sum=0; for(size=s;size<=d;size++) { sum=sum+size; if(sum>=d) { printf("%lld\n",size); break; } } } return 0; }...

#include <bits/stdc++.h> using namespace std; int main() { double a,b,c; double S,A,R; while(cin>>a>>b>>c) { S=(a+b+c)/2; if(S==0) { printf("The radius of the round table is: 0.000\n"); } else { A=S*(S-a)*(S-b)*(S-c); R=sqrt(A)/S; printf("The...

#include<bits/stdc++.h> using namespace std; int main() { string s,sum; int i,l; getline(cin,s); { l=s.size(); for( i=0;i<l;i++) { if(s[i]=='a' || s[i]=='A') { sum+='['; } else if(s[i]=='b' || s[i]=='B') { sum+='c'; } else if(s[i]=='c' || s[i]=='C') {...

#include<bits/stdc++.h> using namespace std; int main() { char s[120]; int l,i; while(gets(s)) { l=strlen(s); for(i=0;i<l;i++) { if(s[i]=='B' || s[i]=='F' || s[i]=='P' || s[i]=='V') { if(s[i+1]!='B' && s[i+1]!='F' && s[i+1]!='P' &&...

#include <bits/stdc++.h> using namespace std; int main() { int n,a[26],b[26],c[26],i,j,farm,ans; cin>>n; while(n--) { cin>>farm; ans=0; for(i=0;i<farm;i++) { cin>>a[i]>>b[i]>>c[i]; ans+=a[i]*c[i]; } cout<<ans<<endl; }...

#include <bits/stdc++.h> using namespace std; int main() { long long int k,sum,i,j; while(scanf("%lld",&k)==1 && k) { sum=(k*k*(k+1)*(k+1))/4; printf("%lld\n",sum); } return 0; }  

#include<stdio.h> #include<string.h> #include<iostream> using namespace std; char s[1000003]; int main() { long int len,i,j,t,min,max,tc=0,temp,op=1; while(cin>>s) { len=strlen(s); if(len==0) break; cin>>t; { for(i=0;i<t;i++) {...

#include <bits/stdc++.h> using namespace std; int check_prime (long int n) { int i; for ( i = 2; i * i <= n; i++) { if (n % i == 0) return 0; } return 1; } int rev(int n) { int reverse=0, rem; while(n) { rem=n%10; reverse=reverse*10+rem; n/=10; } return...

#include <bits/stdc++.h> using namespace std; int main() { int n, array[5000],k, c,count,d,T, t; while(scanf("%d",&n)==1) { count=0; for (c = 0; c < n; c++) { cin>>array[c]; } for (c = 1 ; c <= n - 1; c++) { d = c; while ( d > 0 &&...

#include<stdio.h> int main() { int smoke,n,k; while(scanf("%d %d",&n,&k)==2 && k>1) { do { smoke=n; smoke=smoke+(n/k); n=(n/k)+(n%k); printf("%d\n",smoke); } while(n>=k); } return 0; }  

#include <bits/stdc++.h> using namespace std; int main() { int n,i,j,k,l,h,w,area,surface_area,tc; cin>>tc; while( tc-- ) { cin>>n; area=1000000; for(l=1;l<=n;l++) for(h=1;h<=sqrt(n);h++) for(w=1;w<=sqrt(n);w++) { if(l*h*w==n)//if it a cube...

#include <stdio.h> #include <math.h> int a[2000]; int main() { int t,n,i,j,sum,count,avg,ans; scanf("%d",&t); while(t--) { sum=0,count=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i<n;i++) { sum+=a[i]; } avg=sum/n;...

#include <stdio.h> #include<iostream> #include<math.h> using namespace std; bool flag[20000005]; int primes[20000000]; int tprimes[20000000]; int cnt,m=0; void sieve(int n) { cnt=0; primes[cnt++]=2; for(int i=3; i<=n; i+=2) { if(flag[i] == 0) {...

#include <stdio.h> #include <iostream> #include <string.h> using namespace std; int main() { char s[100],len; int i,j,op,d,sum,ip=0,ip1,ip2; float result; while(gets(s)) { ip++; sum=0; len=strlen(s); for(i=0;i<len;i++) { if(s[i]=='a' || s[i]=='A')...

#include <bits/stdc++.h> using namespace std; #define PI 2*acos(0.0) int main() { double r ,n,a,ans; while(scanf("%lf %lf",&r,&n)==2) { a=(r*r*sin(2*PI/n))/2; ans=n*a; printf("%.3lf\n",ans); } return 0; }...

#include<stdio.h> int main() { unsigned long a,b; while(scanf("%lu %lu",&a,&b)==2) { printf("%lu\n",a^b); } return 0; }  

#include <stdio.h> int main() { int n, i, q, c, sz, idx, idx2, t1, t2, elteres, ce = 0; while(1) { scanf("%d",&n); if(!n) break; printf("Case %d:\n",++ce); int set[n], i = 0, q = 0; sz = n; while(n--) { scanf("%d",&set[i++]); } scanf("%d",&q);...

#include<iostream> #include<cstdio> #include<cmath> using namespace std; int main() { int n; int prime[] = {2,3,5,7,11,13,17,19,23,29,31}; int sum,i,j,count; while(scanf("%d",&n)==1) { if(n==0) break; count =0; for(i=0; i<11; i++) {...