Party Lamps

Problem:

http://ace.delos.com/usacoprob2?a=GDaP3qeGiYp&S=lamps

My Answer:

/*
ID:iby071
TASK:lamps
LANG:C++
*/

#include<iostream>
#include<fstream>
using namespace std;

bool check(int lamps[],int request[])
{	for(int i=0;i<6;++i)
		if(request[i]==1&&lamps[i]==0)
			return false;
		else if(request[i]==2&&lamps[i]==1)
				return false;
	return true;
}

int main()
{	ifstream fin("lamps.in");
	ofstream fout("lamps.out");
	int request[6];					//request保存是否有指定最终状态，0表示没指定，1表示on，2表示off
	int n,cnt,tmp;
	bool flag=false;
	for(int i=0;i<6;++i) {request[i]=0;}
	int lamps[8][6]={{0,0,0,0,0,0},
					 {0,0,1,1,1,0},
                     {0,1,0,1,0,1},
                     {0,1,1,0,1,1},
                     {1,0,0,1,0,0},
                     {1,0,1,0,1,0},
                     {1,1,0,0,0,1},
                     {1,1,1,1,1,1}};
	
	fin>>n>>cnt>>tmp;
	while(tmp!=-1)
	{	tmp%=6;
		request[tmp-1]=1;
		fin>>tmp;
	}
	fin>>tmp;
	while(tmp!=-1)
	{	tmp%=6;
		if(request[tmp-1]==1) {fout<<"IMPOSSIBLE\n";return 0;}
		request[tmp-1]=2;
		fin>>tmp;
	}

	if(cnt==0)
		if(check(lamps[7],request))
		{	for(int i=0;i<n;++i)
				fout<<lamps[7][i%6];
			fout<<endl;
			flag=true;
		}

	if(cnt==1)
	{	if(check(lamps[0],request))
		{	for(int i=0;i<n;++i)
				fout<<lamps[0][i%6];
			fout<<endl;
			flag=true;
		}
		if(check(lamps[2],request))
		{	for(int i=0;i<n;++i)
				fout<<lamps[2][i%6];
			fout<<endl;
			flag=true;
		}
		if(check(lamps[3],request))
		{	for(int i=0;i<n;++i)
				fout<<lamps[3][i%6];
			fout<<endl;
			flag=true;
		}
		if(check(lamps[5],request))
		{	for(int i=0;i<n;++i)
				fout<<lamps[5][i%6];
			fout<<endl;
			flag=true;
		}
	}

	if(cnt>=2)
		for(int i=0;i<8;++i)
			if(check(lamps[i],request))
			{	if(cnt!=2||i!=3)
				for(int j=0;j<n;++j)
					fout<<lamps[i][j%6];
				fout<<endl;
				flag=true;
			}

	if(!flag) fout<<"IMPOSSIBLE\n";

	return 0;
}