Skip to main content

solution of ADDREV - Adding Reversed Numbers on spoj

ADDREV - Adding Reversed Numbers on spoj-

#include<stdio.h>
int main ()
{
  int n,k,p = 0,q=0,x,a,y,t=0,z,s,i;
  scanf("%d\n",&k);
  for(i=0;i<k;i++)
 { scanf ("%d%d", &n,&a);
{while (n != 0)
    {
      x = n % 10;
      p = p * 10 + x;
      n = n / 10;
    }
   
    while(a!=0)
    {
        y=a%10;
        q=q*10+y;
        a=a/10;
    }
   
z=p+q;
while(z!=0)
{
    s=z%10;
    t=t*10+s;
    z=z/10;
    }
   
printf("%d\n",t);
t=0;
p=0;
q=0;
}}
  return 0;
}

 

Comments

Popular posts from this blog

solution of TRICOUNT - Counting Triangles on spoj

  TRICOUNT - Counting Triangles solution- #include<stdio.h> int main() {     int t;     scanf("%d",&t);     while(t--)     {         long long unsigned num,sum;         scanf("%llu",&num);         if(num%2==0)         sum=(num*(num+2)*((2*num)+1))/8;         else         sum=((num*(num+2)*((2*num)+1))-1)/8;         printf("%llu\n",sum);     }     return 0; }

solution of PRIME1 - Prime Generator on spoj

PRIME1 - Prime Generator solution- #include<stdio.h> #include<math.h> int main() {int t; long long int l,h,i,flag; scanf("%d",&t); while(t--) { scanf("%lld%lld",&l,&h); while(l<=h) { flag=0; for(i=2;i<=sqrt(l);i++) { if(l%i==0) { flag=1;     break; } } if(flag==0) { if(l!=1) printf("%lld\n",l); } l++; } printf("\n"); } return 0; }