Pagini recente » Cod sursa (job #1273913) | Cod sursa (job #57444) | Cod sursa (job #769239) | Cod sursa (job #1580261) | Cod sursa (job #1170684)
#include <fstream>
#include <iostream>
#include <cstdlib>
using namespace std;
ifstream f("party.in");
ofstream g("party.out");
#define nmax 105
bool val[nmax];
int n, m, x[nmax], y[nmax], z[nmax], sol;
bool satisfiabila()
{
for (int i = 0; i < nmax; i ++)
{
bool test, loto;
if (z[i] == 0)
test = val[x[i]] || val[y[i]];
if (z[i] == 1)
test = val[x[i]] || !val[y[i]];
if (z[i] == 2)
test = val[!x[i]] || val[y[i]];
if (z[i] == 3)
test = val[!x[i]] || val[!y[i]];
if (!test)
{
loto = rand() % 2;
if (loto)
val[x[i]] = !val[x[i]];
else
val[y[i]] = !val[y[i]];
return false;
}
}
return true;
}
int main()
{
f >> n >> m;
for (int i = 0; i < m; i ++)
f >> x[i] >> y[i] >> z[i];
for (int i = 1; i <= n; i ++)
val[i] = rand() % 2;
while(!satisfiabila);
for (int i = 1; i <= n; i ++)
sol += val[i];
g << sol << '\n';
for (int i = 1; i <= n; i ++)
if (val[i])
g << i << '\n';
f.close();
g.close();
return 0;
}