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 |
399220163 |
May 25, 2012, 3:30 p.m. |
Problems
B'Least common multiple (LCM) of two numbers is the smallest positive integer which is divisible by both of them. You are given integers a and b. Calculate their LCM. The input contains two integers a and b (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89a, xe2 x80 x89b xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89103), separated by a single space. Output LCM(a, b).'... |
Tutorials
Submissions
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|
1717538 |
N-canTER |
C |
May 25, 2012, 4:38 p.m. |
OK |
Roco |
TESTS |
36 |
10 |
1126400 |
|
1400 |
|
3958173 |
stevenkplus |
C |
June 25, 2013, 7 a.m. |
OK |
Roco |
TESTS |
36 |
15 |
0 |
|
1400 |
|
3669327 |
Omelianenko |
C |
May 4, 2013, 1:35 p.m. |
OK |
Roco |
TESTS |
36 |
15 |
0 |
|
1400 |
|
3586175 |
Alex_Mishenev |
C |
April 21, 2013, 5:52 p.m. |
OK |
Roco |
TESTS |
36 |
15 |
0 |
|
1400 |
|
3035008 |
romanychda |
C |
Jan. 29, 2013, 8:43 p.m. |
OK |
Roco |
TESTS |
36 |
15 |
0 |
|
1400 |
|
3816685 |
yermak0v |
C |
June 2, 2013, 6:23 p.m. |
OK |
Roco |
TESTS |
36 |
15 |
102400 |
|
1400 |
|
66596364 |
i_d_f |
C |
Dec. 10, 2019, 2:49 p.m. |
OK |
Roco |
TESTS |
36 |
30 |
0 |
|
1400 |
|
64783710 |
steven1029 |
C |
Nov. 13, 2019, 8:19 a.m. |
OK |
Roco |
TESTS |
36 |
30 |
0 |
|
1400 |
|
54893678 |
Gamapro |
C |
May 31, 2019, 11:17 p.m. |
OK |
Roco |
TESTS |
36 |
30 |
0 |
|
1400 |
|
46247402 |
nongi |
C |
Nov. 26, 2018, 12:14 p.m. |
OK |
Roco |
TESTS |
36 |
30 |
0 |
|
1400 |
remove filters
Back to search problems