SPOJ CANDY3 Solution

| July 01, 2015

The correct, optimal and working solution for programming question CANDY3 on spoj

/*
 * CANDY3.cpp
 *
 *  Created on: Jun 4, 2014
 *      Author: Arpit Bhayani
 */

#include <cstdio>
#include <cstdlib>
#include <iostream>

using namespace std;

#define DEBUG 0
#define gc getchar
#define ll long long

void scanint(ll int &x) {
	register ll int c = gc();
	x = 0;
	for(;(c<48 || c>57);c = gc());
	for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
}

int readline ( char * str ) {

	int i = 0;
	char ch;
	while ( (ch=getchar()) != '\n' ) {
		str[i++] = ch;
	}
	str[i] = '\0';
	return i;
}

int main ( int argc , char * argv[] ) {

	int t;
	scanf("%d" , &t);
	while ( t-- ) {
		ll int sum = 0;
		ll int n,x;
		scanf("%lld" , &n);

		for ( ll int i = 0 ; i < n ; i++ ) {
			scanf("%lld" , &x);
			sum = (sum + x) % n;
		}

		if ( sum == 0 )
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
	return 0;
}