Pagini recente » Cod sursa (job #200948) | Diferente pentru teoria-jocurilor intre reviziile 18 si 17 | Statistici Matasa Cristi (cris36) | Istoria paginii descriere/ordonare/my-text-compare | Cod sursa (job #2001070)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int n,x[10002],ii,i,m,j,d,ok=1;
int cmmdc(int a, int b)
{
int r;
while(b)
{
r=b;
b=a%b;
a=r;
}
return a;
}
int main()
{
ifstream fin ("oz.in");
ofstream fout ("oz.out");
fin>>n>>m;
fill(x+1,x+n+1,1);
for(ii=1;ii<=m;ii++)
{
fin>>i>>j>>d;
x[i]*=(d/cmmdc(x[i],d));
x[j]*=(d/cmmdc(x[j],d));
if(cmmdc(x[i],x[j])!=d){ok=0;break;}
}
if(ok)for(i=1;i<=n;i++)fout<<x[i]<<" ";
else fout<<"-1";
return 0;
}