Pagini recente » Cod sursa (job #2445295) | Cod sursa (job #813780) | Cod sursa (job #825850) | Cod sursa (job #1838412) | Cod sursa (job #237040)
Cod sursa(job #237040)
#include <cstdio>
#define MAX_N 10005
long V[MAX_N], D[MAX_N];
int I[MAX_N], J[MAX_N];
int N, M;
long gcd(long a, long b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
long cmmmc(long a, long b)
{
return a/gcd(a,b) * b;
}
int main()
{
freopen("oz.in","rt",stdin);
freopen("oz.out","wt",stdout);
scanf("%d %d",&N, &M);
for(int i = 1; i <= N; ++i)
V[i] = 1;
for(int i = 1; i <= M; ++i)
{
int x, y;
long z;
scanf("%d %d %ld",&x, &y, &z);
V[x] = cmmmc(V[x], z);
V[y] = cmmmc(V[y], z);
I[i] = x, J[i] = y, D[i] = z;
}
/* for(int i = 1; i <= M; ++i)
if(gcd(V[I[i]], V[J[i]]) != D[i])
{
printf("-1\n");
return 0;
} */
for(int i = 1; i <= N; ++i)
printf("%ld ", V[i]);
}