-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path00424 Integer Inquiry.cpp
66 lines (66 loc) · 1.44 KB
/
00424 Integer Inquiry.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <numeric>
#include <stack>
#include <queue>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <limits>
#include <sstream>
#include <string>
#include <regex>
#define iter(a,b,c,d) for(a = b; a < c; a+=d)
#define ited(a,b,c,d) for(a = b; a > c; a-=d)
#define li long int
#define uli unsigned li
#define ll long li
#define ull unsigned ll
#define si(a) scanf("%d",&a)
#define sli(a) scanf("%ld",&a)
#define sll(a) scanf("%lld",&a)
#define slu(a) scanf("%llu",&a)
#define sf(a) scanf("%f",&a)
#define slf(a) scanf("%lf",&a)
#define PI 3.1415926
using namespace std;
int main()
{
// freopen("1in.txt", "r", stdin);
// freopen("1out.txt", "w", stdout);
array<short, 110> sum;
fill(sum.begin(), sum.end(),0);
short num;
int numLoc;
string s;
while(getline(cin,s))
{
if(s == "0")
break;
numLoc = 0;
for(auto it=s.rbegin();it!=s.rend();++it)
{
num=*it-'0';
sum[numLoc] += num;
sum[numLoc+1] += sum[numLoc]/10;
sum[numLoc] %= 10;
numLoc++;
}
}
bool leadZeroes=true;
for(auto it=sum.rbegin();it!=sum.rend();++it)
{
if(*it!= 0)
leadZeroes = false;
if(!leadZeroes)
printf("%hd",*it);
}
printf("\n");
return 0;
}