name stringlengths 6 41 | description stringlengths 217 4.44k | private_tests sequence | public_tests sequence | generated_tests sequence |
|---|---|---|---|---|
playing-with-substrings | Description
You are given two strings S and T, such that length of S is greater than the length of T.
Then a substring of S is defined as a sequence of characters which appear consecutively in S.
Find the total number of distinct substrings of M such that T is a substring of M
Input Format
One line containing strings... | {
"input": [
"aaaa a",
"abcd cb",
"a abab"
],
"output": [
"4\n",
"0\n",
"0\n"
]
} | {
"input": [],
"output": []
} | {
"input": [
"aaaa b",
"dcba cb",
"aa`a a",
"dcac dc",
"a``a a",
"b abab",
"aaaa c",
"dcba bc",
"b baba",
"aaa` c",
"dcab bc",
"b aaba",
"aa`a c",
"dcab bd",
"b aaaa",
"aa`a b",
"dbac bd",
"b abaa",
"a`aa b",
"dcac bd",
"a abaa",
... |
battle-of-stalingrad-1 | The bloodiest battle of World War II has started. Germany and its allies have attacked the Soviet union army to gain control of the city of Stalingrad (now Volgograd) in the south-western Soviet Union.The war has become intensive and the soviet union's 64th army is fighting against the germans. General "Vasily Chuikov"... | {
"input": [
"36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 3\n1 3 10 5 10 10 4 1\n10 3 10 4 5 5 3 4\n10 3 4 9 3 3 7 3\n6 9 9 2 6 4 3 3\n7 2 1 10 4 7 6 2\n3 4 3 4 3 2 9 5\n7 8 2 9 8 3 2 3\n5 4 6 9 4 4 8 3\n5 2 2 8 1 5 7 5\n4 7 10 2 10 9 2 3\n4 8 2 3 6 6 3 2\n8 10 4 3 4 2... | {
"input": [],
"output": []
} | {
"input": [
"36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 3\n1 3 10 5 10 10 4 1\n10 3 10 4 5 5 3 4\n10 3 4 9 3 3 7 3\n6 9 9 2 6 4 3 3\n7 2 1 10 4 7 6 2\n3 4 3 4 3 2 9 5\n7 8 2 9 8 3 2 3\n5 4 6 9 4 4 8 3\n5 2 2 8 1 5 7 5\n4 7 10 2 10 9 2 3\n4 8 2 3 6 6 3 2\n8 10 4 3 4 2... |
mind-palaces-3 | Sherlock Holmes loves mind palaces! We all know that.
A mind palace, according to Mr. Holmes is something that lets him retrieve a given memory in the least time posible. For this, he structures his mind palace in a very special way. Let a NxM Matrix denote the mind palace of Mr. Holmes. For fast retrieval he keeps ea... | {
"input": [
"5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -432112275 -421496588 -351507172\n-323741602 -232192004 -30134637 -369573 100246476\n156824549 174266331 392354039 601294716 763826005\n768378344 802829330 818988557 992012759 999272829\n10\n156824549\n-758584352\n-99... | {
"input": [],
"output": []
} | {
"input": [
"5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -432112275 -421496588 -351507172\n-323741602 -232192004 -30134637 -369573 100246476\n156824549 174266331 392354039 601294716 763826005\n768378344 802829330 818988557 992012759 999272829\n8\n156824549\n-758584352\n-993... |
207_D9. The Beaver's Problem - 3 | "The Smart Beaver from ABBYY came up with another splendid problem for the ABBYY Cup participants! T(...TRUNCATED) | {"input":["42000\nLAWSON SEES NO CHANGE IN U.K. MONETARY POLICY\nWASHINGTON, April 9 - British Chanc(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["42000\nLAWSON SEES NO CHANGE IN U.K. MONETARY POLICY\nWASHINGTON, April 9 - Brisish Chanc(...TRUNCATED) |
permutation-again | "Given an integer N. Find out the PermutationSum where PermutationSum for integer N is defined as t(...TRUNCATED) | {"input":["10000\n30001\n30002\n30003\n30004\n30005\n30006\n30007\n30008\n30009\n30010\n30011\n30012(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["10000\n30001\n30002\n30003\n30004\n30005\n30006\n30007\n30008\n30009\n30010\n30011\n30012(...TRUNCATED) |
guess-the-permutation-easy-contest | "In this problem your goal is to guess some secret permutation A of integers from 1 to 16.\n\nThere (...TRUNCATED) | {
"input": [
"ELEMENT\n1 13",
"ELEMENT\n6 4"
],
"output": [
"13\n",
"4\n"
]
} | {
"input": [],
"output": []
} | {"input":["ELEMENT\n2 15","ELEMENT\n9 2","ELEMENT\n16 3","ELEMENT\n4 6"],"output":["15\n","2\n","3\n(...TRUNCATED) |
connecting-boxes-1 | "Problem:\n\nN boxes are arranged systematically in a circle and numbered from 1 to N in increasing (...TRUNCATED) | {"input":["616 4\n305 250\n558 43\n182 37\n297 138","60 5\n60 28\n32 38\n31 44\n48 30\n14 34","7 6\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["938 4\n305 250\n558 43\n182 37\n297 138","60 5\n60 28\n32 38\n31 44\n48 30\n14 4","7 6\n5(...TRUNCATED) |
next-lucky-number | "Lucky numbers are defined as the numbers consisting only of digits 3 and 5. So, given a number N, y(...TRUNCATED) | {"input":["100\n200\n201\n202\n203\n204\n205\n206\n207\n208\n209\n210\n211\n212\n213\n214\n215\n216\(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["100\n200\n201\n202\n203\n204\n205\n206\n207\n208\n209\n210\n211\n212\n213\n214\n215\n216\(...TRUNCATED) |
project-team | "A Professor of Physics gave projects to the students of his class. The students have to form a team(...TRUNCATED) | {"input":["8\n4 2 6 4 3\n6 1 1 1 1 1 1\n8 4 2 4 2 1 3 3 7\n14 5 1 8 8 13 7 6 2 1 9 5 11 3 4\n50 1 2 (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["8\n4 2 6 4 3\n6 1 1 1 1 1 1\n8 4 2 4 2 1 3 3 7\n14 5 1 8 8 13 7 6 2 1 9 5 11 3 4\n50 1 2 (...TRUNCATED) |
207_D10. The Beaver's Problem - 3 | "The Smart Beaver from ABBYY came up with another splendid problem for the ABBYY Cup participants! T(...TRUNCATED) | {"input":["56000\nU.K. MONEY MARKET DEFICIT FORECAST AT 400 MLN STG\nLONDON, April 13 - The Bank of (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["56000\nU.K. LONEY MARKET DEFICIT FORECAST AT 400 MLN STG\nLONDON, April 13 - The Bank of (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5