Skip to main content

solution of GERGOVIA - Wine trading in Gergovia on spoj

solution-GERGOVIA - Wine trading in Gergovia

#include <stdio.h>
#include <math.h>
int main(void) {

while(1){
    int n;
    scanf("%d",&n);
    if(n==0)
    break;
    int i,a[n],j,g;
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);
         long long int s=0;
         for(i=0;i<n;i++){
             g=abs(a[i]);
             s=s+g;
             a[i+1]=a[i+1]+a[i];
         }
           printf("%lld\n",s);
}
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; }