Add to Favorites    Make Home Page 21025 Online  
 Language Categories  
 Our Services  

Home » C++ Home » Beginners / Lab Assignments Home » 40 digit subtraction

A D V E R T I S E M E N T

Search Projects & Source Codes:

Title 40 digit subtraction
Description
Category C++ » Beginners / Lab Assignments
Hits 7661
Code Select and Copy the Code
Code : #include<iostream.h> #include<string.h> #include<conio.h> //using namespace std; int l1,l2; char arr1[40],arr2[40],ans[40]; class large { public: void length() { l1=strlen(arr1); l2=strlen(arr2); cout<<" the length of the first digit is:"<<l1; cout<<" the length of the second string is:"<<l2; } void sub2() { int s=0;int f=l1-l2; int i=l1-1; int j=l2-1; int li=i; if(i==j) { while(i>=0) { if(i>0) { s=arr1[i]-arr2[j]; if(s<0) { s=((arr1[i]-48)+10)-(arr2[j]-48); arr1[i-1]=((arr1[i-1]-48)-1)+48; } else { s=(arr1[i]-48)-(arr2[j]-48); } ans[i]=s+48; i--; j--; } else { s=(arr1[i]-48)-(arr2[j]-48); ans[i]=s+48; i--; j--; } } ans[li+1]='<<" "<<ans; } else if(i>j) { while(i>=0) { if(i>=f) { s=(arr1[i]-48)-(arr2[j]-48); if(s<0) { if(arr1[i-1]=='0') { //cout<<arr1[i-1]; s=((arr1[i]-48)+10)-(arr2[j]-48); arr1[i-1]=((arr1[i-1]-48)-1)+48; if(i-2>=0) { arr1[i-2]=((arr1[i-2]-48)-1)+48; } } else { s=((arr1[i]-48)+10)-(arr2[j]-48); arr1[i-1]=((arr1[i-1]-48)-1)+48; } ans[i]=s+48; i--; j--; } else { s=(arr1[i]-48)-(arr2[j]-48); ans[i]=s+48; i--; j--; } /*ans[i]=s+48; i--; j--;*/ } else { s=arr1[i]-48; ans[i]=s+48; i--; j--; } } ans[li+1]='<<" "<<ans; } } void sub3() { int s=0;int f=l2-l1; int i=l1-1; int j=l2-1; int li=j; if(i==j) { while(j>=0) { if(j>0) { s=arr2[j]-arr1[i]; if(s<0) { s=((arr2[j]-48)+10)-(arr1[i]-48); arr2[j-1]=((arr2[j-1]-48)-1)+48; } else { s=(arr2[j]-48)-(arr1[i]-48); } ans[j]=s+48; i--; j--; } else { s=(arr2[j]-48)-(arr1[i]-48); ans[j]=s+48; i--; j--; } } ans[li+1]='<<" -"<<ans; } else if(j>i) { while(j>=0) { if(j>=f) { s=(arr2[j]-48)-(arr1[i]-48); if(s<0) { if(arr2[j-1]=='0') { //cout<<arr1[i-1]; s=((arr2[j]-48)+10)-(arr1[i]-48); arr2[j-1]=((arr2[j-1]-48)-1)+48; if(j-2>=0) { arr2[j-2]=((arr2[j-2]-48)-1)+48; } } else { s=((arr2[j]-48)+10)-(arr1[i]-48); arr2[j-1]=((arr2[j-1]-48)-1)+48; } ans[j]=s+48; i--; j--; } else { s=(arr2[j]-48)-(arr1[i]-48); ans[j]=s+48; i--; j--; } } else { s=arr2[j]-48; ans[j]=s+48; i--; j--; } } ans[li+1]='<<" -"<<ans; } } void sub1() { cout<<" THE ANSWER IS ZERO"; } void input() { cout<<"INPUT THE FIRST NUMBER:"; cin>>arr1; cout<<"INPUT THE SECOND NUMBER:"; cin>>arr2; } void output() { cout<<" "<<arr1<<" - "<<arr2; } }; void main() { int i,j; large l; clrscr(); l.input(); l.length(); cout<<" ***************************START OF ALL PROCESS*********************************"; l.output(); cout<<endl<<" "; for(i=0;i<=l1;i++) { cout<<"-"; } if(l1<l2) { //cout<<" second numbere is greater"; l.sub3(); } else if(l1>l2) { //cout<<" first number is greater"; l.sub2(); } else { int flag=1; for(i=0,j=0;i<l1,j<l2;i++,j++) { if(arr1[i]==arr2[j]) { flag=0; } else if(arr1[i]>arr2[j]) { //cout<<" the first number is greater"; flag=1; l.sub2(); break; } else { //cout<<" the second number is greater"; flag=1; l.sub3(); break; } } if(flag==0) //cout<<" both numbers are equal"; l.sub1(); } cout<<" **************************ENDING OF ALL PROCESS********************************"; //l.sub(); getch(); } ????????????????ont("Courier",style,

Related Source Codes

Script Name Author
Moving ball screen saver karlmarx
The Classic Game of Snake & Ladder Lakshmi Narayana .A
Railway seat reservation question which comes in sapient VyomWorld
To calculate percentile Ravi Mathur
Send to folder ANIMESH SAHU
Analog clock and calendar Nazia & Rida
HIGH/LOW GAME MOLLY ARORA
Data structure (stack Implimentation) Swapnil B Adsure
Memory Game AnirudhSanyal
Easy Calc Anirudh Sanyal
GK Quiz Anirudh Sanyal
Hangman Game Manish Jain
Snakeman Manish Jain
Full month Calendar Nigi
Cursor shapes nigi

A D V E R T I S E M E N T




Google Groups Subscribe to SourceCodesWorld - Techies Talk
Email:

Free eBook - Interview Questions: Get over 1,000 Interview Questions in an eBook for free when you join JobsAssist. Just click on the button below to join JobsAssist and you will immediately receive the Free eBook with thousands of Interview Questions in an ebook when you join.

New! Click here to Add your Code!


ASP Home | C Home | C++ Home | COBOL Home | Java Home | Pascal Home
Source Codes Home Page

 Advertisements  

Google Search

Google

Source Codes World.com is a part of Vyom Network.

Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Interview Questions | Jobs, Discussions | Placement Papers | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | Arabic, French, German | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Software Testing | Google Logo Maker | Freshers Jobs

Sitemap | Privacy Policy | Terms and Conditions
Copyright ©2003-2017 SourceCodesWorld.com, All Rights Reserved.
Page URL: http://www.sourcecodesworld.com/source/show.asp?ScriptID=1132


Download Yahoo Messenger | Placement Papers | Free SMS | C Interview Questions | C++ Interview Questions | Quick2Host Review