message stringlengths 2 433k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 113 108k | cluster float64 12 12 | __index_level_0__ int64 226 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd denotes the [greatest common divisor](https://en.... | instruction | 0 | 63,662 | 12 | 127,324 |
Tags: brute force, dp, greedy, math, number theory
Correct Solution:
```
import sys
import collections
from collections import Counter, deque
import itertools
import math
import timeit
import random
#########################
# imgur.com/Pkt7iIf.png #
#########################
def sieve(n):
if n < 2: return list()... | output | 1 | 63,662 | 12 | 127,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd denotes the [greatest common divisor](https://en.... | instruction | 0 | 63,663 | 12 | 127,326 |
Tags: brute force, dp, greedy, math, number theory
Correct Solution:
```
import sys
from math import gcd
# def gcd (a,b):
# if b== 0:
# return a
# return gcd(b,a%b)
n = int(input())
a = list(map(int,input().split()))
if 1 in a:
print(n- a.count(1))
exit()
count = sys.maxsize
for i in range(n):
tmp = a[i]
fo... | output | 1 | 63,663 | 12 | 127,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd de... | instruction | 0 | 63,664 | 12 | 127,328 |
Yes | output | 1 | 63,664 | 12 | 127,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd de... | instruction | 0 | 63,665 | 12 | 127,330 |
Yes | output | 1 | 63,665 | 12 | 127,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd de... | instruction | 0 | 63,666 | 12 | 127,332 |
Yes | output | 1 | 63,666 | 12 | 127,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd de... | instruction | 0 | 63,667 | 12 | 127,334 |
Yes | output | 1 | 63,667 | 12 | 127,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd de... | instruction | 0 | 63,668 | 12 | 127,336 |
No | output | 1 | 63,668 | 12 | 127,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd de... | instruction | 0 | 63,669 | 12 | 127,338 |
No | output | 1 | 63,669 | 12 | 127,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd de... | instruction | 0 | 63,670 | 12 | 127,340 |
No | output | 1 | 63,670 | 12 | 127,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd de... | instruction | 0 | 63,671 | 12 | 127,342 |
No | output | 1 | 63,671 | 12 | 127,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3, and then went to the bathroom.
JATC decided ... | instruction | 0 | 63,990 | 12 | 127,980 |
Tags: greedy, implementation
Correct Solution:
```
n, a = int(input()), [0] + list(map(int, input().split())) + [1001]
a = [a[i] - a[i - 1] for i in range(1, len(a))] + [0]
m = cnt = 0
for i in range(len(a)):
if a[i] == 1:
cnt += 1
else:
if cnt > 0:
m = max(m, cnt - 1)
... | output | 1 | 63,990 | 12 | 127,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3, and then went to the bathroom.
JATC decided ... | instruction | 0 | 63,991 | 12 | 127,982 |
Tags: greedy, implementation
Correct Solution:
```
from sys import stdin
from collections import deque
mod = 10**9 + 7
import sys
sys.setrecursionlimit(10**5)
from queue import PriorityQueue
# def rl():
# return [int(w) for w in stdin.readline().split()]
from bisect import bisect_right
from bisect import bisect_lef... | output | 1 | 63,991 | 12 | 127,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3, and then went to the bathroom.
JATC decided ... | instruction | 0 | 63,992 | 12 | 127,984 |
Tags: greedy, implementation
Correct Solution:
```
n = int(input())
arr = [0] + list(map(int, input().split()))
arr.append(1001)
max_ = 0
kek = 0
for i in range(1, len(arr)):
if arr[i] - 1 == arr[i - 1]:
kek += 1
else:
max_ = max(max_, kek - 1)
kek = 0
max_ = max(max_, kek - 1)
print(max... | output | 1 | 63,992 | 12 | 127,985 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3, and then went to the bathroom.
JATC decided ... | instruction | 0 | 63,993 | 12 | 127,986 |
Tags: greedy, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
if n == 1:
print(0)
else:
sa = []
s = 0
e = 0
for i in range(n-1):
if a[i] == a[i+1]-1:
e = i+1
else:
sa.append(a[s:e+1])
s = i+1
... | output | 1 | 63,993 | 12 | 127,987 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3, and then went to the bathroom.
JATC decided ... | instruction | 0 | 63,994 | 12 | 127,988 |
Tags: greedy, implementation
Correct Solution:
```
d = int(input())
g = [int(i) for i in input().split()]
count = 0
op = []
i = 0
j = 0
if g[0]==1:
for i in range(len(g)-1):
if g[i]+1==g[i+1]:
count+=1
else:
op.append(count)
break
op.append(count)
count = ... | output | 1 | 63,994 | 12 | 127,989 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3, and then went to the bathroom.
JATC decided ... | instruction | 0 | 63,995 | 12 | 127,990 |
Tags: greedy, implementation
Correct Solution:
```
n = int(input())
arr = list( map(int,input().split()) )
eraseable = 0
if n==1:
print(0)
exit(0)
consecutive = False
if arr[0]==1 and arr[1]==2:
consecutive = 1
for i in range(1,n-1):
if arr[i] - arr[i-1] == 1 and arr[i+1]-arr[i] == 1:
consecutiv... | output | 1 | 63,995 | 12 | 127,991 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3, and then went to the bathroom.
JATC decided ... | instruction | 0 | 63,996 | 12 | 127,992 |
Tags: greedy, implementation
Correct Solution:
```
n=int(input())+2
l=[0]+list(map(int,input().split()))+[1001]
M=0
i=0
while i<n-1:
s=1
j=i+1
while j<n:
if l[j]==l[j-1]+1:
s+=1
j+=1
else :break
if s>M:M=s
i=j
print(M-2) if M-2>0 else print(0)
``` | output | 1 | 63,996 | 12 | 127,993 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3, and then went to the bathroom.
JATC decided ... | instruction | 0 | 63,997 | 12 | 127,994 |
Tags: greedy, implementation
Correct Solution:
```
n = int(input())
a=list(map(int,input().split()))
m=0
count=1
a=[0]+a+[1001]
for i in range(1,n+2):
if a[i]-a[i-1]==1:
count+=1
else:
m=max(m,count-2)
count=1
m=max(m,count-2)
print(m)
``` | output | 1 | 63,997 | 12 | 127,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3... | instruction | 0 | 63,998 | 12 | 127,996 |
Yes | output | 1 | 63,998 | 12 | 127,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3... | instruction | 0 | 63,999 | 12 | 127,998 |
Yes | output | 1 | 63,999 | 12 | 127,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3... | instruction | 0 | 64,000 | 12 | 128,000 |
Yes | output | 1 | 64,000 | 12 | 128,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3... | instruction | 0 | 64,001 | 12 | 128,002 |
Yes | output | 1 | 64,001 | 12 | 128,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3... | instruction | 0 | 64,002 | 12 | 128,004 |
No | output | 1 | 64,002 | 12 | 128,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3... | instruction | 0 | 64,003 | 12 | 128,006 |
No | output | 1 | 64,003 | 12 | 128,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3... | instruction | 0 | 64,004 | 12 | 128,008 |
No | output | 1 | 64,004 | 12 | 128,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a_1, a_2, ..., a_n of integers, such that 1 ≤ a_1 < a_2 < … < a_n ≤ 10^3... | instruction | 0 | 64,005 | 12 | 128,010 |
No | output | 1 | 64,005 | 12 | 128,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n non-decreasing arrays of non-negative numbers.
Vasya repeats the following operation k times:
* Selects a non-empty array.
* Puts the first element of the selected array... | instruction | 0 | 64,181 | 12 | 128,362 |
No | output | 1 | 64,181 | 12 | 128,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n non-decreasing arrays of non-negative numbers.
Vasya repeats the following operation k times:
* Selects a non-empty array.
* Puts the first element of the selected array... | instruction | 0 | 64,182 | 12 | 128,364 |
No | output | 1 | 64,182 | 12 | 128,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n non-decreasing arrays of non-negative numbers.
Vasya repeats the following operation k times:
* Selects a non-empty array.
* Puts the first element of the selected array... | instruction | 0 | 64,183 | 12 | 128,366 |
No | output | 1 | 64,183 | 12 | 128,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n non-decreasing arrays of non-negative numbers.
Vasya repeats the following operation k times:
* Selects a non-empty array.
* Puts the first element of the selected array... | instruction | 0 | 64,184 | 12 | 128,368 |
No | output | 1 | 64,184 | 12 | 128,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every cop... | instruction | 0 | 64,201 | 12 | 128,402 |
Tags: brute force, constructive algorithms, dfs and similar, greedy, implementation
Correct Solution:
```
N, M = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
from copy import *
ans = copy(A[0])
for i in range(1,N):
cnt = 0
lis = []
for j in range(M):
if ans[j]!=A[i][j]:
... | output | 1 | 64,201 | 12 | 128,403 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every cop... | instruction | 0 | 64,202 | 12 | 128,404 |
Tags: brute force, constructive algorithms, dfs and similar, greedy, implementation
Correct Solution:
```
N, M = map(int, input().split())
A = []
for i in range(N):
a = list(map(int, input().split()))
for j in range(M): A.append(a[j])
ans = A[:M]
if M<=2:
print('Yes')
print(*ans)
exit()
for i in range(1,N):
... | output | 1 | 64,202 | 12 | 128,405 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every cop... | instruction | 0 | 64,203 | 12 | 128,406 |
Tags: brute force, constructive algorithms, dfs and similar, greedy, implementation
Correct Solution:
```
import sys
#input = sys.stdin.readline
def solve():
n, m = map(int,input().split())
a = [None]*n
for i in range(n):
a[i] = list(map(int, input().split()))
c = []
row = 0
for i in range(1,n):
c1 = []
f... | output | 1 | 64,203 | 12 | 128,407 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every cop... | instruction | 0 | 64,204 | 12 | 128,408 |
Tags: brute force, constructive algorithms, dfs and similar, greedy, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
A = []
for i in range(N):
a = list(map(int, input().split()))
for j in range(M): A.append(a[j])
ans = A[:M]
if M<=2:
print('Yes')
print... | output | 1 | 64,204 | 12 | 128,409 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every cop... | instruction | 0 | 64,205 | 12 | 128,410 |
Tags: brute force, constructive algorithms, dfs and similar, greedy, implementation
Correct Solution:
```
import io
import os
from collections import Counter, defaultdict, deque
from itertools import product
# Similar to https://codeforces.com/contest/1360/submission/81330345
def solve(N, M, A):
def getDiff(w1... | output | 1 | 64,205 | 12 | 128,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every cop... | instruction | 0 | 64,206 | 12 | 128,412 |
Tags: brute force, constructive algorithms, dfs and similar, greedy, implementation
Correct Solution:
```
def solve():
n, m = map(int,input().split());a = [list(map(int, input().split())) for i in range(n)];c = [];row = 0
for i in range(1,n):
c1 = [j for j in range(m) if a[0][j] != a[i][j]]
if len(c1) > len(c):c ... | output | 1 | 64,206 | 12 | 128,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every cop... | instruction | 0 | 64,207 | 12 | 128,414 |
Tags: brute force, constructive algorithms, dfs and similar, greedy, implementation
Correct Solution:
```
def solve():
n, m = map(int,input().split())
a = [None]*n
for i in range(n):
a[i] = list(map(int, input().split()))
c = []
row = 0
for i in range(1,n):
c1 = []
for j in range(m):
if a[0][j] != a[i][j... | output | 1 | 64,207 | 12 | 128,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every cop... | instruction | 0 | 64,208 | 12 | 128,416 |
Tags: brute force, constructive algorithms, dfs and similar, greedy, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
ans = A[0][:]
for i in range(1,N):
cnt = 0
lis = []
for j in range(M):
if ans... | output | 1 | 64,208 | 12 | 128,417 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may h... | instruction | 0 | 64,209 | 12 | 128,418 |
Yes | output | 1 | 64,209 | 12 | 128,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may h... | instruction | 0 | 64,210 | 12 | 128,420 |
Yes | output | 1 | 64,210 | 12 | 128,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may h... | instruction | 0 | 64,211 | 12 | 128,422 |
Yes | output | 1 | 64,211 | 12 | 128,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may h... | instruction | 0 | 64,212 | 12 | 128,424 |
Yes | output | 1 | 64,212 | 12 | 128,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may h... | instruction | 0 | 64,213 | 12 | 128,426 |
No | output | 1 | 64,213 | 12 | 128,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may h... | instruction | 0 | 64,214 | 12 | 128,428 |
No | output | 1 | 64,214 | 12 | 128,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may h... | instruction | 0 | 64,215 | 12 | 128,430 |
No | output | 1 | 64,215 | 12 | 128,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may h... | instruction | 0 | 64,216 | 12 | 128,432 |
No | output | 1 | 64,216 | 12 | 128,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The only difference between the easy version and the hard version is the constraints on n. You can only make hacks if both versions are solved.
A permutation of 1, 2, …, n is a sequence of n integers... | instruction | 0 | 64,231 | 12 | 128,462 |
Tags: combinatorics, dp, fft, math
Correct Solution:
```
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
de... | output | 1 | 64,231 | 12 | 128,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The only difference between the easy version and the hard version is the constraints on n. You can only make hacks if both versions are solved.
A permutation of 1, 2, …, n is a sequence of n integers... | instruction | 0 | 64,232 | 12 | 128,464 |
Tags: combinatorics, dp, fft, math
Correct Solution:
```
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
de... | output | 1 | 64,232 | 12 | 128,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The only difference between the easy version and the hard version is the constraints on n. You can only make hacks if both versions are solved.
A permutation of 1, 2, …, n is a sequence of n integers... | instruction | 0 | 64,233 | 12 | 128,466 |
Tags: combinatorics, dp, fft, math
Correct Solution:
```
def solve(n, mod):
if n<=3:
return 0
else:
last_ans = 17
ans = 17
size = (n-1)*(n-2)//2 + 1
inv = 1
record = [[0 for i in range(size+1)] for i in range(2)]
record[0][0:4]=[1,2,2,1]
for m in r... | output | 1 | 64,233 | 12 | 128,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The only difference between the easy version and the hard version is the constraints on n. You can only make hacks if both versions are solved.
A permutation of 1, 2, …, n is a sequence of n integers... | instruction | 0 | 64,234 | 12 | 128,468 |
Tags: combinatorics, dp, fft, math
Correct Solution:
```
def divisors(M):
d=[]
i=1
while M>=i**2:
if M%i==0:
d.append(i)
if i**2!=M:
d.append(M//i)
i=i+1
return d
def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + ((x... | output | 1 | 64,234 | 12 | 128,469 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.