[알고리즘] 백준 2547 - 사탕 선생 고창영 (C++)

[문제 링크] : https://www.acmicpc.net/problem/2547

#include <iostream>
using namespace std;

int T;

int main(){
    long long N, Cnt, inp;
    cin >> T;
    
    while(T--){
        Cnt = 0;
        cin >> N;

        for(int i=0; i<N; i++){
            cin >> inp;
            Cnt = (Cnt + inp) % N;
        }
        if(Cnt % N != 0){
            cout << "NO\n";
        }
        else{
            cout << "YES\n";
        }
    }
    return 0;
}