ProjectEuler/Problem 13.cpp at master · root00198/ProjectEuler · GitHub

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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
//ANSWER IS 5537376230
#include<iostream>

using namespace std;

int alphabet_into_digits(char s)
{
     int i;
     if(s=='0')
          i=0;
     else if(s=='1')
          i=1;
     else if(s=='2')
          i=2;
     else if(s=='3')
          i=3;
     else if(s=='4')
          i=4;
     else if(s=='5')
          i=5;
     else if(s=='6')
          i=6;
     else if(s=='7')
          i=7;
     else if(s=='8')
          i=8;
     else
          i=9;
     return i;
}
string digits_into_alpha(int a)
{
     string ch;
     if(a==1)
          ch="1";
     else if(a==2)
          ch="2";
     else if(a==3)
          ch="3";
     else if(a==4)
          ch="4";
     else if(a==5)
          ch="5";
     else if(a==6)
          ch="6";
     else if(a==7)
          ch="7";
     else if(a==8)
          ch="8";
     else if(a==9)
          ch="9";
     else if(a==0)
          ch="0";
     return ch;
}

class bignum
{
          string s1,s2,sans;                      //TWO STRINGS SUM=s1+s2;
          int a1[10000],a2[10000],aans[10000];
          int count_digits_s1,count_digits_s2,count_digits_ans;

     public:

          bignum(string str1,string str2)    //CONSTRUCTOR
          {
               s1=str1;
               s2=str2;
               sans="";

               for(int i=0;i<10000;i++)
               {
                    a1[i]=0;
                    a2[i]=0;
                    aans[i]=0;
               }
               count_digits_s1=0;
               count_digits_s2=0;
               str_into_array();
               count_digits_ans=0;
          }
          void str_into_array()                        //s1 INTO a1 AND s2 INTO a2
          {
               for(int i=0;i<s1.length();i++)
               {
                    a1[s1.length()-i-1]=alphabet_into_digits(s1[i]);
                    count_digits_s1++;
               }
               for(int j=0;j<s2.length();j++)
               {
                    a2[s2.length()-j-1]=alphabet_into_digits(s2[j]);
                    count_digits_s2++;
               }

          }
           void array_into_str()                     //aans INTO sans;
          {
               for(int i=count_digits_ans-1;i>=0;i--)
                    sans+=digits_into_alpha(aans[i]);
          }
          void add()                           //ADDITION
          {
               int i=count_digits_s1-1,j=count_digits_s2-1;
               count_digits_ans=count_digits_s1;
               if(count_digits_s1>=count_digits_s2)
               {
                    for(;i>=0;i--)
                         aans[i]=a1[i];

                    i=0;
                    int a=0;
                    while(i<count_digits_ans)
                    {
                         if(i<count_digits_s2)
                              a=aans[i]+a2[i]+a;
                         else
                              a=aans[i]+a;

                         aans[i]=a%10;
                         a=a/10;

                         if(count_digits_ans==i+1&&a>0)
                              count_digits_ans++;
                         i++;
                    }


               }
               else
               {
                    for(;j>=0;j--)
                         aans[j]=a2[j];
                    count_digits_ans=count_digits_s2;
                    j=0;
                    int a=0;
                    while(j<count_digits_ans)
                    {
                         if(j<count_digits_s1)
                              a=aans[j]+a1[j]+a;
                         else
                              a=aans[j]+a;
                         aans[j]=a%10;
                         a=a/10;
                         if(j+1==count_digits_ans&&a>0)
                              count_digits_ans++;
                         j++;
                    }
               }
               array_into_str();
          }
          string return_sans()
          {
               return sans;
          }

};


int main()
{
     int i=0;
     string a,b,c;

     cin>>a;

     while(i<99)
     {
          cin>>b;
          bignum sum(a,b);
          sum.add();
          c=sum.return_sans();
          a=c;
          i++;
          //cout<<a<<"\n";
     }
     cout<<a;
}