1015 – Brush (I):

#include
int main()
{
int sum,n,t,i,j,k,m;
scanf(“%d”,&t);
for(i=1;i<=t;i++)
{
scanf(“%d”,&n);
sum=0;
for(j=1;j<=n;j++) { scanf(“%d”,&m); if(m>0)
sum+=m;
}
printf(“Case %d: %d\n”,i,sum);
}
return 0;
}

 

 

 

1022 – Circle in Square

#include<stdio.h>
#include<math.h>
int main()
{
int n,i;
double result,add1,add2,a;
scanf(“%d”,&n);
for(i=1;i<=n;i++)
{
scanf(“%lf”,&a);
add1=4*(a*a);
add2=2*acos(0.0)*a*a;
result=add1-add2;
printf(“Case %d: %.2lf\n”,i,result);
}
}

1189 – Sum of Factorials:

 

#include<iostream>
using namespace std;
int main()
{
long long ar[]= {1,1,2,6,24,120,720,5040,40320,362880,
3628800,39916800,479001600,6227020800,
87178291200,1307674368000,20922789888000,
355687428096000,6402373705728000,121645100408832000};
long long i,j=1,t;
cin>>t;
while(j<=t)
{
long long n;
cin>>n;
int arry[200];
long long count=0,sum=0;
for(i=19; i>=0; i–)
{
//cout<<sum;
if(sum==n)
break;
else if(sum<n)
{
sum+=ar[i];
if(sum<=n)
{

arry[count]=i;
count++;
}
else
sum=sum-ar[i];
}

}
cout<<“Case “<<j<<“: “;
if(sum==n)
{
for(int k=count-1; k>0; k–)
{
cout<<arry[k]<<“!+”;
}
cout<<arry[0]<<“!”<<“\n”;
}
else
cout<<“impossible”<<“\n”;

j++;
}

}

 

 

1053 – Higher Math:

 

 

#include<stdio.h>
int main()
{
long a,b,c,temp1,temp2;
int i,n;
scanf(“%d”,&n);
for(i=1;i<=n;i++)
{
scanf(“%ld%ld%ld”,&a,&b,&c);
if((a>b )&&(a>c))
{
temp1=(c*c)+(b*b);
temp2=(a*a);
}
else
if((b>a)&&(b>c))
{
temp1=(a*a)+(c*c);
temp2=(b*b);
}
else
if((c>a)&&(c>b))
{
temp1=(a*a)+(b*b);
temp2=(c*c);
}
if(temp1==temp2)
printf(“Case %d: yes\n”,i);
else
printf(“Case %d: no\n”,i);
}
return 0;
}

 

1305 – Area of a Parallelogram:

#include<stdio.h>
int main()
{
int i,n;
long long Ax,Ay,Bx,By,Cx,Cy,Dx,Dy,area;
scanf(“%d”,&n);
for(i=1;i<=n;i++)
{
scanf(“%lld%lld%lld%lld%lld%lld”,&Ax,&Ay,&Bx,&By,&Cx,&Cy);
Dx=Ax+Cx-Bx;
Dy=Ay+Cy-By;
area=0.5*((Ax*By)+(Bx*Cy)+(Cx*Dy)+(Dx*Ay)-(Bx*Ay)-(Cx*By)-(Dx*Cy)-(Ax*Dy));
if(area<0)
area=area*(-1);
printf(“Case %d: %lld %lld %d\n”,i,Dx,Dy,area);
}
}

 

1216 – Juice in the Glass:

 

 

#include<stdio.h>
#include<math.h>
#define PI acos(-1.0)
int main()
{

int i,n,r1,r2,h,p;
double R,V;
scanf(“%d”,&n);
for(i=1;i<=n;i++)
{
scanf(“%d%d%d%d”,&r1,&r2,&h,&p);
R= r2 + (r1-r2)*(double(p)/h);
V = (1/3.0) * PI * p *( R*R + R*r2 + r2*r2 );
printf(“Case %d: %.9lf\n”,i,V);
}
return 0;
}

 

1182 – Parity:

 

 

1. #include<stdio.h>
   int main()
   {
   int a,n,c[10000],i,sum,m,z;
   while((scanf(“%d”,&m))==1)
   {
   for(z=1;z<=m;z++)
   {
   scanf(“%d”,&n);
   sum=0;
   for(i=0;n>0;i++)
   {
   c[i]=n%2;
   n=n/2;
   sum=sum+c[i];
   }
   if(sum%2==0)
   printf(“Case %d: even\n”,z);
   else
   printf(“Case %d: odd\n”,z);
   }
   }
   return 0;
   }

1069 – Lift:

 

#include<stdio.h>
int main()
{
int a,b,n,i,c,d,e;
scanf(“%d”,&n);
for(i=1;i<=n;i++)
{
scanf(“%d%d”,&a,&b);
if(b>a)
{
c=((b-a)*4);
d=(a*4);
e=c+d+19;
}
else if(b<a)
{
c=((a-b)*4);
d=(a*4);
e=c+d+19;
}
else
{
d=(b*4);
e=d+19;
}
printf(“Case %d: %d\n”,i,e);
}
return 0;
}

Problem: http://www.lightoj.com/volume_showproblem.php?problem=1014

Solution:

#include<stdio.h>
#include<iostream>
#include<set>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
int test,n,p,l,i,j,t;
cin>>test;
for(j=1; j<=test; j++)
{
cin>>p>>l;
set<int>s;
n=p-l;
t=sqrt(n);
cout<<“Case “<<j<<“:”;
if(n<=l)
{
cout<<” impossible”<<endl;
}
else
{
for( i=1; i<=t; i++)
{
if(n%i==0)
{
s.insert(i);
s.insert(n/i);
}
}
set<int> :: iterator it;
for(it=s.begin(); it!=s.end(); it++)
{

if(l<*it)
{
cout<<” “<<*it;
}
}
cout<<endl;
}
}
}