TJU 2210. Adding Reversed Numbers December 7, 2009

SPOJ 42. Adding Reversed Numbers

TJU 2210. Adding Reversed Numbers

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

int main()	
{
  int i,j,k,l1,l2,l,result,n1,n2;
  char s1[10],s2[10],s[10],c,tmp;
  int cases;

  scanf("%d",&cases);
  while(cases--)
  {
   scanf("%s %s",s1,s2);
   l1=strlen(s1);
   l2=strlen(s2);

   for(i=0;i<l1/2;i++)
   {
     tmp=s1[i];
     s1[i]=s1[l1-i-1];
     s1[l1-i-1]=tmp;
   }

   for(i=0;i<l2/2;i++)
   {
     tmp=s2[i];
     s2[i]=s2[l2-i-1];
     s2[l2-i-1]=tmp;
   }

   n1=atoi(s1);
   n2=atoi(s2);
   result=n1+n2;
   sprintf(s1,"%d",result);
   l1=strlen(s1);
   for(i=0;i<l1/2;i++)
   {
     tmp=s1[i];
     s1[i]=s1[l1-i-1];
     s1[l1-i-1]=tmp;
   }
   result=atoi(s1);
   printf("%d\n",result);
  }

return 0;
} 

TJU 1476. A Simple Task November 24, 2009

TJU 1476. A Simple Task
easy one..

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

int main()
{
  int i,j,k;
  int cases,n,o,p,tmp,rem;
  
  scanf("%d",&cases);
  while(cases--)
  {
    scanf("%d",&n);
    tmp=n;
    rem=0;
    i=0;
    for(;rem==0;)
    {
     rem=tmp%2;
     if(rem==0)
     tmp=tmp/2;
     i++;
    }
    
   printf("%d %d\n",tmp,i-1);
  }

return 0;
}