UVa - 10929 - You can say 11

上题目

Problem C - You can say 11
Time Limite: 1 second

Introduction to the problem

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

Description of the 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.

Description of the 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.

 

　　题意很简单，就是给你一个最多1000位的整数，问你这个数能否被11整除。这里之处使用大数模运算就可以了，具体操作看代码。

上代码

#include <stdio.h>
#include <string.h>
#define max(x,y) (x > y ?  x : y)
#define MAX (1000+10)
using namespace std;

char num[MAX];

int main()
{
    int len,i;
    long long ans;
    //freopen("data.txt","r",stdin);
    while(scanf("%s",num),strcmp(num,"0"))
    {
        len=strlen(num);
        ans=0;
        for(i=0;i<len;i++)
            ans=(ans*10+(num[i]-'0'))%11;
        if(!ans) printf("%s is a multiple of 11.\n",num);
        else printf("%s is not a multiple of 11.\n",num);
    }
    return 0;
}