You can say 11

最新推荐文章于 2020-11-20 13:19:12 发布

原创最新推荐文章于 2020-11-20 13:19:12 发布 · 247 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个UVA在线评测系统的题目——判断一个正整数是否为11的倍数，并提供了一段C语言代码实现，该算法通过逐位计算的方式判断输入数字是否符合条件。

UVA - 10929 You can say 11

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 <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
     char a[10000];
     while(scanf("%s",a)&&strcmp(a,"0"))
    {

        int n=strlen(a);
     int s=0,i;
    for(i=0;i<n;i++)
    {

       s=s*10+a[i]-'0'; //差48或s=s*10+a[i]-48;
        s=s%11;
    }
    if(s==0) printf("%s is a multiple of 11.\n",a);
    else printf("%s is not a multiple of 11.\n",a);
    }
    return 0;
}