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 |
---|---|---|---|---|---|---|
130 | Unknown Language Round 4 | FINISHED | False | 10800 | 410021999 | Nov. 20, 2011, 3 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 341 ) | J | Date calculation | PROGRAMMING | *special | 2300 |
B'In Gregorian calendar a typical year consists of 365 days and 12 months. The numbers of days in the months are: 31, xe2 x80 x8928, xe2 x80 x8931, xe2 x80 x8930, xe2 x80 x8931, xe2 x80 x8930, xe2 x80 x8931, xe2 x80 x8931, xe2 x80 x8930, xe2 x80 x8931, xe2 x80 x8930, xe2 x80 x8931. If year index is divisible by 400, or divisible by 4 but not by 100, the year becomes leap year, with one extra day in the second month (the one which typically has 28 days). You are given the index of the year and the index of the day in the year. Find out the date of this day (day and month it will fall upon). The first line of input contains the year index, between 1600 and 2400, inclusive. The second line contains the day index, between 1 and 366, inclusive. It is guaranteed that the day index will be valid for this year, i.e., day 366 will occur only in a leap year. Output the index of the day and the index of the month, separated with a space. All indexes are 1-based.'... |
Unknown Language Round #4: editorial |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
---|---|---|---|---|---|---|---|---|---|---|---|
3669384 | Omelianenko | J | May 4, 2013, 1:45 p.m. | OK | Befunge | TESTS | 50 | 140 | 0 | 2300 | |
3005562 | romanychda | J | Jan. 24, 2013, 10:43 p.m. | OK | Befunge | TESTS | 50 | 140 | 0 | 2300 | |
18508022 | I_Need_Alex_R_Coleman | J | June 15, 2016, 10:44 p.m. | OK | Befunge | TESTS | 50 | 156 | 0 | 2300 | |
3816653 | yermak0v | J | June 2, 2013, 6:17 p.m. | OK | Befunge | TESTS | 50 | 156 | 0 | 2300 | |
3064979 | hariprasath | J | Feb. 2, 2013, 5:10 p.m. | OK | Befunge | TESTS | 50 | 156 | 0 | 2300 | |
26605231 | CyberZHG | J | April 23, 2017, 1:42 p.m. | OK | Befunge | TESTS | 50 | 156 | 5427200 | 2300 | |
23670907 | Ali.Pi | J | Jan. 9, 2017, 8:46 p.m. | OK | Befunge | TESTS | 50 | 156 | 5427200 | 2300 | |
935057 | stevenkplus | J | Dec. 8, 2011, 1:33 a.m. | OK | Befunge | TESTS | 50 | 160 | 4300800 | 2300 | |
886608 | ivan386 | J | Nov. 22, 2011, 11:11 p.m. | OK | Befunge | TESTS | 50 | 160 | 4300800 | 2300 | |
885178 | rulojuka | J | Nov. 22, 2011, 4:13 a.m. | OK | Befunge | TESTS | 50 | 160 | 4300800 | 2300 |
Back to search problems