Pagini recente » Cod sursa (job #3262975) | Cod sursa (job #761089) | Cod sursa (job #405858) | Cod sursa (job #3261816) | Cod sursa (job #2910586)
#include <stdio.h>
#include <algorithm>
#define int long long
using namespace std;
FILE *fin, *fout;
const int N = 1e4;
int v[N + 1];
int n, q, a, b, d;
signed main()
{
fin = fopen ("oz.in", "r");
fout = fopen ("oz.out", "w");
fscanf(fin, "%d%d", &n, &q);
for (int i = 1; i <= n; ++i)
v[i] = 1;
for (; q; --q)
{
fscanf(fin, "%d%d%d", &a, &b, &d);
int cmmd1, cmmd2;
cmmd1 = __gcd(v[a], d);
cmmd2 = __gcd(v[b], d);
v[a] *= d / cmmd1;
v[b] *= d / cmmd2;
}
for (int i = 1; i <= n; ++i)
fprintf(fout, "%d ", v[i]);
return 0;
}