Pagini recente » Cod sursa (job #771584) | Cod sursa (job #1668139) | Cod sursa (job #766754) | Cod sursa (job #286724) | Cod sursa (job #1335947)
#include <fstream>
using namespace std;
ifstream fin ("oz.in");
ofstream fout ("oz.out");
long long N, M, i, j, d, V[10010];
bool w = 1;
int main()
{
fin >> N >> M;
for (int k = 1; k <= N; k++) V[k] = 1;
for (int k = 1; k <= M; k++)
{
fin >> i >> j >> d;
if (V[i] % d != 0) V[i] *= d;
if (V[j] % d != 0) V[j] *= d;
if (V[i] > 2000000000) w = -1;
}
if (w > 0) for (int k = 1; k <= N; k++) fout << V[k] << ' ';
else fout << "-1";
fout << '\n';
fout.close();
return 0;
}