QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#694324 | #6749. Target | zxk# | TL | 0ms | 3844kb | C++17 | 579b | 2024-10-31 17:42:51 | 2024-10-31 17:42:51 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define enter cout<<"enter"<<'\n';
using namespace std;
typedef pair<int, int> PII;
typedef pair<double, int> PDD;
typedef long long LL;
const int inf = 1e18, mod = 1e9 + 7;
double exp1 = 1e-4;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
double a, b;
cin >> a >> b;
cout << string(25, '1');
cout << 2;
a = 0.5;
while (abs(a-b) > exp1)
{
if (a > b)
{
a *= 0.5;
cout << 1;
}
else
{
a = a / 2 + 0.5;
cout << 2;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3680kb
input:
0.5 0.25
output:
111111111111111111111111121
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
1 0.75
output:
111111111111111111111111122
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
1 0
output:
111111111111111111111111121111111111111
result:
ok ok
Test #4:
score: -100
Time Limit Exceeded
input:
0.361954 0.578805
output:
111111111111111111111111122121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121...