148 Werewolf - Simple Version

#include<iostream>

using namespace std;

 

int words[101];

int status[101];

 

bool func(int ii,int jj,int n)

{

status[ii]=-status[ii];

status[jj]=-status[jj];

int t=0;

int tt=0;

for(int i=1;i<=n;++i)

{

int a = words[i];

int c = a<0?-a:a;

int b = status[c];

if(b!=a){

tt++;

}

if(status[i]<0&&b!=a)

{

t++;

}

}

status[ii]=-status[ii];

status[jj]=-status[jj];

if(tt==2&&t==1)

return true;

else

return false;

}

 

int main()

{

int n;

cin>>n;

for(int i=1;i<=n;++i)

{

status[i]=i;

}

for(int i=1;i<=n;++i)

{

cin>>words[i];

}

bool flag = false;

int i,j;

for(i=1;i<=n;++i)

{

for(j=i+1;j<=n;++j)

{

flag = func(i,j,n);

if(flag) break;

}

if(flag) break;

}

if(flag){

cout<<i<<" "<<j<<endl;

}

else

{

cout<<"No Solution"<<endl;

}

return 0;

}