QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #383486 | #6749. Target | Teiosama# | WA | 1ms | 3828kb | C++17 | 402b | 2024-04-09 14:48:16 | 2024-04-09 14:48:17 |
Judging History
answer
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
int main()
{
double a,b;
cin>>a>>b;
int ans[60]={0};
int cnt = 0;
while(fabs(a-b)>0.0001)
{
if(a>b)
{
a*=0.5;
ans[cnt++] = 1;
}
else
{
a = a*0.5+0.5;
ans[cnt++] = 2;
}
if(cnt==51)
break;
}
for(int i = 0;i<cnt;i++)
{
cout<<ans[i];
}
cout<<endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3828kb
input:
0.5 0.25
output:
1
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
1 0.75
output:
12
result:
ok ok
Test #3:
score: 0
Accepted
time: 1ms
memory: 3780kb
input:
1 0
output:
11111111111111
result:
ok ok
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3792kb
input:
0.361954 0.578805
output:
212121212121212121212121212121212121212121212121212
result:
wrong answer wa