Codeforces-Problems-Solution/102152D.cpp at master · abufarhad/Codeforces-Problems-Solution · 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
//! Bismillahi-Rahamanirahim.
/** ========================================**
 ** @Author: Md. Abu Farhad ( RUET, CSE'15)
 ** @Category:
/** ========================================**/

#include<bits/stdc++.h>
#include<stdio.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;

#define ll                  long long
#define scl(n)              scanf("%lld",&n)
#define scll(n, m)              scanf("%lld%lld",&n, &m)
#define scc(c)	            scanf("%c",&c)
#define fr(i,n)             for (ll i=0;i<n;i++)
#define fr1(i,n)            for(ll i=1;i<=n;i++)
#define pfl(x)              printf("%lld\n",x)
#define pb                  push_back
#define debug               cout<<"I am here"<<endl;
#define pno                 cout<<"NO"<<endl
#define pys                 cout<<"YES"<<endl
#define tcas(i,t)           for(ll i=1;i<=t;i++)


int main()
{
    ll t;
    cin>>t;
    tcas(cs, t)
    {
    ll m,n,b,c,d,i,j,k,x,y,z,l,q,r;
    string s[5], ans;

    fr(i, 3)cin>>s[i];
    ll one[10];
    ll ttal=0, extra=0, nai=0;

    fr(j, 10)
    {
        ll cnt=0;
        fr(i, 3)if(s[i][j] =='1'  )cnt++, ttal++;
        one[j]=cnt;
    }

    fr(i, 10)ans+='1';


    if(ttal>=10)
    {
        ll baki=abs(10-ttal);
        ll tmp=baki/2;

        if(baki%2)ans[9]='0';
    }
    else
    {
        ll baki=10-ttal;
        i=9;
        while(baki>0)
        {
            ans[i]='0'; baki--;
            i--;
        }
    }

    cout<<ans<<endl;
    }

return 0;
}

/*
3
1111110000
1001001110
0100001001
*/

///***************Before submit*****************

///    ****Please check all base case output***
///    *check for integer overflow,array bounds
///    *check for n=1