This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "nice_lines.h"
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc;
long double A,C,D,E,X,Y,XX,YY,K,B,A1,A2;
void solve(int subtask_id, int NN) {
/*printf("subtask_id = %d, N = %d\n", subtask_id, N);
printf("query(0, 0) = %Lf\n", query(0, 0));
printf("query(1, 1) = %Lf\n", query(1, 1));
the_lines_are({1}, {0});*/
A1=query(0,0);A2=query(0,1);X=1.0;
K=(A2-A1)/sqrt(X*X-(A2-A1)*(A2-A1));
XX=(0.0-(A1*X)/(A2-A1));YY=0.0;
B=Y-K*XX;
a=round(K);b=round(B);
the_lines_are({a},{b});
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |