hdu1047 Integer Inquiry
2024-08-21 16:14:29
/*
Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15874 Accepted Submission(s): 4079 Problem 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 those numbers.
``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these results.'' (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.) Input
The input will consist of at most 100 lines of text, each of which contains a single VeryLongInteger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (no VeryLongInteger will be negative). The final input line will contain a single zero on a line by itself. Output
Your program should output the sum of the VeryLongIntegers given in the input. This problem contains multiple test cases! The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks. The output format consists of N output blocks. There is a blank line between output blocks. Sample Input 1 123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0 Sample Output 370370367037037036703703703670 Source
East Central North America 1996
*/
#include <iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
const int maxN=;
int main()
{
int n,k,i,j,len,next;
bool flag;
char ch[maxN],ans[maxN];
scanf("%d",&n);
while(n--)
{
flag=false;
memset(ans,,sizeof(ans));
for(i=; i<=maxN; i++)
{
scanf("%s",ch);
if(strcmp(ch,"")==)
break;
len=strlen(ch);
for(j=len-,k=; j>=; j--,k++)
{
next=;
ans[k]+=ch[j]-'';
while(ans[k+next]>)//must handle immediately
{
ans[k+next]-=;
ans[k++next]+=;
next+=;
}
}
}
for(j=maxN-; j>=; j--)//ans[] array can meet 0 advancely when you use strlen
{
if(ans[j]!='\0'&&!flag)
flag=true;
if(flag)
printf("%c",ans[j]+'');
}
if(!flag)//if nothing output before,we must output 0.
printf("%c",'');
printf("\n");
if(n>)
printf("\n");
}
return ;
}
最新文章
- 使用Open xml 操作Excel系列之二--从data table导出数据到Excel
- Mac上因磁盘格式导致gulp无限刷新问题
- java和C#中 定义变量,加一个小括号是什么意思。。。
- Java虚拟机学习 - 体系结构 内存模型
- learning nodejs 1 - stream.pipe
- 结构体 lock_sys
- hdu1064Financial Management
- mysql jdbc 查询连接问题
- vue2.0表单事件的绑定
- block,inline,inline-block的区别
- delphi 10.1 Berlin 中使用自带的 Base64 编码
- MSMQ 和 MQTT
- Spring设计模式_策略模式/其他
- 【记录一次坑经历】axios使用x-www-form-urlencoded 服务器报400(错误的请求。 )(后端.Net MVC5 WebApi OAuth,前端Electron-Vue)
- python selenium简单安装及使用
- FHQ Treap及其可持久化与朝鲜树式重构
- day6:vcp考试
- SlickSafe.NET 开源权限框架开发指南
- 'htmlentities(): charset `utf8' not supported, assuming utf-8'
- Java Web基础——Controller+Service +Dao三层的功能划分