Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<windows.h>
- #include<conio.h>
- #include<stdio.h>
- #include <cstdlib>
- #include <ctime>
- char intr;
- int A[1000];
- int B[1000];
- int C[1000];
- int D[1000];
- int Dig[1000];
- int Rez[1000];
- int Rez1[1000];
- int exit3=0;
- int sum, gran, dif, multi, m, b, st1, st2;
- int doping=0;
- int first=0;
- int exit4=0;
- int second=0;
- int i=0;
- int a=0;
- int ch=0;
- int end1=0;
- int nol1=0;
- int nol2=0;
- int end2=0;
- int nul1=0;
- int nul2=0;
- int exit5=0;
- int one;
- bool exit1=false;
- bool exit2=false;
- bool power=false;
- bool from=false;
- int minus1=0;
- int minus2=0;
- void comp()
- {
- for (int i=0; i<1000; i++)
- {
- if ((D[999]%2)==0)
- {
- ch=1;
- }
- }
- for (int i=0; i<1000; i=i+1)
- {
- if (C[i]==0)
- {
- st1=st1+1;
- }
- }
- if (st1==1000)
- {
- nol1=1;
- }
- for (int i=0; i<1000; i=i+1)
- {
- if (D[i]==0)
- {
- st2=st2+1;
- }
- }
- if (st1==999 && C[999]==1)
- {
- one=1;
- }
- if (st2==1000)
- {
- nol2=1;
- }
- if (end1>end2)
- {
- first=1;
- }
- if (end2>end1)
- {
- second=1;
- }
- if (end1==end2)
- {
- for (int i=0; i<1000; i=i+1)
- {
- if (C[i]>D[i])
- {
- first=1;
- break;
- }
- if (C[i]<D[i])
- {
- second=1;
- break;
- }
- }
- }
- }
- void plus_a_b()
- {
- for (int i=999; i>-1; i=i-1)
- {
- sum=C[i]+D[i];
- if (sum>9)
- {
- Rez[i]=sum % 10;
- C[i-1]=C[i-1]+1;
- }
- else
- {
- Rez[i]=sum;
- }
- }
- for (int i=0; i<1000; i=i+1)
- {
- if (Rez[i]!=0)
- {
- gran=i;
- break;
- }
- }
- for (int j=gran; j<1000; j=j+1)
- {
- printf("%d", Rez[j]);
- }
- }
- void minus_a_b()
- {
- for (int i=999; i>-1; i=i-1)
- {
- if (C[i]>D[i])
- {
- dif=C[i]-D[i];
- Rez[i]=dif;
- }
- if (C[i]==D[i])
- {
- dif=C[i]-D[i];
- Rez[i]=dif;
- }
- if (C[i]<D[i])
- {
- C[i]=C[i]+10;
- dif=C[i]-D[i];
- Rez[i]=dif;
- C[i-1]=C[i-1]-1;
- }
- }
- for (int i=0; i<1000; i=i+1)
- {
- if (Rez[i]!=0)
- {
- gran=i;
- break;
- }
- }
- for (int j=gran; j<1000; j=j+1)
- {
- printf("%d", Rez[j]);
- }
- }
- void minus_b_a()
- {
- for (int i=999; i>-1; i=i-1)
- {
- if (D[i]>C[i])
- {
- dif=D[i]-C[i];
- Rez[i]=dif;
- }
- if (D[i]==C[i])
- {
- dif=D[i]-C[i];
- Rez[i]=dif;
- }
- if (D[i]<C[i])
- {
- D[i]=D[i]+10;
- dif=D[i]-C[i];
- Rez[i]=dif;
- D[i-1]=D[i-1]-1;
- }
- }
- for (int i=0; i<1000; i=i+1)
- {
- if (Rez[i]!=0)
- {
- gran=i;
- break;
- }
- }
- for (int j=gran; j<1000; j=j+1)
- {
- printf("%d", Rez[j]);
- }
- }
- void summa()
- {
- if (minus1==1 && minus2==0)
- {
- if (first==0 && second==0)
- {
- printf("0");
- }
- }
- if (minus1==0 && minus2==1)
- {
- if (first==0 && second==0)
- {
- printf("0");
- }
- }
- if (minus1==0 && minus2==0)
- {
- plus_a_b();
- }
- if (minus1==1 && minus2==1)
- {
- printf("-");
- plus_a_b();
- }
- if (minus1==1 && minus2==0)
- {
- if (first==1)
- {
- printf("-");
- minus_a_b();
- }
- }
- if (minus1==1 && minus2==0)
- {
- if (second==1 )
- {
- minus_b_a();
- }
- }
- if (minus1==0 && minus2==1)
- {
- if (first==1)
- {
- minus_a_b();
- }
- }
- if (minus1==0 && minus2==1)
- {
- if (second==1)
- {
- printf("-");
- minus_b_a();
- }
- }
- }
- void diff()
- {
- if (minus1==0 && minus2==0)
- {
- if (first==0 && second==0)
- {
- printf("0");
- }
- }
- if (minus1==1 && minus2==1)
- {
- if (first==0 && second==0)
- {
- printf("0");
- }
- }
- if (minus1==1 && minus2==0)
- {
- printf("-");
- plus_a_b();
- }
- if (minus1==0 && minus2==1)
- {
- plus_a_b();
- }
- if (minus1==1 && minus2==1)
- {
- if (first==1)
- {
- printf("-");
- minus_a_b();
- }
- }
- if (minus1==1 && minus2==1)
- {
- if (second==1 )
- {
- minus_b_a();
- }
- }
- if (minus1==0 && minus2==0)
- {
- if (first==1)
- {
- minus_a_b();
- }
- }
- if (minus1==0 && minus2==0)
- {
- if (second==1)
- {
- printf("-");
- minus_b_a();
- }
- }
- }
- void mult()
- {
- if (nol1==1)
- {
- printf("0");
- }
- if (nol2==1)
- {
- printf("0");
- }
- if (minus1==1 && nol1==0 && nol2==0 && minus2==0)
- {
- printf("-");
- }
- if (minus2==1 && nol1==0 && nol2==0 && minus1==0)
- {
- printf("-");
- }
- for (int h=0; h<1000; h=h+1)
- {
- Rez[h]=0;
- }
- if (first==1 && nol1==0 && nol2==0)
- {
- a=999;
- b=0;
- for (int j=999; j>-1; j=j-1)
- {
- for (int i=999; i>-1; i=i-1)
- {
- multi=C[i]*D[j]+doping;
- doping=0;
- Rez1[a]=multi % 10;
- doping=multi / 10;
- a=a-1;
- }
- for (int g=999; g>-1; g=g-1)
- {
- m=Rez1[g]+Rez[g];
- Rez[g]=(Rez1[g]+Rez[g]) % 10;
- m=m/10;
- Rez[g-1]=Rez[g-1]+m;
- }
- a=j-1;
- doping=0;
- for (int y=0; y<1000; y=y+1)
- {
- Rez1[y]=0;
- }
- }
- for (int p=0; p<1000; p=p+1)
- {
- if (Rez[p]!=0)
- {
- gran=p;
- break;
- }
- }
- for (int t=gran; t<1000; t=t+1)
- {
- printf("%d", Rez[t]);
- }
- }
- if (second==1 && nol1==0 && nol2==0)
- {
- a=999;
- b=0;
- for (int j=999; j>-1; j=j-1)
- {
- for (int i=999; i>-1; i=i-1)
- {
- multi=D[i]*C[j]+doping;
- doping=0;
- Rez1[a]=multi % 10;
- doping=multi / 10;
- a=a-1;
- }
- for (int g=999; g>-1; g=g-1)
- {
- m=Rez1[g]+Rez[g];
- Rez[g]=(Rez1[g]+Rez[g]) % 10;
- m=m/10;
- Rez[g-1]=Rez[g-1]+m;
- }
- a=j-1;
- doping=0;
- for (int y=0; y<1000; y=y+1)
- {
- Rez1[y]=0;
- }
- }
- for (int p=0; p<1000; p=p+1)
- {
- if (Rez[p]!=0)
- {
- gran=p;
- break;
- }
- }
- for (int t=gran; t<1000; t=t+1)
- {
- printf("%d", Rez[t]);
- }
- }
- if (first==0 && second==0)
- {
- a=999;
- b=0;
- for (int j=999; j>-1; j=j-1)
- {
- for (int i=999; i>-1; i=i-1)
- {
- multi=C[i]*D[j]+doping;
- doping=0;
- Rez1[a]=multi % 10;
- doping=multi / 10;
- a=a-1;
- }
- for (int g=999; g>-1; g=g-1)
- {
- m=Rez1[g]+Rez[g];
- Rez[g]=(Rez1[g]+Rez[g]) % 10;
- m=m/10;
- Rez[g-1]=Rez[g-1]+m;
- }
- a=j-1;
- doping=0;
- for (int y=0; y<1000; y=y+1)
- {
- Rez1[y]=0;
- }
- }
- for (int p=0; p<1000; p=p+1)
- {
- if (Rez[p]!=0)
- {
- gran=p;
- break;
- }
- }
- for (int t=gran; t<1000; t=t+1)
- {
- printf("%d", Rez[t]);
- }
- }
- }
- void pow_out()
- {
- for (int p=0; p<1000; p=p+1)
- {
- if (Rez[p]!=0)
- {
- gran=p;
- break;
- }
- }
- for (int t=gran; t<1000; t=t+1)
- {
- printf("%d", Rez[t]);
- }
- }
- void pow()
- {
- int popa=1;
- if (nol1==1 && nol2==1)
- {
- popa=0;
- printf ("1");
- }
- if (minus1==1 && ch==0)
- {
- printf("-");
- }
- if (nol1==1 && nol2==0)
- {
- popa=0;
- printf ("0");
- }
- if (nol1==0 && nol2==1)
- {
- popa=0;
- printf ("1");
- }
- int R[1000];
- int exit7=0;
- int Re1[1000];
- int N=999;
- int Re[1000];
- doping=0;
- bool from2=false;
- for (int h=0; h<1000; h=h+1)
- {
- Rez[h]=0;
- }
- for (int i=0; i<1000; i++)
- {
- Re1[i]=D[i];
- }
- for (int i=0; i<1000; i++)
- {
- D[i]=C[i];
- }
- for (int i=0; i<1000; i++)
- {
- R[i]=0;
- }
- for (int i=0; i<1000; i++)
- {
- if (i!=999)
- {
- C[i]=0;
- }
- else
- {
- C[i]=1;
- }
- }
- int a=999;
- if (popa==1)
- {
- while (!from2)
- {
- a=999;
- R[N]=R[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (R[h]==10)
- {
- R[h-1]=R[h-1]+1;
- R[h]=0;
- }
- }
- for (int j=999; j>-1; j=j-1)
- {
- for (int i=999; i>-1; i=i-1)
- {
- multi=C[i]*D[j]+doping;
- doping=0;
- Rez1[a]=multi % 10;
- doping=multi / 10;
- a=a-1;
- }
- for (int g=999; g>-1; g=g-1)
- {
- m=Rez1[g]+Rez[g];
- Rez[g]=(Rez1[g]+Rez[g]) % 10;
- m=m/10;
- Rez[g-1]=Rez[g-1]+m;
- }
- a=j-1;
- doping=0;
- for (int y=0; y<1000; y=y+1)
- {
- Rez1[y]=0;
- }
- }
- for (int i=0; i<1000; i++)
- {
- C[i]=Rez[i];
- }
- for (int i=0; i<1000; i++)
- {
- Rez[i]=0;
- }
- for (int i=0; i<1000; i++)
- {
- if (R[i]!=Re1[i])
- {
- exit7=1;
- break;
- }
- }
- if (exit7==0)
- {
- for (int i=0; i<1000; i=i+1)
- {
- if (C[i]!=0)
- {
- gran=i;
- break;
- }
- }
- for (int j=gran; j<1000; j=j+1)
- {
- printf("%d", C[j]);
- }
- from2=true;
- }
- exit7=0;
- }
- }
- }
- void from_to()
- {
- if (minus1==1 && first==1 && minus2==1)
- {
- printf("-");
- for (int t=0;t<1000;t++)
- {
- Rez[t]=D[t];
- }
- int exit6=0;
- while (!from)
- {
- int N=999;
- D[N]=D[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (D[h]==10)
- {
- D[h-1]=D[h-1]+1;
- D[h]=0;
- }
- }
- for (int i=999; i>-1; i=i-1)
- {
- sum=Rez[i]+D[i];
- if (sum>9)
- {
- Rez[i]=sum % 10;
- Rez[i-1]=Rez[i-1]+1;
- }
- else
- {
- Rez[i]=sum;
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (D[i]!=C[i])
- {
- exit6=1;
- break;
- }
- }
- if (exit6==0)
- {
- for (int i=0; i<1000; i=i+1)
- {
- if (Rez[i]!=0)
- {
- gran=i;
- break;
- }
- }
- for (int j=gran; j<1000; j=j+1)
- {
- printf("%d", Rez[j]);
- }
- from=true;
- }
- exit6=0;
- }
- }
- if (first==0 && second==0 && minus1==1)
- {
- printf("0");
- }
- if (nol2==1)
- {
- printf("-");
- int Re1[1000];
- int Re[1000];
- bool from2=false;
- int exit7=0;
- for (int i=0; i<1000; i++)
- {
- Re[i]=C[i];
- }
- for (int i=0; i<1000; i++)
- {
- C[i]=0;
- }
- for (int i=0; i<1000; i++)
- {
- Re1[i]=0;
- }
- while (!from2)
- {
- int N=999;
- Re1[N]=Re1[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (Re1[h]==10)
- {
- Re1[h-1]=Re1[h-1]+1;
- Re1[h]=0;
- }
- }
- for (int i=999; i>-1; i=i-1)
- {
- sum=C[i]+Re1[i];
- if (sum>9)
- {
- C[i]=sum % 10;
- C[i-1]=C[i-1]+1;
- }
- else
- {
- C[i]=sum;
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (Re1[i]!=Re[i])
- {
- exit7=1;
- break;
- }
- }
- if (exit7==0)
- {
- for (int i=0; i<1000; i=i+1)
- {
- if (C[i]!=0)
- {
- gran=i;
- break;
- }
- }
- for (int j=gran; j<1000; j=j+1)
- {
- printf("%d", C[j]);
- }
- from2=true;
- }
- exit7=0;
- }
- first=0;
- }
- if (first==0 && minus1==0)
- {
- for (int t=0;t<1000;t++)
- {
- Rez[t]=C[t];
- }
- int exit6=0;
- while (!from)
- {
- int N=999;
- C[N]=C[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (C[h]==10)
- {
- C[h-1]=C[h-1]+1;
- C[h]=0;
- }
- }
- for (int i=999; i>-1; i=i-1)
- {
- sum=Rez[i]+C[i];
- if (sum>9)
- {
- Rez[i]=sum % 10;
- Rez[i-1]=Rez[i-1]+1;
- }
- else
- {
- Rez[i]=sum;
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (C[i]!=D[i])
- {
- exit6=1;
- break;
- }
- }
- if (exit6==0)
- {
- for (int i=0; i<1000; i=i+1)
- {
- if (Rez[i]!=0)
- {
- gran=i;
- break;
- }
- }
- for (int j=gran; j<1000; j=j+1)
- {
- printf("%d", Rez[j]);
- }
- from=true;
- }
- exit6=0;
- }
- }
- if (minus1==1 && first==1 && minus2==0)
- {
- printf("-");
- bool from1=false;
- int exit6=0;
- for (int i=0; i<1000; i++)
- {
- Rez[i]=C[i];
- }
- for (int i=0; i<1000; i++)
- {
- C[i]=0;
- }
- for (int i=0; i<1000; i++)
- {
- Rez1[i]=0;
- }
- while (!from1)
- {
- int N=999;
- Rez1[N]=Rez1[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (Rez1[h]==10)
- {
- Rez1[h-1]=Rez1[h-1]+1;
- Rez1[h]=0;
- }
- }
- for (int i=999; i>-1; i=i-1)
- {
- sum=C[i]+Rez1[i];
- if (sum>9)
- {
- C[i]=sum % 10;
- C[i-1]=C[i-1]+1;
- }
- else
- {
- C[i]=sum;
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (Rez1[i]!=Rez[i])
- {
- exit6=1;
- break;
- }
- }
- if (exit6==0)
- {
- from1=true;
- }
- exit6=0;
- }
- int Re1[1000];
- int Re[1000];
- bool from2=false;
- int exit7=0;
- for (int i=0; i<1000; i++)
- {
- Re[i]=D[i];
- }
- for (int i=0; i<1000; i++)
- {
- D[i]=0;
- }
- for (int i=0; i<1000; i++)
- {
- Re1[i]=0;
- }
- while (!from2)
- {
- int N=999;
- Re1[N]=Re1[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (Re1[h]==10)
- {
- Re1[h-1]=Re1[h-1]+1;
- Re1[h]=0;
- }
- }
- for (int i=999; i>-1; i=i-1)
- {
- sum=D[i]+Re1[i];
- if (sum>9)
- {
- D[i]=sum % 10;
- D[i-1]=D[i-1]+1;
- }
- else
- {
- D[i]=sum;
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (Re1[i]!=Re[i])
- {
- exit7=1;
- break;
- }
- }
- if (exit7==0)
- {
- from2=true;
- }
- exit7=0;
- }
- minus_a_b();
- }
- if (minus1==1 && second==1)
- {
- bool from1=false;
- int exit6=0;
- for (int i=0; i<1000; i++)
- {
- Rez[i]=C[i];
- }
- for (int i=0; i<1000; i++)
- {
- C[i]=0;
- }
- for (int i=0; i<1000; i++)
- {
- Rez1[i]=0;
- }
- while (!from1)
- {
- int N=999;
- Rez1[N]=Rez1[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (Rez1[h]==10)
- {
- Rez1[h-1]=Rez1[h-1]+1;
- Rez1[h]=0;
- }
- }
- for (int i=999; i>-1; i=i-1)
- {
- sum=C[i]+Rez1[i];
- if (sum>9)
- {
- C[i]=sum % 10;
- C[i-1]=C[i-1]+1;
- }
- else
- {
- C[i]=sum;
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (Rez1[i]!=Rez[i])
- {
- exit6=1;
- break;
- }
- }
- if (exit6==0)
- {
- from1=true;
- }
- exit6=0;
- }
- int Re1[1000];
- int Re[1000];
- bool from2=false;
- int exit7=0;
- for (int i=0; i<1000; i++)
- {
- Re[i]=D[i];
- }
- for (int i=0; i<1000; i++)
- {
- D[i]=0;
- }
- for (int i=0; i<1000; i++)
- {
- Re1[i]=0;
- }
- while (!from2)
- {
- int N=999;
- Re1[N]=Re1[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (Re1[h]==10)
- {
- Re1[h-1]=Re1[h-1]+1;
- Re1[h]=0;
- }
- }
- for (int i=999; i>-1; i=i-1)
- {
- sum=D[i]+Re1[i];
- if (sum>9)
- {
- D[i]=sum % 10;
- D[i-1]=D[i-1]+1;
- }
- else
- {
- D[i]=sum;
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (Re1[i]!=Re[i])
- {
- exit7=1;
- break;
- }
- }
- if (exit7==0)
- {
- from2=true;
- }
- exit7=0;
- }
- minus_b_a();
- }
- }
- void fact()
- {
- int exit7=0;
- int Re1[1000];
- int N=999;
- int Re[1000];
- doping=0;
- bool from2=false;
- if (nol1==1 || one==1)
- {
- printf("1");
- }
- for (int h=0; h<1000; h=h+1)
- {
- Rez[h]=0;
- }
- for (int i=0; i<1000; i++)
- {
- Re[i]=C[i];
- }
- for (int i=0; i<1000; i++)
- {
- if (i!=999)
- {
- C[i]=0;
- }
- else
- {
- C[i]=1;
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (i!=999)
- {
- D[i]=0;
- }
- else
- {
- D[i]=1;
- }
- }
- int a=999;
- while (!from2)
- {
- a=999;
- D[N]=D[N]+1;
- for (int h=999; h>-1; h=h-1)
- {
- if (D[h]==10)
- {
- D[h-1]=D[h-1]+1;
- D[h]=0;
- }
- }
- for (int j=999; j>-1; j=j-1)
- {
- for (int i=999; i>-1; i=i-1)
- {
- multi=C[i]*D[j]+doping;
- doping=0;
- Rez1[a]=multi % 10;
- doping=multi / 10;
- a=a-1;
- }
- for (int g=999; g>-1; g=g-1)
- {
- m=Rez1[g]+Rez[g];
- Rez[g]=(Rez1[g]+Rez[g]) % 10;
- m=m/10;
- Rez[g-1]=Rez[g-1]+m;
- }
- a=j-1;
- doping=0;
- for (int y=0; y<1000; y=y+1)
- {
- Rez1[y]=0;
- }
- }
- for (int i=0; i<1000; i++)
- {
- C[i]=Rez[i];
- }
- for (int i=0; i<1000; i++)
- {
- Rez[i]=0;
- }
- for (int i=0; i<1000; i++)
- {
- if (D[i]!=Re[i])
- {
- exit7=1;
- break;
- }
- }
- if (exit7==0)
- {
- for (int i=0; i<1000; i=i+1)
- {
- if (C[i]!=0)
- {
- gran=i;
- break;
- }
- }
- for (int j=gran; j<1000; j=j+1)
- {
- printf("%d", C[j]);
- }
- from2=true;
- }
- exit7=0;
- }
- }
- void main()
- {
- printf("Enter number:");
- while (!exit1)
- {
- if (_kbhit())
- {
- switch(_getch())
- {
- case '-':
- minus1=1;
- printf("-");
- break;
- case '0':
- A[i]=0;
- i=i+1;
- end1=end1+1;
- printf("0");
- break;
- case '1':
- A[i]=1;
- i=i+1;
- end1=end1+1;
- printf("1");
- break;
- case '2':
- A[i]=2;
- i=i+1;
- end1=end1+1;
- printf("2");
- break;
- case '3':
- A[i]=3;
- i=i+1;
- end1=end1+1;
- printf("3");
- break;
- case '4':
- A[i]=4;
- i=i+1;
- end1=end1+1;
- printf("4");
- break;
- case '5':
- A[i]=5;
- i=i+1;
- end1=end1+1;
- printf("5");
- break;
- case '6':
- A[i]=6;
- i=i+1;
- end1=end1+1;
- printf("6");
- break;
- case '7':
- A[i]=7;
- i=i+1;
- end1=end1+1;
- printf("7");
- break;
- case '8':
- A[i]=8;
- i=i+1;
- end1=end1+1;
- printf("8");
- break;
- case '9':
- A[i]=9;
- i=i+1;
- end1=end1+1;
- printf("9");
- break;
- case 'x':
- exit1=true;
- break;
- }
- }
- }
- printf(" ");
- i=0;
- while (!exit2)
- {
- if (_kbhit())
- {
- switch(_getch())
- {
- case '-':
- minus2=1;
- printf("-");
- break;
- case '0':
- B[i]=0;
- i=i+1;
- end2=end2+1;
- printf("0");
- break;
- case '1':
- B[i]=1;
- i=i+1;
- end2=end2+1;
- printf("1");
- break;
- case '2':
- B[i]=2;
- i=i+1;
- end2=end2+1;
- printf("2");
- break;
- case '3':
- B[i]=3;
- i=i+1;
- end2=end2+1;
- printf("3");
- break;
- case '4':
- B[i]=4;
- i=i+1;
- end2=end2+1;
- printf("4");
- break;
- case '5':
- B[i]=5;
- i=i+1;
- end2=end2+1;
- printf("5");
- break;
- case '6':
- B[i]=6;
- i=i+1;
- end2=end2+1;
- printf("6");
- break;
- case '7':
- B[i]=7;
- i=i+1;
- end2=end2+1;
- printf("7");
- break;
- case '8':
- B[i]=8;
- i=i+1;
- end2=end2+1;
- printf("8");
- break;
- case '9':
- B[i]=9;
- i=i+1;
- end2=end2+1;
- printf("9");
- break;
- case 'x':
- exit2=true;
- break;
- }
- }
- }
- for (int i=0; i<1000; i++)
- {
- if (i>end1-1)
- {
- A[i]=0;
- nul1=nul1+1;
- }
- if (i>end2-1)
- {
- B[i]=0;
- nul2=nul2+1;
- }
- }
- for (int i=0; i<1000; i=i+1)
- {
- if (i<nul1)
- {
- C[i]=0;
- }
- else
- {
- C[i]=A[a];
- a=a+1;
- }
- }
- a=0;
- for (int i=0; i<1000; i=i+1)
- {
- if (i<nul2)
- {
- D[i]=0;
- }
- else
- {
- D[i]=B[a];
- a=a+1;
- }
- }
- comp();
- printf("\n");
- printf("choose (s - sum, d - diff, m - multiply, p - pow, f - factorial, r - sum between a and b):");
- scanf("%c", &intr);
- printf("\n");
- switch(intr)
- {
- case 's':
- summa();
- break;
- case 'd':
- diff();
- break;
- case 'm':
- mult();
- break;
- case 'p':
- pow();
- break;
- case 'r':
- from_to();
- break;
- case 'f':
- fact();
- break;
- }
- _getch();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement