zhx’s submissionsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 540Accepted Submission(s): 146
Problem Description
As one of the most powerful brushes, zhx submits a lot of code on many oj and most of them got AC.One day, zhx wants to count how many submissions he made onojs. He knows that on theoj, he madesubmissions. And what you should do is to add them up.To make the problem more complex, zhx gives younumbers and you should also return anumber to him.What’s more, zhx is so naive that he doesn’t carry a number while adding. That means, his answer to. And he also asked you to calculate in his way.
Input
Multiply test cases(less than). Seekas the end of the file.For each test, there are two integersseparated by a space. ()Then come n lines. In each line there is anumber(may contain leading zeros). The digits are fromthen from(lowercase). The length of a number will not execeed 200.
Output
For each test case, output a single line indicating the answer in(no leading zero).
Sample Input
2 3221 42333 16abbccd
Sample Output
123314
Source
思路：就是不进位的大数相加啦，要注意当结果为0时输出一个0，之前我还做过一个差不多的，上次注意到了，，这次居然没注意到o(╯□╰)o………
疑问：为何运行时间900多ms，而且还可能会T，把cstdio改为stdio.h时间就降下来了，直接变为100多ms，害的我还检查半天。。。但是这是为什么？？？？？？
搞了半天我发现使用g++环境提交的没过，而用c++环境就过啦（以后再HDU做题还是用c++环境吧，醉啦）
据说g++用scanf因为输入太慢而要开挂（难道和cin减速一个性质？？），，，，，貌似是这样的，以后再试试
void gn(int &x){char c;while((c=getchar())<'0'||c>'9');x=c-'0';while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';}
AC代码①（100+ms，g++环境）：
#include <stdio.h>#include <cstring>#include <iostream>#include <algorithm>#include <cmath> using namespace std;char ans[205];char t[205];void fun(char ans[], char t[]) {int len = strlen(t);for(int i = 0; i < len; i++) {ans[i] = t[len – 1 – i];}}void swap(char t[]) {int len = strlen(t);for(int i = 0; i < len / 2; i++) {char m = t[i];t[i] = t[len – 1 – i];t[len – 1 – i] = m;}}void add(char ans[], char t[], int B) {int t1, t2, t3;int len = strlen(t);for(int i = 0; i < len; i++) {if(ans[i] <= 'z' && ans[i] >= 'a') t1 = (int)(ans[i] – 'a' + 10);else t1 = ans[i] – '0';if(t[i] <= 'z' && t[i] >= 'a') t2 = (int)(t[i] – 'a' + 10);else t2 = t[i] – '0';t3 = (t1 + t2) % B;if(t3 >= 10) ans[i] = (char)(t3 – 10 + 'a');else ans[i] = (char)(t3 + '0');}}void print(char ans[]) {int flag = 0, p;for(int i = 204; i >= 0; i–) {if(ans[i] != '0') {printf("%c", ans[i]);flag = 1;}else if(ans[i] == '0' && flag) printf("0");}if(flag == 0) printf("0");printf("\n");}int main() {int n, B;while(scanf("%d %d", &n, &B) != EOF) {for(int i = 0; i< 205; i++) ans[i] = '0';scanf("%s", t);fun(ans, t);for(int i = 0; i < n-1; i++) {scanf("%s", t);swap(t);add(ans, t, B);}print(ans);}return 0;}
代码②（900+ms or TLE，g++环境）：
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <cmath> using namespace std;char ans[205];char t[205];void fun(char ans[], char t[]) {int len = strlen(t);for(int i = 0; i < len; i++) {ans[i] = t[len – 1 – i];}}void swap(char t[]) {int len = strlen(t);for(int i = 0; i < len / 2; i++) {char m = t[i];t[i] = t[len – 1 – i];t[len – 1 – i] = m;}}void add(char ans[], char t[], int B) {int t1, t2, t3;int len = strlen(t);for(int i = 0; i < len; i++) {if(ans[i] <= 'z' && ans[i] >= 'a') t1 = (int)(ans[i] – 'a' + 10);else t1 = ans[i] – '0';if(t[i] <= 'z' && t[i] >= 'a') t2 = (int)(t[i] – 'a' + 10);else t2 = t[i] – '0';t3 = (t1 + t2) % B;if(t3 >= 10) ans[i] = (char)(t3 – 10 + 'a');else ans[i] = (char)(t3 + '0');}}void print(char ans[]) {int flag = 0, p;for(int i = 204; i >= 0; i–) {if(ans[i] != '0') {printf("%c", ans[i]);flag = 1;}else if(ans[i] == '0' && flag) printf("0");}if(flag == 0) printf("0");printf("\n");}int main() {int n, B;while(scanf("%d %d", &n, &B) != EOF) {for(int i = 0; i< 205; i++) ans[i] = '0';scanf("%s", t);fun(ans, t);for(int i = 0; i < n-1; i++) {scanf("%s", t);swap(t);add(ans, t, B);}print(ans);}return 0;}
不能接受失败，也意味太想去成功了，从心理学上解释，
