Pagini recente » Cod sursa (job #2363075) | Cod sursa (job #621132) | Cod sursa (job #1511767) | Cod sursa (job #1187972) | Cod sursa (job #562369)
Cod sursa(job #562369)
// infoarena: problema/oz //
#include <fstream>
using namespace std;
ifstream in("oz.in");
ofstream out("oz.out");
const int MAXN = 10010;
const int MAXM = 100010;
int gcd(int a, int b)
{
int r=1;
while(r)
{
r = a%b;
a = b;
b = r;
}
return a;
}
int n,m,i,j,x[MAXN],a[MAXM],b[MAXM],d[MAXM];
int main()
{
in>>n>>m;
if(m == 0)
{
out<<-1;
return 0;
}
for(i=1; i<=n; i++)
x[i] = 1;
for(i=1; i<=m; i++)
{
in>>a[i]>>b[i]>>d[i];
if(gcd(x[a[i]], x[b[i]]) > d[i])
{
out<<-1;
return 0;
}
x[a[i]] *= d[i]/gcd(x[a[i]], d[i]);
x[b[i]] *= d[i]/gcd(x[b[i]], d[i]);
}
for(i=1; i<=m; i++)
if(gcd(x[a[i]], x[b[i]]) != d[i])
{
out<<-1;
return 0;
}
for(i=1; i<=n; i++)
out<<x[i]<<' ';
return 0;
}