首页 > TAG信息列表 > outputCopy
Codeforces Round #716 (Div. 2) C. Product 1 Modulo N
problem C. Product 1 Modulo N time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Now you get Baby Ehab’s first words: “Given an integer n, find the longest subsequence of [1,2,…,n−1] whose product水题Eating Soup
A. Eating Souptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output The three friends, Kuro, Shiro, and Katie, met up again! It’s time for a party… What the cats do when they unite? Right, theD1. Equalizing by Division (easy version)
The only difference between easy and hard versions is the number of elements in the array. You are given an array a consisting of n integers. In one move you can choose any ai and divide it by 2 rounding down (in other words, in one move you can set aCodeforces Round #566 (Div. 2)B. Plus from Picture
You have a given picture with size w×h. Determine if the given picture has a single “+” shape or not. A “+” shape is described below: A “+” shape has one center nonempty cell. There should be some (at least one) consecutive non-empty cells in eacD - Liebig's Barrels CodeForces - 985C
C. Liebig’s Barrels time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You have m = n·k wooden staves. The i-th stave has length ai. You have to assemble n barrels consisting of k staves each, you