Pagini recente » Cod sursa (job #2353693) | Cod sursa (job #41788) | Cod sursa (job #582399) | Cod sursa (job #1203175) | Cod sursa (job #1808832)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("oz.in");
ofstream g("oz.out");
long long v[10010];
int i,j,d,h,n,m,ok;
pair<pair<int,int>,int>u[100010];
int cmmdc(int a,int b)
{
int r;
while(b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
v[i]=1;
for(h=1;h<=m;h++)
{
f>>i>>j>>d;
v[i]*=d/cmmdc(v[i],d);
v[j]*=d/cmmdc(v[j],d);
u[h].first.first=i;
u[h].first.second=j;
u[h].second=d;
}
ok=0;
for(h=1;h<=m;h++)
{
if(cmmdc(v[u[h].first.first],v[u[h].first.second])!=u[h].second)
{
g<<"-1";
ok=1;
break;
}
}
if(ok==0)
for(i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}