VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror)

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
661 VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) FINISHED False 9000 271517099 April 10, 2016, 4:35 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 638 ) A Lazy Caterer Sequence PROGRAMMING *special 1400

B'Lazy caterer sequence is defined as the maximum number of pieces formed when slicing a convex pancake with n cuts (each cut is a straight line). The formula is Cn xe2 x80 x89= xe2 x80 x89n xc2 xb7(n xe2 x80 x89+ xe2 x80 x891) xe2 x80 x89/ xe2 x80 x892 xe2 x80 x89+ xe2 x80 x891. You are given n; calculate n-th element of the sequence. The only line of the input contains an integer n (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100). Output the n-th element of lazy caterer sequence. '...

Tutorials

Tutorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
22397607 ishtiaque A Nov. 22, 2016, 6:17 a.m. OK J TESTS 20 31 0 1400
19467767 Vulfke A July 28, 2016, 7:59 p.m. OK J TESTS 20 31 0 1400
17326320 qinyuxiang A April 15, 2016, 12:20 p.m. OK J TESTS 20 31 0 1400
17322589 its_like_never_before A April 15, 2016, 5:51 a.m. OK J TESTS 20 31 0 1400
17320380 Wael.Al.Jamal A April 14, 2016, 9:19 p.m. OK J TESTS 20 31 0 1400
17320226 77storm A April 14, 2016, 9 p.m. OK J TESTS 20 31 0 1400
17306117 miroqurcika A April 13, 2016, 5:56 p.m. OK J TESTS 20 31 0 1400
17305102 amirbagh75 A April 13, 2016, 4:39 p.m. OK J TESTS 20 31 0 1400
17301753 Shik A April 13, 2016, 12:21 p.m. OK J TESTS 20 31 0 1400
17294350 Slav9n A April 12, 2016, 6:54 p.m. OK J TESTS 20 31 0 1400

remove filters

Back to search problems