# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
646606 | danikoynov | Nicelines (RMI20_nicelines) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|
**/
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
void solve(int subtask_id, int N)
{
long double d1 = query(0, 0);
long double d2 = query(0, 1);
long double y1 = d1 / (d1 - d2);
long double d3 = query(1, 0);
long double d4 = query(1, 1);
long double y2 = d3 / (d3 - d4);
vector < int > a, b;
a.push_back(y2 - y1);
b.push_back(y1);
the_lines_are(a, b);
}