Private submission
Private submission won't be visible to other users and
won't be taken into consideration in ranks.
Disqualify submission
Your submission will be disqualified. Operation
is not reversible.
Hidden submission
Public submission
Click here to view source code.

Source code of every submission to this problem
in this contest is public.
Help

Aliaksei Danchanka: submissions
Multiplicative digital root

ID DATE PROBLEMRESULT TIME MEM LANG
2460085 2009-06-06 00:45:37 Multiplicative digital root accepted 1.60 2.7M

CPP

2460080 2009-06-06 00:44:45 Multiplicative digital root accepted 0.20 2.7M

CPP

2460077 2009-06-06 00:43:52 Multiplicative digital root accepted 1.98 2.7M

CPP

2460069 2009-06-06 00:41:06 Multiplicative digital root time limit exceeded - 2.7M

CPP

2459896 2009-06-05 23:55:29 Multiplicative digital root time limit exceeded - 2.6M

CPP

2459876 2009-06-05 23:50:12 Multiplicative digital root time limit exceeded - 3.4M

CPP

2434184 2009-05-29 00:34:18 Multiplicative digital root time limit exceeded - 4.2M

CPP

2434162 2009-05-29 00:20:40 Multiplicative digital root time limit exceeded - 79M

CPP

2434156 2009-05-29 00:18:23 Multiplicative digital root time limit exceeded - 10M

CPP

2434140 2009-05-29 00:12:14 Multiplicative digital root time limit exceeded - 2.6M

CPP

2434104 2009-05-28 23:58:10 Multiplicative digital root time limit exceeded - 2.6M

CPP

code...
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.