Untitled

#include <iostream>
using namespace std;
int n, e, k, t;
double data[1001][1001];
double visit[1005];
int dx[] = {-1, -2, -2, -1, 1, 2, 2, 1};
int dy[] = {-2, -1, 1, 2, 2, 1, -1, -2};
int minn = 9999999;
int front, rear;


void init() {
	front = 0;
	rear = 0;
}

struct toado
{
	int x;
};

toado queu[100000];

void push(int xx) {
	queu[rear].x = xx;
	rear ++;
}

toado pop() {
	toado t = queu[front];
	front ++;
	return t;
}

void BFS(int k) {
	init();
	push(k);
	visit[k] = 1;
	while (front < rear) {
		toado vitri = pop();
		for (int i = 1; i <= n; i++) {
			if (data[vitri.x][i] != 0 &&  i > vitri.x) {
				visit[i] = visit[i] + visit[vitri.x] * data[vitri.x][i];		
				data[vitri.x][i] = 0;
				push(i);
			}
		}
	}


}


int main() {
	freopen("input.txt", "r", stdin);
	for (int stt = 1; stt <= 5; stt++) {
	    cin >> n >> e >> k >> t;
		int x, y;
		double z;
		for (int i = 0; i <= n; i++) {
			for (int j = 0; j <= n; j++) {
				data[i][j] = 0;
			}
			visit[i] = 0;
		}

		for (int i = 0; i < e; i++) {
			cin >> x >> y >> z;
			data[x][y] = z;
		}

		BFS(1);
			for (int i = 1; i <= n; i++) {
				cout << visit[i] << endl;
			}

		
	}
		return 0;
}