QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#383753 | #6749. Target | Teiosama# | RE | 0ms | 0kb | C++17 | 505b | 2024-04-09 17:21:50 | 2024-04-09 17:21:51 |
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;
// int ww=0;
while(fabs(a-b)>0.0001)
{
// ww++;
//cout<<"di"<<ww<<"ci ";
if(a>b)
{
a*=0.5;
a*=0.5;
ans[cnt++] = 1;
ans[cnt++] = 1;
}
else
{
a = a*0.5+0.5;
ans[cnt++] = 2;
}
//cout<<fixed<<setprecision(6)<<a<<'\n';
}
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: 0
Runtime Error
input:
0.5 0.25