QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#383756#6749. TargetTeiosama#RE 0ms3688kbC++17543b2024-04-09 17:22:492024-04-09 17:22:50

Judging History

你现在查看的是最新测评结果

  • [2024-04-09 17:22:50]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:3688kb
  • [2024-04-09 17:22:49]
  • 提交

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;
			a = a*0.5+0.5;
			ans[cnt++] = 2;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: 100
Accepted
time: 0ms
memory: 3688kb

input:

0.5 0.25

output:

1

result:

ok ok

Test #2:

score: -100
Runtime Error

input:

1 0.75

output:


result: