QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#407950 | #6749. Target | Ado1phosa | WA | 1ms | 3824kb | C++17 | 715b | 2024-05-09 15:19:26 | 2024-05-09 15:19:27 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for(int i = l; i <= (int)r; i ++)
#define debug(a) cout << #a << " = " << a << '\n';
#define debug2(a, b) cout << #a << " = " << a << " " << #b << " = " << b << '\n';
const int N = 2e5 + 5;
double a, b;
void solve() {
cin >> a >> b;
vector<int> ans;
for(int i = 1; fabs(a - b) > 1e-4 && i <= 50; i ++) {
if(a < b)
a = (a + 1) / 2, ans.push_back(2);
else
a = a / 2, ans.push_back(1);
}
for(auto x : ans) cout << x;
}
main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int _ = 1;
// cin >> _;
while(_ --) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3700kb
input:
0.5 0.25
output:
1
result:
ok ok
Test #2:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
1 0.75
output:
12
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3732kb
input:
1 0
output:
11111111111111
result:
ok ok
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3824kb
input:
0.361954 0.578805
output:
21212121212121212121212121212121212121212121212121
result:
wrong answer wa