QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #410337 | #6749. Target | yi_y# | TL | 1ms | 3720kb | C++11 | 421b | 2024-05-13 21:43:55 | 2024-05-13 21:43:56 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
double a , b;
/*int f(double a , double b){
double t,tt;
t=a-b;
while(t<1){
t*=2;
}
if(t==1) return 1;
else return 0;
}*/
int main(){
cin >> a >> b;
int i = 1;
while(fabs(a-b)>0.00001){
if(a>b){
cout << 1;
a=a*0.5;
}
else{
cout << 2;
a=a*0.5+0.5;
}
/*cout << endl;
cout << a << endl;*/
i++;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3692kb
input:
0.5 0.25
output:
1
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
1 0.75
output:
12
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3720kb
input:
1 0
output:
11111111111111111
result:
ok ok
Test #4:
score: -100
Time Limit Exceeded
input:
0.361954 0.578805
output:
212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121...