第四次更新
https://www.liuchuo.net/archives/4218
第三次更新
没有考虑20位大数,int 最高2的32次方-1,10位。
#include <iostream>
using namespace std;
#include <cmath>
int main(){
int N, n1, n2, a, b, jin, cnt = 0, ns, nj;
string s = "";
cin >> N >> n1 >> n2;
while(n1 != 0 || n2 != 0){
a = n1 % 10; b = n2 % 10;
jin = N % 10;
if(jin == 0) jin = 10;
ns = (a + b) % jin;
s.insert(0, 1, (char)(ns +