u013343013的专栏

#include   using namespace std;  const int MAX=40; //题目要求整数位不超过40位 const int result=100; //两数相乘结果要较大，位数较多 char a[MAX+10];  char b[MAX+10]; //接受输入的数字 int  amul[MAX+10];  int  bmul[MAX+10]; //存储转

#include #include #define M 10007 int c1[M],c2[M],num[107],id[107]; int main() {     int t;     while(scanf("%d",&t),t)//输入价值数     {         memset(num,0,sizeof(num));//num初始为0         int c

大明A+B Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8980    Accepted Submission(s): 3185 Problem Description 话说，经过了漫长的一个多月，小明已经成长了许多，

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24956    Accepted Submission(s): 8774 Problem Description Nowadays, w

N! Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 58227    Accepted Submission(s): 16532 Problem Description Given an integer N(0 ≤ N