QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#413207 | #6749. Target | gaotianyu# | TL | 0ms | 3784kb | C++17 | 536b | 2024-05-17 09:38:18 | 2024-05-17 09:38:18 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
typedef pair<int, int> PII;
void solve()
{
double a, b;
cin >> a >> b;
while (a >= 1e-5) {
a = a / 2.0;
cout << 1;
}
while (abs(a - b) >= 1e-4) {
if (a > b) {
a = a / 2.0;
cout << 1;
} else {
a = a / 2.0 + 0.5;
cout << 2;
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int tt = 1;
// cin >> tt;
while (tt--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
input:
0.5 0.25
output:
111111111111111121
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
1 0.75
output:
1111111111111111122
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
1 0
output:
11111111111111111
result:
ok ok
Test #4:
score: -100
Time Limit Exceeded
input:
0.361954 0.578805
output:
111111111111111122121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212...