代码演示
#include <stdio.h>
#include <string.h>
char num1[102][1002];
int n1[102][1002];
int ans[1002];
int main() {
FILE *fp = freopen("E:/c语言代码/文件数据/欧拉计划input13.txt", "r", stdin);
for (int ii = 1; ii <= 100; ii++) {
fscanf(fp, "%s", num1[ii]);
int n1_size = strlen(num1[ii]);
n1[ii][0] = n1_size;
for (int i = 0, j = n1_size; num1[ii][i] && j > 0; i++, j--) {
n1[ii][j] = num1[ii][i] - '0';
}
ans[0] = n1_size > ans[0] ? n1_size : ans[0];
for (int i = 1; i <= ans[0]; i++) {
ans[i] += n1[ii][i];
}
for (int i = 1; i <= ans[0]; i++) {
if (ans[i] > 9) {
++ans[i + 1];
ans[i] -= 10;
}
}
if (ans[ans[0] + 1]) ++ans[0];
}
fp = freopen("E:/c语言代码/文件数据/欧拉计划output13.txt", "w", stdout);
for (int i = ans[0]; i; i--) {
fprintf(fp, "%d", ans[i]);
}
printf("\n");
return 0;
}
答案
5537376230390876637302048746832985971773659831892672