forked from kothariji/competitive-programming
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path066. The Child and Homework.cpp
81 lines (75 loc) · 1.2 KB
/
066. The Child and Homework.cpp
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
#include <bits/stdc++.h>
#define lli long long int
#define endl "\n"
using namespace std;
int main()
{
string a,b,c,d;
cin>>a>>b>>c>>d;
int lena = a.length()-2;
int lenb = b.length()-2;
int lenc = c.length()-2;
int lend = d.length()-2;
int flag = 0;
char ans;
if(lena >= lenb*2)
if(lena >= lenc*2)
if(lena >= lend*2)
{
flag++;
ans = 'A';
}
if(lenb >= lena*2)
if(lenb >= lenc*2)
if(lenb >= lend*2)
{
flag++;
ans = 'B';
}
if(lenc >= lenb*2)
if(lenc >= lena*2)
if(lenc >= lend*2)
{
flag++;
ans = 'C';
}
if(lend >= lenb*2)
if(lend >= lenc*2)
if(lend >= lena*2)
{
flag++;
ans = 'D';
}
if(2*lena <= lenb)
if(2*lena <= lenc)
if(2*lena <= lend)
{
flag++;
ans = 'A';
}
if(2*lenb <= lena)
if(2*lenb <= lenc)
if(2*lenb <= lend)
{
flag++;
ans = 'B';
}
if(2*lenc <= lena)
if(2*lenc <= lenb)
if(2*lenc <= lend)
{
flag++;
ans = 'C';
}
if(2*lend <= lena)
if(2*lend <= lenb)
if(2*lend <= lenc)
{
flag++;
ans = 'D';
}
if(flag == 1)
cout<<ans;
else
cout<<"C";
}