description stringlengths 116 4.23k | code stringlengths 9 53.6k | sample_inputs stringlengths 0 914 | sample_outputs stringlengths 0 1.33k | normalized_code stringlengths 25 86.1k |
|---|---|---|---|---|
Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone num... | print(min(int(input()) // 11, input().count("8"))) | 22
0011223344556677889988
11
00000000008
11
31415926535
| 2
1
0
| EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL FUNC_CALL VAR STRING |
Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone num... | n=int(input());m=input();a=m.count('8');k=n//11;print(min(a,k)) | 22
0011223344556677889988
11
00000000008
11
31415926535
| 2
1
0
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING ASSIGN VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR FUNC_CALL VAR VAR VAR |
Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone num... | print(min(int(input()) // 11, list(map(int, input())).count(8))) | 22
0011223344556677889988
11
00000000008
11
31415926535
| 2
1
0
| EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR NUMBER |
Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone num... | print(min(int(input())//11,input().count('8'))) | 22
0011223344556677889988
11
00000000008
11
31415926535
| 2
1
0
| EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL FUNC_CALL VAR STRING |
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Recall that a number x belongs to segment [l, r] if l ≤ x ≤ r.
Input
The first line c... | for _ in[0]*int(input()):p,q,r=map(int,input().split());print((r>=p)*q//r*r+r) | 5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5
| 6
4
1
3
10
| FOR VAR BIN_OP LIST NUMBER FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP BIN_OP VAR VAR VAR VAR VAR VAR |
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Recall that a number x belongs to segment [l, r] if l ≤ x ≤ r.
Input
The first line c... | for _ in[0]*int(input()):l,r,v=map(int,input().split());print((v>=l)*r//v*v+v) | 5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5
| 6
4
1
3
10
| FOR VAR BIN_OP LIST NUMBER FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP BIN_OP VAR VAR VAR VAR VAR VAR |
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Recall that a number x belongs to segment [l, r] if l ≤ x ≤ r.
Input
The first line c... | for _ in[0]*int(input()):l,r,d=map(int,input().split());print((-(r+1)//d*-d,d)[d<l]) | 5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5
| 6
4
1
3
10
| FOR VAR BIN_OP LIST NUMBER FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR NUMBER VAR VAR VAR VAR VAR |
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Recall that a number x belongs to segment [l, r] if l ≤ x ≤ r.
Input
The first line c... | for _ in[0]*int(input()):l,r,d=map(int,input().split());print((d>=l)*r//d*d+d) | 5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5
| 6
4
1
3
10
| FOR VAR BIN_OP LIST NUMBER FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP BIN_OP VAR VAR VAR VAR VAR VAR |
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Recall that a number x belongs to segment [l, r] if l ≤ x ≤ r.
Input
The first line c... | for _ in[0]*int(input()):l,r,d=map(int,input().split());print(d*(r//d+1,1)[d<l]) | 5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5
| 6
4
1
3
10
| FOR VAR BIN_OP LIST NUMBER FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP VAR BIN_OP BIN_OP VAR VAR NUMBER NUMBER VAR VAR |
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Recall that a number x belongs to segment [l, r] if l ≤ x ≤ r.
Input
The first line c... | for i in [0]*int(input()): l,r,d=map(int,input().split());print((d>=l)*(r//d)*d+d) | 5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5
| 6
4
1
3
10
| FOR VAR BIN_OP LIST NUMBER FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR VAR BIN_OP VAR VAR VAR VAR |
You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i + 1}).
Find three indices i, j, k such that 1 ≤ i < j < k ≤ n and it is impossible to construct a non-degenerate triangle (a triangle with nonzero area) having sides equal to a_i, a_j and a_k (for example it is possible to ... | for _ in range(int(input())): i,a=int(input()),list(map(int,input().split())) [print('1 2 {}'.format(str(i)) if a[0]+a[1]<=a[i-1] else '-1')] | 3
7
4 6 11 11 15 18 20
4
10 10 10 11
3
1 1 1000000000
| 1 2 7
-1
1 2 3
| FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER VAR NUMBER VAR BIN_OP VAR NUMBER FUNC_CALL STRING FUNC_CALL VAR VAR STRING |
You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i + 1}).
Find three indices i, j, k such that 1 ≤ i < j < k ≤ n and it is impossible to construct a non-degenerate triangle (a triangle with nonzero area) having sides equal to a_i, a_j and a_k (for example it is possible to ... | for s in[*open(0)][2::2]:x,y,*a,z=map(int,s.split());print(*([1,2,len(a)+3],[-1])[x+y>z]) | 3
7
4 6 11 11 15 18 20
4
10 10 10 11
3
1 1 1000000000
| 1 2 7
-1
1 2 3
| FOR VAR LIST FUNC_CALL VAR NUMBER NUMBER NUMBER ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR EXPR FUNC_CALL VAR LIST NUMBER NUMBER BIN_OP FUNC_CALL VAR VAR NUMBER LIST NUMBER BIN_OP VAR VAR VAR |
You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i + 1}).
Find three indices i, j, k such that 1 ≤ i < j < k ≤ n and it is impossible to construct a non-degenerate triangle (a triangle with nonzero area) having sides equal to a_i, a_j and a_k (for example it is possible to ... | [(lambda N,n:print('1 2 %d'%N if n[0]+n[1]<=n[N-1]else-1))(int(input()),list(map(int,input().split())))for t in range(int(input()))] | 3
7
4 6 11 11 15 18 20
4
10 10 10 11
3
1 1 1000000000
| 1 2 7
-1
1 2 3
| EXPR FUNC_CALL FUNC_CALL VAR BIN_OP VAR NUMBER VAR NUMBER VAR BIN_OP VAR NUMBER BIN_OP STRING VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR |
You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i + 1}).
Find three indices i, j, k such that 1 ≤ i < j < k ≤ n and it is impossible to construct a non-degenerate triangle (a triangle with nonzero area) having sides equal to a_i, a_j and a_k (for example it is possible to ... | for _ in range(int(input())):n,a = int(input()),list(map(int,input().split()));print(1,2,n) if a[0]+a[1] <= a[-1] else print(-1) | 3
7
4 6 11 11 15 18 20
4
10 10 10 11
3
1 1 1000000000
| 1 2 7
-1
1 2 3
| FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR BIN_OP VAR NUMBER VAR NUMBER VAR NUMBER FUNC_CALL VAR NUMBER NUMBER VAR FUNC_CALL VAR NUMBER |
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizards and aren't going to go to the demonstration. We know that the city administra... | n,x,y=map(int,input().split());print(max(0, -((100 * x - n * y) // 100))) | 1000 352 146
10 1 14
20 10 50
| 1108
1
0
| ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR NUMBER BIN_OP BIN_OP BIN_OP NUMBER VAR BIN_OP VAR VAR NUMBER |
There are n cows playing poker at a table. For the current betting phase, each player's status is either "ALLIN", "IN", or "FOLDED", and does not change throughout the phase. To increase the suspense, a player whose current status is not "FOLDED" may show his/her hand to the table. However, so as not to affect any bett... | i=input;i();p=i();print([[1,0],[p.count("A")]][p.count("I")==0][p.count("I")>1]) | 3
AFI
6
AFFAAA
| 14 | ASSIGN VAR VAR EXPR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR LIST LIST NUMBER NUMBER LIST FUNC_CALL VAR STRING FUNC_CALL VAR STRING NUMBER FUNC_CALL VAR STRING NUMBER |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | a,b=map(int,input().split());print(a+(a-1)//(b-1)) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP VAR BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | a, b = map(int,input().split()); print((b*a-1)//(b-1)) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR VAR NUMBER BIN_OP VAR NUMBER |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | c,b=map(int,input().split());print((c*b-1)//(b-1)) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR VAR NUMBER BIN_OP VAR NUMBER |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | a,b=map(int,input().split());d=lambda v:v//b and v//b+d(v//b+v%b);print(d(a*b)) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP VAR VAR BIN_OP BIN_OP VAR VAR FUNC_CALL VAR BIN_OP BIN_OP VAR VAR BIN_OP VAR VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | a,b=map(int,input().split());print((a*b-1)//(b-1)) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR VAR NUMBER BIN_OP VAR NUMBER |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | s,n=map(int,input().split());print((s-1)//(n-1)+s) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER VAR |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | a,b=map(int,input().split(' ')); print((a*b-1)//(b-1)) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR VAR NUMBER BIN_OP VAR NUMBER |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | m,n = map(int, input().split());print(m + (m-1)//(n-1)) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP VAR BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER |
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like ... | a,b=map(int,input().split());print((a-1)//(b-1)+a) | 4 2
6 3
| 7
8
| ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER VAR |
A and B are preparing themselves for programming contests.
B loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.
Initially, the compiler displayed n compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix som... | num_error = int(input()); sum1 = sum(map(int, input().split(' '))); sum2 = sum(map(int, input().split(' '))); sum3 = sum(map(int, input().split(' '))); print(sum1 - sum2); print(sum2 - sum3); | 6
1 4 3 3 5 7
3 7 5 4 3
4 3 7 5
5
1 5 8 123 7
123 7 5 1
5 1 7
| 1
3
8
123
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING EXPR FUNC_CALL VAR BIN_OP VAR VAR EXPR FUNC_CALL VAR BIN_OP... |
A and B are preparing themselves for programming contests.
B loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.
Initially, the compiler displayed n compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix som... | a,b,c,d=input(),sum(map(int,input().split())),sum(map(int,input().split())),sum(map(int,input().split()));print(str(b-c)+'\n'+str(c-d)) | 6
1 4 3 3 5 7
3 7 5 4 3
4 3 7 5
5
1 5 8 123 7
123 7 5 1
5 1 7
| 1
3
8
123
| ASSIGN VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP FUNC_CALL VAR BIN_OP VAR VAR STRING FUNC_CALL VAR BIN_OP VAR VAR |
A and B are preparing themselves for programming contests.
B loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.
Initially, the compiler displayed n compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix som... | x,y,z,t = [sum(map(int,input().split()))for _ in " "*4];print(y-z,z-t) | 6
1 4 3 3 5 7
3 7 5 4 3
4 3 7 5
5
1 5 8 123 7
123 7 5 1
5 1 7
| 1
3
8
123
| ASSIGN VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR VAR BIN_OP STRING NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR VAR |
A and B are preparing themselves for programming contests.
B loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.
Initially, the compiler displayed n compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix som... | n,a,b,c = [sum(map(int,input().split()))for _ in ' '*4];print(a-b,b-c) | 6
1 4 3 3 5 7
3 7 5 4 3
4 3 7 5
5
1 5 8 123 7
123 7 5 1
5 1 7
| 1
3
8
123
| ASSIGN VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR VAR BIN_OP STRING NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR VAR |
A and B are preparing themselves for programming contests.
B loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.
Initially, the compiler displayed n compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix som... | z=lambda:sum(map(int,input().split()));z();x=z();c=z();d=z();print(x-c,"\n",c-d) | 6
1 4 3 3 5 7
3 7 5 4 3
4 3 7 5
5
1 5 8 123 7
123 7 5 1
5 1 7
| 1
3
8
123
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP VAR VAR STRING BIN_OP VAR VAR |
A and B are preparing themselves for programming contests.
B loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.
Initially, the compiler displayed n compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix som... | input(); a,b,c=eval("sum(map(int, input().split())),"*3);print(a-b, b-c,sep='\n') | 6
1 4 3 3 5 7
3 7 5 4 3
4 3 7 5
5
1 5 8 123 7
123 7 5 1
5 1 7
| 1
3
8
123
| EXPR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR BIN_OP STRING NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR VAR STRING |
A and B are preparing themselves for programming contests.
B loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.
Initially, the compiler displayed n compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix som... | z=lambda:sum(map(int,input().split()));z();x=z();c=z();d=z();print(x-c,c-d) | 6
1 4 3 3 5 7
3 7 5 4 3
4 3 7 5
5
1 5 8 123 7
123 7 5 1
5 1 7
| 1
3
8
123
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR VAR |
Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off. There are n buttons, each of them is connected to some set of bulbs. Vasya can press any of these buttons. When the button is pressed, it turns on all the bulbs it's connected to. Can Vasya light up all the bulbs?
If Vas... | n=set();a,b=map(int,input().split());[n.update(map(int,input().split()[1:])) for i in " "*a];print("NYOE S"[len(n)==b::2]) | 3 4
2 1 4
3 1 3 1
1 2
3 3
1 1
1 2
1 1
| YES
NO
| ASSIGN VAR FUNC_CALL VAR ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR NUMBER VAR BIN_OP STRING VAR EXPR FUNC_CALL VAR STRING FUNC_CALL VAR VAR VAR NUMBER |
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of length exactly ai each hour. Luba can't water any parts of the garden that were already watered, also she can't water the gro... | a=lambda:map(int,input().split());b,c=a();print(min(c//i for i in sorted(list(a()),reverse=True) if c%i==0)) | 3 6
2 3 5
6 7
1 2 3 4 5 6
| 2
7
| ASSIGN VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER BIN_OP VAR VAR NUMBER |
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of length exactly ai each hour. Luba can't water any parts of the garden that were already watered, also she can't water the gro... | i=lambda:map(int,input().split());_,k=i();print(min(k//x for x in i()if k%x<1)) | 3 6
2 3 5
6 7
1 2 3 4 5 6
| 2
7
| ASSIGN VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR VAR FUNC_CALL VAR BIN_OP VAR VAR NUMBER |
You and your friend are participating in a TV show "Run For Your Prize".
At the start of the show n prizes are located on a straight line. i-th prize is located at position ai. Positions of all prizes are distinct. You start at position 1, your friend — at position 106 (and there is no prize in any of these two positio... | input();print(max([min(i-1,10**6-i) for i in map(int,input().split())])) | 2
2 999995
3
2 3 9
| 5
8
| EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER BIN_OP BIN_OP NUMBER NUMBER VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
You and your friend are participating in a TV show "Run For Your Prize".
At the start of the show n prizes are located on a straight line. i-th prize is located at position ai. Positions of all prizes are distinct. You start at position 1, your friend — at position 106 (and there is no prize in any of these two positio... | input(); print(max(min(x - 1, 1000000 - x) for x in map(int, input().split()))) | 2
2 999995
3
2 3 9
| 5
8
| EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER BIN_OP NUMBER VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.
The problem has N test cases.
For each test case i (1\leq i \leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is `AC`, `... | _,*a=open(0);[print(x,"x",a.count(x+"\n"))for x in["AC","WA","TLE","RE"]] | 6
AC
TLE
AC
AC
WA
TLE10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC | AC x 3
WA x 1
TLE x 2
RE x 0AC x 10
WA x 0
TLE x 0
RE x 0 | ASSIGN VAR VAR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR VAR STRING FUNC_CALL VAR BIN_OP VAR STRING VAR LIST STRING STRING STRING STRING |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,_,b,*c=input();print(-(len(c)>0)or int(a)*int(b)) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR VAR VAR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,b=map(int,input().split());print([a*b,-1][a>9 or b>9]) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR LIST BIN_OP VAR VAR NUMBER VAR NUMBER VAR NUMBER |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,_,b,*c=input();print(-(c!=[])or int(a)*int(b)) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR VAR VAR FUNC_CALL VAR EXPR FUNC_CALL VAR VAR LIST BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,b=map(int,input().split());print(-1 if a>9 or b>9 else a*b) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR VAR NUMBER VAR NUMBER NUMBER BIN_OP VAR VAR |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a, b = map(int, input().split());print(a * b) if max(a, b) <= 9 else print(-1) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR VAR VAR NUMBER FUNC_CALL VAR BIN_OP VAR VAR FUNC_CALL VAR NUMBER |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,b=map(int,input().split());print(a*b if a-9<1and b-9<1else-1) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP VAR NUMBER NUMBER BIN_OP VAR NUMBER NUMBER BIN_OP VAR VAR NUMBER |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,b=map(int,input().split());print(a*b if a<10 and b<10 else -1) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR VAR NUMBER VAR NUMBER BIN_OP VAR VAR NUMBER |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,b=map(int,input().split());print(-1 if max(a,b)>9 else a*b) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR VAR VAR NUMBER NUMBER BIN_OP VAR VAR |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,b=map(int,input().split());print(a*b if a<=9 and b<=9 else -1) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR VAR NUMBER VAR NUMBER BIN_OP VAR VAR NUMBER |
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takahashi can calculate A \times B, print the result; if he cannot, print `-1` instead.
Constraints
* 1 \leq A \leq 20
* 1 \leq B \leq... | a,_,b,*c=input();print(-(c>[])or int(a)*int(b)) | 2 59 95 10 | 1081-1 | ASSIGN VAR VAR VAR VAR FUNC_CALL VAR EXPR FUNC_CALL VAR VAR LIST BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR |
Ringo Mart, a convenience store, sells apple juice.
On the opening day of Ringo Mart, there were A cans of juice in stock in the morning. Snuke buys B cans of juice here every day in the daytime. Then, the manager checks the number of cans of juice remaining in stock every night. If there are C or less cans, D new cans... | from fractions import*;exec("a,b,c,d=map(int,input().split());g=gcd(b,d);print('YNeos'[b>min(a,d)or b-g+a%g>c::2]);"*int(input())) | 24
1 2 3 4
1 2 4 3
1 3 2 4
1 3 4 2
1 4 2 3
1 4 3 2
2 1 3 4
2 1 4 3
2 3 1 4
2 3 4 1
2 4 1 3
2 4 3 1
3 1 2 4
3 1 4 2
3 2 1 4
3 2 4 1
3 4 1 2
3 4 2 1
4 1 2 3
4 1 3 2
4 2 1 3
4 2 3 1
4 3 1 2
4 3 2 114
9 7 5 9
9 7 6 9
14 10 7 12
14 10 8 12
14 10 9 12
14 10 7 11
14 10 8 11
14 10 9 11
9 10 5 10
10 10 5 10
11 10 5 10
16 10 5 1... | No
No
No
No
No
No
Yes
Yes
No
No
No
No
Yes
Yes
Yes
No
No
No
Yes
Yes
Yes
No
No
NoNo
Yes
No
Yes
Yes
No
No
Yes
No
Yes
Yes
No
No
Yes | EXPR FUNC_CALL VAR BIN_OP STRING FUNC_CALL VAR FUNC_CALL VAR |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print("Odd" if sum([int(i) % 2 for i in input().split()])==2 else "Even") | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL FUNC_CALL VAR NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print(["Even","Odd"][a*b%2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR LIST STRING STRING BIN_OP BIN_OP VAR VAR NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print(['Even', 'Odd'][eval(input().replace(' ', '*')) % 2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR LIST STRING STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print("EOvdedn"[a*b%2::2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP BIN_OP VAR VAR NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print("Even" if eval(input().replace(" ","*"))%2==0 else "Odd") | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a, b = map(int, input().split()); print('Even') if a*b%2 == 0 else print('Odd') | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR BIN_OP BIN_OP VAR VAR NUMBER NUMBER FUNC_CALL VAR STRING FUNC_CALL VAR STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print("EOvdedn"[eval(input().replace(" ","*"))%2::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print('EOvdedn'[a%2 and b%2::2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP VAR NUMBER BIN_OP VAR NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | s=input();print('OEdvde n'['0'in s or'4'in s::2]) | 3 41 21 | EvenOdd | ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING STRING VAR STRING VAR NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print("Odd" if (a*b)%2 else "Even") | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP VAR VAR NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('EOvdedn'[eval(input().replace(' ','*')+'%2')::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING FUNC_CALL VAR BIN_OP FUNC_CALL FUNC_CALL VAR STRING STRING STRING NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print("Odd" if all(map(lambda x:int(x)%2, input().split())) else "Even") | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL FUNC_CALL VAR STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('EOvdedn'[sum(s in'04'for s in input())<1::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING FUNC_CALL VAR VAR STRING VAR FUNC_CALL VAR NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print("Odd" if all([int(e) & 1 for e in input().strip().split()]) else "Even") | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('EOvdedn'[eval(input().replace(' ','*'))%2==1::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('Odd' if eval(input().replace(' ','*'))%2 == 1 else 'Even') | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('Even'if[i for i in input().split() if int(i)%2==0]else'Odd') | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print('EOvdedn'[a*b%2!=0::2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP BIN_OP VAR VAR NUMBER NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split()) [print("Even") if a*b%2==0 else print("Odd")] | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR BIN_OP BIN_OP VAR VAR NUMBER NUMBER FUNC_CALL VAR STRING FUNC_CALL VAR STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print('Even' if a*b%2==0 else 'Odd') | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP VAR VAR NUMBER NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('Even' if any(n % 2 == 0 for n in map(int, input().split())) else 'Odd') | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER NUMBER VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print(['Even','Odd'][a*b%2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR LIST STRING STRING BIN_OP BIN_OP VAR VAR NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print(('Even','Odd')[eval(input().replace(' ','*'))%2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('Even' if eval(input().replace(' ', '*')+'%2==0') else 'Odd') | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL FUNC_CALL VAR STRING STRING STRING STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('Even' if eval(input().replace(' ', '*')) % 2 == 0 else 'Odd') | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print("Odd" if eval(input().replace(" ", "*")) % 2 else "Even") | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a, b = map(int, input().split());print(['Even','Odd'][(a*b)%2>0]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR LIST STRING STRING BIN_OP BIN_OP VAR VAR NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | x,y = map(int,input().split()); print('Even') if x*y%2==0 else print('Odd') | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR BIN_OP BIN_OP VAR VAR NUMBER NUMBER FUNC_CALL VAR STRING FUNC_CALL VAR STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print(['Even','Odd'][max(0,sum(map(lambda x:int(x)%2,input().split()))-1)]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR LIST STRING STRING FUNC_CALL VAR NUMBER BIN_OP FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL FUNC_CALL VAR NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('EOvdedn'[eval(input().replace(*' *'))%2::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('Odd' if eval(input().replace(' ','*'))%2 else 'Even') | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print("Odd"if all([int(i)%2for i in input().split()])else"Even") | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL FUNC_CALL VAR STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print("EOvdedn"[a*b%2==1::2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP BIN_OP VAR VAR NUMBER NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print(["Odd","Even"][eval(input().replace(" ","*"))%2==0]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR LIST STRING STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('EOvdedn'[eval(input().replace(' ','*'))%2::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print(("Even","Odd")[eval(input().replace(" ","*"))%2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print("EOvdedn"[a*b%2>0::2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP BIN_OP VAR VAR NUMBER NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print(["Even","Odd"][eval(input().replace(" ", "*"))%2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR LIST STRING STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('OEdvde n'[any(s in'04'for s in input())::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING FUNC_CALL VAR VAR STRING VAR FUNC_CALL VAR NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('EOvdedn'[eval(input().replace(' ','*'))%2!=0::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=input().split();print('EOvdedn'[eval(a+'*'+b)%2!=0::2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR BIN_OP BIN_OP VAR STRING VAR NUMBER NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | a,b=map(int,input().split());print('EOvdedn'[a*b%2::2]) | 3 41 21 | EvenOdd | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP BIN_OP VAR VAR NUMBER NUMBER |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('Odd' if eval(input().replace(' ','*'))%2!=0 else 'Even') | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('Odd' if eval(input().replace(" ",'*'))%2 else 'Even') | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER STRING STRING |
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.
Constraints
* 1 ≤ a,b ≤ 10000
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
If the product is odd, print `Odd`; if it is even, print `Even`.
Examples
In... | print('EOvdedn'[(eval(input().replace(' ','*')))%2==1::2]) | 3 41 21 | EvenOdd | EXPR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER NUMBER NUMBER |
Two students of AtCoder Kindergarten are fighting over candy packs.
There are three candy packs, each of which contains a, b, and c candies, respectively.
Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.
Note t... | a,b,c=map(int,input().split());print('YNeos'[a+b!=c!=abs(a-b)::2]) | 56 25 3110 30 2030 30 100 | YesYesNo | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP VAR VAR VAR FUNC_CALL VAR BIN_OP VAR VAR NUMBER |
Two students of AtCoder Kindergarten are fighting over candy packs.
There are three candy packs, each of which contains a, b, and c candies, respectively.
Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.
Note t... | *a,=map(int,input().split());print('YNeos'[sum(a)/2!=max(a)::2]) | 56 25 3110 30 2030 30 100 | YesYesNo | ASSIGN VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER |
Two students of AtCoder Kindergarten are fighting over candy packs.
There are three candy packs, each of which contains a, b, and c candies, respectively.
Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.
Note t... | a,b,c=map(int,input().split());print('Yes'if max(a,b,c)*2==a+b+c else'No') | 56 25 3110 30 2030 30 100 | YesYesNo | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR VAR NUMBER BIN_OP BIN_OP VAR VAR VAR STRING STRING |
Two students of AtCoder Kindergarten are fighting over candy packs.
There are three candy packs, each of which contains a, b, and c candies, respectively.
Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.
Note t... | a,b,c=map(int,input().split());print(['No','Yes'][max(a,b,c)==((a+b+c)-max(a,b,c))]) | 56 25 3110 30 2030 30 100 | YesYesNo | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR LIST STRING STRING FUNC_CALL VAR VAR VAR VAR BIN_OP BIN_OP BIN_OP VAR VAR VAR FUNC_CALL VAR VAR VAR VAR |
Two students of AtCoder Kindergarten are fighting over candy packs.
There are three candy packs, each of which contains a, b, and c candies, respectively.
Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.
Note t... | a,b,c=map(int,input().split());print("Yes" if (a+b==c or a+c==b or b+c==a) else "No") | 56 25 3110 30 2030 30 100 | YesYesNo | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP VAR VAR VAR BIN_OP VAR VAR VAR BIN_OP VAR VAR VAR STRING STRING |
Two students of AtCoder Kindergarten are fighting over candy packs.
There are three candy packs, each of which contains a, b, and c candies, respectively.
Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.
Note t... | a,b,c=map(int,input().split());print(["No","Yes"][(a+b==c)+(b+c==a)+(c+a==b)]) | 56 25 3110 30 2030 30 100 | YesYesNo | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR LIST STRING STRING BIN_OP BIN_OP BIN_OP VAR VAR VAR BIN_OP VAR VAR VAR BIN_OP VAR VAR VAR |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4