Pagini recente » Cod sursa (job #2633998) | Cod sursa (job #2192014) | Cod sursa (job #2524199) | Cod sursa (job #1611785) | Cod sursa (job #219454)
Cod sursa(job #219454)
#include <stdio.h>
#include <math.h>
#include <cstdlib>
long i, m, n, p1[10010], p2[10010], vq[100010], dv[10010];
long gcd(long a, long b) {
long r = 0;
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
if (b == 0) {
return 1;
}
return 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;
}