text stringlengths 198 433k | conversation_id int64 0 109k |
|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers ask for it, thus you decided to simplify your lif... | 13,400 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers ask for it, thus you decided to simplify your lif... | 13,401 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers ask for it, thus you decided to simplify your lif... | 13,402 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers as... | 13,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers as... | 13,404 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers as... | 13,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers as... | 13,406 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers as... | 13,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers as... | 13,408 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers as... | 13,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i-th good costs a_i coins.
You got tired of remembering the price of each product when customers as... | 13,410 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | 13,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | 13,412 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | 13,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | 13,414 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | 13,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | 13,416 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | 13,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | 13,418 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | 13,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | 13,420 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | 13,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | 13,422 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | 13,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | 13,424 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | 13,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | 13,426 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its way). The queen combines the options given to ... | 13,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its way). The queen combines the options given to ... | 13,428 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its way). The queen combines the options given to ... | 13,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its way). The queen combines the options given to ... | 13,430 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its way). The queen combines the options given to ... | 13,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its way). The queen combines the options given to ... | 13,432 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its way). The queen combines the options given to ... | 13,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its... | 13,434 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its... | 13,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its... | 13,436 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A queen is the strongest chess piece. In modern chess the queen can move any number of squares in any horizontal, vertical or diagonal direction (considering that there're no other pieces on its... | 13,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's always possible to find such rearrangement.
Note... | 13,438 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's always possible to find such rearrangement.
Note... | 13,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's always possible to find such rearrangement.
Note... | 13,440 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's always possible to find such rearrangement.
Note... | 13,441 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's always possible to find such rearrangement.
Note... | 13,442 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's always possible to find such rearrangement.
Note... | 13,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's always possible to find such rearrangement.
Note... | 13,444 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's always possible to find such rearrangement.
Note... | 13,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's al... | 13,446 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's al... | 13,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's al... | 13,448 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's al... | 13,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's al... | 13,450 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's al... | 13,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's al... | 13,452 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have array of n numbers a_{1}, a_{2}, β¦, a_{n}.
Rearrange these numbers to satisfy |a_{1} - a_{2}| β€ |a_{2} - a_{3}| β€ β¦ β€ |a_{n-1} - a_{n}|, where |x| denotes absolute value of x. It's al... | 13,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | 13,454 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | 13,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | 13,456 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | 13,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | 13,458 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | 13,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | 13,460 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | 13,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,462 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,464 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,466 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,468 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,469 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, β¦, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | 13,470 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room allows you to go the (j+1)-th room (and completing... | 13,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room allows you to go the (j+1)-th room (and completing... | 13,472 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room allows you to go the (j+1)-th room (and completing... | 13,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room allows you to go the (j+1)-th room (and completing... | 13,474 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room allows you to go the (j+1)-th room (and completing... | 13,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room allows you to go the (j+1)-th room (and completing... | 13,476 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room allows you to go the (j+1)-th room (and completing... | 13,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room all... | 13,478 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are creating a level for a video game. The level consists of n rooms placed in a circle. The rooms are numbered 1 through n. Each room contains exactly one exit: completing the j-th room all... | 13,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plays a (yet another!) strategic computer game. In this game, he leads an army of mercenaries.
Polycarp wants to gather his army for a quest. There are n mercenaries for hire, and the ... | 13,480 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plays a (yet another!) strategic computer game. In this game, he leads an army of mercenaries.
Polycarp wants to gather his army for a quest. There are n mercenaries for hire, and the ... | 13,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plays a (yet another!) strategic computer game. In this game, he leads an army of mercenaries.
Polycarp wants to gather his army for a quest. There are n mercenaries for hire, and the ... | 13,482 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plays a (yet another!) strategic computer game. In this game, he leads an army of mercenaries.
Polycarp wants to gather his army for a quest. There are n mercenaries for hire, and the ... | 13,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | 13,484 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | 13,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | 13,486 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | 13,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | 13,488 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | 13,489 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | 13,490 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | 13,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that h... | 13,492 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that h... | 13,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that h... | 13,494 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that h... | 13,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that h... | 13,496 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that h... | 13,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that h... | 13,498 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that h... | 13,499 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.