| ENG RUS | Timus Online Judge |
Discussion of Problem 1233. Amusing NumbersAndrewy WA5 // Problem 1233. Amusing Numbers 22 Jul 2019 23:41 1)Pls, give me some tests 2)Am I right that answer < 10^18? Edited by author 22.07.2019 23:42 Cebotari Vladislav Just use int64_t // Problem 1233. Amusing Numbers 29 Dec 2013 17:16 If you work in C, just use int64_t for N and it will work! I spend like 2 hours solving bugs just because of datatypes (facepalm) Cebotari Vladislav WA#4, // Problem 1233. Amusing Numbers 29 Dec 2013 02:55 Well, I guess there is some sneaky thing. Someone can give me test 4 please. Thanks skyjiange is it possible that N >2^64-1? [1] // Problem 1233. Amusing Numbers 20 Nov 2011 10:55 I thought it may happend,so I used BigInteger and gotAC in 0.14s. it's too slow,but i found all the test is <=10^18.long long is enough. Edited by author 20.11.2011 11:23 skyjiange Re: is it possible that N >2^64-1? // Problem 1233. Amusing Numbers 20 Nov 2011 11:22 > Edited by author 20.11.2011 11:23 Khramov Egor(9 class) Why WA#3. I don't know where my mistake. [1] // Problem 1233. Amusing Numbers 7 Jun 2005 01:04 Programmer Re: Why WA#3. I don't know where my mistake. // Problem 1233. Amusing Numbers 15 Jan 2010 04:31 Third test is the third test in the example. Dmitry 'Diman_YES' Kovalioff Good problem! (-) [9] // Problem 1233. Amusing Numbers 28 Feb 2003 10:49 Dinh Hong Minh Re: Good problem! (-) [2] // Problem 1233. Amusing Numbers 28 Feb 2003 11:01 I agree with you ! I am david. Tabo. Can you post the task description. [1] // Problem 1233. Amusing Numbers 28 Feb 2003 13:19 > > I agree with you ! > Dmitry 'Diman_YES' Kovalioff http://neerc.ifmo.ru/Regional/problems/amusing.htm (-) // Problem 1233. Amusing Numbers 28 Feb 2003 16:53 Locomotive I got about 5WA on it. i check all test that was on contests-tests.rar but again it says WA:( [1] // Problem 1233. Amusing Numbers 28 Feb 2003 16:10 Here is my code mail me aidin_n7@hotmail.com Const B : Array[0..20] of double = ((1),(10),(100),(1000),(10000),(100000), (1000000),(10000000),(100000000), (1000000000), (10000000000.0), (100000000000.0), (1000000000000.0), (10000000000000.0), (100000000000000.0), (1000000000000000.0), (10000000000000000.0), (100000000000000000.0), (1000000000000000000.0), (10000000000000000000.0), (100000000000000000000.0)); Var M,K : Longint; P,Y : comp; I,L : byte; Flag : Boolean; Begin Readln(k,m); L:=0; repeat Inc(L); Until B[L]>K; P:=0; Y:=K-B[L-1]; For i:=1 to L do P:=P+(trunc(Y) div Trunc(B[L-I]))+1; If M<p then Writeln(0) Else If M=P then Writeln(K) Else Begin IF Y<B[L-1] then begin Dec(L); flag:=False; end else flag:=True; If Y=0 Then Begin Writeln(0); Exit End; Repeat M:=M-Trunc(P); Y:=Y*10; Inc(L); P:=y; Until M<=p; Writeln(B[L-ord(Flag)]+M-1:0:0); End; End. Dmitry 'Diman_YES' Kovalioff Check your mail :) (-) // Problem 1233. Amusing Numbers 28 Feb 2003 16:50 Oberon (Yura Znovyak) How to submit that problem? In problemset last problem is 1232 (Asteroid Landing)? when I try to submit something after 1232 I am reported that that problem does not exist :( [3] // Problem 1233. Amusing Numbers 28 Feb 2003 16:30 > Dmitry 'Diman_YES' Kovalioff You should just click "Submit Problem" and fill the filed "Problem" as 1233 (or 1234, ..., 1241) (-) [2] // Problem 1233. Amusing Numbers 28 Feb 2003 16:41 > > Oberon (Yura Znovyak) Thanks! Where can I get problems themself? [1] // Problem 1233. Amusing Numbers 28 Feb 2003 16:48 > > > Dmitry 'Diman_YES' Kovalioff http://neerc.ifmo.ru/Regional/problems/index.htm (-) // Problem 1233. Amusing Numbers 28 Feb 2003 16:52
|