Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
---|---|---|---|---|---|---|
513 | Rockethon 2015 | FINISHED | False | 11700 | 313851563 | Feb. 7, 2015, 5 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 2820 ) | B2 | Permutations | PROGRAMMING | bitmasks divide and conquer math | 1800 |
B"You are given a permutation p of numbers 1, xe2 x80 x892, xe2 x80 x89..., xe2 x80 x89n. Let's define f(p) as the following sum: Find the lexicographically m-th permutation of length n in the set of permutations having the maximum possible value of f(p). The single line of input contains two integers n and m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89cntn), where cntn is the number of permutations of length n with maximum possible value of f(p). The problem consists of two subproblems. The subproblems have different constraints on the input. You will get some score for the correct submission of the subproblem. The description of the subproblems follows. Output n number forming the required permutation. In the first example, both permutations of numbers {1, 2} yield maximum possible f(p) which is equal to 4. Among them, (2, xe2 x80 x891) comes second in lexicographical order."... |
16260 |
No solutions yet.