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 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(){
    int a,b=0,c=0,d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m,x;

   scanf("%d",&a);
   x=a;
    b=a/1000000000;
    a=a%1000000000;
    c=a/100000000;
    a=a%100000000;
    d=a/10000000;
    a=a%10000000;
    e=a/1000000;
    a=a%1000000;
    f=a/100000;
    a=a%100000;
    g=a/10000;
    a=a%10000;
    h=a/1000;
    a=a%1000;
    i=a/100;
    a=a%100;
    j=a/10;
    k=a%10;

    l=b+c+d+e+f+g+h+i+j+k;
    m=x%l;
    if(m==0){
        printf("yes");
    }else{
        printf("no");
    }


}