conversations listlengths 2 2 | thinking stringclasses 1
value | status stringclasses 1
value |
|---|---|---|
[
{
"content": "Harsh, like usual, started studying 6 months before for his end semester examinations. He was going to complete his 8th revision of the whole syllabus, when suddenly Pranav showed up in his room with the last year's question paper for their algorithms course. This paper contains a problem which bo... | off | success |
[
{
"content": "You are given an array A of length N weights of masses A_1, A_2...A_N. No two weights have the same mass. You can put every weight on one side of the balance (left or right). You don't have to put weights in order A_1,...,A_N. There is also a string S consisting of characters \"L\" and \"R\", mean... | off | success |
[
{
"content": "Given a string $$$x$$$ of length $$$n$$$ and a string $$$s$$$ of length $$$m$$$ ($$$n \\cdot m \\le 25$$$), consisting of lowercase Latin letters, you can apply any number of operations to the string $$$x$$$.\n\nIn one operation, you append the current value of $$$x$$$ to the end of the string $$$... | off | success |
[
{
"content": "The famous sculptor Cicasso is a Reberlandian spy!\n\nThese is breaking news in Berlandian papers today. And now the sculptor is hiding. This time you give the shelter to the maestro. You have a protected bunker and you provide it to your friend. You set the security system in such way that only y... | off | success |
[
{
"content": "Tic-Tac-Toe used to be Chef's favourite game during his childhood. Reminiscing in his childhood memories, he decided to create his own \"Tic-Tac-Toe\", with rules being similar to the original Tic-Tac-Toe, other than the fact that it is played on an NxN board.\n\nThe game is played between two pla... | off | success |
[
{
"content": "Mirko and Slavko are playing a new game, “Trojke” (Triplets, in English). First they use a chalk to draw an $N \\times N$ square grid on the road. Then they write letters into some of the squares. No letter is written more than once in the grid.\n\nThe game consists of trying to find three letters... | off | success |
[
{
"content": "Little Petya loves playing with squares. Mum bought him a square 2n × 2n in size. Petya marked a cell inside the square and now he is solving the following task.\n\nThe task is to draw a broken line that would go along the grid lines and that would cut the square into two equal parts. The cutting ... | off | success |
[
{
"content": "Given is a string S consisting of `0` and `1`. Find the number of strings, modulo 998244353, that can result from applying the following operation on S between 0 and K times (inclusive):\n\n* Choose a pair of integers i, j (1\\leq i < j\\leq |S|) such that the i-th and j-th characters of S are `0`... | off | success |
[
{
"content": "Andy and Bob are the only two delivery men of Pizza-chef store. Today, the store received N orders.\nIt's known that the amount of tips may be different when handled by different delivery man.\nMore specifically, if Andy takes the i^th order, he would be tipped Ai dollars and if Bob takes this ord... | off | success |
[
{
"content": "As we all know that power sets of any set are formed by taking i elements (where i is from 1 to n) and then random shuffling them like this power set of {1,2,3} are {EMPTY SET},{1},{2},{3},{1,2}{1,3}{2,3}{1,2,3} .\nNow we have a MODIfied POWER SET which contains only those subsets which have cons... | off | success |
[
{
"content": "Vasya’s elder brother Petya loves playing computer games. In one of his favourite computer games Petya reached the final level where a fight with the boss take place.\n\nWhile playing the game Petya found spell scrolls and now he is about to use them. Let’s describe the way fighting goes on this l... | off | success |
[
{
"content": "Do you know Just Odd Inventions? The business of this company is to \"just odd inventions\". Here, it is abbreviated as JOI.\n\nJOI is conducting research to confine many microorganisms in one petri dish alive. There are N microorganisms to be investigated, and they are numbered 1, 2, ..., N. When... | off | success |
[
{
"content": "Given N, count all ‘a’(>=1) and ‘b’(>=0) that satisfy the condition a^{3} + b^{3 }= N.\n \nExample 1:\nInput:\nN = 9 \nOutput:\n2\nExplanation:\nThere are two solutions: (a=1, b=2)\nand (a=2, b=1).\nExample 2:\nInput:\nN = 27\nOutput:\n1\nExplanation:\nThereis only one solution: (a=3, b=0)\n \nYou... | off | success |
[
{
"content": "Karlsson has visited Lillebror again. They found a box of chocolates and a big whipped cream cake at Lillebror's place. Karlsson immediately suggested to divide the sweets fairly between Lillebror and himself. Specifically, to play together a game he has just invented with the chocolates. The winn... | off | success |
[
{
"content": "A necklace can be described as a string of links ('-') and pearls ('o'), with the last link or pearl connected to the first one.\n\nYou can remove a link or a pearl and insert it between two other existing links or pearls (or between a link and a pearl) on the necklace. This process can be repeate... | off | success |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 44