TJU 1457. Beat the Spread! December 5, 2009

TJU 1457. Beat the Spread!

--AC--
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int main()
{
  int i,j,k;
  int cases;
  int sum,diff,a,b;
  scanf("%d",&cases);
  while(cases--)
  {
   scanf("%d%d",&sum,&diff);
   if(sum>diff)
    {
     if((sum+diff)%2==0&&(sum-diff)%2==0)
     {
      a=(sum+diff)/2;
      b=(sum-diff)/2;
      printf("%d %d\n",a,b);
      
     }
     else
       printf("impossible\n");
    }
   else if(sum==0&&diff==0)
    printf("0 0\n");
   else
    {
      printf("impossible\n");
    }

  }

return 0;
}

TJU 1355. Jolly Jumpers November 25, 2009

TJU 1355. Jolly Jumpers

[took 20 Mins to code]

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int main()
{
  int i,j,k;
  int n,a[3001],b[3001],flag,diff;

  while(1)
  {
    if(scanf("%d",&n)==-1) break;
    for(j=1;j<=n-1;j++)
      b[j]=0;
    for(i=1;i<=n;i++)
     scanf("%d",&a[i]);
   if(n==1) printf("Jolly\n");
   else
   {
     for(i=1;i<n;i++)
     {
       diff=a[i+1]-a[i];
       if(diff<0) diff=-diff;
       b[diff]=1;
     }
     flag=1;
     for(i=1;i<=n-1;i++)
     {
        if(b[i]==0)
        {
         flag=0;
         break;
        }
      }
     if(flag==1) printf("Jolly\n");
     else if(flag==0) printf("Not jolly\n");
    }

  }

return 0;
}

TJU 1350. Primary Arithmetic November 24, 2009

TJU 1350. Primary Arithmetic

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>

int main()
{
  int i,j,k;
  char s1[10],s2[10],c;
  int n,l1,l2;
  int carry,sum,count;
  while(1)
  {
   scanf("%s %s",s1,s2);
   if(s1[0]=='0'&&s2[0]=='0') break;
   l1=strlen(s1);
   l2=strlen(s2);
   count=0;
   if(l1>l2)
   {
     carry=0;
     for(i=l1-1,j=l2-1;j>=0;i--,j--)
     {
      
       sum=s1[i]-'0'+s2[j]-'0'+carry;
        if(sum>=10)
        {
         ++count;
          carry=sum/10;
        }
      }
    }
   else if(l2>l1)
   {
      carry=0;
     for(i=l1-1,j=l2-1;i>=0;i--,j--)
     {
      
       sum=s1[i]-'0'+s2[j]-'0'+carry;
        if(sum>=10)
        {
         ++count;
          carry=sum/10;
        }
      }
    }
     else if(l2==l1)
     {
      carry=0;
       for(i=l1-1,j=l2-1;i>=0;i--,j--)
       {
      
        sum=s1[i]-'0'+s2[j]-'0'+carry;
          if(sum>=10)
          {
           ++count;
           carry=sum/10;
          }

       }
     }
  
     if(i>=0&&j==-1)
     {
       while(i>=0)
       {
         sum=s1[i]-'0'+carry;
         if(sum>=10) {++count;carry=sum/10;}
        i--;
       }
     }
    else if(j>=0&&i==-1)
    {
      while(j>=0)
      {
        sum=s2[j]-'0'+carry;
        if(sum>=10) {++count;carry=sum/10;}
       j--;
      }
    }
        
    if(count==0)
       printf("No carry operation.\n");
    else if(count==1)
       printf("%d carry operation.\n",count);
    else 
       printf("%d carry operations.\n",count);
   }

return 0;
}

TJU 1412. Above Average

TJU 1412. Above Average

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>

int main()
{
  int i,j,k;
  int cases;
  int a[10000],n;
  double res,res2,res3,tot,avg,count;

  scanf("%d",&cases);
  while(cases--)
  {
    scanf("%d",&n);
    tot=0;
    for(i=1;i<=n;i++)
    {
      scanf("%d",&a[i]);
      tot+=a[i];
    }
    avg=(double)(tot/n);
    count=0;
    for(i=1;i<=n;i++)
    {
      if(a[i]>avg)
        ++count;
    }
 
    res=(double)((count*100)/n);
    printf("%0.3lf%%\n",res);
  }

return 0;
}