message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in the same place as before. They are also lazy, so... | instruction | 0 | 20,534 | 14 | 41,068 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
if(n%2==0):
for i in range(1,n+1):
if(i%2==0):
print(i-1,end=" ")
else:
print(i+1,end=" ")
print()
else:
pr... | output | 1 | 20,534 | 14 | 41,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in the same place as before. They are also lazy, so... | instruction | 0 | 20,535 | 14 | 41,070 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
T = int(input())
for _ in range(T):
n = int(input())
A = []
if n % 2 == 0:
for i in range(n//2):
A.append(1 + 2*i + 1)
A.append(1 + 2*i)
else:
A = [3, 1, 2]
for i in range(1, n//2... | output | 1 | 20,535 | 14 | 41,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in the same place as before. They are also lazy, so... | instruction | 0 | 20,536 | 14 | 41,072 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
for s in[*open(0)][1:]:
n=int(s)
for i in range(0,n-n%2*3,2):print(i+2,i+1)
if n%2:print(n,n-2,n-1)
``` | output | 1 | 20,536 | 14 | 41,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in the same place as before. They are also lazy, so... | instruction | 0 | 20,537 | 14 | 41,074 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
import sys
#from fractions import Fraction
#import re
#sys.stdin=open('.in','r')
#sys.stdout=open('.out','w')
#import math
#import random
#import time
#sys.setrecursionlimit(int(1e6))
input = sys.stdin.readline
############ ---- USER DEFINE... | output | 1 | 20,537 | 14 | 41,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in the same place as before. They are also lazy, so... | instruction | 0 | 20,538 | 14 | 41,076 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
from functools import reduce
import os
import sys
from collections import *
from decimal import *
from math import *
from bisect import *
from heapq import *
from io import BytesIO, IOBase
input = lambda: sys.stdin.readline().rstrip("\r\n")
de... | output | 1 | 20,538 | 14 | 41,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in the same place as before. They are also lazy, so... | instruction | 0 | 20,539 | 14 | 41,078 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq,bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import th... | output | 1 | 20,539 | 14 | 41,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in t... | instruction | 0 | 20,540 | 14 | 41,080 |
Yes | output | 1 | 20,540 | 14 | 41,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in t... | instruction | 0 | 20,541 | 14 | 41,082 |
Yes | output | 1 | 20,541 | 14 | 41,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in t... | instruction | 0 | 20,542 | 14 | 41,084 |
Yes | output | 1 | 20,542 | 14 | 41,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in t... | instruction | 0 | 20,543 | 14 | 41,086 |
Yes | output | 1 | 20,543 | 14 | 41,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in t... | instruction | 0 | 20,544 | 14 | 41,088 |
No | output | 1 | 20,544 | 14 | 41,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in t... | instruction | 0 | 20,545 | 14 | 41,090 |
No | output | 1 | 20,545 | 14 | 41,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in t... | instruction | 0 | 20,546 | 14 | 41,092 |
No | output | 1 | 20,546 | 14 | 41,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in t... | instruction | 0 | 20,547 | 14 | 41,094 |
No | output | 1 | 20,547 | 14 | 41,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, th... | instruction | 0 | 20,657 | 14 | 41,314 |
Tags: implementation, sortings
Correct Solution:
```
from itertools import permutations
n=int(input())
l=list(map(int,input().split()))
d={}
d2={}
res=[]
c=0
def bf(x,indeks=0):
global c
if c < 3:
if indeks == le:
for i in res:
print(*i,end=" ")
print()
... | output | 1 | 20,657 | 14 | 41,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, th... | instruction | 0 | 20,658 | 14 | 41,316 |
Tags: implementation, sortings
Correct Solution:
```
# coding: utf-8
n = int(input())
tmp = [int(i) for i in input().split()]
li = []
for i in range(1,n+1):
li.append([tmp[i-1],i])
li.sort()
seq = [str(i[1]) for i in li]
two = []
three = []
for i in set(tmp):
cnt = tmp.count(i)
if cnt == 2:
two.appe... | output | 1 | 20,658 | 14 | 41,317 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, th... | instruction | 0 | 20,659 | 14 | 41,318 |
Tags: implementation, sortings
Correct Solution:
```
from random import shuffle
def main():
n = int(input())
a = sorted([(x, i + 1) for i, x in enumerate(map(int, input().split()))])
ways = 1
i = 0
parts = []
while i < n:
j = i
while j < n and a[j][0] == a[i][0]:
j += 1
parts.append(a[i : j])
ways... | output | 1 | 20,659 | 14 | 41,319 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, th... | instruction | 0 | 20,660 | 14 | 41,320 |
Tags: implementation, sortings
Correct Solution:
```
n = int(input())
h=[[0, i+1] for i in range(n)]
a=list(map(int, input().split()))
for i in range(n):
h[i][0] = a[i]
h.sort(key = lambda x : x[0])
cnt = 0
for i in range(n-1):
if h[i][0]==h[i+1][0]:
cnt+=1
if cnt < 2:
print("NO")
else:
print("Y... | output | 1 | 20,660 | 14 | 41,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, th... | instruction | 0 | 20,661 | 14 | 41,322 |
Tags: implementation, sortings
Correct Solution:
```
def print_permutation(array):
temp = ""
for ar in array:
temp += str(ar[1])+" "
return temp.strip()
n = int(input().strip())
a = list(map(int, input().split()))
for i in range(n):
a[i] = (a[i], i+1)
a.sort(key=lambda t: t[0])
b = a.copy()
in... | output | 1 | 20,661 | 14 | 41,323 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, th... | instruction | 0 | 20,662 | 14 | 41,324 |
Tags: implementation, sortings
Correct Solution:
```
n,inp = int(input()),input().split(" ")
dict = [ [i,int(inp[i])] for i in range(n)]
dict.sort(key=lambda i: i[1])
val = [i[1] for i in dict]
f = [i[0]+1 for i in dict]
i = p = 0
if len(val) - len(set(val)) < 2:
print("NO")
else:
print("YES")
print(" ".joi... | output | 1 | 20,662 | 14 | 41,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, th... | instruction | 0 | 20,663 | 14 | 41,326 |
Tags: implementation, sortings
Correct Solution:
```
n = int(input())
a = [int(i) for i in input().split()]
s = sorted([(a[i],i) for i in range(n)])
f = [s[i][1] for i in range(n)]
swp = []
for i in range(n-1):
if s[i][0] == s[i+1][0]:
swp.append((i,i+1))
if len(swp)==2:
print('YES')
pri... | output | 1 | 20,663 | 14 | 41,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, th... | instruction | 0 | 20,664 | 14 | 41,328 |
Tags: implementation, sortings
Correct Solution:
```
n = int(input())
l = list(map(int, input().split()))
a = []
for i in range(n):
a.append((l[i], i + 1))
a.sort()
cnt = 0
i = 0
maxi = 0;
while i < n:
c = 0
j = i
while i < n:
if a[i][0] == a[j][0]:
c += 1
else:
... | output | 1 | 20,664 | 14 | 41,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal s... | instruction | 0 | 20,665 | 14 | 41,330 |
Yes | output | 1 | 20,665 | 14 | 41,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal s... | instruction | 0 | 20,666 | 14 | 41,332 |
Yes | output | 1 | 20,666 | 14 | 41,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal s... | instruction | 0 | 20,667 | 14 | 41,334 |
Yes | output | 1 | 20,667 | 14 | 41,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal s... | instruction | 0 | 20,668 | 14 | 41,336 |
Yes | output | 1 | 20,668 | 14 | 41,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal s... | instruction | 0 | 20,669 | 14 | 41,338 |
No | output | 1 | 20,669 | 14 | 41,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal s... | instruction | 0 | 20,670 | 14 | 41,340 |
No | output | 1 | 20,670 | 14 | 41,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal s... | instruction | 0 | 20,671 | 14 | 41,342 |
No | output | 1 | 20,671 | 14 | 41,343 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal s... | instruction | 0 | 20,672 | 14 | 41,344 |
No | output | 1 | 20,672 | 14 | 41,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(gcd(a,b)), (b)/(gcd(a,b)) can form sides of a t... | instruction | 0 | 21,389 | 14 | 42,778 |
Tags: binary search, math, number theory, two pointers
Correct Solution:
```
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer... | output | 1 | 21,389 | 14 | 42,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(gcd(a,b)), (b)/(gcd(a,b)) can form sides of a t... | instruction | 0 | 21,390 | 14 | 42,780 |
Tags: binary search, math, number theory, two pointers
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
import math
import bisect
import heapq
def main():
pass
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
s... | output | 1 | 21,390 | 14 | 42,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(gcd(a,b)), (b)/(gcd(a,b)) can form sides of a t... | instruction | 0 | 21,392 | 14 | 42,784 |
Tags: binary search, math, number theory, two pointers
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
import os
self.os = os
self._fd = file.fileno()
self.bu... | output | 1 | 21,392 | 14 | 42,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(gcd(a,b)), (b)/(gcd(a,b)) can form sides of a t... | instruction | 0 | 21,395 | 14 | 42,790 |
Tags: binary search, math, number theory, two pointers
Correct Solution:
```
import math
import sys
import os
import sys
from io import BytesIO, IOBase
from types import GeneratorType
from collections import defaultdict
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self.... | output | 1 | 21,395 | 14 | 42,791 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(gcd(a,b)), (b)/(gcd(a,b)) can form sides of a t... | instruction | 0 | 21,396 | 14 | 42,792 |
Tags: binary search, math, number theory, two pointers
Correct Solution:
```
import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode o... | output | 1 | 21,396 | 14 | 42,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(... | instruction | 0 | 21,397 | 14 | 42,794 |
Yes | output | 1 | 21,397 | 14 | 42,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(... | instruction | 0 | 21,399 | 14 | 42,798 |
Yes | output | 1 | 21,399 | 14 | 42,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(... | instruction | 0 | 21,400 | 14 | 42,800 |
Yes | output | 1 | 21,400 | 14 | 42,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(... | instruction | 0 | 21,401 | 14 | 42,802 |
No | output | 1 | 21,401 | 14 | 42,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In number world, two different numbers are friends if they have a lot in common, but also each one has unique perks.
More precisely, two different numbers a and b are friends if gcd(a,b), (a)/(... | instruction | 0 | 21,402 | 14 | 42,804 |
No | output | 1 | 21,402 | 14 | 42,805 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 21,506 | 14 | 43,012 |
Tags: combinatorics
Correct Solution:
```
inp = input().split(' ')
n = int(inp[0])
k = int(inp[1])
print((k**(k-1)*(n-k)**(n-k)) % 1000000007)
``` | output | 1 | 21,506 | 14 | 43,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 21,507 | 14 | 43,014 |
Tags: combinatorics
Correct Solution:
```
n,k=map(int,input().split());n-=k;print(k**~-k*n**n%(10**9+7))
``` | output | 1 | 21,507 | 14 | 43,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 21,508 | 14 | 43,016 |
Tags: combinatorics
Correct Solution:
```
n, k = map(int, input().split())
d = 1000000007
def f(a, b):
if b == 0: return 1
s, c = 0, b * a
for i in range(1, b + 1):
s += c * f(i, b - i)
c = (a * c * (b - i)) // (i + 1)
return s
print((k * f(1, k - 1) * pow(n - k, n - k, d)) % d)
``` | output | 1 | 21,508 | 14 | 43,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 21,509 | 14 | 43,018 |
Tags: combinatorics
Correct Solution:
```
n,k = list(map(int,input().split()))
print(((k**(k-1))*((n-k)**(n-k)))%((10**9)+7))
``` | output | 1 | 21,509 | 14 | 43,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 21,511 | 14 | 43,022 |
Tags: combinatorics
Correct Solution:
```
nk=input().split()
n=int(nk[0])
k=int(nk[1])
p=10**9+7
a=pow(k,k-1,p)
b=pow(n-k,n-k,p)
print((a*b)%p)
``` | output | 1 | 21,511 | 14 | 43,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength si.
In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He choos... | instruction | 0 | 21,570 | 14 | 43,140 |
Tags: data structures, math, number theory
Correct Solution:
```
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()... | output | 1 | 21,570 | 14 | 43,141 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength si.
In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He choos... | instruction | 0 | 21,571 | 14 | 43,142 |
Tags: data structures, math, number theory
Correct Solution:
```
#!/usr/bin/env python3
# from typing import *
import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq
def input():
return sys.stdin.readline()[:-1]
# sys.setrecursionlimit(1000000)
# _INPUT ... | output | 1 | 21,571 | 14 | 43,143 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength si.
In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He choos... | instruction | 0 | 21,572 | 14 | 43,144 |
Tags: data structures, math, number theory
Correct Solution:
```
from collections import defaultdict, deque, Counter
from sys import stdin, stdout
from heapq import heappush, heappop
import math
import io
import os
import math
# import bisect
from bisect import bisect_left as lower_bound
from bisect import bisect_righ... | output | 1 | 21,572 | 14 | 43,145 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength si.
In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He choos... | instruction | 0 | 21,573 | 14 | 43,146 |
Tags: data structures, math, number theory
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
#from collectio... | output | 1 | 21,573 | 14 | 43,147 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength si.
In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He choos... | instruction | 0 | 21,574 | 14 | 43,148 |
Tags: data structures, math, number theory
Correct Solution:
```
import os, sys
from io import BytesIO, IOBase
from math import gcd
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file... | output | 1 | 21,574 | 14 | 43,149 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.