Submission #4240503

---

Source Code Expand

#include<string>
#include<stdio.h>
#include<iostream>
#include<iomanip>
#include<ios>
#include<algorithm>
#include<stack>
#include<queue>
#include<cmath>
#include<type_traits>

using namespace std;

	

	

int main()
{
int N,M ;

cin >> N >> M ;

if(M==0)
{
cout << 1 <<endl;
}
else
{

queue<int> box[N+1];

int G[M][2];

for(int f=0;f<M;f++)
	{
	cin >> G[f][0] >> G[f][1];
	
	box[2].push(G[f][0]);
	box[2].push(G[f][1]);
	}
	
bool judge_i = 0;
int member[N];

for(int i=2;judge_i==0 && i<N+1;i++)
{
bool judge_j = 0;
for(int j=0;judge_j==0;j++)
	{	

	for(int l=0;l<i;l++)
		{
		member[l] = box[i].front();
		
		box[i].pop();
		}
	for(int k=1;k<N+1;k++)
		{
		bool judge_mem = 1;
		bool judge_k = 0;

		for(int n=0;n<i;n++)
			{
			if(member[n]==k)
				{
				judge_mem = 0;
				}
			}
		if(judge_mem==1)
			{
			for(int q=0;judge_k==0 && q<i;q++)
				{
				bool judge_p = 0;
				for(int p=0;judge_p==0 && p<M;p++)
					{
					if((G[p][1]==k && G[p][0]==member[q])||(G[p][0]==k && G[p][1]==member[q]))
						{
						judge_p = 1;
						judge_k = 0;
						}
					else
						{
						judge_k = 1;
						}
					}
				}
			}
		else
			{
			judge_k = 1;
			}
			
		if(judge_k==0)
			{
			box[i+1].push(k);
			for(int r=0;r<i;r++)
				{
				int origin = member[r];
				box[i+1].push(origin);
				}
			}	
		}
	judge_j = box[i].empty();

	}
judge_i = box[i+1].empty();

if(judge_i==1)
	{
	cout << i << endl;
	}

}
}
}			

Submission Info

Judge Result