Problem:
Score : 200 points

Problem Statement

An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.

Determine whether N is a multiple of 9.

Constraints

0 \leq N < 10^{200000}

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If N is a multiple of 9, print Yes; otherwise, print No.

Sample Input 1

123456789

Sample Output 1

Yes

The sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.

Sample Input 2

0

Sample Output 2

Yes

Sample Input 3

31415926535897932384626433832795028841971693993751058209749445923078164062862089986280

Sample Output 3

No

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;

int main() {
  string N;
  int ans=0;
  getline(cin,N);
  
  for (char c:N)
  switch (c) {
    case '1':ans+=1;break;
    case '2':ans+=2;break;
    case '3':ans+=3;break;
    case '4':ans+=4;break;
    case '5':ans+=5;break;
    case '6':ans+=6;break;
    case '7':ans+=7;break;
    case '8':ans+=8;break;
    case '9':ans+=9;break;
    default:break;
  }
  
  if (ans%9==0) cout << "YES" <<endl;
  else cout << "NO" << endl;
}