Spoj Problem solutions

Pages

  • Home
  • Spoj Solution List
  • Spoj Problem Classifier
  • C Programming Examples

Spoj Problem Candy 3(CANDY3)

CANDY3

#include<iostream>
using namespace std;
int main()
{
int t, n, i;
long long  s, a;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
s = 0;
for(i=0;i<n;i++)
{
scanf("%lld",&a);
s += a;
if(s >= n) s %= n;
}
if(s == 0) printf("YES\n");
else printf("NO\n");
}
return 0;
}

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Online Member

Blog Archive

  • ►  2014 (66)
    • ►  October (10)
    • ►  September (46)
    • ►  August (3)
    • ►  April (3)
    • ►  March (2)
    • ►  January (2)
  • ▼  2013 (66)
    • ►  December (21)
    • ►  November (9)
    • ►  October (8)
    • ►  September (14)
    • ▼  August (14)
      • AP- Complete the series Spoj solution(AP2)
      • Spoj Problem Candy 3(CANDY3)
      • Spoj Problem Solution ololo(OLOLO)
      • Spoj Problem solution for Dota Heros(DOTAA)
      • Last digit Re Visited(LASTDIG2)
      • problem solution for last digit(LASTDIG)
      • Triple fat ladies(EIGHT)
      • Amusing number spoj problem solution(TSHOW1)
      • manku word spoj solution(MAY99_2)
      • spoj marbles problem solution(MARBLES)
      • Army Strength spoj problem solution(ARMY)
      • Build A fence(BUILD)
      • spoj reversed no(ADDREV)
      • Life and Universe(TEST)

About Me

Explore Much
View my complete profile

Search This Blog

Pages

  • Home
Theme images by mammamaart. Powered by Blogger.