题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=1047 Integer Inquiry Description One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of t…

Problem Description Oneof the first users of BIT's new supercomputer was Chip Diller. He extended hisexploration of powers of 3 to go from 0 to 333 and he explored taking varioussums of those numbers.  ``This supercomputer is great,'' remarked Chip.…

本题就是大数相加,题目都不用看了. 只是注意的就是HDU的肯爹输出,好几次presentation error了. 还有个特殊情况,就是会有空数据的输入case. #include <stdio.h> #include <vector> #include <string.h> #include <algorithm> #include <iostream> #include <string> #include <limits.h…

题意:整数大数加法 思路:大数模板 #include<iostream> #include<stdio.h> #include<stdlib.h> #include<string.h> using namespace std; #define MAXN 9999//万进制 #define DLEN 4//4位 class BigNum{ private: ];//可以控制大数位数(500*4) int len;//大数长度 public: BigNum(){…

链接:传送门 思路:高精度水题 /************************************************************************* > File Name: hdu1047.cpp > Author: WArobot > Blog: http://www.cnblogs.com/WArobot/ > Created Time: 2017年05月16日 星期二 21时16分38秒 ***************************…

Integer Inquiry Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11678    Accepted Submission(s): 2936 Problem Description One of the first users of BIT's new supercomputer was Chip Diller. He ex…

Integer Inquiry Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15221    Accepted Submission(s): 3912 Problem Description One of the first users of BIT's new supercomputer was Chip Diller. He ex…

#include"stdio.h" #include"stdlib.h" #include"string.h" #define N 105 int a[N]; int main() { int i,j,n,n1,flag; char ch[N]; scanf("%d",&n); while(n--) { memset(a,,sizeof(a)); //数组初始化为零 ]!=') //输入零结束 { n1=strlen(…

String 大数加法模板 #include<stdio.h> #include<string> #include<iostream> using namespace std; //高精度加法 //只能是两个正数相加 string add(string str1,string str2)//高精度加法 { string str; int len1=str1.length(); int len2=str2.length(); //前面补0,弄成长度相同 if(len1&l…

Integer Inquiry Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 27730   Accepted: 10764 Description 题目链接:http://poj.org/problem?id=1503 One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of pow…