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
Discussion of Problem
1204
. Idempotents
Subject
Author
Problem
Updated
Answers
Can someone explain this problem to me?
Stefan Ciobaca
1204
. Idempotents
19 Oct 2002 15:20
2
PLS! Can N be prime?
Rostislav
1204
. Idempotents
16 Apr 2002 02:06
1
why? 5^5=5 (mod 6) !!
wuwuwu
1204
. Idempotents
10 Apr 2002 18:05
1
My program is "Limit Time",Who can help me!
gaozhenwei
1204
. Idempotents
8 Apr 2002 14:27
5
Oh!I lost myself,my confidence in this unfortunate problem.Maybe I foget all of my resplendence in the past.What a shame!
Blue cat
1204
. Idempotents
20 Mar 2002 11:42
2
Yes,I know all this.My algorithm is O(sqrt(n)),but I got Time Limited exceeded.The program uses only 1.5 sec at my computer when K=1000 and the dataset is random.It will cost also O(sqrt(n)) to get p
Blue cat
1204
. Idempotents
20 Mar 2002 11:41
3
Someone could help me with the TL?? (+)
Miguel Angel
1204
. Idempotents
20 Mar 2002 11:17
1
After all,thanks to all those who help me.
Blue cat
1204
. Idempotents
19 Mar 2002 16:00
0
Can anybody help me with P1204?If so,please send message to "flyingbluecat@hotmail.com".
Blue cat
1204
. Idempotents
19 Mar 2002 15:25
1
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2024
Timus Online Judge Team
. All rights reserved.