Skip to main content

solution of-AP2 - AP - Complete The Series (Easy) on spoj

AP2 - AP - Complete The Series (Easy)

solution-

#include<stdio.h>
int main()
{ int i,t,j;

long long int n,a,k,b,d,o,sum;
scanf("%d",&t);
for(j=0;j<t;j++)
{ 
scanf("%lld%lld%lld",&a,&b,&sum);
n=2*sum/(a+b);
   d=(b-a)/(n-5);
   k=a-2*d;
   printf("%lld\n",n);
   for(i=1;i<=n;i++)
   {
    o=k+(i-1)*d;
  printf("%lld ",o);
   }
   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