Datasets:

---

evanellis

/

codeforces_gemma_3_27b_it_human_with_Llama-3.1-8B-Instruct_eta0.5_f

like 0

"Основой любой социальной сети является отношение дру(...TRUNCATED)

"def solve():\n n = int(input())\n trips = []\n for _ in range(n):\n trips.append(in(...TRUNCATED)

"The capital of Berland has *n* multifloor buildings. The architect who built up the capital was ver(...TRUNCATED)

"def solve():\n n = int(input())\n t = list(map(int, input().split()))\n \n visited = se(...TRUNCATED)

"After studying the beacons Mister B decided to visit alien's planet, because he learned that they l(...TRUNCATED)

"def solve():\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n b (...TRUNCATED)

"Vova plays a computer game known as Mages and Monsters. Vova's character is a mage. Though as he ha(...TRUNCATED)

"def solve():\n n = int(input())\n a = list(map(int, input().split()))\n \n bonus = 0\n (...TRUNCATED)

"You are given an undirected graph, constisting of *n* vertices and *m* edges. Each edge of the grap(...TRUNCATED)

"def solve():\n s = input()\n n = len(s)\n \n def is_beautiful(x):\n x_str = str((...TRUNCATED)

"There are $n$ cities and $m$ roads in Berland. Each road connects a pair of cities. The roads in Be(...TRUNCATED)

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

"You're given a tree with $n$ vertices.\n\nYour task is to determine the maximum possible number of (...TRUNCATED)

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

"Company \"Robots industries\" produces robots for territory protection. Robots protect triangle ter(...TRUNCATED)

"def solve():\n n, x = map(int, input().split())\n s = input()\n \n def fibonacci(x):\n (...TRUNCATED)