| ENG RUS | Timus Online Judge |
Discussion of Problem 1262. Pseudo-Roman Numbermonyura[ONU 1 2/3] 9 = IX also 9 = VIV [1] // Problem 1262. Pseudo-Roman Number 25 Jul 2011 16:41 The nine has two representation according to to these rules, am I wrong? Dmitri Belous Re: 9 = IX also 9 = VIV // Problem 1262. Pseudo-Roman Number 20 Oct 2017 22:49 Yes, you are, look at the 5th rule. Nodirbek Islomov Wrong #11 example // Problem 1262. Pseudo-Roman Number 8 Jan 2015 01:25 8888 --> 16 Edited by author 08.01.2015 10:09 Edited by author 08.01.2015 10:09 Bobur very interesting!! there 2 code [3] // Problem 1262. Pseudo-Roman Number 26 Oct 2008 19:04 var s : integer; ch : char; begin s := 0; while not eof do begin read(ch); case ch of '1', '5' : inc(s); '2', '4', '6', '9' : inc(s, 2); '3', '7' : inc(s, 3); '8' : inc(s, 4); end; end; writeLn(s); end. this ic gave me AC!! var s : integer; ch : char; a : array ['0'..'9'] of byte = (0, 1, 2, 3, 2, 1, 2, 3, 4, 2); begin s := 0; while not eof do begin read(ch); s := s + a[ch]; end; writeLn(s); end. and this WA#1!!!! i don't know why, who can explain it to me!! thanks!! trc-pskov Re: very interesting!! there 2 code [2] // Problem 1262. Pseudo-Roman Number 8 Dec 2008 22:05 i don't know what it mean in pascal, but in C it is "address to non-existent element of memory" take one correction: read(ch); //insert here: if ((ch<'0') or (ch>'9')) then break; s := s + a[ch]; ..... and sorry for my bad english Edited by author 08.12.2008 22:11 Artem Ladik Re: very interesting!! there 2 code [1] // Problem 1262. Pseudo-Roman Number 24 Mar 2009 13:59 this is my program: const a:array['0'..'9'] of longint=(0,1,2,3,2,1,2,3,4,2); var k:char; s:longint; begin s:=0; while not EOln do begin read(k); inc(s,a[k]); end; write(s); end. use longint, not byte;) yangdong Re: very interesting!! there 2 code // Problem 1262. Pseudo-Roman Number 23 Oct 2010 19:03 But can you tell me the reason using Longint excepted byte? thankx Fokysnik[LNU] Strange judgement result. [1] // Problem 1262. Pseudo-Roman Number 9 Feb 2007 21:19 First, I wrote a program on C++ like this: #include<stdio.h> void main(void) {char c; int t,s=0; while (!feof()) {scanf("%c",&c); ... } ... printf("%i\n",s); } Judgement result: Wrong answer #1 After that I wrote same program on Pascal like this: program roman; var c:char; t,s: integer; begin s:=0; while not eof() do begin read(c); ... end; ... writeln(s); end. Program on Pascal got AC. Those "..." are both correct I tested both programs on my own on the keyboard and using freopen. Does anybody know why C++ gets WA and Pascal AC? Edited by author 09.02.2007 21:21 Sandro (USU) Thank you! That was a jury bug. Incorrect verdicts were rejudged. (-) // Problem 1262. Pseudo-Roman Number 10 Feb 2007 10:52 Yu Yuanming AC(+) [9] // Problem 1262. Pseudo-Roman Number 11 Jun 2005 21:30 At first I think this problem is difficult, so I am surprised why so many people got AC... I look at small case, and general it just for a try, it got AC! the pro is very short...faint... I am get tester... Re: AC(+) // Problem 1262. Pseudo-Roman Number 12 Oct 2005 16:54 I don't know why all think than that problem is difficult. I spent for it 10 minutes Нараевский Женя (Хмельницкий) Re: AC(+) // Problem 1262. Pseudo-Roman Number 12 Oct 2005 19:46 Yu Yuanming please help me! Can you send your AC on my e-mail naraevsky@rambler.ru!!! Please Dzhulgakov Dmitry Re: AC(+) [6] // Problem 1262. Pseudo-Roman Number 15 Jun 2006 20:51 I agree with you. This problem is so easy!!! My AC solution size is 4 code lines :) Alexey Re: AC(+) [5] // Problem 1262. Pseudo-Roman Number 15 Jun 2006 23:18 Damn, but how to do it?.. Burunduk1 Re: AC(+) // Problem 1262. Pseudo-Roman Number 16 Jun 2006 02:35 Each digit has itself code. You have to determine summary code's length. KAV Re: AC(+) [3] // Problem 1262. Pseudo-Roman Number 16 Jun 2006 07:55 Just write some numbers manually... It's very easy to understand the decision. Alexey Re: AC(+) [2] // Problem 1262. Pseudo-Roman Number 16 Jun 2006 11:59 So, I should try it in small numbers, then I'll see the decesion and the task will be solved? I looks like so difficult... KAV Re: AC(+) [1] // Problem 1262. Pseudo-Roman Number 16 Jun 2006 14:11 Write a program which converts decimal numbers to roman. You will see ;) Alexey Re: AC(+) // Problem 1262. Pseudo-Roman Number 16 Jun 2006 14:36 "I had nothing to say and i get lost in the nothingness inside of me..." Linkin Park says true. Oh, God! AC! I didn't expect me to solve this problem! Thank U! Michael Rybak (accepted@ukr.net) Some clarifications // Problem 1262. Pseudo-Roman Number 3 Feb 2006 21:42 *** rule 1 is REALLY IMPORTANT. It means we have an infinite number of letters, not only I .. M, which means we can represent as large numbers as we wish to The rest below is just for the sake of being pedantic enough :) *** rule 2 is incorrect about non-powers-of-10. There can be 3 or less identical symbols (in a row) if they denote 10^k, and no identical symbols otherwise, not 2. *** rule 5 actually says: Ai >= Ai+2, and Ai+1 can be anything, but if it's larger than Ai, then Ai > Ai+2, not >= *** rule 4 means that for some i there can only be a signle j that j < i and Aj < Ai (another interpretation is that there can be no 2 smaller numerals *immediately* before some numeral, which in fact implies from rule 5) Edited by author 03.02.2006 21:42 Edited by author 03.02.2006 21:43 Sni right output on '440' [1] // Problem 1262. Pseudo-Roman Number 31 Dec 2005 13:12 plz hlp with '440' right answer is 4 or which ACM.Tolstobrov_Anatoliy[Ivanovo SPU] Re: right output on '440' // Problem 1262. Pseudo-Roman Number 31 Dec 2005 20:59 yes it 4. Test for you 1234567891011121314151617181920 Answer 52. Maybe it Help. Bandera I think that something is wrong in this problem... [3] // Problem 1262. Pseudo-Roman Number 1 Apr 2005 16:12 If n=20000 i think that are no psevdo-roman number to represent n. What i have print in this case? May be 0? Edited by author 01.04.2005 19:42 Burunduk1 Re: I think that something is wrong in this problem... [2] // Problem 1262. Pseudo-Roman Number 1 Apr 2005 19:59 Why there is no such number? My AC solution works right in this case. Bandera Re: I think that something is wrong in this problem... [1] // Problem 1262. Pseudo-Roman Number 1 Apr 2005 20:06 Than please write answer of your problem if n=20000. Burunduk1 wrote 1 April 2005 19:59 Why there is no such number? My AC solution works right in this case. Burunduk1 Re: I think that something is wrong in this problem... // Problem 1262. Pseudo-Roman Number 1 Apr 2005 20:21 It's 2 :) Stanica Andrei why i get WA in test #11 ? [5] // Problem 1262. Pseudo-Roman Number 31 Mar 2004 14:04 test Re: why i get WA in test #11 ? So did I!! Who can tell why? // Problem 1262. Pseudo-Roman Number 12 Apr 2004 15:22 test test on 11 is the first one length of N > 3 [1] // Problem 1262. Pseudo-Roman Number 12 Apr 2004 15:32 Stupnikov Pavel Re: test on 11 is the first one length of N > 3 // Problem 1262. Pseudo-Roman Number 8 Sep 2004 23:23 I can also say, that it is the first test in which N has more than 1000 digits ... test if N = 10000 what should me output ? [1] // Problem 1262. Pseudo-Roman Number 12 Apr 2004 15:33 I think 10000 = MMMMMMMMMM So I output 10... Is this right? Sandro Re: if N = 10000 what should me output ? // Problem 1262. Pseudo-Roman Number 29 May 2004 19:52 No, you are wrong. The answer is 1, because all the numbers 10^k and 5*10^k are written in Pseudo-Romanian system with only 1 (maybe very unusual) digit.
|