Skip to main content

solution of CEQU - Crucial Equation on spoj

solution -CEQU - Crucial Equation 

#include<stdio.h>
int main()
{ long long int a,b,x,c,i,t;
scanf("%lld",&t);
for(i=1;i<=t;i++)
{
scanf("%lld%lld%lld",&a,&b,&c);
while(b!=0)
{
x=a%b;
a=b;
b=x;
}
if(c%a==0)
{ printf("Case %lld: Yes",i);
printf("\n");
}
else
    {printf("Case %lld: No",i);
printf("\n");
    }

}
return  0;
}

Comments

Post a Comment

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; }
Post a Comment
Read more

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; }
Post a Comment
Read more