sicily 1562 LVM

其实这道题挺简单，不过需要注意几个问题：
1. STORE操作要将栈顶元素pop掉
2. IFZERO 操作不管跳不跳转都需要将栈顶元素pop掉，另外指令是从下标0开始计算的
3. DONE指令直接结束，最后输出的是栈顶的元素

//1562
#include <iostream>
#include <stack>
#include <string.h>
#include <cstdio>
using namespace std;

struct Instruction
{
	char ins[10];
	int n;
};

int main()
{
	int n;
	scanf ("%d",&n);
	Instruction instruction[1005];
	for (int i = 0; i < n; i++)
	{
		scanf ("%s",instruction[i].ins);
		if (strcmp(instruction[i].ins, "PUSH") == 0 || strcmp(instruction[i].ins,"IFZERO") == 0)
			scanf ("%d",&instruction[i].n);
	}
	stack<int> st;
	int reg = 0;
	for (int i = 0; i < n; i++)
	{
		if (strcmp(instruction[i].ins, "PUSH") == 0)
			st.push(instruction[i].n);
		else if (strcmp(instruction[i].ins, "STORE") == 0)
		{
			reg = st.top();
			st.pop();
		}
		else if (strcmp(instruction[i].ins, "LOAD") == 0)
		{
			st.push(reg);
		}
		else if (strcmp(instruction[i].ins, "PLUS") == 0)
		{
			int x,y;
			x = st.top();
			st.pop();
			y = st.top();
			st.pop();
			st.push(x+y);
		}
		else if (strcmp(instruction[i].ins, "TIMES") == 0)
		{
			int x,y;
			x = st.top();
			st.pop();
			y = st.top();
			st.pop();
			st.push(x*y);
		}
		else if (strcmp(instruction[i].ins, "IFZERO") == 0)
		{
			if (st.top() == 0)
			{
				i = instruction[i].n - 1;
				
			}
			st.pop();
		}
		else if (strcmp(instruction[i].ins, "DONE") == 0)
		{
			break;
		}
		else 
			st.pop();
	}
	printf ("%d\n",st.top());
}