Pagini recente » Cod sursa (job #2337931) | Cod sursa (job #2676531) | Cod sursa (job #2091741) | Cod sursa (job #685062) | Cod sursa (job #219472)
Cod sursa(job #219472)
#include <stdio.h>
#include <math.h>
#include <cstdlib>
long long i, m, n, p1[100010], p2[100010], vq[10010], dv[100010];
long long gcd(long long a, long 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("%lld %lld", &n, &m);
for (i = 1; i <= n; ++i) vq[i] = 1;
for (i = 1; i <= m; ++i) {
scanf("%lld %lld %lld", &p1[i], &p2[i], &dv[i]);
vq[p1[i]] = ((long long)vq[p1[i]] * dv[i]) / gcd(vq[p1[i]], dv[i]);
vq[p2[i]] = ((long long)vq[p2[i]] * dv[i]) / gcd(vq[p2[i]], dv[i]);
}
check();
for (i = 1; i <= n; ++i) {
printf("%lld ", vq[i]);
}
return 0;
}