fork(2) download

copy

#include<bits/stdc++.h>
//#include<conio.h>
//#define s(x) scanf("%d",&(x))
#define print(x) printf("%d ",x)
#define printnl(x) printf("%d\n",x);
#define fi(i,a,b) for(int i=(a);i<(b);i++)
#define forD(i,a,b) for(int i=(a);i>(b);--i)
#define MOD 1000000009
#define INF_LONG 8999999999999999999
#define llu  long long unsigned
#define FOUND 1
#define NOTFOUND 0
#define MAXSIZE 10000
#define pb push_back
using namespace::std;
 
typedef vector <int> vi;
typedef vector<vi> vvi;
typedef pair < int, int > ii;
typedef vector < ii > vii;
typedef vector <vii> vvii;
//int getch()
//{
//    
//}
int main()
{
    int t = 10, i = 0, j = 0, k = 0;
    char c;
   while(t-- >= 1)
   {
    i = 0, j = 0, k = 0;
    vi s(101, 0);
    vi d(101, 0);
    //p = s+d ; q = s-q
    vi p;
    vi q;
 
    while((c = getch()) != 13)
        s[i++] = c - 48;
 
    while((c = getch()) != 13)
        d[j++] = c - 48;
 
        int ssize = i--; // i = # elements in s -1
        int dsize = j--; // j = # elements in d -1
//        cout<<"\n total apples are :\t";
//        for(int x = 0 ; x <= i ; ++x)
//            cout<<s[x];
//        cout<<endl;
//         cout<<"\n difference of apples is :\t";
//        for(int x = 0 ; x <= j ; ++x)
//            cout<<d[x];
//        cout<<endl;
 
// s + d = 2P
p = vi(ssize+1, 0);
q = vi(ssize, 0);
    for(i; i >=0 && j>=0 ; --i, --j)
    {
        p[i+1] = (s[i] + d[j] + k) %10;
        k = (s[i] + d[j] + k)/10;
    }
    while(i >= 0)
    {
        p[i+1] = (s[i] + k)%10;
        k = (s[i--] + k)/10;
    }
    p[i+1] = k;
    /**now 2p stands created, lets halve it 2 find # apples a has**/
    for(i = 0; i < p.size(); i++)
    {
        if(p[i]%2)  p[i+1] += 10;
        p[i] /= 2;
    }
    /**lets create q**/
    for(i = ssize -1, j = dsize-1 ; i >=0 && j >=0 ; i--, j--)
    {/**#############$@@@@@@@@@@@@@@!!@@@##$$$$$$$$$**/
        if(s[i] >= d[j])        q[i] = s[i] - d[j];
        else {
                q[i] = s[i] - d[j] +10;
                s[i-1] -= 1;
                }
    }
    while(i >= 0)
    {
        if(s[i] >=0)
        q[i] = s[i];
        else
        {
            q[i] = 0;
            s[i-1] -=1;
        }
        i--;
    }
    /**now 2q stands created, lets halve it 2 find # apples a has**/
    for(i = 0; i < q.size(); i++)
    {
        if(q[i]%2)  q[i+1] += 10;
        q[i] /= 2;
    }
//for(auto it : p)
//     cout<<it;cout<<endl;
//for(auto it : q)cout<<it;
    int flag = 0;
    i = 0;
    //lets print # apples a has
//    cout<<"\n # apples with a :\t";
    while(i <p.size() && p[i] == 0)    ++i;
    while(i <p.size())
        {
            cout<<p[i++];
            flag = 1;
        }
    if(!flag) cout<<"0";
    cout<<endl;
 
    flag =0;
    j = 0;
//    cout<<"\n # apples with b :\t";
    while(j < q.size() && q[j] == 0)    ++j;
 
   while(j < q.size())
    {
        cout<<q[j++];
        flag = 1;
    }
    if(!flag) cout<<"0";
    cout<<endl;
   }
    return 0;
}
 

prog.cpp: In function ‘int main()’:
prog.cpp:39:22: error: ‘getch’ was not declared in this scope
     while((c = getch()) != 13)
                      ^
prog.cpp:42:22: error: ‘getch’ was not declared in this scope
     while((c = getch()) != 13)
                      ^
prog.cpp:59:10: warning: statement has no effect [-Wunused-value]
     for(i; i >=0 && j>=0 ; --i, --j)
          ^
prog.cpp:71:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i = 0; i < p.size(); i++)
                           ^
prog.cpp:97:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i = 0; i < q.size(); i++)
                           ^
prog.cpp:109:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(i <p.size() && p[i] == 0)    ++i;
                     ^
prog.cpp:110:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(i <p.size())
                     ^
prog.cpp:121:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(j < q.size() && q[j] == 0)    ++j;
                      ^
prog.cpp:123:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(j < q.size())
                     ^

Standard output is empty