ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
Common Board
Subject
Author
Problem
Updated
Answers
There is a simple O(n) algorithm that does not use mathematical GCD algorithm
Nic Roets
1024
. Permutations
15 Sep 2016 05:17
1
Please help me Wa15, in c++ with BINARY SEARCH
Fibo
1133
. Fibonacci Sequence
15 Sep 2016 04:39
5
WA, please help
Danica Porobic
1057
. Amount of Degrees
15 Sep 2016 00:44
2
Test 5 Runtime error
Pontmen
1002
. Phone Numbers
14 Sep 2016 21:38
0
WA#8 test
Umidbek
1423
. String Tale
14 Sep 2016 15:43
0
all tests please
Evilcookie228
1353
. Milliard Vasya's Function
13 Sep 2016 17:02
0
poj.org solution app on google play
daydreamer
13 Sep 2016 07:38
0
Wrong Answer For Test 19
K P Charith Chowdary
1297
. Palindrome
12 Sep 2016 20:32
4
always get Runtime error (access violation) C#
ArtemArtem
1136
. Parliament
12 Sep 2016 15:33
1
Short solution
fjxttq
1496
. Spammer
12 Sep 2016 09:55
1
WA#14 getters :)
kerpoo
1630
. Talisman
12 Sep 2016 06:13
0
WA#7 getters :)
kerpoo
1630
. Talisman
12 Sep 2016 06:12
0
if Graph , Full Graph, answer->?
xurshid_n
1630
. Talisman
12 Sep 2016 05:58
4
can anyone give a counterexample if BFS is wrong?
kerpoo
1254
. Die Hard
11 Sep 2016 21:01
1
WA#4
evil
1104
. Don’t Ask Woman about Her Age
11 Sep 2016 17:06
0
HINT
Alibi
1935
. Tears of Drowned
11 Sep 2016 12:56
2
please help me why it is wrong
xinxin
1079
. Maximum
11 Sep 2016 08:08
4
Accepted N=11 Test Answer
TARASHI {Kutaisi SU3} (Georgia)
1149
. Sinus Dances
11 Sep 2016 02:14
0
Using Short path algo seems feasible
Blackops
1741
. Communication Fiend
10 Sep 2016 21:43
1
Different status with different compilers
Infoshoc
1306
. Sequence Median
9 Sep 2016 21:48
0
Previous Page
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2025
Timus Online Judge Team
. All rights reserved.