Scribd
Upload
144 views11 pages

CXXCZ

The document contains multiple implementations of a function named 'tong' that adds two strings representing large numbers. Each implementation uses a loop to calculate the sum digit by digit, handling carry values appropriately. The function returns the result as a string.

Uploaded by

23110339
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
144 views11 pages

CXXCZ

The document contains multiple implementations of a function named 'tong' that adds two strings representing large numbers. Each implementation uses a loop to calculate the sum digit by digit, handling carry values appropriately. The function returns the result as a string.

Uploaded by

23110339
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 11

string tong(string a, string b)

{ string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/1 string tong(string a, string b)
{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}
string tong(string a, string b)
{
int carry=0,i=a string tong(string a, string b)
{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%1 string tong(string a, string b)
{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, s string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}
string tong(string a, string b)
{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

string tong(string a, string b)


{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

tring b)
{
int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

0 +'0') +kq;
carry=sum/10;
}
return kq;
}

.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

0;
}
return kq;
}

int carry=0,i=a.size()-1,j=b.size()-1;
string kq="";
while(i>=0 || j>=0 || carry>0){
int sum=carry;
if(i>=0){
sum+=a[i--]-'0';
}
if(j>=0){
sum+=b[j--]-'0';
}
kq= char(sum%10 +'0') +kq;
carry=sum/10;
}
return kq;
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy