Kotlin Heroes 5: ICPC Round

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
1431 Kotlin Heroes 5: ICPC Round FINISHED False 9000 131988263 Nov. 12, 2020, 2:35 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 44 ) J Zero-XOR Array PROGRAMMING *special dp

B'You are given an array of integers a of size n . This array is non-decreasing, i. xe2 x80 x89e. a_1 <= a_2 <= ... <= a_n . You have to find arrays of integers b of size 2n - 1 , such that: Calculate the number of arrays that meet all the above conditions, modulo 998244353 . The first line contains a single integer n ( 2 <= n <= 17 ) -- the size of the array a . The second line contains n integers ( 0 <= a_i <= 2^{60} - 1; a_i <= a_{i+1} ) -- elements of the array a . Print a single integer -- the number of arrays that meet all the above conditions, modulo 998244353 . '...

Tutorials

84563

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
98246818 sh1194 J Nov. 13, 2020, 5:27 a.m. OK Kotlin TESTS 131 530 0
98247344 sh1194 J Nov. 13, 2020, 5:38 a.m. OK Kotlin TESTS 131 545 0
98246648 sh1194 J Nov. 13, 2020, 5:23 a.m. OK Kotlin TESTS 131 560 0
98219204 Benq J Nov. 12, 2020, 4:30 p.m. OK Kotlin TESTS 131 560 0
98246973 sh1194 J Nov. 13, 2020, 5:31 a.m. OK Kotlin TESTS 131 561 0
98235544 Benq J Nov. 12, 2020, 10:37 p.m. OK Kotlin TESTS 131 4304 0
98217910 tourist J Nov. 12, 2020, 4:13 p.m. OK Kotlin TESTS 131 5896 102400

remove filters

Back to search problems