Pagini recente » Cod sursa (job #2408357) | Cod sursa (job #807351) | Cod sursa (job #679249) | Cod sursa (job #2204379) | Cod sursa (job #237111)
Cod sursa(job #237111)
#include<stdio.h>
int n,m,a[10001];
int euclid(int x,int y){
int i,j,r;
i=x;
j=y;
do{
r=x%y;
x=y;
y=r;}
while(r);
return i*j/x;}
void solve(){
int i,x,y,z;
scanf("%d%d",&n,&m);
for(i=1; i<=n; ++i)
a[i]=1;
for(i=1; i<=m; ++i){
scanf("%d%d%d",&x,&y,&z);
a[x]=euclid(a[x],z);
a[y]=euclid(a[y],z);}
for(i=1; i<=n; ++i)
printf("%d ",a[i]);}
int main(){
freopen("oz.in","r",stdin);
freopen("oz.out","w",stdout);
solve();
return 0;}