大家好，欢迎来到IT知识分享网。
- please.
Input Specification:
Each input file contains one test case, which gives the integer N (0 < N < 10) in a line.
Output Specification:
Print in a line the sum of all N’s subnumbers (modulo ).
Sample Input:
#include <bits/stdc++.h> using namespace std; #define N (int)1e5+10 char arr[N]; typedef long long ll; ll pre[10][N]; int pren[N]; const int mod = ; void init() { ll i, j; for (i = 1; i <= 9; i++) { pre[i][0] = i; for (j = 1; j < N; j++) { pre[i][j] = (pre[i][j-1] * 10) % mod + i; } } } int main(void) { init(); scanf("%s", arr+1); ll res = 0; int i; int len = strlen(arr+1); pren[0] = -1; for (i = 1; i <= len; i++) { if (arr[i] != 48) pren[i] = pren[i-1]+1; else pren[i] = pren[i-1]; } for (i = 1; i <= len; i++) { if (arr[i] == 48) continue; res = (res + pre[arr[i]-48][len-i]*(pren[i]+1)) % mod; } cout << res; } 免责声明：本站所有文章内容,图片，视频等均是来源于用户投稿和互联网及文摘转载整编而成，不代表本站观点，不承担相关法律责任。其著作权各归其原作者或其出版社所有。如发现本站有涉嫌抄袭侵权/违法违规的内容,侵犯到您的权益，请在线联系站长,一经查实,本站将立刻删除。 本文来自网络,若有侵权，请联系删除，如若转载，请注明出处：https://haidsoft.com/99870.html
