Pagini recente » Cod sursa (job #2749167) | Cod sursa (job #1672055) | Cod sursa (job #2306400) | Cod sursa (job #1319598) | Cod sursa (job #219467)
Cod sursa(job #219467)
#include <stdio.h>
#include <math.h>
#include <cstdlib>
long i, m, n, p1[20010], p2[20010], vq[200010], dv[20010];
long gcd(long a, long b) {
if (!b) return a;
return gcd(b, a % b);
}
void check() {
for (long i = 1; i <= m; ++i) {
if (gcd(vq[p1[i]], vq[p2[i]]) != dv[i]) {
printf("-1");
exit(0);
}
}
}
int main() {
freopen("oz.in", "r", stdin);
freopen("oz.out", "w", stdout);
scanf("%ld %ld", &n, &m);
for (i = 1; i <= n; ++i) vq[i] = 1;
for (i = 1; i <= m; ++i) {
scanf("%ld %ld %ld", &p1[i], &p2[i], &dv[i]);
vq[p1[i]] = (vq[p1[i]] * dv[i]) / gcd(vq[p1[i]], dv[i]);
vq[p2[i]] = (vq[p2[i]] * dv[i]) / gcd(vq[p2[i]], dv[i]);
}
check();
for (i = 1; i <= n; ++i) {
printf("%ld ", vq[i]);
}
return 0;
}