QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#692549#6749. Targetxuedinedtouzi#WA 0ms3788kbC++23549b2024-10-31 14:41:302024-10-31 14:42:17

Judging History

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

  • [2024-10-31 14:42:17]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3788kb
  • [2024-10-31 14:41:30]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
long double x,y;
int len;
vector<bool> ans(55);
bool dfs(int dp,int max_dp,double a){
	if(dp>max_dp){
		return false;
	}
	if(abs(a-y)<=0.00001){
		len=dp;
		return true;
	}
	if(a>y){
		ans[dp]=0;
		if(dfs(dp+1,max_dp,a/2)){
			return true;
		}
	}else{
		ans[dp]=1;
		if(dfs(dp+1,max_dp,(a+1)/2)){
			return true;
		}
	}
	return false;
}
int main(){
	cin>>x>>y;
	for(int i=0;i<51;i++){
		if(dfs(0,i,x)){
			break;
		}
	}
	for(int i=0;i<len;i++){
		cout<<ans[i]+1;
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3732kb

input:

0.5 0.25

output:

1

result:

ok ok

Test #2:

score: 0
Accepted
time: 0ms
memory: 3732kb

input:

1 0.75

output:

12

result:

ok ok

Test #3:

score: 0
Accepted
time: 0ms
memory: 3736kb

input:

1 0

output:

11111111111111111

result:

ok ok

Test #4:

score: -100
Wrong Answer
time: 0ms
memory: 3788kb

input:

0.361954 0.578805

output:


result:

wrong answer wa