UVa Solved Code
Copy Paste & Raising ur Solve No will destroy ur creativity. So Just use these codes only to fix code bugs.
Happy Coding... :)
*More trusted References :
# Felix Halim Hints
# Sudipto Kar's Blog
Happy Coding... :)
*More trusted References :
# Felix Halim Hints
# Sudipto Kar's Blog
100 - 3n+1
#include<stdio.h>
int main()
{
long long int i, n, count, max, a, b, temp;
while(scanf("%lld%lld", &a, &b)==2)
{
printf("%lld %lld ", a, b);
if(a>b)
{
temp=a;
a=b;
b=temp;
}
max=0;
for(i=a; i<=b; i++)
{
n=i;
count=1;
while(n != 1)
{
if(n%2==0)
{
n=n/2;
}
else if(n%2==1)
{
n=(3*n)+1;
}
count++;
}
if(count>max) max=count;
}
printf("%lld\n", max);
}
return 0;
}
int main()
{
long long int i, n, count, max, a, b, temp;
while(scanf("%lld%lld", &a, &b)==2)
{
printf("%lld %lld ", a, b);
if(a>b)
{
temp=a;
a=b;
b=temp;
}
max=0;
for(i=a; i<=b; i++)
{
n=i;
count=1;
while(n != 1)
{
if(n%2==0)
{
n=n/2;
}
else if(n%2==1)
{
n=(3*n)+1;
}
count++;
}
if(count>max) max=count;
}
printf("%lld\n", max);
}
return 0;
}
100 - 3n+1 (with recursion)
#include<stdio.h>
long int func(long int n);
int main()
{
long int i, a, b, max, temp, x;
while(scanf("%ld%ld", &a, &b)==2)
{
printf("%ld %ld ", a, b);
max=0;
if(a>b)
{
temp=a;
a=b;
b=temp;
}
for(i=a; i<=b; i++)
{
x=func(i);
if(x>max)
{
max=x;
}
}
printf("%ld\n", max);
}
return 0;
}
long int func(long int n)
{
int count=1;
if(n==1)
return n;
if(n%2==0)
{
n=count+func(n/2);
}
else if(n%2==1)
{
n=count+func((3*n)+1);
}
return n;
}
long int func(long int n);
int main()
{
long int i, a, b, max, temp, x;
while(scanf("%ld%ld", &a, &b)==2)
{
printf("%ld %ld ", a, b);
max=0;
if(a>b)
{
temp=a;
a=b;
b=temp;
}
for(i=a; i<=b; i++)
{
x=func(i);
if(x>max)
{
max=x;
}
}
printf("%ld\n", max);
}
return 0;
}
long int func(long int n)
{
int count=1;
if(n==1)
return n;
if(n%2==0)
{
n=count+func(n/2);
}
else if(n%2==1)
{
n=count+func((3*n)+1);
}
return n;
}
113-power of cryptography
#include<stdio.h>
#include<math.h>
int main()
{
double n,p,a,i;
while(scanf("%lf %lf",&n,&p)==2)
{
a=pow(10,log10(p)/n);
printf("%.0lf\n",a);
}
return 0;
}
#include<math.h>
int main()
{
double n,p,a,i;
while(scanf("%lf %lf",&n,&p)==2)
{
a=pow(10,log10(p)/n);
printf("%.0lf\n",a);
}
return 0;
}
294 - Divisors
#include<stdio.h>
#include<math.h>
int main()
{
long long l,u,i,j,maxdiv,maxnum,div,n,tmp,l1,u1;
scanf("%lld",&n);
while(n--)
{
scanf("%lld %lld",&l,&u);
l1=l,u1=u;
if(l>u)
{
tmp=u;
u=l;
l=tmp;
}
maxdiv=0;
for(i=l;i<=u;i++)
{
div=0;
for(j=1;j<=sqrt(i);j++)
if(i%j==0)
div+=2;
if((int)sqrt(i)==sqrt(i)) div--;
if(div>maxdiv)
{
maxdiv=div;
maxnum=i;
}
}
printf("Between %lld and %lld, %lld has a maximum of %lu divisors.\n",l1,u1,maxnum,maxdiv);
}
return 0;
}
#include<math.h>
int main()
{
long long l,u,i,j,maxdiv,maxnum,div,n,tmp,l1,u1;
scanf("%lld",&n);
while(n--)
{
scanf("%lld %lld",&l,&u);
l1=l,u1=u;
if(l>u)
{
tmp=u;
u=l;
l=tmp;
}
maxdiv=0;
for(i=l;i<=u;i++)
{
div=0;
for(j=1;j<=sqrt(i);j++)
if(i%j==0)
div+=2;
if((int)sqrt(i)==sqrt(i)) div--;
if(div>maxdiv)
{
maxdiv=div;
maxnum=i;
}
}
printf("Between %lld and %lld, %lld has a maximum of %lu divisors.\n",l1,u1,maxnum,maxdiv);
}
return 0;
}
299 - Train swapping
#include<stdio.h>
long long int exchange(long long int p, long long int n[]);
int main()
{
long long int i, j, n[10000], a, b;
while(scanf("%lld", &b)==1)
{
for(j=0; j<b; j++)
{
scanf("%lld", &a);
for(i=0; i<a; i++)
{
scanf("%lld", &n[i]);
}
printf("Optimal train swapping takes %lld swaps.\n", exchange(a, n));
}
}
return 0;
}
long long int exchange(long long int p, long long int n[])
{
long long int temp, count=0;
long long int i, j;
for(j=0; j<p-1; j++)
{
for(i=j+1; i<p; i++)
{
if(n[i]<n[j])
{
temp=n[i];
n[i]=n[j];
n[j]=temp;
count++;
}
}
}
return count;
}
long long int exchange(long long int p, long long int n[]);
int main()
{
long long int i, j, n[10000], a, b;
while(scanf("%lld", &b)==1)
{
for(j=0; j<b; j++)
{
scanf("%lld", &a);
for(i=0; i<a; i++)
{
scanf("%lld", &n[i]);
}
printf("Optimal train swapping takes %lld swaps.\n", exchange(a, n));
}
}
return 0;
}
long long int exchange(long long int p, long long int n[])
{
long long int temp, count=0;
long long int i, j;
for(j=0; j<p-1; j++)
{
for(i=j+1; i<p; i++)
{
if(n[i]<n[j])
{
temp=n[i];
n[i]=n[j];
n[j]=temp;
count++;
}
}
}
return count;
}
305 - Joseph
#include<stdio.h>
int main()
{
int a[15]={0,2,7,5,30,169,441,1872,7632,1740,93313,459901,1358657,2504881};
int n;
while(scanf("%d",&n)==1 && n)
{
printf("%d\n",a[n]);
}
return 0;
}
int main()
{
int a[15]={0,2,7,5,30,169,441,1872,7632,1740,93313,459901,1358657,2504881};
int n;
while(scanf("%d",&n)==1 && n)
{
printf("%d\n",a[n]);
}
return 0;
}
371 - Ackermann Functions
#include<stdio.h>
#include<math.h>
int main()
{
long long a,b,maxs,maxi,i,tmp,step,x;
while(scanf("%lld %lld",&a,&b)==2)
{
maxs=0;
if(a==0 && b==0) break ;
if(a>b)
{
tmp=a;
a=b;
b=tmp;
}
for(i=a;i<=b;i++)
{
step=0;
x=i;
while(1)
{
if(fmod(x,2)==0) x=x/2;
else x=3*x+1;
step++;
if(x==1) break;
}
if(step>maxs)
{
maxs=step;
maxi=i;
}
}
printf("Between %lld and %lld, %lld generates the longest sequence of %lld values.\n",a,b,maxi,maxs);
}
return 0;
}
412 - Pi
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<stdlib.h>
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*d-*c);
}
int gcd(int a,int b)
{
int c;
while(1)
{
if(a%b==0)
return b;
c=a%b;
a=b;
b=c;
}
}
int main()
{
long long n,a[100],i,j,k,count,max;
long long c,e,d;
double pi,x,y;
while(scanf("%lld",&n)==1 && n)
{
count=0;
for(i=0;i<n;i++)
scanf("%lld",&a[i]);
qsort(a,n,sizeof(long long),sort);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
d=gcd(a[i],a[j]);
if(d==1) count++;
}
c=(n*(n-1))/2;
x=c,y=count;
if(count==0)
{
printf("No estimate for this data set.\n");
continue;
}
pi=sqrt((x*6)/y);
printf("%lf\n",pi);
}
}
#include<math.h>
#include<stdlib.h>
#include<stdlib.h>
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*d-*c);
}
int gcd(int a,int b)
{
int c;
while(1)
{
if(a%b==0)
return b;
c=a%b;
a=b;
b=c;
}
}
int main()
{
long long n,a[100],i,j,k,count,max;
long long c,e,d;
double pi,x,y;
while(scanf("%lld",&n)==1 && n)
{
count=0;
for(i=0;i<n;i++)
scanf("%lld",&a[i]);
qsort(a,n,sizeof(long long),sort);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
d=gcd(a[i],a[j]);
if(d==1) count++;
}
c=(n*(n-1))/2;
x=c,y=count;
if(count==0)
{
printf("No estimate for this data set.\n");
continue;
}
pi=sqrt((x*6)/y);
printf("%lf\n",pi);
}
}
458 - Decoder
#include<stdio.h>
#include<string.h>
int main()
{
int l,i; char s[1000];
while(gets(s))
{
l=strlen(s);
for(i=0;i<l;i++)
{
printf("%c",s[i]-7);
printf("\n");
}
return 0;
}
579 - Clockhands
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
double h,m,ang;
while(scanf("%lf%:%lf",&h,&m)==2)
{
if(h==0 && m==0) break;
ang=(h*30+m*0.5)-(m*6);
if(ang>180) ang=360-ang;
if(ang<0)ang=ang*-1;
printf("%.3lf\n",ang);
}
return 0;
}
#include<stdlib.h>
#include<math.h>
int main()
{
double h,m,ang;
while(scanf("%lf%:%lf",&h,&m)==2)
{
if(h==0 && m==0) break;
ang=(h*30+m*0.5)-(m*6);
if(ang>180) ang=360-ang;
if(ang<0)ang=ang*-1;
printf("%.3lf\n",ang);
}
return 0;
}
591 - Box of Bricks
#include<stdio.h>
int main()
{
long long int test, average, t=1, bricks[1000], i, sum, count;
while(scanf("%lld", &test)==1)
{
average=0, sum=0, count=0;
if(test==0) break;
for(i=0; i<test; i++)
{
scanf("%lld", &bricks[i]);
sum+=bricks[i];
}
average=sum/test;
for(i=0; i<test; i++)
{
while(bricks[i]>average)
{
bricks[i]--;
count++;
}
}
printf("Set #%lld\nThe minimum number of moves is %lld.\n", t++, count);
puts("");
}
return 0;
}
int main()
{
long long int test, average, t=1, bricks[1000], i, sum, count;
while(scanf("%lld", &test)==1)
{
average=0, sum=0, count=0;
if(test==0) break;
for(i=0; i<test; i++)
{
scanf("%lld", &bricks[i]);
sum+=bricks[i];
}
average=sum/test;
for(i=0; i<test; i++)
{
while(bricks[i]>average)
{
bricks[i]--;
count++;
}
}
printf("Set #%lld\nThe minimum number of moves is %lld.\n", t++, count);
puts("");
}
return 0;
}
612 - DNA Sorting
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct
{
char dna[110];
int sort;
}str;
int sort(const void *a,const void *b)
{
str *c,*d;
c=(str*)a;
d=(str*)b;
return (c->sort-d->sort);
}
int main()
{
str DNA[110];
int f,n,m,i,j,k,p;
scanf("%d",&f);
while(f--)
{
scanf("%d%d",&n,&m);
for(k=0;k<m;k++)
{
DNA[k].sort=0;
scanf("%s",DNA[k].dna);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(DNA[k].dna[i]>DNA[k].dna[j])
DNA[k].sort++;
}
qsort(DNA,m,sizeof(str),sort);
for(i=0;i<m;i++)
printf("%s\n",DNA[i].dna);
if(f) printf("\n");
}
return 0;
}
#include<string.h>
#include<stdlib.h>
typedef struct
{
char dna[110];
int sort;
}str;
int sort(const void *a,const void *b)
{
str *c,*d;
c=(str*)a;
d=(str*)b;
return (c->sort-d->sort);
}
int main()
{
str DNA[110];
int f,n,m,i,j,k,p;
scanf("%d",&f);
while(f--)
{
scanf("%d%d",&n,&m);
for(k=0;k<m;k++)
{
DNA[k].sort=0;
scanf("%s",DNA[k].dna);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(DNA[k].dna[i]>DNA[k].dna[j])
DNA[k].sort++;
}
qsort(DNA,m,sizeof(str),sort);
for(i=0;i<m;i++)
printf("%s\n",DNA[i].dna);
if(f) printf("\n");
}
return 0;
}
694 - Collatz Sequence
#include<stdio.h>
long long int i;
int main()
{
long long int n, count, max, a, b, temp, m;
for(i=0; i<10000; i++)
{
scanf("%lld%lld", &n, &b);
m=n;
max=0;
if(n<0 && b<0) break;
count=1;
while(n != 1)
{
if(n%2==0)
{
n=n/2;
}
else if(n%2==1)
{
n=(3*n)+1;
}
if(n>b) break;
count++;
}
printf("Case %lld: ", i+1);
printf("A = %lld, limit = %lld, number of terms = %lld\n", m, b, count);
}
return 0;
}
long long int i;
int main()
{
long long int n, count, max, a, b, temp, m;
for(i=0; i<10000; i++)
{
scanf("%lld%lld", &n, &b);
m=n;
max=0;
if(n<0 && b<0) break;
count=1;
while(n != 1)
{
if(n%2==0)
{
n=n/2;
}
else if(n%2==1)
{
n=(3*n)+1;
}
if(n>b) break;
count++;
}
printf("Case %lld: ", i+1);
printf("A = %lld, limit = %lld, number of terms = %lld\n", m, b, count);
}
return 0;
}
913 - Joanna and the odd numbers
#include<stdio.h>
int main()
{
long long n,a,b,c,d,sum,po,i;
while(scanf("%lld",&n)==1)
{
po=0;
for(i=1;i<=n;i+=2)
po+=i;
a=(po*2)-1;
sum=a+(a-2)+(a-4);
printf("%llu\n",sum);
}
return 0;
}
int main()
{
long long n,a,b,c,d,sum,po,i;
while(scanf("%lld",&n)==1)
{
po=0;
for(i=1;i<=n;i+=2)
po+=i;
a=(po*2)-1;
sum=a+(a-2)+(a-4);
printf("%llu\n",sum);
}
return 0;
}
944 - Happy Numbers
#include<stdio.h>
#include<math.h>
int c,a[10000];
int happy(int i);
int main()
{
int l,h,i,H,j;
j=0;
while(scanf("%d %d",&l,&h)==2)
{
if(j!=0) printf("\n");
for(i=l;i<=h;i++)
{
if(i==1)
{
printf("1 1\n");
continue ;
}
H=happy(i);
if(H==1) printf("%d %d\n",i,c);
}
j++;
}
return 0;
}
int happy(int s)
{
int i,j,k,si,flag;
c=1;
j=0;
flag=1;
while(1)
{
si=0;
while(s)
{
si+=(s%10)*(s%10);
s=s/10;
}
c++;
if(si==1) return 1;
a[c-2]=si;
for(i=0;i<c-2;i++)
if(si==a[i])
return 0;
s=si;
}
}
#include<math.h>
int c,a[10000];
int happy(int i);
int main()
{
int l,h,i,H,j;
j=0;
while(scanf("%d %d",&l,&h)==2)
{
if(j!=0) printf("\n");
for(i=l;i<=h;i++)
{
if(i==1)
{
printf("1 1\n");
continue ;
}
H=happy(i);
if(H==1) printf("%d %d\n",i,c);
}
j++;
}
return 0;
}
int happy(int s)
{
int i,j,k,si,flag;
c=1;
j=0;
flag=1;
while(1)
{
si=0;
while(s)
{
si+=(s%10)*(s%10);
s=s/10;
}
c++;
if(si==1) return 1;
a[c-2]=si;
for(i=0;i<c-2;i++)
if(si==a[i])
return 0;
s=si;
}
}
10006 - Carmichael Numbers
#include<stdio.h>
int main()
{
int n;
while(scanf("%d",&n)==1 && n)
{
if(n==561)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==1105)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==1729)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==2465)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==2821)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==6601)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==8911)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==10585)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==15841)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==29341)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==41041)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==46657)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==52633)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==62745)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==63973)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==75361)
{
printf("The number %d is a Carmichael number.\n",n);
}
else printf("%d is normal.\n",n);
}
return 0;
}
int main()
{
int n;
while(scanf("%d",&n)==1 && n)
{
if(n==561)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==1105)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==1729)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==2465)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==2821)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==6601)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==8911)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==10585)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==15841)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==29341)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==41041)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==46657)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==52633)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==62745)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==63973)
{
printf("The number %d is a Carmichael number.\n",n);
}
else if(n==75361)
{
printf("The number %d is a Carmichael number.\n",n);
}
else printf("%d is normal.\n",n);
}
return 0;
}
10018 - Reverse and Add
#include<stdio.h>
#include<math.h>
long long int digit(long long int n);
long long int reverse(long long int x, long long int dgt);
int main()
{
long long int test, a, i, j, count, num, p, loop;
scanf("%lld", &test);
while(test--)
{
scanf("%lld", &num);
loop=0;
while(1)
{
count=digit(num);
a=reverse(num, count);
p=num+a;
count=digit(p);
a=reverse(p, count);
loop++;
if(a==p)
{
break;
}
num=p;
}
printf("%lld %lld\n", loop, p);
}
return 0;
}
long long int digit(long long int n)
{
long long int count=0;
while(n>=0)
{
n/=10;
count++;
if(n<=0) break;
}
return (count);
}
long long int reverse(long long int x, long long int dgt)
{
long long int a=0, l, m;
for(l=dgt-1; l>=0; l--)
{
m=x%10;
a+=m*pow(10,l);
x/=10;
}
return a;
}
#include<math.h>
long long int digit(long long int n);
long long int reverse(long long int x, long long int dgt);
int main()
{
long long int test, a, i, j, count, num, p, loop;
scanf("%lld", &test);
while(test--)
{
scanf("%lld", &num);
loop=0;
while(1)
{
count=digit(num);
a=reverse(num, count);
p=num+a;
count=digit(p);
a=reverse(p, count);
loop++;
if(a==p)
{
break;
}
num=p;
}
printf("%lld %lld\n", loop, p);
}
return 0;
}
long long int digit(long long int n)
{
long long int count=0;
while(n>=0)
{
n/=10;
count++;
if(n<=0) break;
}
return (count);
}
long long int reverse(long long int x, long long int dgt)
{
long long int a=0, l, m;
for(l=dgt-1; l>=0; l--)
{
m=x%10;
a+=m*pow(10,l);
x/=10;
}
return a;
}
10035 - Primary Arithmetic
#include<stdio.h>
int main()
{
long long int i, a, b, r, carry;
while(scanf("%lld%lld", &a, &b)==2)
{
carry=0, r=0;
if(a==0 && b==0) break;
for(i=0; i<12; i++)
{
if(a==0 && b==0) break;
if((a%10)+(b%10)+r>9)
{
carry++;
r=1;
}
else
{
r=0;
}
a/=10;
b/=10;
}
if(carry==1)
printf("%d carry operation.\n", carry);
else if(carry==0)
printf("No carry operation.\n");
else if(carry>1)
printf("%d carry operations.\n", carry);
}
return 0;
}
int main()
{
long long int i, a, b, r, carry;
while(scanf("%lld%lld", &a, &b)==2)
{
carry=0, r=0;
if(a==0 && b==0) break;
for(i=0; i<12; i++)
{
if(a==0 && b==0) break;
if((a%10)+(b%10)+r>9)
{
carry++;
r=1;
}
else
{
r=0;
}
a/=10;
b/=10;
}
if(carry==1)
printf("%d carry operation.\n", carry);
else if(carry==0)
printf("No carry operation.\n");
else if(carry>1)
printf("%d carry operations.\n", carry);
}
return 0;
}
10071 - Back 2 High School Physics
#include<stdio.h>
int main()
{
int v, t, s;
while(scanf("%d%d", &v, &t)==2)
{
s= 2*v*t;
printf("%d\n", s);
}
return 0;
}
int main()
{
int v, t, s;
while(scanf("%d%d", &v, &t)==2)
{
s= 2*v*t;
printf("%d\n", s);
}
return 0;
}
10370 - Above Avarage
#include<stdio.h>
int main()
{
long long int i, j, count, num[1000];
double average, n, sum, p, q, set;
while(scanf("%lf", &n)==1)
{
for(j=0; j<n; j++)
{
sum=0, count=0, average=0;
scanf("%lf", &set);
for(i=0; i<set; i++)
{
scanf("%lld", &num[i]);
sum+=num[i];
}
average=sum/set;
for(i=0; i<set; i++)
{
if(num[i]>average) count++;
}
p=(count/set)* 100;
printf("%.3lf%%\n", p);
}
}
return 0;
}
int main()
{
long long int i, j, count, num[1000];
double average, n, sum, p, q, set;
while(scanf("%lf", &n)==1)
{
for(j=0; j<n; j++)
{
sum=0, count=0, average=0;
scanf("%lf", &set);
for(i=0; i<set; i++)
{
scanf("%lld", &num[i]);
sum+=num[i];
}
average=sum/set;
for(i=0; i<set; i++)
{
if(num[i]>average) count++;
}
p=(count/set)* 100;
printf("%.3lf%%\n", p);
}
}
return 0;
}
10424 - Love Calculator
#include<stdio.h>
#include<string.h>
int main()
{
char n1[50],n2[50];
float temp1,temp2,len1,len2,per;
int i,sum1,sum2;
while(gets(n1))
{
gets(n2);
sum1=0,sum2=0;
len1=strlen(n1);
len2=strlen(n2);
for(i=0; i<len1; i++)
{
if(n1[i]>='A' && n1[i]<='Z') sum1+=(n1[i]-64);
else if(n1[i]>='a' && n1[i]<='z')sum1+=(n1[i]-96);
}
for(i=0; i<len2; i++)
{
if(n2[i]>='A' && n2[i]<='Z') sum2+=(n2[i]-64);
else if(n2[i]>='a' && n2[i]<='z')sum2+=(n2[i]-96);
}
int w,x,y;
w=(sum1/100)+(sum1%100);
x=(w/100)+(w%100);
y=(x/10)+(x%10);
temp1=(y/10)+(y%10);
w=(sum2/100)+(sum2%100);
x=(w/100)+(w%100);
y=(x/10)+(x%10);
temp2=(y/10)+(y%10);
if(temp2<temp1)
{
per=(temp2/temp1)*100;
printf("%.2f %\n",per);
}
else
{
per=(temp1/temp2)*100;
printf("%.2f %\n",per);
}
}
return 0;
}
#include<string.h>
int main()
{
char n1[50],n2[50];
float temp1,temp2,len1,len2,per;
int i,sum1,sum2;
while(gets(n1))
{
gets(n2);
sum1=0,sum2=0;
len1=strlen(n1);
len2=strlen(n2);
for(i=0; i<len1; i++)
{
if(n1[i]>='A' && n1[i]<='Z') sum1+=(n1[i]-64);
else if(n1[i]>='a' && n1[i]<='z')sum1+=(n1[i]-96);
}
for(i=0; i<len2; i++)
{
if(n2[i]>='A' && n2[i]<='Z') sum2+=(n2[i]-64);
else if(n2[i]>='a' && n2[i]<='z')sum2+=(n2[i]-96);
}
int w,x,y;
w=(sum1/100)+(sum1%100);
x=(w/100)+(w%100);
y=(x/10)+(x%10);
temp1=(y/10)+(y%10);
w=(sum2/100)+(sum2%100);
x=(w/100)+(w%100);
y=(x/10)+(x%10);
temp2=(y/10)+(y%10);
if(temp2<temp1)
{
per=(temp2/temp1)*100;
printf("%.2f %\n",per);
}
else
{
per=(temp1/temp2)*100;
printf("%.2f %\n",per);
}
}
return 0;
}
10490 - Md.Azad and His Sons
#include<stdio.h>
#include<stdbool.h>
#include<math.h>
_Bool a[51];
void sieve(void)
{
register int i,j,lim,k;
a[0]=1;
a[1]=1;
a[2]=0;
lim=sqrt(50);
for(i=2;2*i<=50;i++)
a[2*i]=1;
j=3;
while(j<=lim)
{
for(i=3;i*j<=50;i++)
a[i*j]=1;
j+=2;
}
return ;
}
int main()
{
sieve();
int n,i,j,flag;
int p[]={2,3,5,7,13,17,19,31};
int np[]={11,23,29};
unsigned long long per,sum;
while(scanf("%d",&n)==1 && n)
{
if(n==1)
{
printf("Perfect: 1!\n");
continue;
}
if(a[n]!=0)
{
printf("Given number is NOT prime! NO perfect number is available.\n");
continue;
}
for(i=0;i<8;i++)
if(n==p[i])
{
per=pow(2,n-1)*(pow(2,n)-1);
printf("Perfect: %llu!\n",per);
continue;
}
for(i=0;i<3;i++)
if(n==np[i])
{
printf("Given number is prime. But, NO perfect number is available.\n");
continue;
}
}
return 0;
}
#include<stdbool.h>
#include<math.h>
_Bool a[51];
void sieve(void)
{
register int i,j,lim,k;
a[0]=1;
a[1]=1;
a[2]=0;
lim=sqrt(50);
for(i=2;2*i<=50;i++)
a[2*i]=1;
j=3;
while(j<=lim)
{
for(i=3;i*j<=50;i++)
a[i*j]=1;
j+=2;
}
return ;
}
int main()
{
sieve();
int n,i,j,flag;
int p[]={2,3,5,7,13,17,19,31};
int np[]={11,23,29};
unsigned long long per,sum;
while(scanf("%d",&n)==1 && n)
{
if(n==1)
{
printf("Perfect: 1!\n");
continue;
}
if(a[n]!=0)
{
printf("Given number is NOT prime! NO perfect number is available.\n");
continue;
}
for(i=0;i<8;i++)
if(n==p[i])
{
per=pow(2,n-1)*(pow(2,n)-1);
printf("Perfect: %llu!\n",per);
continue;
}
for(i=0;i<3;i++)
if(n==np[i])
{
printf("Given number is prime. But, NO perfect number is available.\n");
continue;
}
}
return 0;
}
11547 - Automatic Answer
#include<stdio.h>
int main()
{
int test, i, a, b, c, d, e, f, n, x, y;
scanf("%d", &test);
for(i=0; i<test; i++)
{
scanf("%d", &a);
b=a*567;
c=b/9;
d=c+7492;
e=d*235;
f=e/47;
n=f-498;
x=n/10;
y=x%10;
if(y<0) printf("%d\n", y*(-1));
else printf("%d\n", y);
}
return 0;
}
int main()
{
int test, i, a, b, c, d, e, f, n, x, y;
scanf("%d", &test);
for(i=0; i<test; i++)
{
scanf("%d", &a);
b=a*567;
c=b/9;
d=c+7492;
e=d*235;
f=e/47;
n=f-498;
x=n/10;
y=x%10;
if(y<0) printf("%d\n", y*(-1));
else printf("%d\n", y);
}
return 0;
}
10783 - Odd Sum
#include<stdio.h>
int main()
{
int c,i,j,a,b,temp,sum;
while(scanf("%d",&c)==1)
{
for(i=1;i<=c;i++)
{
scanf("%d %d",&a,&b);
if(b<a)
{
temp=a;
a=b;
b=temp;
}
sum=0;
for(j=a;j<=b;j++)
{
if(j%2==1)
{
sum+=j;
}
}
printf("Case %d: %d\n",i,sum);
}
}
return 0;
}
int main()
{
int c,i,j,a,b,temp,sum;
while(scanf("%d",&c)==1)
{
for(i=1;i<=c;i++)
{
scanf("%d %d",&a,&b);
if(b<a)
{
temp=a;
a=b;
b=temp;
}
sum=0;
for(j=a;j<=b;j++)
{
if(j%2==1)
{
sum+=j;
}
}
printf("Case %d: %d\n",i,sum);
}
}
return 0;
}
11764 - Jumping Mario
#include<stdio.h>
int main()
{
long long int a[1000], s_jump, l_jump, i, test, set, t;
scanf("%lld", &test);
for(t=1; t<=test; t++)
{
s_jump=0, l_jump=0;
scanf("%lld", &set);
for(i=0; i<set; i++)
{
scanf("%lld", &a[i]);
}
for(i=0; i<set-1; i++)
{
if(a[i+1]<a[i])
{
s_jump++;
}
else if(a[i+1]>a[i])
{
l_jump++;
}
}
printf("Case %lld: %lld %lld\n", t, l_jump, s_jump);
}
return 0;
}
int main()
{
long long int a[1000], s_jump, l_jump, i, test, set, t;
scanf("%lld", &test);
for(t=1; t<=test; t++)
{
s_jump=0, l_jump=0;
scanf("%lld", &set);
for(i=0; i<set; i++)
{
scanf("%lld", &a[i]);
}
for(i=0; i<set-1; i++)
{
if(a[i+1]<a[i])
{
s_jump++;
}
else if(a[i+1]>a[i])
{
l_jump++;
}
}
printf("Case %lld: %lld %lld\n", t, l_jump, s_jump);
}
return 0;
}
10038 - Jolly Jumper
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int sort(const void *a,const void *b);
int main()
{
int n,i,flag;
while(scanf("%d",&n)==1)
{
int arr[n],diff[n-1];
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
for(i=0;i<n-1;i++)
diff[i]=abs(arr[i+1]-arr[i]);
qsort((void*)diff,(n-1),sizeof(int),sort);
flag=1;
for(i=0;i<n-1;i++)
{
if(diff[i]!=i+1)
{
flag=0;
break;
}
}
if(flag==1)
printf("Jolly\n");
else
printf("Not jolly\n");
}
return 0;
}
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*c-*d);
}
#include<stdlib.h>
#include<math.h>
int sort(const void *a,const void *b);
int main()
{
int n,i,flag;
while(scanf("%d",&n)==1)
{
int arr[n],diff[n-1];
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
for(i=0;i<n-1;i++)
diff[i]=abs(arr[i+1]-arr[i]);
qsort((void*)diff,(n-1),sizeof(int),sort);
flag=1;
for(i=0;i<n-1;i++)
{
if(diff[i]!=i+1)
{
flag=0;
break;
}
}
if(flag==1)
printf("Jolly\n");
else
printf("Not jolly\n");
}
return 0;
}
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*c-*d);
}
10019-funny encryption method
#include<stdio.h>
#include<math.h>
int main()
{
int n,b1,b2,f,i,j,x,d,h;
scanf("%d",&f);
while(f--)
{
scanf("%d",&n);
h=n;
d=0;
for(i=0;h;i++)
{
d+=(h%10)*pow(16,i);
h=h/10;
}
b1=0;
while(n)
{
if(n%2==1) b1++;
n=n/2;
}
b2=0;
while(d)
{
if(d%2==1) b2++;
d=d/2;
}
printf("%d %d\n",b1,b2);
}
return 0;
}
#include<math.h>
int main()
{
int n,b1,b2,f,i,j,x,d,h;
scanf("%d",&f);
while(f--)
{
scanf("%d",&n);
h=n;
d=0;
for(i=0;h;i++)
{
d+=(h%10)*pow(16,i);
h=h/10;
}
b1=0;
while(n)
{
if(n%2==1) b1++;
n=n/2;
}
b2=0;
while(d)
{
if(d%2==1) b2++;
d=d/2;
}
printf("%d %d\n",b1,b2);
}
return 0;
}
10082 - WERTYU
#include<stdio.h>
#include<string.h>
int main()
{
long int l,i;
char s[100000];
while(gets(s))
{
l=strlen(s);
for(i=0;i<l;i++)
{
switch(s[i])
{
case 'W':
printf("Q"); break;
case 'E':
printf("W"); break;
case 'R':
printf("E"); break;
case 'T':
printf("R"); break;
case 'Y':
printf("T"); break;
case 'U':
printf("Y"); break;
case 'I':
printf("U"); break;
case 'O':
printf("I"); break;
case 'P':
printf("O"); break;
case 'S':
printf("A"); break;
case 'D':
printf("S"); break;
case 'F':
printf("D"); break;
case 'G':
printf("F"); break;
case 'H':
printf("G"); break;
case 'J':
printf("H"); break;
case 'K':
printf("J"); break;
case 'L':
printf("K"); break;
case 'X':
printf("Z"); break;
case 'C':
printf("X"); break;
case 'V':
printf("C"); break;
case 'B':
printf("V"); break;
case 'N':
printf("B"); break;
case 'M':
printf("N"); break;
case '2':
printf("1"); break;
case '3':
printf("2"); break;
case '4':
printf("3"); break;
case '5':
printf("4"); break;
case '6':
printf("5"); break;
case '7':
printf("6"); break;
case '8':
printf("7"); break;
case '9':
printf("8"); break;
case '0':
printf("9"); break;
case '-':
printf("0"); break;
case '=':
printf("-"); break;
case '[':
printf("P"); break;
case ']':
printf("["); break;
case '\\':
printf("]"); break;
case ';':
printf("L"); break;
case '1':
printf("`"); break;
case ',':
printf("M"); break;
case '.':
printf(","); break;
case '/':
printf("."); break;
case ' ':
printf(" "); break;
default:
printf(";"); break;
}
}
printf("\n");
}
return 0;
}
#include<string.h>
int main()
{
long int l,i;
char s[100000];
while(gets(s))
{
l=strlen(s);
for(i=0;i<l;i++)
{
switch(s[i])
{
case 'W':
printf("Q"); break;
case 'E':
printf("W"); break;
case 'R':
printf("E"); break;
case 'T':
printf("R"); break;
case 'Y':
printf("T"); break;
case 'U':
printf("Y"); break;
case 'I':
printf("U"); break;
case 'O':
printf("I"); break;
case 'P':
printf("O"); break;
case 'S':
printf("A"); break;
case 'D':
printf("S"); break;
case 'F':
printf("D"); break;
case 'G':
printf("F"); break;
case 'H':
printf("G"); break;
case 'J':
printf("H"); break;
case 'K':
printf("J"); break;
case 'L':
printf("K"); break;
case 'X':
printf("Z"); break;
case 'C':
printf("X"); break;
case 'V':
printf("C"); break;
case 'B':
printf("V"); break;
case 'N':
printf("B"); break;
case 'M':
printf("N"); break;
case '2':
printf("1"); break;
case '3':
printf("2"); break;
case '4':
printf("3"); break;
case '5':
printf("4"); break;
case '6':
printf("5"); break;
case '7':
printf("6"); break;
case '8':
printf("7"); break;
case '9':
printf("8"); break;
case '0':
printf("9"); break;
case '-':
printf("0"); break;
case '=':
printf("-"); break;
case '[':
printf("P"); break;
case ']':
printf("["); break;
case '\\':
printf("]"); break;
case ';':
printf("L"); break;
case '1':
printf("`"); break;
case ',':
printf("M"); break;
case '.':
printf(","); break;
case '/':
printf("."); break;
case ' ':
printf(" "); break;
default:
printf(";"); break;
}
}
printf("\n");
}
return 0;
}
10107-what is the median
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*c-*d);
}
int main()
{
long long i=0,arr[10010],n,m;
while(scanf("%lld",&arr[i])==1)
{
qsort((void*)arr,i+1,sizeof(long long),sort);
if(i%2==0)
{
n=ceil(i/2);
printf("%lld\n",arr[n]);
}
else if(i%2!=0)
{
n=i/2;
m=(arr[n]+arr[n+1])/2;
printf("%lld\n",m);
}
i++;
}
return 0;
}
#include<stdlib.h>
#include<math.h>
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*c-*d);
}
int main()
{
long long i=0,arr[10010],n,m;
while(scanf("%lld",&arr[i])==1)
{
qsort((void*)arr,i+1,sizeof(long long),sort);
if(i%2==0)
{
n=ceil(i/2);
printf("%lld\n",arr[n]);
}
else if(i%2!=0)
{
n=i/2;
m=(arr[n]+arr[n+1])/2;
printf("%lld\n",m);
}
i++;
}
return 0;
}
10190 - Divide, But Not Quite Conquer!
#include<stdio.h>
int main()
{
long long n,m,d,f;
while(scanf("%lld %lld",&n,&m)==2)
{
f=0;
while(1)
{
if(n%m==0)
{
if(f==0)
{
printf("%lld ",n);
f=1;
}
d=n/m;
printf("%lld ",d);
n=d;
if(n==1)
{
break;
}
}
if(n%m!=0)
{
printf("boring\n");
break;
}
}
}
return 0;
}
Another Way :
#include<stdio.h>
int main()
{
int n,m,a[10000],f,i,d,j;
while(scanf("%d %d",&n,&m)==2)
{
f=0;
i=0;
while(1)
{
if(m==0 ||n==0 || m==1 || n==1)
{
f=0;
break;
}
if(n%m!=0)
{
f=0;
break;
}
else if(n%m==0)
{
a[i]=n;
n=n/m;
i++;
if(n==1)
{
a[i]=n;
f=1;
break;
}
}
f=0;
}
if(f==0)
{
printf("Boring!\n");
}
if(f==1)
{
for(j=0;j<=i;j++)
{
if(j==i)
{
printf("%d\n",a[j]);
}
else
{
printf("%d ",a[j]);
}
}
}
}
return 0;
}
int main()
{
long long n,m,d,f;
while(scanf("%lld %lld",&n,&m)==2)
{
f=0;
while(1)
{
if(n%m==0)
{
if(f==0)
{
printf("%lld ",n);
f=1;
}
d=n/m;
printf("%lld ",d);
n=d;
if(n==1)
{
break;
}
}
if(n%m!=0)
{
printf("boring\n");
break;
}
}
}
return 0;
}
Another Way :
#include<stdio.h>
int main()
{
int n,m,a[10000],f,i,d,j;
while(scanf("%d %d",&n,&m)==2)
{
f=0;
i=0;
while(1)
{
if(m==0 ||n==0 || m==1 || n==1)
{
f=0;
break;
}
if(n%m!=0)
{
f=0;
break;
}
else if(n%m==0)
{
a[i]=n;
n=n/m;
i++;
if(n==1)
{
a[i]=n;
f=1;
break;
}
}
f=0;
}
if(f==0)
{
printf("Boring!\n");
}
if(f==1)
{
for(j=0;j<=i;j++)
{
if(j==i)
{
printf("%d\n",a[j]);
}
else
{
printf("%d ",a[j]);
}
}
}
}
return 0;
}
10110-light more light
#include<stdio.h>
#include<math.h>
int main()
{
long long root,n,r;
while(scanf("%lld",&n)==1)
{
if(n==0)
{
break;
}
r=sqrt(n);
root=pow(r,2);
if(root==n)
{
printf("yes\n");
}
else
{
printf("no\n");
}
}
return 0;
}
#include<math.h>
int main()
{
long long root,n,r;
while(scanf("%lld",&n)==1)
{
if(n==0)
{
break;
}
r=sqrt(n);
root=pow(r,2);
if(root==n)
{
printf("yes\n");
}
else
{
printf("no\n");
}
}
return 0;
}
10222-decode the mad man
#include<stdio.h>
#include<string.h>
#include<ctype.h>
int main()
{
char a[]="`1234567890qwertyuiop[]asdfghjkl;'zxcvbnm,./";
char b[1000];
int n,l,k,i,j,p;
while(gets(b))
{
l=strlen(b);
for(i=0;i<l;i++)
{
b[i]=tolower(b[i]);
}
for(i=0;i<l;i++)
{
for(j=0;j<44;j++)
{
if(a[j]==b[i])
{
p=j-2;
if(p==-1)
{
p=43;
}
if(p==-2)
{
p=42;
}
b[i]=a[p];
break;
}
}
}
printf("%s\n",b);
}
return 0;
}
#include<string.h>
#include<ctype.h>
int main()
{
char a[]="`1234567890qwertyuiop[]asdfghjkl;'zxcvbnm,./";
char b[1000];
int n,l,k,i,j,p;
while(gets(b))
{
l=strlen(b);
for(i=0;i<l;i++)
{
b[i]=tolower(b[i]);
}
for(i=0;i<l;i++)
{
for(j=0;j<44;j++)
{
if(a[j]==b[i])
{
p=j-2;
if(p==-1)
{
p=43;
}
if(p==-2)
{
p=42;
}
b[i]=a[p];
break;
}
}
}
printf("%s\n",b);
}
return 0;
}
10260 - Soundex
#include<stdio.h>
#include<string.h>
int main()
{
char a[25];
int i,len,x,b[25];
while(scanf("%s",a)==1)
{
for(i=0;i<22;i++)b[i]=0;
len=strlen(a);
for(i=0;i<len;i++)
{
if(a[i]== 'A'||a[i]== 'E'||a[i]== 'I'||a[i]== 'O'||a[i]== 'U'||a[i]== 'H'||a[i]== 'W') b[i]=0;
if(a[i]== 'B'||a[i]== 'F'||a[i]== 'P'||a[i]== 'V') b[i]=1;
if(a[i]== 'C'||a[i]== 'G'||a[i]== 'J'||a[i]== 'K'||a[i]== 'Q'||a[i]== 'S'||a[i]== 'X'||a[i]== 'Z') b[i]=2;
if(a[i]== 'D'||a[i]== 'T') b[i]=3;
if(a[i]== 'L') b[i]=4;
if(a[i]== 'M'||a[i]== 'N') b[i]=5;
if(a[i]== 'R') b[i]=6;
if(i>0 && b[i]==b[i-1])continue;
else if(b[i]!=0)printf("%d",b[i]);
}
printf("\n");
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char c[26];
int l,i,d[26],flag;
while(scanf("%s",c)==1)
{
l=strlen(c);
for(i=0;i<l;i++)
{
flag=0;
if(c[i]=='B'||c[i]=='F'||c[i]=='P'||c[i]=='V')
{
d[i]=1;
}
else if(c[i]=='C'||c[i]=='G'||c[i]=='J'||c[i]=='K'||c[i]=='Q'||c[i]=='S'||c[i]=='X'||c[i]=='Z')
{
d[i]=2;
}
else if(c[i]=='D'||c[i]=='T')
{
d[i]=3;
}
else if(c[i]=='L')
{
d[i]=4;
}
else if(c[i]=='M'||c[i]=='N')
{
d[i]=5;
}
else if(c[i]=='R')
{
d[i]=6;
}
else
{
d[i]=0;
flag=1;
}
if(d[i-1]!=d[i] && d[i]>0 &&d[i]<=6)
{
printf("%d",d[i]);
}
}
printf("\n");
}
return 0;
}
#include<string.h>
int main()
{
char a[25];
int i,len,x,b[25];
while(scanf("%s",a)==1)
{
for(i=0;i<22;i++)b[i]=0;
len=strlen(a);
for(i=0;i<len;i++)
{
if(a[i]== 'A'||a[i]== 'E'||a[i]== 'I'||a[i]== 'O'||a[i]== 'U'||a[i]== 'H'||a[i]== 'W') b[i]=0;
if(a[i]== 'B'||a[i]== 'F'||a[i]== 'P'||a[i]== 'V') b[i]=1;
if(a[i]== 'C'||a[i]== 'G'||a[i]== 'J'||a[i]== 'K'||a[i]== 'Q'||a[i]== 'S'||a[i]== 'X'||a[i]== 'Z') b[i]=2;
if(a[i]== 'D'||a[i]== 'T') b[i]=3;
if(a[i]== 'L') b[i]=4;
if(a[i]== 'M'||a[i]== 'N') b[i]=5;
if(a[i]== 'R') b[i]=6;
if(i>0 && b[i]==b[i-1])continue;
else if(b[i]!=0)printf("%d",b[i]);
}
printf("\n");
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char c[26];
int l,i,d[26],flag;
while(scanf("%s",c)==1)
{
l=strlen(c);
for(i=0;i<l;i++)
{
flag=0;
if(c[i]=='B'||c[i]=='F'||c[i]=='P'||c[i]=='V')
{
d[i]=1;
}
else if(c[i]=='C'||c[i]=='G'||c[i]=='J'||c[i]=='K'||c[i]=='Q'||c[i]=='S'||c[i]=='X'||c[i]=='Z')
{
d[i]=2;
}
else if(c[i]=='D'||c[i]=='T')
{
d[i]=3;
}
else if(c[i]=='L')
{
d[i]=4;
}
else if(c[i]=='M'||c[i]=='N')
{
d[i]=5;
}
else if(c[i]=='R')
{
d[i]=6;
}
else
{
d[i]=0;
flag=1;
}
if(d[i-1]!=d[i] && d[i]>0 &&d[i]<=6)
{
printf("%d",d[i]);
}
}
printf("\n");
}
return 0;
}
10235-simply emirp
#include<stdio.h>
#include<string.h>
#include<stdbool.h>
#include<math.h>
_Bool a[1000011];
void sieve(void)
{
register int i,j,lim,k;
a[0]=1;
a[1]=1;
a[2]=0;
lim=sqrt(1000010);
for(i=2;2*i<=1000010;i++)
a[2*i]=1;
j=3;
while(j<=lim)
{
for(i=3;i*j<=1000010;i++)
a[i*j]=1;
j+=2;
}
return ;
}
int main()
{
sieve();
int i,j,k,l,n,n_rev,b;
while(scanf("%d",&n)==1)
{
n_rev=0;
b=n;
l=0;
while(b/10!=0)
{
b=b/10;
l++;
}
b=n;
for(i=l;i>=0;i--)
{
n_rev+=(b%10)*pow(10,i);
b=b/10;
}
if(a[n]!=0) printf("%d is not prime.\n",n);
else if(n==n_rev) printf("%d is prime.\n",n);
else if(a[n]==0 && a[n_rev]==0) printf("%d is emirp.\n",n);
else if(a[n]==0 && a[n_rev]!=0) printf("%d is prime.\n",n);
}
return 0;
}
#include<string.h>
#include<stdbool.h>
#include<math.h>
_Bool a[1000011];
void sieve(void)
{
register int i,j,lim,k;
a[0]=1;
a[1]=1;
a[2]=0;
lim=sqrt(1000010);
for(i=2;2*i<=1000010;i++)
a[2*i]=1;
j=3;
while(j<=lim)
{
for(i=3;i*j<=1000010;i++)
a[i*j]=1;
j+=2;
}
return ;
}
int main()
{
sieve();
int i,j,k,l,n,n_rev,b;
while(scanf("%d",&n)==1)
{
n_rev=0;
b=n;
l=0;
while(b/10!=0)
{
b=b/10;
l++;
}
b=n;
for(i=l;i>=0;i--)
{
n_rev+=(b%10)*pow(10,i);
b=b/10;
}
if(a[n]!=0) printf("%d is not prime.\n",n);
else if(n==n_rev) printf("%d is prime.\n",n);
else if(a[n]==0 && a[n_rev]==0) printf("%d is emirp.\n",n);
else if(a[n]==0 && a[n_rev]!=0) printf("%d is prime.\n",n);
}
return 0;
}
10300-ecological premium
#include<stdio.h>
int main()
{
int n,f,ar[25],an[25],efrnd[25],i,j,premium;
while(scanf("%d",&n)==1)
{
while(n--)
{
scanf("%d",&f);
for(i=0;i<f;i++)
scanf("%d %d %d",&ar[i],&an[i],&efrnd[i]);
premium=0;
for(i=0;i<f;i++)
premium+=(ar[i]*efrnd[i]);
printf("%d\n",premium);
}
}
return 0;
}
int main()
{
int n,f,ar[25],an[25],efrnd[25],i,j,premium;
while(scanf("%d",&n)==1)
{
while(n--)
{
scanf("%d",&f);
for(i=0;i<f;i++)
scanf("%d %d %d",&ar[i],&an[i],&efrnd[i]);
premium=0;
for(i=0;i<f;i++)
premium+=(ar[i]*efrnd[i]);
printf("%d\n",premium);
}
}
return 0;
}
10310-dog and gopher
#include<stdio.h>
#include<math.h>
int main()
{
long int n,i;
double gdis,ddis,hx[1001],hy[1001],gx,dx,gy,dy;
while(scanf("%ld%lf%lf%lf%lf",&n,&gx,&gy,&dx,&dy)==5)
{
int goph=0,x;
for(i=1;i<=n;i++)
{
scanf("%lf%lf",&hx[i],&hy[i]);
}
for(i=1;i<=n;i++)
{
gdis=4*(pow((hx[i]-gx),2)+pow((hy[i]-gy),2));
ddis=pow((hx[i]-dx),2)+pow((hy[i]-dy),2);
if(gdis<=ddis)
{
goph++;x=i;
break;
}
}
if(goph==0) printf("The gopher cannot escape.\n");
else printf("The gopher can escape through the hole at (%.3lf,%.3lf).\n",hx[x],hy[x]);
}
return 0;
}
#include<math.h>
int main()
{
long int n,i;
double gdis,ddis,hx[1001],hy[1001],gx,dx,gy,dy;
while(scanf("%ld%lf%lf%lf%lf",&n,&gx,&gy,&dx,&dy)==5)
{
int goph=0,x;
for(i=1;i<=n;i++)
{
scanf("%lf%lf",&hx[i],&hy[i]);
}
for(i=1;i<=n;i++)
{
gdis=4*(pow((hx[i]-gx),2)+pow((hy[i]-gy),2));
ddis=pow((hx[i]-dx),2)+pow((hy[i]-dy),2);
if(gdis<=ddis)
{
goph++;x=i;
break;
}
}
if(goph==0) printf("The gopher cannot escape.\n");
else printf("The gopher can escape through the hole at (%.3lf,%.3lf).\n",hx[x],hy[x]);
}
return 0;
}
10346 - Peter's Smokes
#include<stdio.h>
int main()
{
int n,k,i,m,b,c,p;
while(scanf("%d %d",&n,&k)==2)
{
b=n;
while(n>=k)
{
m=n/k;
i=n%k;
b+=m;
n=m+i;
}
printf("%d\n",b);
}
return 0;
}
int main()
{
int n,k,i,m,b,c,p;
while(scanf("%d %d",&n,&k)==2)
{
b=n;
while(n>=k)
{
m=n/k;
i=n%k;
b+=m;
n=m+i;
}
printf("%d\n",b);
}
return 0;
}
10370-above avarage
#include<stdio.h>
int main()
{
int f,i;
double n,arr[1010],avg,sum,count=0,per;
scanf("%d",&f);
while(f--)
{
count=0;
sum=0,avg=0;
scanf("%lf",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&arr[i]);
sum+=arr[i];
}
avg=sum/n;
for(i=0;i<n;i++)
if(arr[i]>avg)
count++;
per=(count/n)*100;
printf("%.3lf%c\n",per,37);
}
return 0;
}
Another Way :
#include<stdio.h>
int main()
{
double n,a[1000],b,k,sum,avrg,prcnt;
int i,j;
while(scanf("%lf",&n)==1)
{
for(i=0;i<n;i++)
{
scanf("%lf",&b);
sum=0;
for(j=0;j<b;j++)
{
scanf("%lf",&a[j]);
sum+=a[j];
}
avrg=sum/b;
k=0;
for(j=0;j<b;j++)
{
if(a[j]>avrg)
{
k++;
}
}
prcnt=(k/b)*100;
printf("%.3lf%%\n",prcnt);
}
}
return 0;
}
int main()
{
int f,i;
double n,arr[1010],avg,sum,count=0,per;
scanf("%d",&f);
while(f--)
{
count=0;
sum=0,avg=0;
scanf("%lf",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&arr[i]);
sum+=arr[i];
}
avg=sum/n;
for(i=0;i<n;i++)
if(arr[i]>avg)
count++;
per=(count/n)*100;
printf("%.3lf%c\n",per,37);
}
return 0;
}
Another Way :
#include<stdio.h>
int main()
{
double n,a[1000],b,k,sum,avrg,prcnt;
int i,j;
while(scanf("%lf",&n)==1)
{
for(i=0;i<n;i++)
{
scanf("%lf",&b);
sum=0;
for(j=0;j<b;j++)
{
scanf("%lf",&a[j]);
sum+=a[j];
}
avrg=sum/b;
k=0;
for(j=0;j<b;j++)
{
if(a[j]>avrg)
{
k++;
}
}
prcnt=(k/b)*100;
printf("%.3lf%%\n",prcnt);
}
}
return 0;
}
10327-flip sort
#include<stdio.h>
int main()
{
int n,a[1001],i,j,temp,c;
while(scanf("%d",&n)==1)
{
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
c=0;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[j]<a[i])
{
temp=a[j];
a[j]=a[i];
a[i]=temp;
c++;
}
}
}
printf("Minimum exchange operations : %d\n",c);
}
return 0;
}
10365-blocks
#include<stdio.h>
#include<math.h>
int main()
{
int n,i,j,k,l,h,w,area,a,f;
scanf("%d",&f);
while(f--)
{
scanf("%d",&n);
area=1000000;
for(l=1;l<=n;l++)
for(h=1;h<=sqrt(n)+1;h++)
for(w=1;w<=sqrt(n)+1;w++)
{
if(l*h*w==n)
{
a=(2*l*w)+(2*l*h)+(2*h*w);
if(area>a) area=a;
}
}
printf("%d\n",area);
}
return 0;
}
#include<math.h>
int main()
{
int n,i,j,k,l,h,w,area,a,f;
scanf("%d",&f);
while(f--)
{
scanf("%d",&n);
area=1000000;
for(l=1;l<=n;l++)
for(h=1;h<=sqrt(n)+1;h++)
for(w=1;w<=sqrt(n)+1;w++)
{
if(l*h*w==n)
{
a=(2*l*w)+(2*l*h)+(2*h*w);
if(area>a) area=a;
}
}
printf("%d\n",area);
}
return 0;
}
10469-to carry or not tocarry
#include<stdio.h>
#include<math.h>
int main()
{
int x[33],y[33],z[33];
int a,b,i,j,k,sum;
while(scanf("%d %d",&a,&b)==2)
{
for(i=0;i<32;i++)
x[i]=0;
for(i=0;i<32;i++)
y[i]=0;
i=32;
while(1)
{
if(a<2)
{
x[i]=a;
break ;
}
x[i]=a%2;
a=a/2;
i--;
}
i=32;
while(1)
{
if(b<2)
{
y[i]=b;
break;
}
y[i]=b%2;
b=b/2;
i--;
}
for(i=32;i>=0;i--)
{
k=x[i]+y[i];
z[i]=k%2;
}
sum=0;
for(i=32,j=0;i>=0;i--,j++)
sum+=z[i]*pow(2,j);
printf("%d\n",sum);
}
return 0;
}
#include<math.h>
int main()
{
int x[33],y[33],z[33];
int a,b,i,j,k,sum;
while(scanf("%d %d",&a,&b)==2)
{
for(i=0;i<32;i++)
x[i]=0;
for(i=0;i<32;i++)
y[i]=0;
i=32;
while(1)
{
if(a<2)
{
x[i]=a;
break ;
}
x[i]=a%2;
a=a/2;
i--;
}
i=32;
while(1)
{
if(b<2)
{
y[i]=b;
break;
}
y[i]=b%2;
b=b/2;
i--;
}
for(i=32;i>=0;i--)
{
k=x[i]+y[i];
z[i]=k%2;
}
sum=0;
for(i=32,j=0;i>=0;i--,j++)
sum+=z[i]*pow(2,j);
printf("%d\n",sum);
}
return 0;
}
10394-twin primes
#include<stdio.h>
#include<stdbool.h>
#include<math.h>
typedef struct
{
int a,b;
}twin;
_Bool a[18409301];
void sieve(void)
{
register int i,j;
a[0]=1;
a[1]=1;
int lim=sqrt(18409300),k;
for(i=1;2*i<=18409300;i++)
a[2*i]=1;
j=3;
while(j<=lim)
{
for(i=3;i*j<=18409300;i++)
a[i*j]=1;
j+=2;
}
return ;
}
int main()
{
sieve();
int n;
long long i,j,count=0;
twin arr[100005];
for(i=0;i<18409295;i++)
{
if(a[i]==0 && a[i+2]==0)
{
arr[count].a=i;
arr[count].b=i+2;
count++;
}
}
while(scanf("%d",&n)==1)
{
printf("(%d, %d)\n",arr[n-1].a,arr[n-1].b);
}
return 0;
}
#include<stdbool.h>
#include<math.h>
typedef struct
{
int a,b;
}twin;
_Bool a[18409301];
void sieve(void)
{
register int i,j;
a[0]=1;
a[1]=1;
int lim=sqrt(18409300),k;
for(i=1;2*i<=18409300;i++)
a[2*i]=1;
j=3;
while(j<=lim)
{
for(i=3;i*j<=18409300;i++)
a[i*j]=1;
j+=2;
}
return ;
}
int main()
{
sieve();
int n;
long long i,j,count=0;
twin arr[100005];
for(i=0;i<18409295;i++)
{
if(a[i]==0 && a[i+2]==0)
{
arr[count].a=i;
arr[count].b=i+2;
count++;
}
}
while(scanf("%d",&n)==1)
{
printf("(%d, %d)\n",arr[n-1].a,arr[n-1].b);
}
return 0;
}
10424-love calculator
#include<stdio.h>
#include<string.h>
#include<ctype.h>
int main()
{
char c[26],d[26];
int l1,l2,i,j,m,n,sum1,sum2,a,b,temp;
double rat;
while(gets(c))
{
l1=strlen(c);
gets(d);
l2=strlen(d);
m=0;
sum1=0;
for(i=0;i<l1;i++)
{
if(c[i]>=65 && c[i]<=90 || c[i]>=97 && c[i]<=122)
{
sum1+=tolower(c[i])-96;
m++;
}
}
n=0;
sum2=0;
for(i=0;i<l2;i++)
{
if(d[i]>=65 && d[i]<=90 || d[i]>=97 && d[i]<=122)
{
sum2+=tolower(d[i])-96;
n++;
}
}
a=0;
if(sum1>9)
{
while(sum1>0)
{
a+=sum1%10;
sum1=sum1/10;
if(a>9)
{
sum1=a;
a=0;
continue;
}
if(sum1==0)
{
break;
}
else
continue;
}
}
b=0;
if(sum2>9)
{
while(sum2>0)
{
b+=sum2%10;
sum2=sum2/10;
if(b>9)
{
sum2=b;
b=0;
continue;
}
if(sum2==0)
{
break;
}
else
continue;
}
}
if(a>b)
{
temp=a;
a=b;
b=temp;
}
rat=((double)a/(double)b)*100;
printf("%.2lf%%\n",rat);
}
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char n1[50],n2[50];
float temp1,temp2,len1,len2,per;
int i,sum1,sum2;
while(gets(n1))
{
gets(n2);
sum1=0,sum2=0;
len1=strlen(n1);
len2=strlen(n2);
for(i=0; i<len1; i++)
{
if(n1[i]>='A' && n1[i]<='Z') sum1+=(n1[i]-64);
else if(n1[i]>='a' && n1[i]<='z')sum1+=(n1[i]-96);
}
for(i=0; i<len2; i++)
{
if(n2[i]>='A' && n2[i]<='Z') sum2+=(n2[i]-64);
else if(n2[i]>='a' && n2[i]<='z')sum2+=(n2[i]-96);
}
int w,x,y;
w=(sum1/100)+(sum1%100);
x=(w/100)+(w%100);
y=(x/10)+(x%10);
temp1=(y/10)+(y%10);
w=(sum2/100)+(sum2%100);
x=(w/100)+(w%100);
y=(x/10)+(x%10);
temp2=(y/10)+(y%10);
if(temp2<temp1)
{
per=(temp2/temp1)*100;
printf("%.2f %\n",per);
}
else
{
per=(temp1/temp2)*100;
printf("%.2f %\n",per);
}
}
return 0;
}
#include<string.h>
#include<ctype.h>
int main()
{
char c[26],d[26];
int l1,l2,i,j,m,n,sum1,sum2,a,b,temp;
double rat;
while(gets(c))
{
l1=strlen(c);
gets(d);
l2=strlen(d);
m=0;
sum1=0;
for(i=0;i<l1;i++)
{
if(c[i]>=65 && c[i]<=90 || c[i]>=97 && c[i]<=122)
{
sum1+=tolower(c[i])-96;
m++;
}
}
n=0;
sum2=0;
for(i=0;i<l2;i++)
{
if(d[i]>=65 && d[i]<=90 || d[i]>=97 && d[i]<=122)
{
sum2+=tolower(d[i])-96;
n++;
}
}
a=0;
if(sum1>9)
{
while(sum1>0)
{
a+=sum1%10;
sum1=sum1/10;
if(a>9)
{
sum1=a;
a=0;
continue;
}
if(sum1==0)
{
break;
}
else
continue;
}
}
b=0;
if(sum2>9)
{
while(sum2>0)
{
b+=sum2%10;
sum2=sum2/10;
if(b>9)
{
sum2=b;
b=0;
continue;
}
if(sum2==0)
{
break;
}
else
continue;
}
}
if(a>b)
{
temp=a;
a=b;
b=temp;
}
rat=((double)a/(double)b)*100;
printf("%.2lf%%\n",rat);
}
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char n1[50],n2[50];
float temp1,temp2,len1,len2,per;
int i,sum1,sum2;
while(gets(n1))
{
gets(n2);
sum1=0,sum2=0;
len1=strlen(n1);
len2=strlen(n2);
for(i=0; i<len1; i++)
{
if(n1[i]>='A' && n1[i]<='Z') sum1+=(n1[i]-64);
else if(n1[i]>='a' && n1[i]<='z')sum1+=(n1[i]-96);
}
for(i=0; i<len2; i++)
{
if(n2[i]>='A' && n2[i]<='Z') sum2+=(n2[i]-64);
else if(n2[i]>='a' && n2[i]<='z')sum2+=(n2[i]-96);
}
int w,x,y;
w=(sum1/100)+(sum1%100);
x=(w/100)+(w%100);
y=(x/10)+(x%10);
temp1=(y/10)+(y%10);
w=(sum2/100)+(sum2%100);
x=(w/100)+(w%100);
y=(x/10)+(x%10);
temp2=(y/10)+(y%10);
if(temp2<temp1)
{
per=(temp2/temp1)*100;
printf("%.2f %\n",per);
}
else
{
per=(temp1/temp2)*100;
printf("%.2f %\n",per);
}
}
return 0;
}
10499-the land of justice
#include<stdio.h>
int main()
{
long long a,n;
while(scanf("%lld",&n)==1)
{
if(n<0) break;
if(n==1)
{
printf("0%c\n",37);
continue;
}
a=n*25;
printf("%lld%c\n",a,37);
}
return 0;
}
int main()
{
long long a,n;
while(scanf("%lld",&n)==1)
{
if(n<0) break;
if(n==1)
{
printf("0%c\n",37);
continue;
}
a=n*25;
printf("%lld%c\n",a,37);
}
return 0;
}
10633-rare easy problem
#include<stdio.h>
int main()
{
unsigned long long n,x;
while(scanf("%llu",&n)==1)
{
if(n==0)
{
break;
}
x=(n*10)/9;
if(n%9==0)
{
printf("%llu %llu\n",x-1,x);
}
else
{
printf("%llu\n",x);
}
}
return 0;
}
int main()
{
unsigned long long n,x;
while(scanf("%llu",&n)==1)
{
if(n==0)
{
break;
}
x=(n*10)/9;
if(n%9==0)
{
printf("%llu %llu\n",x-1,x);
}
else
{
printf("%llu\n",x);
}
}
return 0;
}
10696-f91
#include<stdio.h>
int main()
{
int n;
while(scanf("%d",&n)==1)
{
if(n==0)
{
break;
}
if(n>=101)
{
printf("f91(%d) = %d\n",n,n-10);
}
else if(n<=100)
{
printf("f91(%d) = 91\n",n);
}
}
return 0;
}
int main()
{
int n;
while(scanf("%d",&n)==1)
{
if(n==0)
{
break;
}
if(n>=101)
{
printf("f91(%d) = %d\n",n,n-10);
}
else if(n<=100)
{
printf("f91(%d) = 91\n",n);
}
}
return 0;
}
10790-how many points of intersection
#include<stdio.h>
int main()
{
long long a,b,i;
for(i=1;;i++)
{
scanf("%lld %lld",&a,&b);
if(a==0 && b==0) break;
if(a==0 || b==0)
{
printf("Case %lld: 0\n",i);
continue ;
}
printf("Case %lld: %lld\n",i,((a*b*(a-1)*(b-1))/4));
}
return 0;
}
int main()
{
long long a,b,i;
for(i=1;;i++)
{
scanf("%lld %lld",&a,&b);
if(a==0 && b==0) break;
if(a==0 || b==0)
{
printf("Case %lld: 0\n",i);
continue ;
}
printf("Case %lld: %lld\n",i,((a*b*(a-1)*(b-1))/4));
}
return 0;
}
10789-prime frequency
#include<stdio.h>
#include<string.h>
#include<stdio.h>
#include<stdbool.h>
#include<math.h>
_Bool a[3001];
void sieve(void)
{
register int i,j,lim,k;
a[0]=1;
a[1]=1;
a[2]=0;
lim=sqrt(3000);
for(i=2;2*i<=3000;i++)
a[2*i]=1;
j=3;
while(j<=lim)
{
for(i=3;i*j<=3000;i++)
a[i*j]=1;
j+=2;
}
return ;
}
int main()
{
sieve();
char ch,r;
int b[150],i,j,k,n,s,x,m=1,flag;
scanf("%d",&n);
r=getchar();
for(i=1;i<=n;i++)
{
flag=0;
for(j=0;j<150;j++)
b[j]=0;
while(1)
{
scanf("%c",&ch);
if(ch=='\n') break ;
s=(int)(ch);
b[s]=m+b[s];
}
printf("Case %d: ",i);
for(j=48;j<=57;j++)
{
x=b[j];
if(a[x]==0)
{
printf("%c",j);
flag++;
}
}
for(j=65;j<=90;j++)
{
x=b[j];
if(a[x]==0)
{
printf("%c",j);
flag++;
}
}
for(j=97;j<=122;j++)
{
x=b[j];
if(a[x]==0)
{
printf("%c",j);
flag++;
}
}
if(flag==0) printf("empty");
printf("\n");
}
return 0;
}
#include<string.h>
#include<stdio.h>
#include<stdbool.h>
#include<math.h>
_Bool a[3001];
void sieve(void)
{
register int i,j,lim,k;
a[0]=1;
a[1]=1;
a[2]=0;
lim=sqrt(3000);
for(i=2;2*i<=3000;i++)
a[2*i]=1;
j=3;
while(j<=lim)
{
for(i=3;i*j<=3000;i++)
a[i*j]=1;
j+=2;
}
return ;
}
int main()
{
sieve();
char ch,r;
int b[150],i,j,k,n,s,x,m=1,flag;
scanf("%d",&n);
r=getchar();
for(i=1;i<=n;i++)
{
flag=0;
for(j=0;j<150;j++)
b[j]=0;
while(1)
{
scanf("%c",&ch);
if(ch=='\n') break ;
s=(int)(ch);
b[s]=m+b[s];
}
printf("Case %d: ",i);
for(j=48;j<=57;j++)
{
x=b[j];
if(a[x]==0)
{
printf("%c",j);
flag++;
}
}
for(j=65;j<=90;j++)
{
x=b[j];
if(a[x]==0)
{
printf("%c",j);
flag++;
}
}
for(j=97;j<=122;j++)
{
x=b[j];
if(a[x]==0)
{
printf("%c",j);
flag++;
}
}
if(flag==0) printf("empty");
printf("\n");
}
return 0;
}
10784-diagonal
#include<stdio.h>
#include<math.h>
int main()
{
long long a,b=1,n;
while(scanf("%lld",&n)==1)
{
if(n==0)
return 0;
a=ceil((3+sqrt(9+8*n))/2);
printf("Case %lld: %lld\n",b,a);
b++;
}
return 0;
}
#include<math.h>
int main()
{
long long a,b=1,n;
while(scanf("%lld",&n)==1)
{
if(n==0)
return 0;
a=ceil((3+sqrt(9+8*n))/2);
printf("Case %lld: %lld\n",b,a);
b++;
}
return 0;
}
10921-find the telephone
#include<stdio.h>
int main()
{
char ch;
while(scanf("%c",&ch)==1)
{
if (ch=='A'||ch=='B'||ch=='C') printf("2");
else if (ch=='D'||ch=='E'||ch=='F') printf("3");
else if (ch=='G'||ch=='H'||ch=='I') printf("4");
else if (ch=='J'||ch=='K'||ch=='L') printf("5");
else if (ch=='M'||ch=='N'||ch=='O') printf("6");
else if (ch=='P'||ch=='Q'||ch=='R'||ch=='S') printf("7");
else if (ch=='T'||ch=='U'||ch=='V') printf("8");
else if (ch=='W'||ch=='X'||ch=='Y'||ch=='Z') printf("9");
else printf("%c",ch);
}
return 0;
}
int main()
{
char ch;
while(scanf("%c",&ch)==1)
{
if (ch=='A'||ch=='B'||ch=='C') printf("2");
else if (ch=='D'||ch=='E'||ch=='F') printf("3");
else if (ch=='G'||ch=='H'||ch=='I') printf("4");
else if (ch=='J'||ch=='K'||ch=='L') printf("5");
else if (ch=='M'||ch=='N'||ch=='O') printf("6");
else if (ch=='P'||ch=='Q'||ch=='R'||ch=='S') printf("7");
else if (ch=='T'||ch=='U'||ch=='V') printf("8");
else if (ch=='W'||ch=='X'||ch=='Y'||ch=='Z') printf("9");
else printf("%c",ch);
}
return 0;
}
10924-prime words
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
char c[21];
int l,i,j,sum;
while(gets(c))
{
l=strlen(c);
sum=0;
for(i=0;i<l;i++)
{
if(c[i]>=97 && c[i]<=122)
{
sum+=c[i]-96;
}
else if(c[i]>=65 && c[i]<=90)
{
sum+=c[i]-38;
}
else if(c[i]==' ')
{
break;
}
}
j=1;
for(i=2;i<=sqrt(sum);i++)
{
if(sum%i==0)
{
printf("It is not a prime word.\n");
j=0;
break;
}
}
if(j==1)
{
printf("It is a prime word.\n");
}
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char word[100];
int len,a,b,i,j;
while(gets(word))
{
a=0;
b=0;
len=strlen(word);
for(i=0; i<len; i++)
{
if(word[i]>'a' && word[i]<'z') a=a+(word[i]-96);
else if(word[i]>'A' && word[i]<'Z') a=a+(word[i]-64);
if(word[i]==' ') break;
}
for(j=2; j<=a/2; j++)
{
if(a%j==0)
{
b++;
break;
}
}
if(b==0) printf("It is a prime word.\n");
if(b>0)printf("It is not a prime word.\n");
}
return 0;
}
#include<string.h>
#include<math.h>
int main()
{
char c[21];
int l,i,j,sum;
while(gets(c))
{
l=strlen(c);
sum=0;
for(i=0;i<l;i++)
{
if(c[i]>=97 && c[i]<=122)
{
sum+=c[i]-96;
}
else if(c[i]>=65 && c[i]<=90)
{
sum+=c[i]-38;
}
else if(c[i]==' ')
{
break;
}
}
j=1;
for(i=2;i<=sqrt(sum);i++)
{
if(sum%i==0)
{
printf("It is not a prime word.\n");
j=0;
break;
}
}
if(j==1)
{
printf("It is a prime word.\n");
}
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char word[100];
int len,a,b,i,j;
while(gets(word))
{
a=0;
b=0;
len=strlen(word);
for(i=0; i<len; i++)
{
if(word[i]>'a' && word[i]<'z') a=a+(word[i]-96);
else if(word[i]>'A' && word[i]<'Z') a=a+(word[i]-64);
if(word[i]==' ') break;
}
for(j=2; j<=a/2; j++)
{
if(a%j==0)
{
b++;
break;
}
}
if(b==0) printf("It is a prime word.\n");
if(b>0)printf("It is not a prime word.\n");
}
return 0;
}
10922-2 the 9's
#include<stdio.h>
#include<string.h>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
char num[10000];
int n,i,j,len,sum,a;
while(gets(num))
{
sum=0;
len=strlen(num);
if(len==1 && num[0]=='0') return 0;
for(i=0;i<len;i++)
sum+=num[i]-'0';
i=1;
while(sum>9)
{
a=sum;
sum=0;
while(1)
{
sum+=a%10;
a=a/10;
if(a<10)
{
sum+=a;
break;
}
}
i++;
}
if(sum%9==0) printf("%s is a multiple of 9 and has 9-degree %d.\n",num,i);
else printf("%s is not a multiple of 9.\n",num);
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char num[1002];
long int i,j,sum,k,len,deg;
while(scanf("%s",num)==1)
{
len=strlen(num);
if(len==1 && num[0]=='0')break;
sum=0;
deg=0;
for(i=0; i<len; i++)
{
sum+=num[i]-48;
}
if(sum%9==0)
{
for(i=1;; i++)
{
j=sum;
sum=0;
if(j/10==0)
{
printf("%s is a multiple of 9 and has 9-degree %ld.\n",num,i);
break;
}
else
{
for(;;)
{
printf("%ld\n",j);
sum+=j%10;
j=j/10;
printf("%ld\n",j);
if(j==0)break;
}
}
}
}
else printf("%s is not a multiple of 9.\n",num);
}
return 0;
}
& m More other way :
#include<stdio.h>
#include<string.h>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
char num[10000];
int n,i,j,len,sum,a;
while(gets(num))
{
sum=0;
len=strlen(num);
if(len==1 && num[0]=='0')
return 0;
for(i=0;i<len;i++)
sum+=num[i]-'0';
i=1;
while(sum>9)
{
a=sum;
sum=0;
while(1)
{
sum+=a%10;
a=a/10;
if(a<10)
{
sum+=a;
break;
}
}
i++;
}
if(sum%9==0) printf("%s is a multiple of 9 and has 9-degree %d.\n",num,i);
else printf("%s is not a multiple of 9.\n",num);
}
return 0;
}
#include<string.h>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
char num[10000];
int n,i,j,len,sum,a;
while(gets(num))
{
sum=0;
len=strlen(num);
if(len==1 && num[0]=='0') return 0;
for(i=0;i<len;i++)
sum+=num[i]-'0';
i=1;
while(sum>9)
{
a=sum;
sum=0;
while(1)
{
sum+=a%10;
a=a/10;
if(a<10)
{
sum+=a;
break;
}
}
i++;
}
if(sum%9==0) printf("%s is a multiple of 9 and has 9-degree %d.\n",num,i);
else printf("%s is not a multiple of 9.\n",num);
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char num[1002];
long int i,j,sum,k,len,deg;
while(scanf("%s",num)==1)
{
len=strlen(num);
if(len==1 && num[0]=='0')break;
sum=0;
deg=0;
for(i=0; i<len; i++)
{
sum+=num[i]-48;
}
if(sum%9==0)
{
for(i=1;; i++)
{
j=sum;
sum=0;
if(j/10==0)
{
printf("%s is a multiple of 9 and has 9-degree %ld.\n",num,i);
break;
}
else
{
for(;;)
{
printf("%ld\n",j);
sum+=j%10;
j=j/10;
printf("%ld\n",j);
if(j==0)break;
}
}
}
}
else printf("%s is not a multiple of 9.\n",num);
}
return 0;
}
& m More other way :
#include<stdio.h>
#include<string.h>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
char num[10000];
int n,i,j,len,sum,a;
while(gets(num))
{
sum=0;
len=strlen(num);
if(len==1 && num[0]=='0')
return 0;
for(i=0;i<len;i++)
sum+=num[i]-'0';
i=1;
while(sum>9)
{
a=sum;
sum=0;
while(1)
{
sum+=a%10;
a=a/10;
if(a<10)
{
sum+=a;
break;
}
}
i++;
}
if(sum%9==0) printf("%s is a multiple of 9 and has 9-degree %d.\n",num,i);
else printf("%s is not a multiple of 9.\n",num);
}
return 0;
}
10929-can you say 11
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
char num[10000];
long long n,i,j,len,odd,even,a;
while(gets(num))
{
odd=0,even=0;
len=strlen(num);
if(len==1 && num[0]=='0') return 0;
for(i=0;i<len;i+=2)
odd+=num[i]-'0';
for(i=1;i<len;i+=2)
even+=num[i]-'0';
a=abs(odd-even);
if(a%11==0) printf("%s is a multiple of 11.\n",num);
else printf("%s is not a multiple of 11.\n",num);
}
return 0;
}
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
char num[10000];
long long n,i,j,len,odd,even,a;
while(gets(num))
{
odd=0,even=0;
len=strlen(num);
if(len==1 && num[0]=='0') return 0;
for(i=0;i<len;i+=2)
odd+=num[i]-'0';
for(i=1;i<len;i+=2)
even+=num[i]-'0';
a=abs(odd-even);
if(a%11==0) printf("%s is a multiple of 11.\n",num);
else printf("%s is not a multiple of 11.\n",num);
}
return 0;
}
10931-parity
#include<stdio.h>
#include<string.h>
int main()
{
long long a;
int i,j,l,b[1000];
while(scanf("%lld",&a)==1)
{
if(a==0)
{
break;
}
l=0;
j=0;
while(a>=0)
{
b[l]=a%2;
if(b[l]==1)
{
j++;
}
a=a/2;
if(a==0)
{
break;
}
l++;
}
printf("The parity of ");
for(i=l;i>=0;i--)
{
printf("%d",b[i]);
}
printf(" is %d (mod 2).\n",j);
}
return 0;
}
#include<string.h>
int main()
{
long long a;
int i,j,l,b[1000];
while(scanf("%lld",&a)==1)
{
if(a==0)
{
break;
}
l=0;
j=0;
while(a>=0)
{
b[l]=a%2;
if(b[l]==1)
{
j++;
}
a=a/2;
if(a==0)
{
break;
}
l++;
}
printf("The parity of ");
for(i=l;i>=0;i--)
{
printf("%d",b[i]);
}
printf(" is %d (mod 2).\n",j);
}
return 0;
}
10935-throwing cards away I
#include<stdio.h>
#include<math.h>
int main()
{
int a[100],i,j,k,l,n,ip,fp,th,rm,x,s,tmp;
double y;
while(scanf("%d",&n)==1 && n)
{
if(n==1)
{
printf("Discarded cards:\nRemaining card: 1\n");
continue ;
}
for(i=1;i<=n;i++)
a[i]=i;
ip=3;
fp=n;
th=0;
rm=n;
x=0;
printf("Discarded cards: 1");
while(1)
{
if(rm==1) break ;
for(i=ip,j=ip+1;i<=fp;i+=2,j+=2)
{
printf(", %d",a[i]);
}
j=1;
for(i=2;i<=fp;i+=2)
{
a[j]=a[i];
j++;
}
if(rm%2==1) th=(rm/2)+1;
else th=rm/2;
rm=rm-th;
s=fp;
fp=rm;
if(s%2==1)
{
tmp=a[1];
for(i=1,j=i+1;i<rm;i++,j++)
a[i]=a[j];
a[rm]=tmp;
}
ip=1;
}
printf("\nRemaining card: %d\n",a[1]);
}
return 0;
}
#include<math.h>
int main()
{
int a[100],i,j,k,l,n,ip,fp,th,rm,x,s,tmp;
double y;
while(scanf("%d",&n)==1 && n)
{
if(n==1)
{
printf("Discarded cards:\nRemaining card: 1\n");
continue ;
}
for(i=1;i<=n;i++)
a[i]=i;
ip=3;
fp=n;
th=0;
rm=n;
x=0;
printf("Discarded cards: 1");
while(1)
{
if(rm==1) break ;
for(i=ip,j=ip+1;i<=fp;i+=2,j+=2)
{
printf(", %d",a[i]);
}
j=1;
for(i=2;i<=fp;i+=2)
{
a[j]=a[i];
j++;
}
if(rm%2==1) th=(rm/2)+1;
else th=rm/2;
rm=rm-th;
s=fp;
fp=rm;
if(s%2==1)
{
tmp=a[1];
for(i=1,j=i+1;i<rm;i++,j++)
a[i]=a[j];
a[rm]=tmp;
}
ip=1;
}
printf("\nRemaining card: %d\n",a[1]);
}
return 0;
}
10940-throwing cards away II
#include<stdio.h>
#include<math.h>
int main()
{
int i,x,s,n;
double y;
while(scanf("%d",&n)==1 && n)
{
x=1;
while(x<=n)
{
x*=2;
}
s=x%n;
printf("%d\n",n-s);
}
return 0;
}
#include<math.h>
int main()
{
int i,x,s,n;
double y;
while(scanf("%d",&n)==1 && n)
{
x=1;
while(x<=n)
{
x*=2;
}
s=x%n;
printf("%d\n",n-s);
}
return 0;
}
10945-mother bear
#include<stdio.h>
#include<string.h>
int main()
{
char a[1000],b[1000];
int i,j,k,n,m,p,l,flag;
while(gets(b))
{
if(strcmp(b,"DONE")==0)
{
break;
}
l=strlen(b);
printf("%d\n",l);
m=0;
for(i=0;i<l;i++)
{
if(b[i]>='A' && b[i]<='Z'||b[i]>='a' && b[i]<='z')
{
a[m]=b[i];
m++;
}
}
n=strlen(a);
printf("*%d\n",n);
for(j=0,k=n-1;j<=n/2;j++,k--)
{
flag=0;
if(a[j]>='A' && a[j]<='Z'||a[j]>='a' &&a[j]<='z')
{
if(a[j]==a[k])
{
flag=1;
}
}
}
if(flag==1)
{
printf("You won't be eaten!\n");
}
else if(flag==0)
{
printf("Uh oh..\n");
}
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
#include<ctype.h>
int main()
{
char line[10000],m,test[10000],x,rev[10000];
int len,i,j,l,k,p;
while(gets(line))
{
if(line[0]=='D'&&line[1]=='O'&&line[2]=='N'&&line[3]=='E')break;
len=strlen(line);
j=0;
p=0;
for(i=0; i<len; i++)
{
x=tolower(line[i]);
if(x>='a' && x<='z')
{
test[j++]=x;
}
}
test[j]='\0';
l=j;
for(i=0,j=l-1; i<l/2,j>=l/2; i++,j--)
{
if(test[i]!=test[j])
{
p=1;
break;
}
}
if(p!=0)
printf("Uh oh..\n");
else
printf("You won't be eaten!\n");
}
return 0;
}
#include<string.h>
int main()
{
char a[1000],b[1000];
int i,j,k,n,m,p,l,flag;
while(gets(b))
{
if(strcmp(b,"DONE")==0)
{
break;
}
l=strlen(b);
printf("%d\n",l);
m=0;
for(i=0;i<l;i++)
{
if(b[i]>='A' && b[i]<='Z'||b[i]>='a' && b[i]<='z')
{
a[m]=b[i];
m++;
}
}
n=strlen(a);
printf("*%d\n",n);
for(j=0,k=n-1;j<=n/2;j++,k--)
{
flag=0;
if(a[j]>='A' && a[j]<='Z'||a[j]>='a' &&a[j]<='z')
{
if(a[j]==a[k])
{
flag=1;
}
}
}
if(flag==1)
{
printf("You won't be eaten!\n");
}
else if(flag==0)
{
printf("Uh oh..\n");
}
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
#include<ctype.h>
int main()
{
char line[10000],m,test[10000],x,rev[10000];
int len,i,j,l,k,p;
while(gets(line))
{
if(line[0]=='D'&&line[1]=='O'&&line[2]=='N'&&line[3]=='E')break;
len=strlen(line);
j=0;
p=0;
for(i=0; i<len; i++)
{
x=tolower(line[i]);
if(x>='a' && x<='z')
{
test[j++]=x;
}
}
test[j]='\0';
l=j;
for(i=0,j=l-1; i<l/2,j>=l/2; i++,j--)
{
if(test[i]!=test[j])
{
p=1;
break;
}
}
if(p!=0)
printf("Uh oh..\n");
else
printf("You won't be eaten!\n");
}
return 0;
}
10948-the primary problem
#include<stdio.h>
long long a[1000000];
void sieve()
{
long long i,j,p;
a[0]=0;
a[1]=0;
for(i=2; i<=1000000; i++)
{
a[i]=1;
}
for(i=2; i<=1000; i++)
{
if(a[i]!=0)
{
for(j=i; j<=500000; j++)
{
p=i*j;
if(p<=1000000)
{
a[p]=0;
}
else
{
break;
}
}
}
}
}
int main()
{
sieve();
long long n,i,o;
while(scanf("%lld",&n)==1)
{
if(n==0)
{
return 0;
}
if(n>0&&n<=2)
{
printf("%lld:\nNO WAY!\n",n);
continue;
}
for(i=2;i<=1000000;i++)
{
if(a[i]==1)
{
o=n-i;
if(a[o]!=0)
{
printf("%lld:\n%lld+%lld\n",n,i,o);
break;
}
}
if(i>=n)
{
printf("%lld:\nNO WAY!\n",n);
break;
}
}
}
return 0;
}
long long a[1000000];
void sieve()
{
long long i,j,p;
a[0]=0;
a[1]=0;
for(i=2; i<=1000000; i++)
{
a[i]=1;
}
for(i=2; i<=1000; i++)
{
if(a[i]!=0)
{
for(j=i; j<=500000; j++)
{
p=i*j;
if(p<=1000000)
{
a[p]=0;
}
else
{
break;
}
}
}
}
}
int main()
{
sieve();
long long n,i,o;
while(scanf("%lld",&n)==1)
{
if(n==0)
{
return 0;
}
if(n>0&&n<=2)
{
printf("%lld:\nNO WAY!\n",n);
continue;
}
for(i=2;i<=1000000;i++)
{
if(a[i]==1)
{
o=n-i;
if(a[o]!=0)
{
printf("%lld:\n%lld+%lld\n",n,i,o);
break;
}
}
if(i>=n)
{
printf("%lld:\nNO WAY!\n",n);
break;
}
}
}
return 0;
}
10970 - Big Chocolate
#include<stdio.h>
int main()
{
long long m,n;
while(scanf("%lld %lld",&m,&n)==2)
{
printf("%lld\n",((m*n)-1));
}
return 0;
}
int main()
{
long long m,n;
while(scanf("%lld %lld",&m,&n)==2)
{
printf("%lld\n",((m*n)-1));
}
return 0;
}
11045-T-shirt suits me
#include<stdio.h>
#include<string.h>
int main()
{
int t,n,m,i,l,j,k,p,q,r,a1,a2,b1,b2,c1,c2,d1,d2,e1,e2,f1,f2,a,b,c,d,e,f;
char x[4],y[4],z[10];
scanf("%d",&t);
while(t--)
{
scanf("%d %d ",&n,&m);
a1=0,a2=0,b1=0,b2=0,c1=0,c2=0,d1=0,d2=0,e1=0,e2=0,f1=0,f2=0;
for(i=0; i<m; i++)
{
gets(z);
l=strlen(z);
r=0;
q=0;
for(i=0; i<l; i++)
{
if(z[i]==' ')
{
for(p=0,k=i+1; k<l; k++,p++)
{
y[p]=z[k];
}
q=1;
if(q==1)
{
break;
}
}
if(z[i]!=' ')
{
x[i]=z[i];
}
}
printf("%s %d\n",x,strlen(x));
printf("%s %d\n",y,strlen(y));
}
}
return 0;
}
#include<string.h>
int main()
{
int t,n,m,i,l,j,k,p,q,r,a1,a2,b1,b2,c1,c2,d1,d2,e1,e2,f1,f2,a,b,c,d,e,f;
char x[4],y[4],z[10];
scanf("%d",&t);
while(t--)
{
scanf("%d %d ",&n,&m);
a1=0,a2=0,b1=0,b2=0,c1=0,c2=0,d1=0,d2=0,e1=0,e2=0,f1=0,f2=0;
for(i=0; i<m; i++)
{
gets(z);
l=strlen(z);
r=0;
q=0;
for(i=0; i<l; i++)
{
if(z[i]==' ')
{
for(p=0,k=i+1; k<l; k++,p++)
{
y[p]=z[k];
}
q=1;
if(q==1)
{
break;
}
}
if(z[i]!=' ')
{
x[i]=z[i];
}
}
printf("%s %d\n",x,strlen(x));
printf("%s %d\n",y,strlen(y));
}
}
return 0;
}
11044 - Searching for Nessy
#include<stdio.h>
int main()
{
long long a,b,c,t,i;
while(scanf("%lld",&t)==1)
{
for(i=1;i<=t;i++)
{
scanf("%lld %lld",&a,&b);
c=(a/3)*(b/3);
printf("%lld\n",c);
}
}
return 0;
}
int main()
{
long long a,b,c,t,i;
while(scanf("%lld",&t)==1)
{
for(i=1;i<=t;i++)
{
scanf("%lld %lld",&a,&b);
c=(a/3)*(b/3);
printf("%lld\n",c);
}
}
return 0;
}
10812 - Beat the Spread!
#include<stdio.h>
int main()
{
double n,s,d,a,b;
scanf("%lf",&n);
while(n--)
{
scanf("%lf %lf",&s,&d);
if(d>s)
{
printf("impossible\n");
continue ;
}
if((int)(s+d)/2!=(s+d)/2)
{
printf("impossible\n");
continue ;
}
a=(s+d)/2;
b=s-a;
printf("%.0lf %.0lf\n",a,b);
}
return 0;
}
int main()
{
double n,s,d,a,b;
scanf("%lf",&n);
while(n--)
{
scanf("%lf %lf",&s,&d);
if(d>s)
{
printf("impossible\n");
continue ;
}
if((int)(s+d)/2!=(s+d)/2)
{
printf("impossible\n");
continue ;
}
a=(s+d)/2;
b=s-a;
printf("%.0lf %.0lf\n",a,b);
}
return 0;
}
11068 - An Easy Task
#include<stdio.h>
#include<math.h>
int main()
{
double a,b,c,p,q,r,x,y;
while(scanf("%lf %lf %lf %lf %lf %lf",&a,&b,&c,&p,&q,&r)==6)
{
if(a==0 && b==0 && c==0 && p==0 && q==0 && r==0)
break ;
if((a/b)==(p/q))
{
printf("No fixed point exists.\n");
continue ;
}
x=((b*r)-(q*c))/((p*b)-(a*q));
if(x==-0) x=x*-1;
y=((a*r)-(p*c))/((a*q)-(p*b));
if(y==-0) y=y*-1;
printf("The fixed point is at %.2lf %.2lf.\n",x,y);
}
return 0;
}
Another Way :
#include <stdio.h>
int main()
{
double x1,x2, y1, y2, c1, c2, result_x, result_y;
while(scanf("%lf %lf %lf %lf %lf %lf", &x1, &y1, &c1, &x2, &y2, &c2)==6)
{
if(x1==0 && x2==0 && y1==0 && y2==0 && c1==0 && c2==0)
break;
else if(x1*y2==x2*y1 || y1*x2==y2)
{
printf("No fixed point exists.\n");
}
else
{
result_x=(((c1*y2)-(c2*y1))/((x1*y2)-(x2*y1)));
result_y=(((c1*x2)-(c2*x1))/((y1*x2)-(y2*x1)));
printf("The fixed point is at %.2lf %.2lf.\n", result_x, result_y);
}
}
return 0;
}
#include<math.h>
int main()
{
double a,b,c,p,q,r,x,y;
while(scanf("%lf %lf %lf %lf %lf %lf",&a,&b,&c,&p,&q,&r)==6)
{
if(a==0 && b==0 && c==0 && p==0 && q==0 && r==0)
break ;
if((a/b)==(p/q))
{
printf("No fixed point exists.\n");
continue ;
}
x=((b*r)-(q*c))/((p*b)-(a*q));
if(x==-0) x=x*-1;
y=((a*r)-(p*c))/((a*q)-(p*b));
if(y==-0) y=y*-1;
printf("The fixed point is at %.2lf %.2lf.\n",x,y);
}
return 0;
}
Another Way :
#include <stdio.h>
int main()
{
double x1,x2, y1, y2, c1, c2, result_x, result_y;
while(scanf("%lf %lf %lf %lf %lf %lf", &x1, &y1, &c1, &x2, &y2, &c2)==6)
{
if(x1==0 && x2==0 && y1==0 && y2==0 && c1==0 && c2==0)
break;
else if(x1*y2==x2*y1 || y1*x2==y2)
{
printf("No fixed point exists.\n");
}
else
{
result_x=(((c1*y2)-(c2*y1))/((x1*y2)-(x2*y1)));
result_y=(((c1*x2)-(c2*x1))/((y1*x2)-(y2*x1)));
printf("The fixed point is at %.2lf %.2lf.\n", result_x, result_y);
}
}
return 0;
}
11057 - Exact Sum
#include<stdio.h>
#include<stdlib.h>
int main()
{
int a[10010],i,j,n,k,mind,x,y,p,dif,tmp;
while(scanf("%d",&n)==1)
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&p);
mind=1000000;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if((a[i]+a[j])==p)
{
dif=abs(a[i]-a[j]);
if(dif<mind)
{
mind=dif;
x=a[i];
y=a[j];
}
}
}
if(x>y)
{
tmp=x;
x=y;
y=tmp;
}
printf("Peter should buy books whose prices are %d and %d.\n\n",x,y);
}
return 0;
}
#include<stdlib.h>
int main()
{
int a[10010],i,j,n,k,mind,x,y,p,dif,tmp;
while(scanf("%d",&n)==1)
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&p);
mind=1000000;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if((a[i]+a[j])==p)
{
dif=abs(a[i]-a[j]);
if(dif<mind)
{
mind=dif;
x=a[i];
y=a[j];
}
}
}
if(x>y)
{
tmp=x;
x=y;
y=tmp;
}
printf("Peter should buy books whose prices are %d and %d.\n\n",x,y);
}
return 0;
}
11150 - Cola
#include<stdio.h>
int main()
{
int n,a,b,sum,mod,flag;
while(scanf("%d",&n)==1)
{
sum=0;
flag=0;
while(n/3!=0 || (n%3 == 2 && flag == 0))
{
if(n%3==2 && flag==0)
{
n++;
flag=1;
}
a=n/3;
sum+=a*3;
n=n-(a*3)+a;
}
sum+=n;
if(flag==1) sum--;
printf("%d\n",sum);
}
return 0;
}
int main()
{
int n,a,b,sum,mod,flag;
while(scanf("%d",&n)==1)
{
sum=0;
flag=0;
while(n/3!=0 || (n%3 == 2 && flag == 0))
{
if(n%3==2 && flag==0)
{
n++;
flag=1;
}
a=n/3;
sum+=a*3;
n=n-(a*3)+a;
}
sum+=n;
if(flag==1) sum--;
printf("%d\n",sum);
}
return 0;
}
11152 - Colourful Flowers
#include<stdio.h>
#include<math.h>
int main()
{
double s,max,a,b,c,x,ic,cc,t,y;
while(scanf("%lf %lf %lf",&a,&b,&c)==3)
{
s=(a+b+c)/2;
t=sqrt(s*(s-a)*(s-b)*(s-c));
ic=3.141592653589793*pow((t/s),2);
x=t-ic;
cc=3.141592653589793*pow(((a*b*c)/(4*t)),2);
y=cc-(x+ic);
printf("%.4lf %.4lf %.4lf\n",y,x,ic);
}
return 0;
}
#include<math.h>
int main()
{
double s,max,a,b,c,x,ic,cc,t,y;
while(scanf("%lf %lf %lf",&a,&b,&c)==3)
{
s=(a+b+c)/2;
t=sqrt(s*(s-a)*(s-b)*(s-c));
ic=3.141592653589793*pow((t/s),2);
x=t-ic;
cc=3.141592653589793*pow(((a*b*c)/(4*t)),2);
y=cc-(x+ic);
printf("%.4lf %.4lf %.4lf\n",y,x,ic);
}
return 0;
}
11172 - Relational Operator
#include<stdio.h>
int main()
{
int n;
long long a,b;
scanf("%d",&n);
while(n--)
{
scanf("%lld %lld",&a,&b);
if(a>b)
printf("%c\n",62);
else if(a<b)
printf("%c\n",60);
else
printf("%c\n",61);
}
return 0;
}
int main()
{
int n;
long long a,b;
scanf("%d",&n);
while(n--)
{
scanf("%lld %lld",&a,&b);
if(a>b)
printf("%c\n",62);
else if(a<b)
printf("%c\n",60);
else
printf("%c\n",61);
}
return 0;
}
11185 - Ternary
#include<stdio.h>
void ternary(long long b,long long a);
int main()
{
long long b,a,j,i;
while(scanf("%lld",&b)==1 && b>=0)
{
if(b==0) printf("0");
else ternary(b,a);
printf("\n");
}
return 0;
}
void ternary(long long b,long long a)
{
if(b==0)
return;
a=b%3;
b=b/3;
ternary(b,a);
printf("%lld",a);
}
void ternary(long long b,long long a);
int main()
{
long long b,a,j,i;
while(scanf("%lld",&b)==1 && b>=0)
{
if(b==0) printf("0");
else ternary(b,a);
printf("\n");
}
return 0;
}
void ternary(long long b,long long a)
{
if(b==0)
return;
a=b%3;
b=b/3;
ternary(b,a);
printf("%lld",a);
}
11192 - Group Reverse
#include<stdio.h>
#include<string.h>
int main()
{
int n,i,j,l,m,a;
char c[100];
while(scanf("%d ",&n)==1)
{
if(n==0)
{
break;
}
else
{
gets(c);
l=strlen(c);
a=l/n;
m=0;
for(i=0;i<l;i++)
{
if((i+1)%a==0)
{
for(j=i;j>=m;j--)
{
printf("%c",c[j]);
}
m=i+1;
}
}
}
printf("\n");
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char line[102];
int i,j,grp,k,a,b,len,start,end;
while(scanf("%d\n",&grp)==1)
{
if(grp==0)break;
else
{
gets(line);
;
end=0;
len=strlen(line);
a=len/grp;
printf("%d %s\n",len,line);
for(i=0; i<len; i++)
{
if((i+1)%a==0)
{
end=i;
for(j=end; j>=start; j--)
{
printf("%c",line[j]);
}
start = end + 1 ;
}
}
}
printf("\n");
}
return 0;
}
#include<string.h>
int main()
{
int n,i,j,l,m,a;
char c[100];
while(scanf("%d ",&n)==1)
{
if(n==0)
{
break;
}
else
{
gets(c);
l=strlen(c);
a=l/n;
m=0;
for(i=0;i<l;i++)
{
if((i+1)%a==0)
{
for(j=i;j>=m;j--)
{
printf("%c",c[j]);
}
m=i+1;
}
}
}
printf("\n");
}
return 0;
}
Another Way :
#include<stdio.h>
#include<string.h>
int main()
{
char line[102];
int i,j,grp,k,a,b,len,start,end;
while(scanf("%d\n",&grp)==1)
{
if(grp==0)break;
else
{
gets(line);
;
end=0;
len=strlen(line);
a=len/grp;
printf("%d %s\n",len,line);
for(i=0; i<len; i++)
{
if((i+1)%a==0)
{
end=i;
for(j=end; j>=start; j--)
{
printf("%c",line[j]);
}
start = end + 1 ;
}
}
}
printf("\n");
}
return 0;
}
11332 - Summing Digits
#include<stdio.h>
#include<string.h>
int main()
{
int n,sum,i,j,l;
char c[100];
while(gets(c))
{
if(strcmp(c,"0")==0)
{
break;
}
l=strlen(c);
sum=0;
for(i=0;i<l;i++)
{
sum+=c[i]-48;
}
while(sum>9)
{
j=sum;
sum=0;
while(j>0)
{
sum+=j%10;
j=j/10;
}
}
printf("%d\n",sum);
}
return 0;
}
#include<string.h>
int main()
{
int n,sum,i,j,l;
char c[100];
while(gets(c))
{
if(strcmp(c,"0")==0)
{
break;
}
l=strlen(c);
sum=0;
for(i=0;i<l;i++)
{
sum+=c[i]-48;
}
while(sum>9)
{
j=sum;
sum=0;
while(j>0)
{
sum+=j%10;
j=j/10;
}
}
printf("%d\n",sum);
}
return 0;
}
11417 - GCD
#include <stdio.h>
int GCD(int a,int b);
int main()
{
int i,j,G,n;
while(scanf("%d",&n)==1)
{
if(n==0)
{
break;
}
else
{
G=0;
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
G+=GCD(i,j);
}
}
printf("%d\n", G);
}
}
return 0;
}
int GCD(int a,int b)
{
int c,i;
for(i=0; ; i++)
{
c=(a%b);
a=b;
b=c;
if(b==0)
{
return a;
}
}
}
int GCD(int a,int b);
int main()
{
int i,j,G,n;
while(scanf("%d",&n)==1)
{
if(n==0)
{
break;
}
else
{
G=0;
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
G+=GCD(i,j);
}
}
printf("%d\n", G);
}
}
return 0;
}
int GCD(int a,int b)
{
int c,i;
for(i=0; ; i++)
{
c=(a%b);
a=b;
b=c;
if(b==0)
{
return a;
}
}
}
11428 - Cubes
#include<stdio.h>
int main()
{
long int n,p,q,x;
int i,j,flag;
while(scanf("%ld",&n)==1 && n)
{
flag=0;
for(i=1; i<=100; i++)
{
p=i*i*i;
for(j=i+1; j<=100; j++)
{
q=j*j*j;
x=q-p;
if(x==n)
{
flag=1;
break;
}
if(x>n)
break;
}
if(flag==1)
break;
}
if(flag==1)
printf("%d %d\n",j,i);
else
printf("No solution\n");
}
return 0;
}
int main()
{
long int n,p,q,x;
int i,j,flag;
while(scanf("%ld",&n)==1 && n)
{
flag=0;
for(i=1; i<=100; i++)
{
p=i*i*i;
for(j=i+1; j<=100; j++)
{
q=j*j*j;
x=q-p;
if(x==n)
{
flag=1;
break;
}
if(x>n)
break;
}
if(flag==1)
break;
}
if(flag==1)
printf("%d %d\n",j,i);
else
printf("No solution\n");
}
return 0;
}
11455 - Behold My Quadrangle
#include<stdio.h>
#include<stdlib.h>
int sort(const void *a,const void *b);
int main()
{
int n;
long long a[4],mx;
scanf("%d",&n);
while(n--)
{
scanf("%lld %lld %lld %lld",&a[0],&a[1],&a[2],&a[3]);
qsort(a,4,sizeof(long long),sort);
if(a[0]==a[1] && a[1]==a[2] && a[2]==a[3])
{
printf("square\n");
continue;
}
if(a[0]-a[1]+a[2]-a[3]==0)
{
printf("rectangle\n");
continue;
}
if((a[1]+a[2]+a[3]<a[0]))
{
printf("banana\n");
continue;
}
else printf("quadrangle\n");
}
return 0;
}
int sort(const void *a,const void *b)
{
long long *c,*d;
c=(long long*)a;
d=(long long*)b;
return *d-*c;
}
#include<stdlib.h>
int sort(const void *a,const void *b);
int main()
{
int n;
long long a[4],mx;
scanf("%d",&n);
while(n--)
{
scanf("%lld %lld %lld %lld",&a[0],&a[1],&a[2],&a[3]);
qsort(a,4,sizeof(long long),sort);
if(a[0]==a[1] && a[1]==a[2] && a[2]==a[3])
{
printf("square\n");
continue;
}
if(a[0]-a[1]+a[2]-a[3]==0)
{
printf("rectangle\n");
continue;
}
if((a[1]+a[2]+a[3]<a[0]))
{
printf("banana\n");
continue;
}
else printf("quadrangle\n");
}
return 0;
}
int sort(const void *a,const void *b)
{
long long *c,*d;
c=(long long*)a;
d=(long long*)b;
return *d-*c;
}
11461 - Square Numbers
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,i,count;
while(scanf("%d %d",&a,&b)==2 &(a!=0 || b!=0))
{
count=0;
for(i=a;i<=b;i++)
if((int)sqrt(i)==sqrt(i))
count++;
printf("%d\n",count);
}
return 0;
}
#include<math.h>
int main()
{
int a,b,i,count;
while(scanf("%d %d",&a,&b)==2 &(a!=0 || b!=0))
{
count=0;
for(i=a;i<=b;i++)
if((int)sqrt(i)==sqrt(i))
count++;
printf("%d\n",count);
}
return 0;
}
11462 - Age Sort
#include<stdio.h>
#include<stdlib.h>
int arr[2000001];
int sort(const void *a,const void *b);
int main()
{
int n,i;
while(scanf("%d",&n)==1 && n!=0)
{
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
qsort((void*)arr,n,sizeof(int),sort);
for(i=0;i<n;i++)
{
printf("%d",arr[i]);
if(i!=n-1) printf(" ");
}
printf("\n");
}
return 0;
}
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*c-*d);
}
#include<stdlib.h>
int arr[2000001];
int sort(const void *a,const void *b);
int main()
{
int n,i;
while(scanf("%d",&n)==1 && n!=0)
{
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
qsort((void*)arr,n,sizeof(int),sort);
for(i=0;i<n;i++)
{
printf("%d",arr[i]);
if(i!=n-1) printf(" ");
}
printf("\n");
}
return 0;
}
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*c-*d);
}
11479 - Is this the easiest problem
#include<stdio.h>
#include<stdlib.h>
int sort(const void *a,const void *b);
int main()
{
long long a[3];
int n,flag,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
flag=0;
scanf("%lld %lld %lld",&a[0],&a[1],&a[2]);
qsort((void*)a,3,sizeof(long long),sort);
if(a[0]>=a[1]+a[2])
{
printf("Case %d: Invalid\n",i);
continue;
}
if(a[0]==a[1]) flag++;
if(a[1]==a[2]) flag++;
if(flag==0) printf("Case %d: Scalene\n",i);
else if(flag==1) printf("Case %d: Isosceles\n",i);
else printf("Case %d: Equilateral\n",i);
}
return 0;
}
int sort(const void *a,const void *b)
{
long long *c,*d;
c=(long long*)a;
d=(long long*)b;
return *d-*c;
}
#include<stdlib.h>
int sort(const void *a,const void *b);
int main()
{
long long a[3];
int n,flag,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
flag=0;
scanf("%lld %lld %lld",&a[0],&a[1],&a[2]);
qsort((void*)a,3,sizeof(long long),sort);
if(a[0]>=a[1]+a[2])
{
printf("Case %d: Invalid\n",i);
continue;
}
if(a[0]==a[1]) flag++;
if(a[1]==a[2]) flag++;
if(flag==0) printf("Case %d: Scalene\n",i);
else if(flag==1) printf("Case %d: Isosceles\n",i);
else printf("Case %d: Equilateral\n",i);
}
return 0;
}
int sort(const void *a,const void *b)
{
long long *c,*d;
c=(long long*)a;
d=(long long*)b;
return *d-*c;
}
11498 - Division Of Nlogona
#include<stdio.h>
int main()
{
long x1,y1,x,y;
long n,i;
while(scanf("%ld",&n)==1)
{
if(n==0)break;
scanf("%ld %ld",&x1,&y1);
for(i=1; i<=n; i++)
{
scanf("%ld %ld",&x,&y);
if(x==x1||y==y1)printf("divisa\n");
else if(x>x1&&y>y1) printf("NE\n");
else if(x<x1&&y>y1)printf("NO\n");
else if(x<x1&&y<y1) printf("SO\n");
else printf("SE\n");
}
}
return 0;
}
Another Way :
#include<stdio.h>
int main()
{
int n,x,y,ox,oy,ax,ay;
while(scanf("%d",&n)==1 && n)
{
scanf("%d %d",&ox,&oy);
while(n--)
{
scanf("%d %d",&x,&y);
if(x==ox || y==oy)
{
printf("divisa\n");
continue;
}
if(x>ox) ax=1;
else ax=-1;
if(y>oy) ay=1;
else ay=-1;
if(ax==1 && ay==1) printf("NE\n");
else if(ax==-1 && ay==1) printf("NO\n");
else if(ax==-1 && ay==-1) printf("SO\n");
else if(ax==1 && ay==-1) printf("SE\n");
}
}
return 0;
}
int main()
{
long x1,y1,x,y;
long n,i;
while(scanf("%ld",&n)==1)
{
if(n==0)break;
scanf("%ld %ld",&x1,&y1);
for(i=1; i<=n; i++)
{
scanf("%ld %ld",&x,&y);
if(x==x1||y==y1)printf("divisa\n");
else if(x>x1&&y>y1) printf("NE\n");
else if(x<x1&&y>y1)printf("NO\n");
else if(x<x1&&y<y1) printf("SO\n");
else printf("SE\n");
}
}
return 0;
}
Another Way :
#include<stdio.h>
int main()
{
int n,x,y,ox,oy,ax,ay;
while(scanf("%d",&n)==1 && n)
{
scanf("%d %d",&ox,&oy);
while(n--)
{
scanf("%d %d",&x,&y);
if(x==ox || y==oy)
{
printf("divisa\n");
continue;
}
if(x>ox) ax=1;
else ax=-1;
if(y>oy) ay=1;
else ay=-1;
if(ax==1 && ay==1) printf("NE\n");
else if(ax==-1 && ay==1) printf("NO\n");
else if(ax==-1 && ay==-1) printf("SO\n");
else if(ax==1 && ay==-1) printf("SE\n");
}
}
return 0;
}
11530 - SMS typing
#include<stdio.h>
#include<string.h>
int main()
{
char a[100];
int n,i,j,p,l;
while(scanf("%d",&n)==1)
{
for(j=0; j<=n; j++)
{
gets(a);
p=0;
l=strlen(a);
for(i=0; i<=l; i++)
{
if(a[i]==' '||a[i]=='a'||a[i]=='d'||a[i]=='g'||a[i]=='j'||a[i]=='m'||a[i]=='p'||a[i]=='t'||a[i]=='w')
p++;
else if(a[i]=='b'||a[i]=='e'||a[i]=='h'||a[i]=='k'||a[i]=='n'||a[i]=='q'||a[i]=='u'||a[i]=='x')
p+=2;
else if(a[i]=='c'||a[i]=='f'||a[i]=='i'||a[i]=='l'||a[i]=='o'||a[i]=='r'||a[i]=='v'||a[i]=='y')
p+=3;
else if(a[i]=='s'||a[i]=='z') p+=4;
}
if(j!=0) printf("Case #%d: %d\n",j,p);
}
}
return 0;
}
#include<string.h>
int main()
{
char a[100];
int n,i,j,p,l;
while(scanf("%d",&n)==1)
{
for(j=0; j<=n; j++)
{
gets(a);
p=0;
l=strlen(a);
for(i=0; i<=l; i++)
{
if(a[i]==' '||a[i]=='a'||a[i]=='d'||a[i]=='g'||a[i]=='j'||a[i]=='m'||a[i]=='p'||a[i]=='t'||a[i]=='w')
p++;
else if(a[i]=='b'||a[i]=='e'||a[i]=='h'||a[i]=='k'||a[i]=='n'||a[i]=='q'||a[i]=='u'||a[i]=='x')
p+=2;
else if(a[i]=='c'||a[i]=='f'||a[i]=='i'||a[i]=='l'||a[i]=='o'||a[i]=='r'||a[i]=='v'||a[i]=='y')
p+=3;
else if(a[i]=='s'||a[i]=='z') p+=4;
}
if(j!=0) printf("Case #%d: %d\n",j,p);
}
}
return 0;
}
11541 - Decoding
#include<stdio.h>
int main()
{
int n,a,i,j;
char c,ch,ch1;
scanf("%d",&n);
ch1=getchar();
for(i=1;i<=n;i++)
{
printf("Case %d: ",i);
while(1)
{
scanf("%c",&c);
if(c=='\n') break ;
scanf("%d",&a);
for(j=0;j<a;j++)
printf("%c",c);
}
printf("\n");
}
return 0;
}
int main()
{
int n,a,i,j;
char c,ch,ch1;
scanf("%d",&n);
ch1=getchar();
for(i=1;i<=n;i++)
{
printf("Case %d: ",i);
while(1)
{
scanf("%c",&c);
if(c=='\n') break ;
scanf("%d",&a);
for(j=0;j<a;j++)
printf("%c",c);
}
printf("\n");
}
return 0;
}
11547 - Automatic Answer
#include<stdio.h>
int main()
{
long a,t,n;
int i;
while(scanf("%ld",&t)==1)
{
for(i=1;i<=t;i++)
{
scanf("%ld",&n);
n=n*567;
n=n/9;
n+=7492;
n=n*235;
n=n/47;
n-=498;
n=n/10;
a=n%10;
if(a<0)
{
a=a*(-1);
}
printf("%ld\n",a);
}
}
return 0;
}
Another Way :
#include<stdio.h>
#include<stdlib.h>
int main()
{
long int n,a;
scanf("%ld",&n);
while(n--)
{
scanf("%ld",&a);
a=a*315+36962;
a=a/10;
a=a%10;
printf("%ld\n",abs(a));
}
return 0;
}
int main()
{
long a,t,n;
int i;
while(scanf("%ld",&t)==1)
{
for(i=1;i<=t;i++)
{
scanf("%ld",&n);
n=n*567;
n=n/9;
n+=7492;
n=n*235;
n=n/47;
n-=498;
n=n/10;
a=n%10;
if(a<0)
{
a=a*(-1);
}
printf("%ld\n",a);
}
}
return 0;
}
Another Way :
#include<stdio.h>
#include<stdlib.h>
int main()
{
long int n,a;
scanf("%ld",&n);
while(n--)
{
scanf("%ld",&a);
a=a*315+36962;
a=a/10;
a=a%10;
printf("%ld\n",abs(a));
}
return 0;
}
11614 - Etruscan Warriors never play Chess
#include<stdio.h>
#include<math.h>
int main()
{
float c,b,a,n;
scanf("%d",&n);
while(n--)
{
scanf("%f",&a);
c=sqrt(1+(4*2*a));
c=(c-1)/2;
printf("%d\n",(int)c);
}
return 0;
}
#include<math.h>
int main()
{
float c,b,a,n;
scanf("%d",&n);
while(n--)
{
scanf("%f",&a);
c=sqrt(1+(4*2*a));
c=(c-1)/2;
printf("%d\n",(int)c);
}
return 0;
}
11636 - hello world!
#include<stdio.h>
int main()
{
int n,i,count,sum,p=0;
while(scanf("%d",&n)==1)
{
if(n<=0)
{
break;
}
p++;
sum=1;
count=0;
if(n>1)
{
for(i=1;;i++)
{
sum=sum*2;
count++;
if(sum>=n)
{
break;
}
}
}
printf("Case %d: %d\n",p,count);
}
return 0;
}
Another Way :
#include<stdio.h>
#include<math.h>
int main()
{
int k,n,count=0;
while(scanf("%d",&k)==1 && k>0)
{
count++;
n=ceil(log10(k)/log10(2));
printf("Case %d: %d\n",count,n);
}
return 0;
}
int main()
{
int n,i,count,sum,p=0;
while(scanf("%d",&n)==1)
{
if(n<=0)
{
break;
}
p++;
sum=1;
count=0;
if(n>1)
{
for(i=1;;i++)
{
sum=sum*2;
count++;
if(sum>=n)
{
break;
}
}
}
printf("Case %d: %d\n",p,count);
}
return 0;
}
Another Way :
#include<stdio.h>
#include<math.h>
int main()
{
int k,n,count=0;
while(scanf("%d",&k)==1 && k>0)
{
count++;
n=ceil(log10(k)/log10(2));
printf("Case %d: %d\n",count,n);
}
return 0;
}
11646 - Athletics Track
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,t=1;double ang,x;
while(scanf("%d : %d",&a,&b)==2)
{
ang=acos((double)(a*a-b*b)/(a*a+b*b));
x=400/(2*a+ang*sqrt(a*a+b*b));
printf("Case %d: %.10f %.10f\n",t++,a*x,b*x);
}
return 0;
}
#include<math.h>
int main()
{
int a,b,t=1;double ang,x;
while(scanf("%d : %d",&a,&b)==2)
{
ang=acos((double)(a*a-b*b)/(a*a+b*b));
x=400/(2*a+ang*sqrt(a*a+b*b));
printf("Case %d: %.10f %.10f\n",t++,a*x,b*x);
}
return 0;
}
11650 - Mirror Clock
#include<stdio.h>
int main()
{
double t,h,m,i,j,f,hr,mr,hmi;
while(scanf("%lf",&t)==1)
{
while(t--)
{
scanf("%lf:%lf",&h,&m);
if(h>12)
{
f=h/12;
h-=12*f;
}
if(m==0)
{
mr=0;
if(h==12)
{
hr=12;
}
else
{
hr=12-h;
}
}
else
{
mr=60-m;
{
h=h+1;
if(h==13)
{
hr=11;
}
else
hr=12-h;
}
}
printf("%.0lf:%.0lf\n",hr,mr);
}
}
return 0;
}
Another Way :
#include <stdio.h>
#include <math.h>
int main()
{
double h,m,ah,am;
int i,hr,mr,t;
while(scanf("%d", &t)==1)
{
for(i=0;i<t;i++)
{
scanf("%lf:%lf", &h, &m);
if(h>=12)
h-=12;
ah=(h*30.0)+(m*0.5);
am=(m*6.0);
ah=360-ah;
am=360-am;
h=(ah/30.0);
m=(am/6.0);
hr=h;
mr=m;
if(hr==0)
hr=12;
if(mr==60)
{
mr=0;
}
if(mr<10 && hr<10)
printf("0%d:0%d\n", hr, mr);
else if(mr<10)
printf("%d:0%d\n", hr, mr);
else if(hr<10)
printf("0%d:%d\n", hr, mr);
else
printf("%d:%d\n", hr, mr);
}
}
return 0;
}
int main()
{
double t,h,m,i,j,f,hr,mr,hmi;
while(scanf("%lf",&t)==1)
{
while(t--)
{
scanf("%lf:%lf",&h,&m);
if(h>12)
{
f=h/12;
h-=12*f;
}
if(m==0)
{
mr=0;
if(h==12)
{
hr=12;
}
else
{
hr=12-h;
}
}
else
{
mr=60-m;
{
h=h+1;
if(h==13)
{
hr=11;
}
else
hr=12-h;
}
}
printf("%.0lf:%.0lf\n",hr,mr);
}
}
return 0;
}
Another Way :
#include <stdio.h>
#include <math.h>
int main()
{
double h,m,ah,am;
int i,hr,mr,t;
while(scanf("%d", &t)==1)
{
for(i=0;i<t;i++)
{
scanf("%lf:%lf", &h, &m);
if(h>=12)
h-=12;
ah=(h*30.0)+(m*0.5);
am=(m*6.0);
ah=360-ah;
am=360-am;
h=(ah/30.0);
m=(am/6.0);
hr=h;
mr=m;
if(hr==0)
hr=12;
if(mr==60)
{
mr=0;
}
if(mr<10 && hr<10)
printf("0%d:0%d\n", hr, mr);
else if(mr<10)
printf("%d:0%d\n", hr, mr);
else if(hr<10)
printf("0%d:%d\n", hr, mr);
else
printf("%d:%d\n", hr, mr);
}
}
return 0;
}
11689 - Soda Supplier
#include<stdio.h>
int main()
{
int n,e,f,c,s,d,b,a;
scanf("%d",&n);
while(n--)
{
scanf("%d %d %d",&e,&f,&c);
s=e+f;
b=0;
while(s>=c)
{
d=s/c;
a=s%c;
b+=d;
s=d+a;
if(c>s)
{
break;
}
}
printf("%d\n",b);
}
return 0;
}
int main()
{
int n,e,f,c,s,d,b,a;
scanf("%d",&n);
while(n--)
{
scanf("%d %d %d",&e,&f,&c);
s=e+f;
b=0;
while(s>=c)
{
d=s/c;
a=s%c;
b+=d;
s=d+a;
if(c>s)
{
break;
}
}
printf("%d\n",b);
}
return 0;
}
11713 - Abstract Names
#include<stdio.h>
#include<string.h>
int main()
{
int n,i,j,lena,lenb,flag;
char a[50],b[50],ch;
scanf("%d",&n);
ch=getchar();
while(n--)
{
flag=1;
scanf(" %s %s",a,b);
lena=strlen(a);
lenb=strlen(b);
if(lena!=lenb)
{
printf("No\n");
continue ;
}
for(i=0;i<lena;i++)
{
if(a[i]!='a' && a[i]!='e' && a[i]!='i' && a[i]!='o' && a[i]!='u')
if(a[i]!=b[i])
{
flag=0;
break ;
}
}
if(flag==1) printf("Yes\n");
else printf("No\n");
}
return 0;
}
#include<string.h>
int main()
{
int n,i,j,lena,lenb,flag;
char a[50],b[50],ch;
scanf("%d",&n);
ch=getchar();
while(n--)
{
flag=1;
scanf(" %s %s",a,b);
lena=strlen(a);
lenb=strlen(b);
if(lena!=lenb)
{
printf("No\n");
continue ;
}
for(i=0;i<lena;i++)
{
if(a[i]!='a' && a[i]!='e' && a[i]!='i' && a[i]!='o' && a[i]!='u')
if(a[i]!=b[i])
{
flag=0;
break ;
}
}
if(flag==1) printf("Yes\n");
else printf("No\n");
}
return 0;
}
11715 - Car
#include<stdio.h>
#include<math.h>
int main()
{
double u,v,t,a,s;
int n,i=1;
while(scanf("%d",&n)==1 && n!=0)
{
switch(n)
{
case 1:
scanf("%lf %lf %lf",&u,&v,&t);
a=(v-u)/t;
s=u*t+(a*t*t)/2;
printf("Case %d: %.3lf %.3lf\n",i,s,a);
break;
case 2:
scanf("%lf %lf %lf",&u,&v,&a);
t=(v-u)/a;
s=u*t+(a*t*t)/2;
printf("Case %d: %.3lf %.3lf\n",i,s,t);
break;
case 3:
scanf("%lf %lf %lf",&u,&a,&s);
v=sqrt((u*u)+2*a*s);
t=(v-u)/a;
printf("Case %d: %.3lf %.3lf\n",i,v,t);
break;
case 4:
scanf("%lf %lf %lf",&v,&a,&s);
u=sqrt((v*v)-2*a*s);
t=(v-u)/a;
printf("Case %d: %.3lf %.3lf\n",i,u,t);
break;
}
i++;
}
return 0;
}
#include<math.h>
int main()
{
double u,v,t,a,s;
int n,i=1;
while(scanf("%d",&n)==1 && n!=0)
{
switch(n)
{
case 1:
scanf("%lf %lf %lf",&u,&v,&t);
a=(v-u)/t;
s=u*t+(a*t*t)/2;
printf("Case %d: %.3lf %.3lf\n",i,s,a);
break;
case 2:
scanf("%lf %lf %lf",&u,&v,&a);
t=(v-u)/a;
s=u*t+(a*t*t)/2;
printf("Case %d: %.3lf %.3lf\n",i,s,t);
break;
case 3:
scanf("%lf %lf %lf",&u,&a,&s);
v=sqrt((u*u)+2*a*s);
t=(v-u)/a;
printf("Case %d: %.3lf %.3lf\n",i,v,t);
break;
case 4:
scanf("%lf %lf %lf",&v,&a,&s);
u=sqrt((v*v)-2*a*s);
t=(v-u)/a;
printf("Case %d: %.3lf %.3lf\n",i,u,t);
break;
}
i++;
}
return 0;
}
11716 - Digital Fortress
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
char a[10001];
long long n,i,j,len,p,l;
while(scanf("%lld ",&n)==1)
{
while(n--)
{
gets(a);
l=strlen(a);
p=sqrt(l);
if(p*p!=l)
{
printf("INVALID\n");
}
else
{
for(i=0;i<p;i++)
{
for(j=i;j<l;j+=p)
{
printf("%c",a[j]);
}
}
printf("\n");
}
}
}
return 0;
}
#include<math.h>
#include<string.h>
int main()
{
char a[10001];
long long n,i,j,len,p,l;
while(scanf("%lld ",&n)==1)
{
while(n--)
{
gets(a);
l=strlen(a);
p=sqrt(l);
if(p*p!=l)
{
printf("INVALID\n");
}
else
{
for(i=0;i<p;i++)
{
for(j=i;j<l;j+=p)
{
printf("%c",a[j]);
}
}
printf("\n");
}
}
}
return 0;
}
11723 - Numbering Roads
#include<stdio.h>
#include<math.h>
int main()
{
int count=0,a;
double r,n,ans;
while(scanf("%lf %lf",&r,&n)==2 && n!=0 && r!=0)
{
count++;
if(r>(n+n*26))
{
printf("Case %d: impossible\n",count);
continue;
}
else
{
ans=ceil((r-n)/n);
a=ans;
printf("Case %d: %d\n",count,a);
}
}
return 0;
}
#include<math.h>
int main()
{
int count=0,a;
double r,n,ans;
while(scanf("%lf %lf",&r,&n)==2 && n!=0 && r!=0)
{
count++;
if(r>(n+n*26))
{
printf("Case %d: impossible\n",count);
continue;
}
else
{
ans=ceil((r-n)/n);
a=ans;
printf("Case %d: %d\n",count,a);
}
}
return 0;
}
11727 - Cost Cutting
#include<stdio.h>
int main()
{
long t,i,a,b,c;
while(scanf("%ld",&t)==1)
{
for(i=1; i<=t; i++)
{
scanf("%ld %ld %ld",&a,&b,&c);
if((a>b && a<c)||a<b && a>c)
{
printf("Case %ld: %ld\n",i,a);
}
else if((b>a && b<c)||(b<a && b>c))
{
printf("Case %ld: %ld\n",i,b);
}
else
{
printf("Case %ld: %ld\n",i,c);
}
}
}
return 0;
}
int main()
{
long t,i,a,b,c;
while(scanf("%ld",&t)==1)
{
for(i=1; i<=t; i++)
{
scanf("%ld %ld %ld",&a,&b,&c);
if((a>b && a<c)||a<b && a>c)
{
printf("Case %ld: %ld\n",i,a);
}
else if((b>a && b<c)||(b<a && b>c))
{
printf("Case %ld: %ld\n",i,b);
}
else
{
printf("Case %ld: %ld\n",i,c);
}
}
}
return 0;
}
11734 - Big Number of Teams will Solve this
#include<stdio.h>
#include<string.h>
int main()
{
int n,i,j,k,len;
char a[50],b[50],c[50],ch;
scanf("%d",&n);
ch=getchar();
for(i=1;i<=n;i++)
{
k=0;
gets(a);
gets(b);
len=strlen(a);
if(strcmp(a,b)==0)
{
printf("Case %d: Yes\n",i);
continue ;
}
for(j=0;j<len;j++)
{
if((a[j]>='a'&& a[j]<='z') || (a[j]>='A' && a[j]<='Z'))
{
c[k]=a[j];
k++;
}
}
c[k]='\0';
if(strcmp(b,c)==0) printf("Case %d: Output Format Error\n",i);
else printf("Case %d: Wrong Answer\n",i);
}
return 0;
}
#include<string.h>
int main()
{
int n,i,j,k,len;
char a[50],b[50],c[50],ch;
scanf("%d",&n);
ch=getchar();
for(i=1;i<=n;i++)
{
k=0;
gets(a);
gets(b);
len=strlen(a);
if(strcmp(a,b)==0)
{
printf("Case %d: Yes\n",i);
continue ;
}
for(j=0;j<len;j++)
{
if((a[j]>='a'&& a[j]<='z') || (a[j]>='A' && a[j]<='Z'))
{
c[k]=a[j];
k++;
}
}
c[k]='\0';
if(strcmp(b,c)==0) printf("Case %d: Output Format Error\n",i);
else printf("Case %d: Wrong Answer\n",i);
}
return 0;
}
11764 - Jumping Mario
#include<stdio.h>
int main()
{
int f,n,w[60],i,j,t,s;
scanf("%d",&f);
for(i=1;i<=f;i++)
{
t=0,s=0;
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&w[j]);
for(j=0;j<n-1;j++)
{
if(w[j]>w[j+1]) s++;
else if(w[j]<w[j+1]) t++;
}
printf("Case %d: %d %d\n",i,t,s);
}
return 0;
}
int main()
{
int f,n,w[60],i,j,t,s;
scanf("%d",&f);
for(i=1;i<=f;i++)
{
t=0,s=0;
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&w[j]);
for(j=0;j<n-1;j++)
{
if(w[j]>w[j+1]) s++;
else if(w[j]<w[j+1]) t++;
}
printf("Case %d: %d %d\n",i,t,s);
}
return 0;
}
11799 - Horror Dash
#include<stdio.h>
#include<stdlib.h>
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*d-*c);
}
int main()
{
int n,c,a[11000],i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&c);
for(j=0;j<c;j++)
scanf("%d",&a[j]);
qsort((void*)a,c,sizeof(int),sort);
printf("Case %d: %d\n",i,a[0]);
}
return 0;
}
#include<stdlib.h>
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*d-*c);
}
int main()
{
int n,c,a[11000],i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&c);
for(j=0;j<c;j++)
scanf("%d",&a[j]);
qsort((void*)a,c,sizeof(int),sort);
printf("Case %d: %d\n",i,a[0]);
}
return 0;
}
11805 - Bafana Bafana
#include<stdio.h>
int main()
{
int n,N,K,P,a,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d %d %d",&N,&K,&P);
a=(K+P)%N;
if(a==0) a=N;
printf("Case %d: %d\n",i,a);
}
return 0;
}
int main()
{
int n,N,K,P,a,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d %d %d",&N,&K,&P);
a=(K+P)%N;
if(a==0) a=N;
printf("Case %d: %d\n",i,a);
}
return 0;
}
11827 - Maximum GCD
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int GCD(int a,int b)
{
int c;
while(1)
{
if(a%b==0)
return b;
c=a%b;
a=b;
b=c;
}
}
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*d-*d);
}
int main()
{
char s[100000],ch;
int a[150],n,i,j,len,p,x,v,maxgcd,gcd;
scanf("%d",&n);
ch=getchar();
while(n--)
{
for(i=0;i<150;i++)
a[i]=0;
x=-1;
gets(s);
len=strlen(s);
for(i=len-1;i>=0;i--)
{
if(s[i]>='0' && s[i]<='9')
{
x++;
p=0;
while(i>=0)
{
if(s[i]==' ') break ;
v=s[i]-'0';
a[x]+=v*pow(10,p);
p++;
i--;
}
}
}
qsort(a,x,sizeof(int),sort);
maxgcd=0;
for(i=0;i<x;i++)
for(j=i+1;j<=x;j++)
{
gcd=GCD(a[i],a[j]);
if(gcd>maxgcd) maxgcd=gcd;
}
printf("%d\n",maxgcd);
}
return 0;
}
#include<string.h>
#include<math.h>
#include<stdlib.h>
int GCD(int a,int b)
{
int c;
while(1)
{
if(a%b==0)
return b;
c=a%b;
a=b;
b=c;
}
}
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return (*d-*d);
}
int main()
{
char s[100000],ch;
int a[150],n,i,j,len,p,x,v,maxgcd,gcd;
scanf("%d",&n);
ch=getchar();
while(n--)
{
for(i=0;i<150;i++)
a[i]=0;
x=-1;
gets(s);
len=strlen(s);
for(i=len-1;i>=0;i--)
{
if(s[i]>='0' && s[i]<='9')
{
x++;
p=0;
while(i>=0)
{
if(s[i]==' ') break ;
v=s[i]-'0';
a[x]+=v*pow(10,p);
p++;
i--;
}
}
}
qsort(a,x,sizeof(int),sort);
maxgcd=0;
for(i=0;i<x;i++)
for(j=i+1;j<=x;j++)
{
gcd=GCD(a[i],a[j]);
if(gcd>maxgcd) maxgcd=gcd;
}
printf("%d\n",maxgcd);
}
return 0;
}
11854 - Egypt
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int sort(const void* a,const void* b);
int main()
{
int a[3];
while(scanf("%d %d %d",&a[0],&a[1],&a[2])==3 && (a[0]!=0 || a[1]!=0 || a[2]!=0))
{
qsort((void*)a,3,sizeof(int),sort);
if(sqrt((a[1]*a[1])+(a[2]*a[2]))==a[0]) printf("right\n");
else printf("wrong\n");
}
return 0;
}
int sort(const void* a,const void* b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return *d-*c;
}
#include<stdlib.h>
#include<math.h>
int sort(const void* a,const void* b);
int main()
{
int a[3];
while(scanf("%d %d %d",&a[0],&a[1],&a[2])==3 && (a[0]!=0 || a[1]!=0 || a[2]!=0))
{
qsort((void*)a,3,sizeof(int),sort);
if(sqrt((a[1]*a[1])+(a[2]*a[2]))==a[0]) printf("right\n");
else printf("wrong\n");
}
return 0;
}
int sort(const void* a,const void* b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return *d-*c;
}
11875 - Brick Game
#include<stdio.h>
#include<stdlib.h>
int sort (const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return *c-*d;
}
int main()
{
int a[20],b,n,i,j;
while(scanf("%d",&n)==1)
{
for(i=1;i<=n;i++)
{
scanf("%d",&b);
for(j=0;j<b;j++)
{
scanf("%d",&a[j]);
}
qsort(a,b,sizeof(int),sort);
printf("Case %d: %d\n",i,a[b/2]);
}
}
return 0;
}
Another Way :
#include<stdio.h>
#include<math.h>
int main()
{
int n,a,arr[25],i,j,r;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a);
for(j=0;j<a;j++)
scanf("%d",&arr[j]);
r=ceil(a/2);
printf("Case %d: %d\n",i,arr[r]);
}
return 0;
}
#include<stdlib.h>
int sort (const void *a,const void *b)
{
int *c,*d;
c=(int*)a;
d=(int*)b;
return *c-*d;
}
int main()
{
int a[20],b,n,i,j;
while(scanf("%d",&n)==1)
{
for(i=1;i<=n;i++)
{
scanf("%d",&b);
for(j=0;j<b;j++)
{
scanf("%d",&a[j]);
}
qsort(a,b,sizeof(int),sort);
printf("Case %d: %d\n",i,a[b/2]);
}
}
return 0;
}
Another Way :
#include<stdio.h>
#include<math.h>
int main()
{
int n,a,arr[25],i,j,r;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a);
for(j=0;j<a;j++)
scanf("%d",&arr[j]);
r=ceil(a/2);
printf("Case %d: %d\n",i,arr[r]);
}
return 0;
}
11877 - the Coco Cola Store
#include<stdio.h>
int main()
{
int n,a,b,sum,mod,flag;
while(scanf("%d",&n)==1 && n)
{
sum=0;
while(n>=3)
{
a=n/3;
sum=sum+a;
n=n%3+a;
}
if(n==2) sum++;
printf("%d\n",sum);
}
return 0;
}
int main()
{
int n,a,b,sum,mod,flag;
while(scanf("%d",&n)==1 && n)
{
sum=0;
while(n>=3)
{
a=n/3;
sum=sum+a;
n=n%3+a;
}
if(n==2) sum++;
printf("%d\n",sum);
}
return 0;
}
11879 - Multiple of 17
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
char num[10000];
long long n,i,j,len,odd,even,a;
while(gets(num))
{
odd=0,even=0;
len=strlen(num);
if(len==1 && num[0]=='0') return 0;
for(i=0;i<len;i+=2)
odd+=num[i]-'0';
for(i=1;i<len;i+=2)
even+=num[i]-'0';
a=abs(odd-even);
if(a%17==0) printf("1\n");
else printf("0\n",num);
}
return 0;
}
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
char num[10000];
long long n,i,j,len,odd,even,a;
while(gets(num))
{
odd=0,even=0;
len=strlen(num);
if(len==1 && num[0]=='0') return 0;
for(i=0;i<len;i+=2)
odd+=num[i]-'0';
for(i=1;i<len;i+=2)
even+=num[i]-'0';
a=abs(odd-even);
if(a%17==0) printf("1\n");
else printf("0\n",num);
}
return 0;
}
11900 - Boiled Eggs
#include<stdio.h>
#include<stdlib.h>
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int *)a;
d=(int *)b;
return *c-*d;
}
int main()
{
int t,n,p,q,a[50],c,d,i,j,u;
while(scanf("%d",&t)==1)
{
for(j=1;j<=t;j++)
{
scanf("%d %d %d",&n,&p,&q);
u=0;
c=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
qsort(a,n,sizeof(int),sort);
for(i=0;i<n;i++)
{
u+=a[i];
}
d=a[0];
if(u<=q&&n<=p)
c=1;
for(i=1;i<n;i++)
{
if(d<=q && c<=p)
{
c++;
d+=a[i];
}
else
break;
}
printf("Case %d: %d\n",j,c);
}
}
return 0;
}
Another Way :
#include<stdio.h>
int main()
{
int n,p,q,t,cs=0,cnt,i;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&p,&q);
int wt[35];
for(cnt=0; cnt<n; cnt++)
scanf("%d",&wt[cnt]);
cnt=0;
i=0;
while(n--&&p>0)
{
q-=wt[i];
if(q<0)
break;
cnt++;
p--;
i++;
}
printf("Case %d: %d\n",++cs,cnt);
}
return 0;
}
#include<stdlib.h>
int sort(const void *a,const void *b)
{
int *c,*d;
c=(int *)a;
d=(int *)b;
return *c-*d;
}
int main()
{
int t,n,p,q,a[50],c,d,i,j,u;
while(scanf("%d",&t)==1)
{
for(j=1;j<=t;j++)
{
scanf("%d %d %d",&n,&p,&q);
u=0;
c=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
qsort(a,n,sizeof(int),sort);
for(i=0;i<n;i++)
{
u+=a[i];
}
d=a[0];
if(u<=q&&n<=p)
c=1;
for(i=1;i<n;i++)
{
if(d<=q && c<=p)
{
c++;
d+=a[i];
}
else
break;
}
printf("Case %d: %d\n",j,c);
}
}
return 0;
}
Another Way :
#include<stdio.h>
int main()
{
int n,p,q,t,cs=0,cnt,i;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&p,&q);
int wt[35];
for(cnt=0; cnt<n; cnt++)
scanf("%d",&wt[cnt]);
cnt=0;
i=0;
while(n--&&p>0)
{
q-=wt[i];
if(q<0)
break;
cnt++;
p--;
i++;
}
printf("Case %d: %d\n",++cs,cnt);
}
return 0;
}
11917 - Do Your own Homework
#include<stdio.h>
#include<string.h>
typedef struct
{
char sub[40];
int day;
}subject;
int main()
{
subject arr[200];
int tn,sn,D,i,j;
char sub1[40];
scanf("%d",&tn);
for(i=1;i<=tn;i++)
{
scanf("%d",&sn);
for(j=0;j<sn;j++)
scanf("%s %d",arr[j].sub,&arr[j].day);
scanf("%d",&D);
scanf("%s",sub1);
for(j=0;j<sn;j++)
if(strcmp(arr[j].sub,sub1)==0)
break;
if(j>=sn) printf("Case %d: Do your own homework!\n",i);
else if(arr[j].day<=D) printf("Case %d: Yesss\n",i);
else if(arr[j].day>D && arr[j].day<=(D+5)) printf("Case %d: Late\n",i);
else if (arr[j].day>(D+5)) printf("Case %d: Do your own homework!\n",i);
}
return 0;
}
#include<string.h>
typedef struct
{
char sub[40];
int day;
}subject;
int main()
{
subject arr[200];
int tn,sn,D,i,j;
char sub1[40];
scanf("%d",&tn);
for(i=1;i<=tn;i++)
{
scanf("%d",&sn);
for(j=0;j<sn;j++)
scanf("%s %d",arr[j].sub,&arr[j].day);
scanf("%d",&D);
scanf("%s",sub1);
for(j=0;j<sn;j++)
if(strcmp(arr[j].sub,sub1)==0)
break;
if(j>=sn) printf("Case %d: Do your own homework!\n",i);
else if(arr[j].day<=D) printf("Case %d: Yesss\n",i);
else if(arr[j].day>D && arr[j].day<=(D+5)) printf("Case %d: Late\n",i);
else if (arr[j].day>(D+5)) printf("Case %d: Do your own homework!\n",i);
}
return 0;
}
11934 - Magic Formula
#include<stdio.h>
int main()
{
long long a,b,c,d,l,r,i,count;
while(scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&l)==5)
{
count=0;
if(a==0 && b==0 && c==0 && d==0 && l==0) break ;
for(i=0;i<=l;i++)
{
r=(a*i*i)+b*i+c;
if(r%d==0) count++;
}
printf("%lld\n",count);
}
return 0;
}
int main()
{
long long a,b,c,d,l,r,i,count;
while(scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&l)==5)
{
count=0;
if(a==0 && b==0 && c==0 && d==0 && l==0) break ;
for(i=0;i<=l;i++)
{
r=(a*i*i)+b*i+c;
if(r%d==0) count++;
}
printf("%lld\n",count);
}
return 0;
}
11936 - The Lazy Lumberjacks
#include<stdio.h>
int a[3];
void sort(void)
{
int i,j,tmp;
for(i=0; i<3-1; i++)
for(j=i+1; j<3; j++)
if(a[i]<a[j])
{
tmp=a[i];
a[i]=a[j];
a[j]=tmp;
}
return ;
}
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
scanf("%d %d %d",&a[0],&a[1],&a[2]);
sort();
if(a[1]+a[2]>a[0]) printf("OK\n");
else printf("Wrong!!\n");
}
return 0;
}
int a[3];
void sort(void)
{
int i,j,tmp;
for(i=0; i<3-1; i++)
for(j=i+1; j<3; j++)
if(a[i]<a[j])
{
tmp=a[i];
a[i]=a[j];
a[j]=tmp;
}
return ;
}
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
scanf("%d %d %d",&a[0],&a[1],&a[2]);
sort();
if(a[1]+a[2]>a[0]) printf("OK\n");
else printf("Wrong!!\n");
}
return 0;
}
11984 - A Change in Thermal Unit
#include<stdio.h>
int main()
{
int n,i;
double c,f,fc,nf,nc;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%lf %lf",&c,&f);
fc=(9*c/5)+32;
nf=f+fc;
nc=(nf-32)*5/9;
printf("Case %d: %.2lf\n",i,nc);
}
return 0;
}
int main()
{
int n,i;
double c,f,fc,nf,nc;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%lf %lf",&c,&f);
fc=(9*c/5)+32;
nf=f+fc;
nc=(nf-32)*5/9;
printf("Case %d: %.2lf\n",i,nc);
}
return 0;
}
12015 - google is Feeling Lucky
#include<stdio.h>
#include<stdlib.h>
typedef struct
{
char web[150];
int rel;
} google;
void sort(google webp[])
{
int i,j;
google tmp;
for(i=0; i<9; i++)
for(j=i+1; j<10; j++)
if(webp[i].rel<webp[j].rel)
{
tmp=webp[i];
webp[i]=webp[j];
webp[j]=tmp;
}
}
int main()
{
int i,j,n;
char ch;
google webp[10];
scanf("%d",&n);
ch=getchar();
for(i=1; i<=n; i++)
{
for(j=0; j<10; j++)
{
scanf("%s",webp[j].web);
scanf("%d",&webp[j].rel);
ch=getchar();
}
sort(webp);
printf("Case #%d:\n",i);
for(j=0; j<10; j++)
{
if(webp[j].rel!=webp[0].rel) break ;
printf("%s\n",webp[j].web);
}
}
return 0;
}
#include<stdlib.h>
typedef struct
{
char web[150];
int rel;
} google;
void sort(google webp[])
{
int i,j;
google tmp;
for(i=0; i<9; i++)
for(j=i+1; j<10; j++)
if(webp[i].rel<webp[j].rel)
{
tmp=webp[i];
webp[i]=webp[j];
webp[j]=tmp;
}
}
int main()
{
int i,j,n;
char ch;
google webp[10];
scanf("%d",&n);
ch=getchar();
for(i=1; i<=n; i++)
{
for(j=0; j<10; j++)
{
scanf("%s",webp[j].web);
scanf("%d",&webp[j].rel);
ch=getchar();
}
sort(webp);
printf("Case #%d:\n",i);
for(j=0; j<10; j++)
{
if(webp[j].rel!=webp[0].rel) break ;
printf("%s\n",webp[j].web);
}
}
return 0;
}
12157 - Tarrif Plan
#include<stdio.h>
int main()
{
int n,f,arr[25],i,c=0,ju,mi,j,m;
scanf("%d",&f);
while(f--)
{
ju=0;
mi=0;
c++;
scanf("%d",&n);
for(i=0; i<n; i++)
scanf("%d",&arr[i]);
for(i=0; i<n; i++)
{
j=(arr[i]/60)+1;
ju+=15*j;
}
for(i=0; i<n; i++)
{
m=(arr[i]/30)+1;
mi+=10*m;
}
if(mi<ju) printf("Case %d: Mile %d\n",c,mi);
else if(ju<mi) printf("Case %d: Juice %d\n",c,ju);
else if(mi==ju) printf("Case %d: Mile Juice %d\n",c,mi);
}
return 0;
}
int main()
{
int n,f,arr[25],i,c=0,ju,mi,j,m;
scanf("%d",&f);
while(f--)
{
ju=0;
mi=0;
c++;
scanf("%d",&n);
for(i=0; i<n; i++)
scanf("%d",&arr[i]);
for(i=0; i<n; i++)
{
j=(arr[i]/60)+1;
ju+=15*j;
}
for(i=0; i<n; i++)
{
m=(arr[i]/30)+1;
mi+=10*m;
}
if(mi<ju) printf("Case %d: Mile %d\n",c,mi);
else if(ju<mi) printf("Case %d: Juice %d\n",c,ju);
else if(mi==ju) printf("Case %d: Mile Juice %d\n",c,mi);
}
return 0;
}
12250 - Language Detection
#include<stdio.h>
#include<string.h>
int main()
{
char a[50];
int i=0;
while(scanf("%s",a)==1)
{
if(strcmp(a,"#")==0) break;
else if(strcmp(a,"HELLO")==0)
{
printf("Case %d: ENGLISH\n",++i);
}
else if(strcmp(a,"HOLA")==0)
{
printf("Case %d: SPANISH\n",++i);
}
else if(strcmp(a,"HALLO")==0)
{
printf("Case %d: GERMAN\n",++i);
}
else if(strcmp(a,"BONJOUR")==0)
{
printf("Case %d: FRENCH\n",++i);
}
else if(strcmp(a,"CIAO")==0)
{
printf("Case %d: ITALIAN\n",++i);
}
else if(strcmp(a,"ZDRAVSTVUJTE")==0)
{
printf("Case %d: RUSSIAN\n",++i);
}
else printf("Case %d: UNKNOWN\n",++i);
}
return 0;
}
#include<string.h>
int main()
{
char a[50];
int i=0;
while(scanf("%s",a)==1)
{
if(strcmp(a,"#")==0) break;
else if(strcmp(a,"HELLO")==0)
{
printf("Case %d: ENGLISH\n",++i);
}
else if(strcmp(a,"HOLA")==0)
{
printf("Case %d: SPANISH\n",++i);
}
else if(strcmp(a,"HALLO")==0)
{
printf("Case %d: GERMAN\n",++i);
}
else if(strcmp(a,"BONJOUR")==0)
{
printf("Case %d: FRENCH\n",++i);
}
else if(strcmp(a,"CIAO")==0)
{
printf("Case %d: ITALIAN\n",++i);
}
else if(strcmp(a,"ZDRAVSTVUJTE")==0)
{
printf("Case %d: RUSSIAN\n",++i);
}
else printf("Case %d: UNKNOWN\n",++i);
}
return 0;
}
12289 - One Two Three
#include<stdio.h>
#include<string.h>
int main()
{
int n,len,c,i;
char ch,a[10],d[10][10]= {"zero","one","two","three","four","five","six","seven","eight","nine"};
scanf("%d",&n);
ch=getchar();
while(n--)
{
c=0;
gets(a);
len=strlen(a);
if(len==5)
{
printf("3\n");
continue ;
}
else
{
if(a[0]=='o') c++;
if(a[1]=='n') c++;
if(a[2]=='e') c++;
}
if(c>=2) printf("1\n");
else printf("2\n");
}
return 0;
}
#include<string.h>
int main()
{
int n,len,c,i;
char ch,a[10],d[10][10]= {"zero","one","two","three","four","five","six","seven","eight","nine"};
scanf("%d",&n);
ch=getchar();
while(n--)
{
c=0;
gets(a);
len=strlen(a);
if(len==5)
{
printf("3\n");
continue ;
}
else
{
if(a[0]=='o') c++;
if(a[1]=='n') c++;
if(a[2]=='e') c++;
}
if(c>=2) printf("1\n");
else printf("2\n");
}
return 0;
}