problem_id stringlengths 32 32 | name stringlengths 2 112 | problem stringlengths 202 13k | solutions sequence | test_cases stringlengths 33 28.9M | difficulty class label 24
classes | language stringclasses 1
value | source class label 5
classes | num_solutions int64 2 2 | starter_code stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|
34c570004ec7795aaadb7d0ef147acd6 | brcktsrm | Problem description.
Vipul is a hardworking super-hero who maintains the bracket ratio of all the strings in the world. Recently he indulged himself in saving the string population so much that he lost his ability for checking brackets (luckily, not permanently ).Being his super-hero friend help him in his time of hard... | {
"language": [
1,
1,
1
],
"solution": [
"for _ in range(input()):\n try:\n eval(raw_input())\n print 'YES'\n except TypeError:\n print 'YES'\n except:\n print 'NO'",
"for _ in range(input()):\n ins = raw_input().strip()\n stck = []\n res = \"YES\"... | {"inputs": ["3\n((()))\n(())()\n()(()", "3\n((()))\n(())()\n()())", "3\n((()()\n(())()\n()(()", "3\n((()))\n(())))\n()())", "3\n)))(((\n(())))\n()())", "3\n((()))\n(())()\n))(((", "3\n((()()\n(())()\n()(((", "3\n((()))\n(())()\n()()(", "3\n((()()\n'())()\n()(((", "3\n)))(((\n(())))\n()(*)", "3\n)(()()\n'())()\n()(((", ... | 6EXTERNAL | PYTHON3 | 1CODECHEF | 2 | |
ef0bd132d1ee833bb59308942bab8a9c | comm3 | The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef all carry two-way transceivers so they can stay in constant contact. Of course, these transceivers have a limited range so if two are too far apart, they cannot communicate directly.
The Chef invested in top-of-the-line t... | {
"language": [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
... | {"inputs": ["3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1", "3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1", "3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1", "3\n2\n0 -1\n0 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n2 1", "3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n1 -1\n2\n1 0\n1 2\n1 1", "3\n... | 1EASY | PYTHON3 | 1CODECHEF | 2 | |
749440f73d213d141ea3e1da803f6198 | gcd2 | Frank explained its friend Felman the algorithm of Euclides to calculate the GCD
of two numbers. Then Felman implements it algorithm
int gcd(int a, int b)
{
if (b==0)
return a;
else
return gcd(b,a%b);
}
and it proposes to Frank that makes it
but with a little integer and another integer that has up to 250 d... | {
"language": [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
... | {"inputs": ["2\n2 6\n10 11", "2\n3 6\n10 11", "2\n1 3\n10 11", "2\n0 6\n10 11", "2\n0 6\n0 11", "2\n3 6\n8 22", "2\n3 6\n8 4", "2\n5 2\n10 2", "2\n4 10\n8 6", "2\n7 14\n8 6", "2\n7 14\n8 4", "2\n2 6\n5 2", "2\n0 14\n16 2", "2\n0 11\n10 1", "2\n0 14\n16 1", "2\n1 3\n10 5", "2\n0 12\n0 11", "2\n3 8\n8 4", "2\n0 5\n8 6", ... | 2MEDIUM | PYTHON3 | 1CODECHEF | 2 | |
653443722527be14f1ea12ffbd80a3f3 | luckybal | A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of the lucky digits 4 and 7.
The Little Elephant calls some string T of the length M balanced if there exists at least one integer X (1 ≤ X ≤ M) such that the number of digits 4 in the substring T[1, X - 1] is equal to the n... | {
"language": [
1,
1,
1,
1,
1
],
"solution": [
"n = input()\nfor i in range(n):\n str = raw_input()\n l = len(str)\n megacounter = 0\n counter = 0\n i = 0\n while(1):\n while(i<l and str[i]=='7'):\n i=i+1\n counter=counter+1\n if(i>=l):... | {"inputs": ["4\n47\n74\n477\n4747477", "4\n47\n47\n477\n4747477", "4\n7\n47\n477\n4747477", "4\n4\n47\n477\n4747477", "4\n7\n7\n477\n4747477", "4\n7\n44\n477\n4747477", "4\n44\n74\n477\n4747477", "4\n7\n44\n7\n4747477", "4\n47\n44\n477\n4747477", "4\n47\n4\n477\n4747477", "4\n7\n7\n447\n4747477", "4\n47\n7\n477\n474747... | 2MEDIUM | PYTHON3 | 1CODECHEF | 2 | |
713702cb48591218c127ac8b5855b911 | prpaln | Given a string s. Can you make it a palindrome by deleting exactly one character? Note that size of the string after deletion would be one less than it was before.
Input
First line of the input contains a single integer T denoting number of test cases.
For each test case, you are given a single line containing string... | {
"language": [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
"solution": [
"import math\nimport sys\ndef checkpal(s):\n return s==s[::-1]\nfor a in range(input()):\n s=raw_input()\n l=len(s)\n if(l==2):\n print \"YES\"\n else:\n if chec... | {"inputs": ["4\naaa\nabc\nabdbca\nabba", "4\naaa\nabc\nabdbca\nabca", "4\naaa\nabc\nabdbc`\naaca", "4\naab\nacc\n`bd`cb\naaad", "4\nbaa\nabc\n`bd`bb\naabd", "4\nbab\nabb\nbb`db`\naabd", "4\nbaa\n`aa\nbb`c`b\ndba`", "4\nba`\n`aa\nbb`c_c\ndba`", "4\n`a_\naa`\ndda`^c\nca^a", "4\n_c`\n]`_\ncdad^`\n`c_^", "4\n_c`\n]`_\ncdac... | 2MEDIUM | PYTHON3 | 1CODECHEF | 2 | |
91659162144fae7c6e65f91d02379043 | tf01 | An established group of scientists are working on finding solution to NP hard problems. They claim Subset Sum as an NP-hard problem. The problem is to determine whether there exists a subset of a given set S whose sum is a given number K.
You are a computer engineer and you claim to solve this problem given that all... | {
"language": [
1
],
"solution": [
"import sys\n\nfor __ in range(input()) :\n n , k = map(int,sys.stdin.readline().split())\n lists = map(int,sys.stdin.readline().split())\n dp = [0]*(k+1)\n dp[0]=1\n for i in lists :\n for j in range(k-i,-1,-1) :\n if dp[k] :\n ... | {"inputs": ["2\n5 10\n3 4 6 1 9\n3 2\n1 3 4"], "outputs": ["1\n0"]} | 6EXTERNAL | PYTHON3 | 1CODECHEF | 2 | |
78e09093cc14a9153fa66da7dded8afd | 1012_E. Cycle sort | "You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED) | {"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | "{\"inputs\": [\"5 5\\n3 2 3 1 1\\n\", \"4 3\\n2 1 4 3\\n\", \"2 0\\n2 2\\n\", \"5 0\\n884430748 884(...TRUNCATED) | 11E | PYTHON3 | 2CODEFORCES | 2 | |
2134415ced87b8fc2bce4549a0aeef7a | 1037_E. Trips | "There are n persons who initially don't know each other. On each morning, two of them, who were not(...TRUNCATED) | {"language":[2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,4,2,4,2,2,4,2,2,2,4,2,2,4,4,4,2,4,2,4,4,1,4,4(...TRUNCATED) | "{\"inputs\": [\"4 4 2\\n2 3\\n1 2\\n1 3\\n1 4\\n\", \"5 8 2\\n2 1\\n4 2\\n5 4\\n5 2\\n4 3\\n5 1\\n4(...TRUNCATED) | 11E | PYTHON3 | 2CODEFORCES | 2 | |
0df7a8f97f44a05d3e4d8a030305533f | 1060_A. Phone Numbers | "Let's call a string a phone number if it has length 11 and fits the pattern \"8xxxxxxxxxx\", where (...TRUNCATED) | {"language":[3,2,3,1,2,3,3,3,4,4,2,3,1,2,3,1,3,1,1,3,4,3,4,2,3,2,4,3,3,1,2,3,3,2,3,1,3,1,2,4,3,3,4,3(...TRUNCATED) | "{\"inputs\": [\"22\\n0011223344556677889988\\n\", \"11\\n00000000008\\n\", \"11\\n31415926535\\n\",(...TRUNCATED) | 7A | PYTHON3 | 2CODEFORCES | 2 | |
c43bbddcd6fcd849ac321f690995ea54 | 1081_G. Mergesort Strikes Back | "Chouti thought about his very first days in competitive programming. When he had just learned to wr(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | "{\"inputs\": [\"3 2 998244353\\n\", \"9 3 998244353\\n\", \"3 1 998244353\\n\", \"9 4 998244353\\n\(...TRUNCATED) | 13G | PYTHON3 | 2CODEFORCES | 2 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 43