QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#409607 | #6749. Target | zouyua# | TL | 0ms | 3924kb | C++23 | 535b | 2024-05-12 13:02:17 | 2024-05-12 13:02:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double eps = 1e-4;
typedef pair<int, int> PII;
void solve(){
double a, b;
cin >> a >> b;
ll ans = 0;
while(fabs(a - b) > eps){
if(a < b){
a = a * 0.5 + 0.5;
cout << 2;
}
else{
a = a * 0.5;
cout << 1;
}
// ans ++;
// cout << fixed << setprecision(10) << a << '\n';
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t = 1;
// cin >> t;
while(t --){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
input:
0.5 0.25
output:
1
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
1 0.75
output:
12
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
1 0
output:
11111111111111
result:
ok ok
Test #4:
score: -100
Time Limit Exceeded
input:
0.361954 0.578805
output:
212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121...