path: root / Year 2 / Design and analysis of algorithms / Practicum / Maycamp-198_Beach.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int T = 0;
	scanf("%d", &T);
	vector<vector<int>> a;
	int t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0;
	for (int i = 0; i < T; i++) {
		scanf("%d %d %d %d %d %d", &t1, &t2, &t3, &t4, &t5, &t6);
		a.push_back({t1, t2, t3, t4, t5, t6});
	}
	for (vector<int>& b : a) {
		l*p + r*(1-p) = 0
		(l-r)p + r = 0
		p = r/(r-l)
		p = b[]
	}
}