Hello World题解

大家可见，这道题是一道很难的题，所以我手搓了一个虚拟机来解决它
code:

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned int
#define N 65536
int memory[N];
ull code[N] = {
	0x2000000000000048, 0x1200000000000000,	//H
	0x2000000000000065, 0x1200000000000000,	//e
	0x200000000000006c, 0x1200000000000000,	//l
	0x200000000000006c, 0x1200000000000000,	//l
	0x200000000000006f, 0x1200000000000000,	//o
	0x2000000000000020, 0x1200000000000000,	//[space]
	0x2000000000000077, 0x1200000000000000,	//w      
	0x200000000000006f, 0x1200000000000000,	//o
	0x2000000000000072, 0x1200000000000000,	//r
	0x200000000000006c, 0x1200000000000000,	//l
	0x2000000000000064, 0x1200000000000000,	//d
	0x200000000000000a, 0x1200000000000000,	//[\n]
	0xf000000000000000
};
signed main()
{
	for(int i=0;;i=(i+1)%N)
	{
		int op=code[i]>>60;
		if(op==0)
		{
			int p=code[i]&65535;
			cin >> memory[ (code[i]>>56)&1 ? memory[p] : p ];
		}
		else if(op==1)
		{
			int p=code[i]&65535, val = memory[ (code[i]>>56)&1 ? memory[p] : p ];
			if((code[i]>>57)&1)
			{
				cout<<char(val&127);
			}
			else
			{
				cout<<val;
			}
		}
		else if(op==2)
		{
			int p = (code[i]>>32)&65535, val = code[i]&((1ll<<32)-1);
			memory[ (code[i]>>56)&1 ? memory[p] : p ] = val;
		}
		else if(op==3)
		{
			int pf = (code[i]>>16)&65535, pt = code[i]&65535;
			int val = memory[ (code[i]>>55)&1 ? memory[pf] : pf ];
			memory[ (code[i]>>56)&1 ? memory[pt] : pt ] = val;
		}
		else if(op==4)
		{
			int p1 = (code[i]>>32)&65535, p2 = (code[i]>>16)&65535, p3 = code[i]&65535;
			int val1 = memory[ (code[i]>>58)&1 ? memory[p1] : p1 ],
			val2 = memory[ (code[i]>>57)&1 ? memory[p2] : p2 ], val3;
			int op2 = (code[i]>>52)&15;
			if(op2==0)
			{
				val3=val1&val2;
			}
			else if(op2==1)
			{
				val3=val1|val2;
			}
			else if(op2==2)
			{
				val3=~val2;
			}
			else if(op2==3)
			{
				val3=val1^val2;
			}
			else if(op2==4)
			{
				val3=((val2>>6)?0:val1<<val2);
			}
			else
			{
				val3=((val2>>6)?0:val1>>val2);
			}
			memory[ (code[i]>>56)&1 ? memory[p3] : p3 ] = val3;
		}
		else if(op==5)
		{
			int p1 = (code[i]>>32)&65535, p2 = (code[i]>>16)&65535, p3 = code[i]&65535;
			int val1 = memory[ (code[i]>>58)&1 ? memory[p1] : p1 ],
			val2 = memory[ (code[i]>>57)&1 ? memory[p2] : p2 ], val3;
			int op2 = (code[i]>>52)&15;
			if(op2==0)
			{
				val3=val1+val2;
			}
			else if(op2==1)
			{
				val3=val1-val2;
			}
			else if(op2==2)
			{
				val3=val1*val2;
			}
			else if(op2==3)
			{
				val3=(val2?val1/val2:0);
			}
			else
			{
				val3=(val2?val1%val2:0);
			}
			memory[ (code[i]>>56)&1 ? memory[p3] : p3 ] = val3;
		}
		else if(op==6)
		{
			int p=code[i]&65535;
			i = (code[i]>>56)&1 ? memory[p] : p;
			i = (i+N-1)%N;
		}
		else if(op==7)
		{
			int p1 = (code[i]>>32)&65535, p2 = (code[i]>>16)&65535, p3 = code[i]&65535;
			int val1 = memory[ (code[i]>>58)&1 ? memory[p1] : p1 ],
			val2 = memory[ (code[i]>>57)&1 ? memory[p2] : p2 ];
			int op2 = (code[i]>>52)&15;
			bool flag;
			if(op2==0)
			{
				flag=(val1>val2);
			}
			else if(op2==1)
			{
				flag=(val1<val2);
			}
			else if(op2==2)
			{
				flag=(val1==val2);
			}
			else if(op2==3)
			{
				flag=(val1>=val2);
			}
			else if(op2==4)
			{
				flag=(val1<=val2);
			}
			else
			{
				flag=(val1!=val2);
			}
			if(flag)
			{
				i = (code[i]>>56)&1 ? memory[p3] : p3;
				i = (i+N-1)%N;
			}
		}
		else if(op==8)
		{
			int p=code[i]&65535;
			memory[ (code[i]>>56)&1 ? memory[p] : p ]++;
		}
		else if(op==9)
		{
			int p=code[i]&65535;
			memory[ (code[i]>>56)&1 ? memory[p] : p ]--;
		}
		else if(op==15)
		{
			break;
		}
		else
		{
			cout<<"\n\nError: Invalid code\n\n";
		}
	}
	return 0;
}

如果觉得这对你有帮助的话记得点个赞再走，谢谢