Wierd Problem

[Script Coder]

It stops the infinite looping and the program gives the correct output for the sample program, but the judge still says it gives the wrong answer.

EDIT: @keskiverto Thank you

[Script Coder]

Problem Solved. After scrapping everything I had, I created a solution that was accepted by the judge:

#include <iostream>
#include <string>
#include <sstream>
using namespace std;
int reg[10], ram[1000];

inline void decode(int ins, int &ir) {
	int opcode=ins/100;
	int op1=(ins%100)/10;
	int op2=ins%10;
	switch(opcode) {
		case 0:
			ir=(reg[op2]!=0 ? reg[op1]-1 : ir);
			break;
		case 1:
			ir=-2;
			break;
		case 2:
			reg[op1]=op2;
			break;
		case 3:
			reg[op1]+=op2;
			reg[op1]%=1000;
			break;
		case 4:
			reg[op1]*=op2;
			reg[op1]%=1000;
			break;
		case 5:
			reg[op1]=reg[op2];
			break;
		case 6:
			reg[op1]+=reg[op2];
			reg[op1]%=1000;
			break;
		case 7:
			reg[op1]*=reg[op2];
			reg[op1]%=1000;
			break;
		case 8:
			reg[op1]=ram[reg[op2]];
			break;
		case 9:
			ram[reg[op2]]=reg[op1];
			break;
		default:
			break;
	}
}
int main() {
	int n;
	string s;
	cin>>n;
	getline(cin,s);
	getline(cin,s);
	for(int j=0; j<n; ++j) {
		int count=0, ir=0;
		for(int i=0; i<10; ++i) reg[i]=0;
		for(int i=0; i<1000; ++i) ram[i]=0;
	
		for(int i=0; i<1000;++i) {
			getline(cin,s);
			if(s=="") break;
			istringstream iss(s);
			iss>>ram[i];
		}
		while(ir>=0) {
			decode(ram[ir], ir);
			++ir;
			++count;
		}
		if(j>0) cout<<'\n';
		cout<<count<<'\n';
	}
}

[keskiverto]

Good. For fun, compare:

for ( int i=0; i<1000; ++i ) ram[i]=0;
std::fill( ram, ram+1000, 0 );

[Script Coder]

I know about the fill operation, I do not use it because I do not know how efficient it is, and considering my program is being timed efficiency is of utmost importance.

[cire]

Always good to trust your own ad hoc solutions over those that get used by everyone and have been optimized to death. Especially without timing them.