COJ 1102 - You Can Say 11 题解-优快云博客

本文介绍了一种通过编程方式判断一个大数是否能够被11整除的方法。利用字符串模拟除法的过程，适用于包含上千位的大数。示例代码采用C++实现，展示了如何读取输入并输出相应的判断结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

本题就是给出一个无穷大数，算其是否能被11除尽

Description

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

Input specification

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 specification

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

Sample input

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.

使用string模拟除法就可以了。

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

bool divEleven(string s)
{
	int carry = 0;
	for (int i = 0; i < s.size(); i++)
	{
		int d = carry * 10 + s[i] - '0';
		carry = d % 11;
	}
	if (carry) return false;
	return true;
}

void Eleven()
{
	string S;
	while (cin>>S && "0" != S)
	{
		if (divEleven(S)) cout<<S<<" is a multiple of 11.\n";
		else cout<<S<<" is not a multiple of 11.\n";
	}
}