Pagini recente » Cod sursa (job #2033078) | Cod sursa (job #1872527) | Cod sursa (job #2377977) | Cod sursa (job #248556) | Cod sursa (job #484398)
Cod sursa(job #484398)
#include<cstdio>
#define NRFM 1<<6
#define M 1<<17
#define N 1<<14
int n,m,lung,f[NRFM],nrf[NRFM],v[N],x[M],y[M],z[M];
void read()
{
freopen("oz.in","r",stdin);
freopen("oz.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
scanf("%d%d%d",&x[i],&y[i],&z[i]);
for(int i=1;i<=n;i++)
v[i]=1;
}
void dfp(int x)
{
for(int i=2;i*i<=x;i++)
if(x%i==0)
{
f[++lung]=i;
while(x%i==0)
x/=i, nrf[lung]++;
}
if(x>1)
f[++lung]=x, nrf[lung]=1;
}
void init()
{
for(int i=1;i<=lung;i++)
f[i]=nrf[i]=0;
lung=0;
}
int putere(int x,int y)
{
int p=1;
for(int i=1;i<=y;i++)
p*=x;
return p;
}
void getput(int x,int poz)
{
int nrfc[NRFM]={0};
for(int i=1;i<=lung;i++)
if(x%f[i]==0)
{
while(x%f[i])
x/=f[i], nrfc[i]++;
}
for(int i=1;i<=lung;i++)
if(nrfc[i]<nrf[i])
v[poz]*=putere(f[i],nrf[i]-nrfc[i]);
}
void solve()
{
for(int i=1;i<=m;i++)
{
init();
dfp(z[i]);
getput(v[x[i]],x[i]);
getput(v[y[i]],y[i]);
}
}
int cmmdc(int x,int y)
{
int r=x%y;
while(r)
{
x=y;
y=r;
r=x%y;
}
return y;
}
void verif()
{
bool ok=true;
for(int i=1;i<=m;i++)
if(cmmdc(v[x[i]],v[y[i]])!=z[i])
{
ok=false;
break;
}
if(ok==false)
printf("-1");
else
{
for(int i=1;i<=n;i++)
printf("%d ",v[i]);
}
}
int main()
{
read();
solve();
verif();
return 0;
}