QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#660901 | #6749. Target | ucup-team1769# | WA | 0ms | 3780kb | C++20 | 1.0kb | 2024-10-20 13:53:27 | 2024-10-20 13:53:28 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
double a, b;
std::cin >> a >> b;
std::vector<int> A, B;
double base = 1;
while (A.size() < 25) {
if (a >= base) {
A.emplace_back(1);
a -= base;
} else {
A.emplace_back(0);
}
base /= 2;
}
base = 1;
while (B.size() < 25) {
if (b >= base) {
B.emplace_back(1);
b -= base;
} else {
B.emplace_back(0);
}
base /= 2;
}
// std::cerr << "Yes\n";
for (int i = 0, j = 25; i < 25 && j > 0; i++, j--) {
int l = i, r = 0;
while (l < 25 && r < j && A[r] == B[l]) {
l++, r++;
}
// std::cerr << "Yes\n";
if (l == 25 && r == j) {
// std::cerr << i << " " << j << "\n";
for (int _ = i - 1; _ >= 0; _--) {
if (B[_]) {
std::cout << 2;
} else {
std::cout << 1;
}
}
std::cout << "\n";
return 0;
}
}
for (int i = 0; i < 25; i++) {
std::cout << 1;
}
std::cout << "\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3780kb
input:
0.5 0.25
output:
1
result:
ok ok
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3712kb
input:
1 0.75
output:
21
result:
wrong answer wa