Datasets:

---

evanellis

/

codeforces_gemma_3_27b_it_human_with_Llama-3.1-8B-Instruct_eta0.5

like 0

"There will be a launch of a new, powerful and unusual collider very soon, which located along a str(...TRUNCATED)

"def solve():\n n, m = map(int, input().split())\n grid = []\n for _ in range(n):\n (...TRUNCATED)

"You are given *n* integers *a*1,<=<=*a*2,<=<=...,<=<=*a**n*.\n\nA sequence of integers *x*1,<=<=*x*(...TRUNCATED)

"def solve():\n n = int(input())\n p = list(map(int, input().split()))\n \n max_records (...TRUNCATED)

"The princess is going to escape the dragon's cave, and she needs to plan it carefully.\n\nThe princ(...TRUNCATED)

"def solve():\n h, w, n = map(int, input().split())\n black_cells = []\n for _ in range(n):(...TRUNCATED)

"Misha has an array of *n* integers indexed by integers from 1 to *n*. Let's define palindrome degre(...TRUNCATED)

"def solve():\n h, w, q = map(int, input().split())\n grid = [list(input()) for _ in range(h)](...TRUNCATED)

"You are given *n* points on a plane. All the points are distinct and no three of them lie on the sa(...TRUNCATED)

"def solve():\n n, m = map(int, input().split())\n \n def num_digits_base7(x):\n if (...TRUNCATED)

"Iahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The(...TRUNCATED)

"def solve():\n n, k = map(int, input().split())\n fighters = []\n for _ in range(n):\n (...TRUNCATED)

"Vanya has a table consisting of 100 rows, each row contains 100 cells. The rows are numbered by int(...TRUNCATED)

"from itertools import permutations\n\ndef solve():\n a = input()\n digits = sorted(list(a))\n(...TRUNCATED)

"Vasya came up with his own weather forecasting method. He knows the information about the average a(...TRUNCATED)

"import math\n\ndef solve():\n n, a, d = map(int, input().split())\n trolleybuses = []\n fo(...TRUNCATED)