10033 - Interpreter

[Jan]

Its tough to generate inputs manually. However, here are some random cases. U can try them.

Input:

Code: Select all

2

299
492
495
399
492
495
399
283
279
689
078
100
000
000
000

456
789
234
453
125
175
183
256
012
100
000


Output:

Code: Select all

16

5


Hope these help.

EDIT : The wrong input set is removed. Sorry for posting it.

[beloni]

Anyone can tell me if the following code solve correctly the input of problem 10033???

void CPU::read()
{
int w = 0;
while(1)
{
ram[pc][w] = getchar();
while(ram[pc][w] != '\n')
{
w++;
ram[pc][w] = getchar();
}

if(ram[pc][0] == '\n')
break;
else
{
ram[pc][w] = 0;em string
w = 0;
pc++;
}
}
}

[beloni]

I have this sample input posted by JAN:
1

299
492
279
283
078
100
123
345

first code: move register 9 with the value 9
second: mul by two the content of register 9
third: move rigister 7 with the value 9
fourth: move register 8 with value 3

fifth: jump to ram position in register 7 if register 8 is not zero
so... in this case reg 7 contains 9, reg 8 conteisn 3 and reg 9 contains 18.
but the ram position in reg 7 is 000 and we have a infinity loop!!!

[beloni]

3

299
492
495
399
492
495
399
283
279
689
078
100
000
000
000

456
789
234
453
125
175
183
256
012
100
000

299
492
279
283
078
100
123
345

[chunyi81]

My AC code goes into an infinite loop for this test case as well. I guess you can safely assume the judge contains no such cases.

[beloni]

thanks
so... can you give to me an sample input???

[tmdrbs6584]

Why don't you make bigger array size?

[John Herre]

I sent my solution to this problem, and I got ACC, but the last test case makes my program infinite-looping... that's weird... but I have no time to test that manually.

jedihe

[smilitude]

I guess, beloni wanted to say

but the ram position in reg '9' is 000 and we have a infinity loop!!!

he is right with that, anyway.. this input is faulty!

[Jan]

Thanks beloni for showing me the error. Those cases were randomly generated, and somehow my old code(which was accepted, too) generated those outputs. But my current code goes into an infinite loop for the case. Sorry for posting such faulty case .

[Bandrosh]

I have read and re-read this problem so many times that I already know it by heart.

I have searched at the forum and found this sample input and output posted by Jan:

Input:

456
789
234
453
125
175
183
256
012
100
000

Output:

5

Here's the link where I found this input/output:
http://online-judge.uva.es/board/viewto ... ight=10033


What's my problem?
I can't understand how the output can be 5.

First instruction: multiply by 6 the content of register 5
Second: multiply the register 8 content by the content of register 9
Third: set the register 3 the value 4
Fourth: multiply by 3 the content of register 5
Fifth: isn't interpreted
Sixtth: isn't interpreted
Seventh: isn't interpreted
Eighth: set the register 5 the value 6
Nineth: don't go to register 1, beacause the content of register 2 is 0
Tenth: halt interpreter

So we have 6 instructions.
Why is the correct output is 5?

[tgoulart]

Actually, my program stops when 125 is reached. It is the halt instruction, so the program finishes there, and the subsequent lines should be ignored. This way we have 5 instructions executed, including the 125.

[Bandrosh]

u have accepted? in ur question?
hehe thnks man, i

[Bandrosh]

u have accepted? in ur question?
hehe thnks man, now i have win one Sig Error heheh Ipm staying more crazy

[tgoulart]

Yes, I got accepted and I hardly doubt that cases like this one would be in the judge's input, unless it's the last case, because of the lines that you have to ignore.

Try to recode your program, you might have done some mistakes, and don't forget that all results are mod 1000!