message stringlengths 2 44.5k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Compute A + B.
Constraints
* -1000 ≤ A, B ≤ 1000
Input
The input will consist of a series of pairs of integers A and B separated by a space, one pair of integers per line. The input will be terminated by EOF.
Output
For each pair of input integers A and B, you must output the sum of A and B in one line.
Example
Input
1 2
10 5
100 20
Output
3
15
120
Submitted Solution:
```
while True:
try:
a, b = list(map(int,input().split()))
except EOFError:
break
print(a+b)
``` | instruction | 0 | 10,709 | 5 | 21,418 |
Yes | output | 1 | 10,709 | 5 | 21,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Compute A + B.
Constraints
* -1000 ≤ A, B ≤ 1000
Input
The input will consist of a series of pairs of integers A and B separated by a space, one pair of integers per line. The input will be terminated by EOF.
Output
For each pair of input integers A and B, you must output the sum of A and B in one line.
Example
Input
1 2
10 5
100 20
Output
3
15
120
Submitted Solution:
```
while True:
try:
print(sum([eval(x) for x in input().split()]))
except EOFError:
brea
``` | instruction | 0 | 10,710 | 5 | 21,420 |
No | output | 1 | 10,710 | 5 | 21,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Compute A + B.
Constraints
* -1000 ≤ A, B ≤ 1000
Input
The input will consist of a series of pairs of integers A and B separated by a space, one pair of integers per line. The input will be terminated by EOF.
Output
For each pair of input integers A and B, you must output the sum of A and B in one line.
Example
Input
1 2
10 5
100 20
Output
3
15
120
Submitted Solution:
```
a=int(input())
b=int(input())
print(a+b)
# aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
``` | instruction | 0 | 10,711 | 5 | 21,422 |
No | output | 1 | 10,711 | 5 | 21,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Compute A + B.
Constraints
* -1000 ≤ A, B ≤ 1000
Input
The input will consist of a series of pairs of integers A and B separated by a space, one pair of integers per line. The input will be terminated by EOF.
Output
For each pair of input integers A and B, you must output the sum of A and B in one line.
Example
Input
1 2
10 5
100 20
Output
3
15
120
Submitted Solution:
```
while True:
pair_num = input("A pair of numbers")
if pair_num == '':
break
a, b = pair_num.split(" ")
print(int(a) + int(b))
``` | instruction | 0 | 10,712 | 5 | 21,424 |
No | output | 1 | 10,712 | 5 | 21,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Compute A + B.
Constraints
* -1000 ≤ A, B ≤ 1000
Input
The input will consist of a series of pairs of integers A and B separated by a space, one pair of integers per line. The input will be terminated by EOF.
Output
For each pair of input integers A and B, you must output the sum of A and B in one line.
Example
Input
1 2
10 5
100 20
Output
3
15
120
Submitted Solution:
```
import time,sys
start=time.time()
while time.time()-start<=4.98:pass
for input in sys.stdin:print(sum(map(int,input.split())))
``` | instruction | 0 | 10,713 | 5 | 21,426 |
No | output | 1 | 10,713 | 5 | 21,427 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
2 4
%.@\$
..\$\$
Output
Yes | instruction | 0 | 10,757 | 5 | 21,514 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
h,w = LI()
mp = [S() for _ in range(h)]
def search(ss):
d = collections.defaultdict(lambda: inf)
q = []
for s in ss:
d[s] = 0
heapq.heappush(q, (0, s))
v = collections.defaultdict(bool)
while len(q):
k, u = heapq.heappop(q)
if v[u]:
continue
v[u] = True
for di,dj in dd:
ni = u[0] + di
nj = u[1] + dj
if ni < 0 or ni >= h or nj < 0 or nj >= w or mp[ni][nj] == '#':
continue
uv = (ni, nj)
if v[uv]:
continue
vd = k + 1
if d[uv] > vd:
d[uv] = vd
heapq.heappush(q, (vd, uv))
return d
ss = []
ps = None
es = None
for i in range(h):
for j in range(w):
if mp[i][j] == '$':
ss.append((i,j))
elif mp[i][j] == '@':
ps = (i,j)
elif mp[i][j] == '%':
es = (i,j)
pd = search(ss)
d = search([ps])
if d[es] < pd[es]:
return 'Yes'
return 'No'
print(main())
``` | output | 1 | 10,757 | 5 | 21,515 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3 | instruction | 0 | 10,759 | 5 | 21,518 |
"Correct Solution:
```
_ = input()
A = map(int, input().split())
print(len([x for x in A if x % 2 == 0]))
``` | output | 1 | 10,759 | 5 | 21,519 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3 | instruction | 0 | 10,760 | 5 | 21,520 |
"Correct Solution:
```
input();print(sum(map(lambda x:(int(x)-1)%2,input().split())))
``` | output | 1 | 10,760 | 5 | 21,521 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3 | instruction | 0 | 10,761 | 5 | 21,522 |
"Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
r = 0
for j in a:
if j % 2 == 0:
r += 1
print(r)
``` | output | 1 | 10,761 | 5 | 21,523 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3 | instruction | 0 | 10,762 | 5 | 21,524 |
"Correct Solution:
```
n=int(input())
a=list(map(int, input().split()))
c=0
for i in a:
if i%2==0:
c+=1
print(c)
``` | output | 1 | 10,762 | 5 | 21,525 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3 | instruction | 0 | 10,763 | 5 | 21,526 |
"Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in a:
if i%2==0:ans+=1
print(ans)
``` | output | 1 | 10,763 | 5 | 21,527 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3 | instruction | 0 | 10,764 | 5 | 21,528 |
"Correct Solution:
```
n = int(input())
li = list(map(int,input().split()))
cnt = 0
for i in li:
if i % 2 == 0:
cnt += 1
print(cnt)
``` | output | 1 | 10,764 | 5 | 21,529 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3 | instruction | 0 | 10,765 | 5 | 21,530 |
"Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
for i in a:
n -= i%2
print(n)
``` | output | 1 | 10,765 | 5 | 21,531 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3 | instruction | 0 | 10,766 | 5 | 21,532 |
"Correct Solution:
```
N = int(input())
A = [int(x)%2 for x in input().split()]
ans = N - sum(A)
print(ans)
``` | output | 1 | 10,766 | 5 | 21,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3
Submitted Solution:
```
N=int(input())
A=list(map(int,input().split()))
ANS=0
for i in range(N):
if A[i]%2==0:
ANS+=1
print(ANS)
``` | instruction | 0 | 10,767 | 5 | 21,534 |
Yes | output | 1 | 10,767 | 5 | 21,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3
Submitted Solution:
```
n = input()
a = [int(i)%2 for i in input().split()]
print(a.count(0))
``` | instruction | 0 | 10,768 | 5 | 21,536 |
Yes | output | 1 | 10,768 | 5 | 21,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3
Submitted Solution:
```
n = input()
print(len(list(filter(lambda x:x%2==0, map(int,input().split())))))
``` | instruction | 0 | 10,769 | 5 | 21,538 |
Yes | output | 1 | 10,769 | 5 | 21,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3
Submitted Solution:
```
n=int(input())
ls=list(map(int,input().split()))
ans=0
for i in range(n):
if ls[i]%2==0:
ans+=1
print(ans)
``` | instruction | 0 | 10,770 | 5 | 21,540 |
Yes | output | 1 | 10,770 | 5 | 21,541 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
D: Sontaku (Surmise)
Some twins like even numbers.
Count how many even numbers are in $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $.
input
The integer $ N $ is given on the first line.
On the second line, $ N $ integers $ A_1, A_2, A_3, \ dots, A_N $ are given, separated by blanks.
output
Output an even number. However, insert a line break at the end.
Constraint
* $ N $ is an integer greater than or equal to $ 1 $ and less than or equal to $ 100 $
* $ A_1, A_2, A_3, \ dots, A_N $ are integers between $ 1 $ and $ 100 $
Input example 1
Five
4 3 5 2 6
Output example 1
3
$ A_1 = 4 $, $ A_4 = 2 $ and $ A_5 = 6 $ are even numbers. Therefore, the even number is $ 3 $.
Input example 2
3
2 2 2
Output example 2
3
Even if the numbers are the same, if the positions in $ A_1, A_2, A_3, \ dots, A_N $ are different, they are counted as different numbers.
Example
Input
5
4 3 5 2 6
Output
3
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split()))
r = 0
for j in a:
if a % 2 == 0:
r += 1
print(r)
``` | instruction | 0 | 10,771 | 5 | 21,542 |
No | output | 1 | 10,771 | 5 | 21,543 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x).
Input
The first line contains the single positive integer n (1 ≤ n ≤ 105) — the number of integers.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2.
Examples
Input
4
7 3 2 1
Output
2
Input
3
1 1 1
Output
3
Note
In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).
In the second example all pairs of indexes (i, j) (where i < j) include in answer.
Submitted Solution:
```
from collections import Counter
def main():
n = int(input())
a = map(int, input().split())
c = Counter()
ans = 0
for x in a:
for i in range(1, 33):
ans += c[2 ** i - x]
c[x] += 1
print(ans)
main()
``` | instruction | 0 | 11,251 | 5 | 22,502 |
Yes | output | 1 | 11,251 | 5 | 22,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x).
Input
The first line contains the single positive integer n (1 ≤ n ≤ 105) — the number of integers.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2.
Examples
Input
4
7 3 2 1
Output
2
Input
3
1 1 1
Output
3
Note
In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).
In the second example all pairs of indexes (i, j) (where i < j) include in answer.
Submitted Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon Jul 27 10:52:28 2020
@author: shailesh
"""
from collections import defaultdict
N = int(input())
A = [int(i) for i in input().split()]
d = {}
d = defaultdict(lambda :0,d)
power_table = [2**i for i in range(31)]
sum_val= 0
for i in A:
for pow_2 in power_table:
sum_val += d[pow_2 - i]
d[i] += 1
print(sum_val)
``` | instruction | 0 | 11,253 | 5 | 22,506 |
Yes | output | 1 | 11,253 | 5 | 22,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x).
Input
The first line contains the single positive integer n (1 ≤ n ≤ 105) — the number of integers.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2.
Examples
Input
4
7 3 2 1
Output
2
Input
3
1 1 1
Output
3
Note
In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).
In the second example all pairs of indexes (i, j) (where i < j) include in answer.
Submitted Solution:
```
n=int(input())
d=dict()
for i in input().split():
if int(i) in d:
d[int(i)]+=1
else:
d[int(i)]=1
mylist=[]
ans=0
for a in range(1,31):
mylist.append(2**a)
for a in d:
for b in mylist:
if b-a in d:
if b-a!=a:
ans+=d[b-a]*d[a]
else:
ans+=(d[a]-1)*(d[a])
print(ans//2)
``` | instruction | 0 | 11,254 | 5 | 22,508 |
Yes | output | 1 | 11,254 | 5 | 22,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x).
Input
The first line contains the single positive integer n (1 ≤ n ≤ 105) — the number of integers.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2.
Examples
Input
4
7 3 2 1
Output
2
Input
3
1 1 1
Output
3
Note
In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).
In the second example all pairs of indexes (i, j) (where i < j) include in answer.
Submitted Solution:
```
import sys, threading
sys.setrecursionlimit(10 ** 6)
scan = lambda: map(int, input().split())
n = int(input())
arr = list(scan())
hash = {}
ans = 0
for i in arr:
if hash.get(i, 0):
hash[i] += 1
else:
hash[i] = 1
for i in arr:
tmp = 1
while tmp * 2 <= 1e9:
tmp *= 2
x = tmp - i
ans += max(hash.get(x, 0) - (1 if x == i else 0), 0)
hash[i] -= 1
print(ans)
``` | instruction | 0 | 11,255 | 5 | 22,510 |
No | output | 1 | 11,255 | 5 | 22,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x).
Input
The first line contains the single positive integer n (1 ≤ n ≤ 105) — the number of integers.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2.
Examples
Input
4
7 3 2 1
Output
2
Input
3
1 1 1
Output
3
Note
In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).
In the second example all pairs of indexes (i, j) (where i < j) include in answer.
Submitted Solution:
```
n=int(input())
s=list(map(int,input().split()))
k=0
for j in range(n):
for i in range(n-1):
t=s[0]+s[i+1]
t=str(bin(t))
l=t.count('1')
if l==1:
k=k+1
print(k//2)
``` | instruction | 0 | 11,256 | 5 | 22,512 |
No | output | 1 | 11,256 | 5 | 22,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x).
Input
The first line contains the single positive integer n (1 ≤ n ≤ 105) — the number of integers.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2.
Examples
Input
4
7 3 2 1
Output
2
Input
3
1 1 1
Output
3
Note
In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).
In the second example all pairs of indexes (i, j) (where i < j) include in answer.
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split()))
pairs = 0
for i in range(n):
for j in range(i,n):
s = a[i] + a[j]
if s != 0 and (s & (s-1))==0:
pairs += 1
print(pairs//2)
``` | instruction | 0 | 11,257 | 5 | 22,514 |
No | output | 1 | 11,257 | 5 | 22,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x).
Input
The first line contains the single positive integer n (1 ≤ n ≤ 105) — the number of integers.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2.
Examples
Input
4
7 3 2 1
Output
2
Input
3
1 1 1
Output
3
Note
In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).
In the second example all pairs of indexes (i, j) (where i < j) include in answer.
Submitted Solution:
```
import sys, threading
sys.setrecursionlimit(10 ** 6)
scan = lambda: map(int, input().split())
n = int(input())
arr = list(scan())
hash = {}
ans = 0
for i in arr:
if hash.get(i, 0):
hash[i] += 1
else:
hash[i] = 1
for i in arr:
tmp = 1
while tmp * 2 <= 1e9:
tmp *= 2
x = tmp - i
ans += hash.get(x, 0) - (1 if x == i else 0)
hash[i] -= 1
print(ans)
``` | instruction | 0 | 11,258 | 5 | 22,516 |
No | output | 1 | 11,258 | 5 | 22,517 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0 | instruction | 0 | 11,408 | 5 | 22,816 |
"Correct Solution:
```
s = input()
n = 0
ans = 0
mods = [0]*2019
mods[0] = 1
for i, j in enumerate(reversed(s)):
n += int(j)*pow(10, i, 2019)
n %= 2019
mods[n] += 1
for i in mods:
ans += i*(i-1)//2
print(ans)
``` | output | 1 | 11,408 | 5 | 22,817 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0 | instruction | 0 | 11,409 | 5 | 22,818 |
"Correct Solution:
```
S=input()
ans,n=0,len(S)
dp=[0]*(2019)
s,dp[0],k=0,1,1
for i in range(1,n+1):
s=(s+int(S[-i])*k)%2019
k=(k*10)%2019
ans+=dp[s]
dp[s]+=1
print(ans)
``` | output | 1 | 11,409 | 5 | 22,819 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0 | instruction | 0 | 11,410 | 5 | 22,820 |
"Correct Solution:
```
S=input()
p=2019
h=0
d=1
t=0
c=[0]*p
c[0]=1
for s in reversed(S):
m=int(s)*d%p
h=(h+m)%p
t+=c[h]
c[h]+=1
d=d*10%p
print(t)
``` | output | 1 | 11,410 | 5 | 22,821 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0 | instruction | 0 | 11,411 | 5 | 22,822 |
"Correct Solution:
```
mod = 2019
cnt = [0 for i in range(2019)]
cnt[0] = 1
x = 0
ten = 1
ans = 0
for s in input()[::-1]:
x = (x + int(s) * ten) % mod
ans += cnt[x]
cnt[x] += 1
ten *= 10
ten %= mod
print(ans)
``` | output | 1 | 11,411 | 5 | 22,823 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0 | instruction | 0 | 11,412 | 5 | 22,824 |
"Correct Solution:
```
M=2019
S=input()+'0'
t = 1
p=0
mcnt = [0] * 2019
ans = 0
for x in S[::-1]:
dm = int(x) * t % M
am = (dm+p) % M
ans += mcnt[am]
mcnt[am]+=1
t=t*10%M
p=am
print(ans)
``` | output | 1 | 11,412 | 5 | 22,825 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0 | instruction | 0 | 11,413 | 5 | 22,826 |
"Correct Solution:
```
s = input()
n = len(s)
m = 2019
a = 0
r = [0 for _ in range(m+1)]
r[0] = 1
z = 0
for i in range(0,n):
z = (int(s[n-i-1])*pow(10,i,m) + z)%m
a += r[z]
r[z] += 1
print(a)
``` | output | 1 | 11,413 | 5 | 22,827 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0 | instruction | 0 | 11,414 | 5 | 22,828 |
"Correct Solution:
```
s = input()
n = len(s)
dp = [1] + [0]*2019
now = 0
i = 1
for c in reversed(s):
now = (now+i*int(c))%2019
dp[now] += 1
i = (i*10)%2019
ans = sum([i*(i-1)/2 for i in dp])
print(int(ans))
``` | output | 1 | 11,414 | 5 | 22,829 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0 | instruction | 0 | 11,415 | 5 | 22,830 |
"Correct Solution:
```
n = input()
p = 2019
t = 1
y = 0
c = p*[0]
for x in map(int,n[::-1]):
y+=t*x
y%=p
c[y]+=1
t*=10
t%=p
print(sum(i*(i-1)//2 for i in c)+c[0])
``` | output | 1 | 11,415 | 5 | 22,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0
Submitted Solution:
```
P=2019
S = input()
N=len(S)
count=[0]*P
ans = 0
count[0] = 1
u = 0
for i, s in enumerate(reversed(S)):
u = (int(s) * pow(10, i, P) + u) % P
ans += count[u]
count[u] += 1
print(ans)
``` | instruction | 0 | 11,416 | 5 | 22,832 |
Yes | output | 1 | 11,416 | 5 | 22,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0
Submitted Solution:
```
y=2019
a=[0]*y
k=1
r=p=0
for c in input()[::-1]:
a[p]+=1
p-=int(c)*k
p%=y
r+=a[p]
k*=10
k%=y
print(r)
``` | instruction | 0 | 11,417 | 5 | 22,834 |
Yes | output | 1 | 11,417 | 5 | 22,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0
Submitted Solution:
```
s=input()
d=[0]*2019
dp=0
d[0]+=1
l=len(s)
r=1
for i in range(l):
dp+=int(s[l-1-i])*r
dp%=2019
r*=10
r%=2019
d[dp]+=1
res=0
for a in d:
res+=a*(a-1)//2
print(res)
``` | instruction | 0 | 11,418 | 5 | 22,836 |
Yes | output | 1 | 11,418 | 5 | 22,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0
Submitted Solution:
```
s=input()[::-1]
ans=0
u=0
d=1
l=[0]*2019
l[0]=1
for i in map(int,s):
u=(u+i*d)%2019
l[u]+=1
d=d*10%2019
for i in l:
ans+=i*(i-1)//2
print(ans)
``` | instruction | 0 | 11,419 | 5 | 22,838 |
Yes | output | 1 | 11,419 | 5 | 22,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0
Submitted Solution:
```
# ABC164 D
def main():
s = input()
count = 0
#results = []
for i in range(len(s)-4):
for j in range(i+5, len(s)+1):
if int(s[i:j]) % 2019 == 0:
count += 1
#results.append((i+1,j))
print(count)
#print(len(s))
#print(results)
if __name__ == '__main__':
main()
``` | instruction | 0 | 11,420 | 5 | 22,840 |
No | output | 1 | 11,420 | 5 | 22,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0
Submitted Solution:
```
s=input()
n=0
for i in range(len(s)):
for j in range(i, len(s)):
if int(s[i:j+1])%2019==0:
n+=1
print(n)
``` | instruction | 0 | 11,421 | 5 | 22,842 |
No | output | 1 | 11,421 | 5 | 22,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0
Submitted Solution:
```
s = int(input())
str = str(s)
n = len(str)
cnt = 0
for i in range(4, n+1):
for j in range(n+1-i):
if (int(str[j:j+i])%2019 == 0):
cnt += 1
print(cnt)
``` | instruction | 0 | 11,422 | 5 | 22,844 |
No | output | 1 | 11,422 | 5 | 22,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S consisting of digits from `1` through `9`.
Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:
Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.
Constraints
* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.
Examples
Input
1817181712114
Output
3
Input
14282668646
Output
2
Input
2119
Output
0
Submitted Solution:
```
def countSubStr(str1, l, k):
count = 0
for i in range(l):
n = 0
# Take all sub-strings starting from i
for j in range(i, l, 1):
n = n * 10 + (ord(str1[j]) - ord('0'))
# If current sub-string is divisible by k
if (n % k == 0):
count += 1
# Return the required count
return count
# Driver code
str1 = str(input())
l = len(str1)
k = 2019
print(countSubStr(str1, l, k))
``` | instruction | 0 | 11,423 | 5 | 22,846 |
No | output | 1 | 11,423 | 5 | 22,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we have a pair of numbers (a, b). We can get a new pair (a + b, b) or (a, a + b) from the given pair in a single step.
Let the initial pair of numbers be (1,1). Your task is to find number k, that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals n.
Input
The input contains the only integer n (1 ≤ n ≤ 106).
Output
Print the only integer k.
Examples
Input
5
Output
3
Input
1
Output
0
Note
The pair (1,1) can be transformed into a pair containing 5 in three moves: (1,1) → (1,2) → (3,2) → (5,2).
Submitted Solution:
```
import math as m
def hcf(a,b):
while(a!=b):
if(a>b): a=a-b
else: b = b-a
return a
n = int(input())
if(n==1 or n==2):
print(n-1)
exit()
mnm = m.inf
for k in range(m.ceil(n/2),n):
if(hcf(n,k)!=1): continue
p =k
q = n-k
count = 2
while(p!=2):
diff = p-q
if(q>diff):
p=q
q=diff
else:
p=diff
count+=1
if(count<mnm):
mnm = count
print(mnm)
``` | instruction | 0 | 11,772 | 5 | 23,544 |
Yes | output | 1 | 11,772 | 5 | 23,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we have a pair of numbers (a, b). We can get a new pair (a + b, b) or (a, a + b) from the given pair in a single step.
Let the initial pair of numbers be (1,1). Your task is to find number k, that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals n.
Input
The input contains the only integer n (1 ≤ n ≤ 106).
Output
Print the only integer k.
Examples
Input
5
Output
3
Input
1
Output
0
Note
The pair (1,1) can be transformed into a pair containing 5 in three moves: (1,1) → (1,2) → (3,2) → (5,2).
Submitted Solution:
```
import sys
def solve():
n = int(input())
if n == 1: return 0
res = 1000000
for other in range(n - 1, 0, -1):
pair = [n, other]
temp = 0
while (pair[0] > 1 or pair[1] > 1) and (pair[0] > 0 and pair[1] > 0):
if pair[0] > pair[1]: pair[0], pair[1] = pair[1], pair[0]
multiples = (pair[1] - 1) // pair[0]
if multiples == 0: break
pair[1] -= pair[0] * multiples
temp+=multiples
if temp > res: break
if pair[0] == 1 and pair[1] == 1: res = min(res, temp)
return res
if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
print(solve())
``` | instruction | 0 | 11,773 | 5 | 23,546 |
Yes | output | 1 | 11,773 | 5 | 23,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we have a pair of numbers (a, b). We can get a new pair (a + b, b) or (a, a + b) from the given pair in a single step.
Let the initial pair of numbers be (1,1). Your task is to find number k, that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals n.
Input
The input contains the only integer n (1 ≤ n ≤ 106).
Output
Print the only integer k.
Examples
Input
5
Output
3
Input
1
Output
0
Note
The pair (1,1) can be transformed into a pair containing 5 in three moves: (1,1) → (1,2) → (3,2) → (5,2).
Submitted Solution:
```
import sys
def solve():
n = int(input())
if n == 1: return 0
res = 1000000
for other in range(1, n):
pair = [n, other]
temp = 0
while (pair[0] > 1 or pair[1] > 1) and (pair[0] > 0 and pair[1] > 0):
if pair[0] > pair[1]: pair[0], pair[1] = pair[1], pair[0]
pair[1] -= pair[0]
temp+=1
if pair[0] == 1 and pair[1] == 1: res = min(res, temp)
return res
if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
print(solve())
``` | instruction | 0 | 11,774 | 5 | 23,548 |
Yes | output | 1 | 11,774 | 5 | 23,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we have a pair of numbers (a, b). We can get a new pair (a + b, b) or (a, a + b) from the given pair in a single step.
Let the initial pair of numbers be (1,1). Your task is to find number k, that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals n.
Input
The input contains the only integer n (1 ≤ n ≤ 106).
Output
Print the only integer k.
Examples
Input
5
Output
3
Input
1
Output
0
Note
The pair (1,1) can be transformed into a pair containing 5 in three moves: (1,1) → (1,2) → (3,2) → (5,2).
Submitted Solution:
```
def solve(n):
ans = n - 1
for i in range(2, n // 2 + 1):
j = n
k = 0
while i > 1 and j > 1:
k += 1
if j >= i:
j -= i
else:
i -= j
if i < 1 or j < 1:
continue
elif i == 1:
ans = min(ans, k + j - 1)
elif j == 1:
ans = min(ans, k + i - 1)
return ans
if __name__ == "__main__":
ans = solve(int(input()))
print(ans)
``` | instruction | 0 | 11,775 | 5 | 23,550 |
Yes | output | 1 | 11,775 | 5 | 23,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we have a pair of numbers (a, b). We can get a new pair (a + b, b) or (a, a + b) from the given pair in a single step.
Let the initial pair of numbers be (1,1). Your task is to find number k, that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals n.
Input
The input contains the only integer n (1 ≤ n ≤ 106).
Output
Print the only integer k.
Examples
Input
5
Output
3
Input
1
Output
0
Note
The pair (1,1) can be transformed into a pair containing 5 in three moves: (1,1) → (1,2) → (3,2) → (5,2).
Submitted Solution:
```
import math
n = int(input())
print(math.ceil(math.log(n, 2)))
``` | instruction | 0 | 11,776 | 5 | 23,552 |
No | output | 1 | 11,776 | 5 | 23,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we have a pair of numbers (a, b). We can get a new pair (a + b, b) or (a, a + b) from the given pair in a single step.
Let the initial pair of numbers be (1,1). Your task is to find number k, that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals n.
Input
The input contains the only integer n (1 ≤ n ≤ 106).
Output
Print the only integer k.
Examples
Input
5
Output
3
Input
1
Output
0
Note
The pair (1,1) can be transformed into a pair containing 5 in three moves: (1,1) → (1,2) → (3,2) → (5,2).
Submitted Solution:
```
from collections import deque
class CodeforcesTask134BSolution:
def __init__(self):
self.result = ''
self.n = 0
def read_input(self):
self.n = int(input())
def process_task(self):
num = self.n - 1
for i in range(2, self.n):
tmp = 1
a = num
b = i
while a != 2 and b != 1:
if a % b == 0:
break
c = a % b
tmp += a // b
a = b
b = c
if tmp > num:
break
if b == 1:
tmp += a - 2
a = 2
if a == 2 and b == 1 and tmp < num:
num = tmp
self.result = str(num)
def get_result(self):
return self.result
if __name__ == "__main__":
Solution = CodeforcesTask134BSolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())
``` | instruction | 0 | 11,777 | 5 | 23,554 |
No | output | 1 | 11,777 | 5 | 23,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we have a pair of numbers (a, b). We can get a new pair (a + b, b) or (a, a + b) from the given pair in a single step.
Let the initial pair of numbers be (1,1). Your task is to find number k, that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals n.
Input
The input contains the only integer n (1 ≤ n ≤ 106).
Output
Print the only integer k.
Examples
Input
5
Output
3
Input
1
Output
0
Note
The pair (1,1) can be transformed into a pair containing 5 in three moves: (1,1) → (1,2) → (3,2) → (5,2).
Submitted Solution:
```
import math
l=[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040]
n=int(input())
con=True
if n in l:
con=False
if n==1:
print(0)
if n>1:
print(l.index(n)-1)
if con and n!=2009:
con1=True
res=0
for i in l:
if i==2:
con1=False
if not con1:
res+=1
if i>n:
break
print(res)
if n==2009:
print(17)
``` | instruction | 0 | 11,778 | 5 | 23,556 |
No | output | 1 | 11,778 | 5 | 23,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we have a pair of numbers (a, b). We can get a new pair (a + b, b) or (a, a + b) from the given pair in a single step.
Let the initial pair of numbers be (1,1). Your task is to find number k, that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals n.
Input
The input contains the only integer n (1 ≤ n ≤ 106).
Output
Print the only integer k.
Examples
Input
5
Output
3
Input
1
Output
0
Note
The pair (1,1) can be transformed into a pair containing 5 in three moves: (1,1) → (1,2) → (3,2) → (5,2).
Submitted Solution:
```
def gc(a,b,rs):
if b==1:
return [a-1,rs+a-1]
if b==0:
return [a,rs]
rs+=(a//b)
return gc(b,a%b,rs)
x=int(input())
res=10**9
for n in range(1,x):
u=gc(x,n,0)
if u[0]==1:
res=min(res,u[1])
if res==10**9:
res=0
print(res)
``` | instruction | 0 | 11,779 | 5 | 23,558 |
No | output | 1 | 11,779 | 5 | 23,559 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.