Problem:
Score : 200 points

Problem Statement

Let S(n) denote the sum of the digits in the decimal notation of n.
For example, S(101) = 1 + 0 + 1 = 2.

Given an integer N, determine if S(N) divides N.

Constraints

1 \leq N \leq 10^9

Input

Input is given from Standard Input in the following format:

N

Output

If S(N) divides N, print Yes; if it does not, print No.

Sample Input 1

12

Sample Output 1

Yes

In this input, N=12.
As S(12) = 1 + 2 = 3, S(N) divides N.

Sample Input 2

101

Sample Output 2

No

As S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.

Sample Input 3

999999999

Sample Output 3

Yes

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

#include<stdio.h>
#include<string.h>
#include<math.h>

int main(void)
{
  char nc[11];
  scanf("%s",nc);

  int nlen;
  nlen = strlen(nc);

  int s=0,n=0,i,j;
  for(i=0;i<nlen;i++){
    s += (nc[i]-'0');
    n += (nc[i]-'0')*pow(10,(nlen-i)-1);
  }

  printf("nc = %s\n",nc);
  printf("s = %d\n",s);
  printf("n = %d\n",n);

  if(n%s==0)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}