Submission #494036

#TimeUsernameProblemLanguageResultExecution timeMemory
494036mosiashvililukaNicelines (RMI20_nicelines)C++14
0 / 100
0 ms200 KiB
#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});*/
    X=0.001;Y=10.0;X=X;
    A1=query(0,0);A2=query(X,0);
    /*cout<<setprecision(9)<<X*X<<endl;
    cout<<setprecision(9)<<(A2-A1)*(A2-A1)<<endl;*/
    K=(A2-A1)/sqrt(X*X-(A2-A1)*(A2-A1));
    /*cout<<setprecision(12)<<K;
    return;*/
    XX=(0.0-(A1*X)/(A2-A1));YY=0.0;
    B=YY-K*XX;
    a=round(K);b=round(B);
    the_lines_are({a},{b});
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...