Pagini recente » Cod sursa (job #501763) | Cod sursa (job #2131357) | Cod sursa (job #1308116) | Cod sursa (job #79432) | Cod sursa (job #2171987)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("party.in");
ofstream g("party.out");
int n,m,x,y,z,i,a[100],b[100],c[100],cont,total,d; //0=x sau y // 1=daca x participa y face ce vrea si daca nu participa nici y nu participa// 2=ori x sau y// 3=ori x ori y ori niciunul
int main() //-1 = merge -2 = nu merge
{
f>>n>>m;
cont=1;
for(i=1;i<=m;i++)
{
a[i]=cont;
cont++;
}
i=1;cont=1;
for(i=1;i<=m;i++)
{
b[1]=cont;
cont++;
}
f>>x>>y>>z;
b[x]=-1;
b[y]=-1;
while(m>0)
{
if(z==0){b[x]==-1;b[y]=-2;}
if(z==1&&b[x]==-1)b[y]=b[y];
if(z==1&&b[x]==-2) b[y]=-2;
if(z==2&&b[x]==-1)b[y]=b[y]=-2;
if(z==2&&b[x]==-2) b[y]=-1;
if(z==3&&b[x]==-1)b[y]=-2;
if(z==3&&b[x]==-2) b[y]=-1;
m--;
if(b[x]==-1){total=total+1; c[total]=x;}
if(b[y]==-1){total==total+1;c[total]=y;}
f>>x>>y>>z;
}
for(d=1;d<=total;d++)
{
cout<<c[d]<<endl;
}
return 0;
}