Pagini recente » Cod sursa (job #363680) | Cod sursa (job #1244194) | Cod sursa (job #2119810) | Cod sursa (job #2588237) | Cod sursa (job #2656615)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("oz.in");
ofstream fout("oz.out");
#define MLD 2000000000
struct triplete {
int x, y, d;
} v[100005];
int n, m, x, y, a[10005];
bool comp(triplete a, triplete b) {
if (a.x != b.x)
return a.x > b.x;
if (a.y != b.y)
return a.y > b.y;
return a.d > b.d;
}
int main() {
fin >> n >> m;
for (int i = 1; i <= m; i++) {
fin >> v[i].x >> v[i].y >> v[i].d;
a[v[i].x] = a[v[i].y] = 1;
}
for (int i = 1; i <= m; i++) {
if (a[v[i].x] % v[i].d != 0)
a[v[i].x] *= v[i].d / __gcd(a[v[i].x], v[i].d);
if (a[v[i].y] % v[i].d != 0)
a[v[i].y] *= v[i].d / __gcd(a[v[i].y], v[i].d);
}
x = 1;
while(x <= n && a[x] > 0 && a[x] < MLD)
x ++;
if (x == n+1){
y = 1;
while(y <= m && __gcd(a[v[y].x], a[v[y].y]) == v[y].d)
y ++;
}
if (y == m+1){
for (int i = 1; i <= n; i++)
fout << a[i] << " ";
fout << '\n';
}else{
fout << "-1" << '\n';
}
return 0;
}