I - You can say 11 UVA - 10929

Your job is, given a positive number N, determine if it is a multiple of eleven.

Input

The input is a file such that each line contains a positive number. A line containing the number ‘0’ is
the end of the input. The given numbers can contain up to 1000 digits.

Output

The output of the program shall indicate, for each input number, if it is a multiple of eleven or not.

Sample Input

112233
30800
2937
323455693
5038297
112234
0

Sample Output

112233 is a multiple of 11.
30800 is a multiple of 11.
2937 is a multiple of 11.
323455693 is a multiple of 11.
5038297 is a multiple of 11.
112234 is not a multiple of 11.

#include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <math.h>
using namespace std;
char str[10000];
int main()
{
    while(scanf("%s",str)&&strcmp(str,"0"))
    {
        int s=0;
        int len=strlen(str);
        for(int i=0;i<len;++i)
        {
            s=s*10+str[i]-'0';
            s=s%11;//大数取模过程；
        }
        if(s==0)
            printf("%s is a multiple of 11.\n",str);
        else
            printf("%s is not a multiple of 11.\n",str);
    }
    return 0;
}

大数取模的过程实际上就是在模拟我们自己的计算过程。
所谓求余就是除法得到余数的过程，这个程序的算法其实跟我们手动除法的过程是一样的，可以想想我们怎么笔算的

图片来源