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 |
| 188
|
Surprise Language Round 6 |
FINISHED |
False |
7200 |
393863399 |
May 25, 2012, 3:30 p.m. |
Problems
B'You are given a number n. Print n lines, i-th line should consist of i characters "*". Lines ' indices are 1-based. The only line of input contains an integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8950). Output the described pattern.'... |
Tutorials
Submissions
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|
2086621 |
vlad107 |
D |
Sept. 1, 2012, 9:01 a.m. |
OK |
Roco |
TESTS |
29 |
10 |
307200 |
|
1400 |
|
1717876 |
daonix |
D |
May 25, 2012, 4:59 p.m. |
OK |
Roco |
TESTS |
29 |
10 |
1126400 |
|
1400 |
|
1717681 |
annaalkh |
D |
May 25, 2012, 4:47 p.m. |
OK |
Roco |
TESTS |
29 |
10 |
1126400 |
|
1400 |
|
1716885 |
natsugiri |
D |
May 25, 2012, 4:09 p.m. |
OK |
Roco |
TESTS |
29 |
10 |
1126400 |
|
1400 |
|
1716687 |
Abra |
D |
May 25, 2012, 4:02 p.m. |
OK |
Roco |
TESTS |
29 |
10 |
1126400 |
|
1400 |
|
3958367 |
stevenkplus |
D |
June 25, 2013, 7:59 a.m. |
OK |
Roco |
TESTS |
29 |
15 |
0 |
|
1400 |
|
3037352 |
romanychda |
D |
Jan. 30, 2013, 2:53 p.m. |
OK |
Roco |
TESTS |
29 |
15 |
0 |
|
1400 |
|
4080032 |
Router |
D |
July 16, 2013, 9:23 a.m. |
OK |
Roco |
TESTS |
29 |
15 |
102400 |
|
1400 |
|
3816687 |
yermak0v |
D |
June 2, 2013, 6:23 p.m. |
OK |
Roco |
TESTS |
29 |
15 |
102400 |
|
1400 |
|
3669330 |
Omelianenko |
D |
May 4, 2013, 1:36 p.m. |
OK |
Roco |
TESTS |
29 |
15 |
102400 |
|
1400 |
remove filters
Back to search problems