QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #474914 | #6749. Target | hebaodan77777777 | TL | 0ms | 3852kb | C++14 | 382b | 2024-07-13 09:18:05 | 2024-07-13 09:18:05 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3+10;
map<double,int> vs;
int main (){
double a,b;
double s =0.5;
cin>>a>>b;
int flag = 0 ;
while( abs(a-b) > 1e-4 ){
double t1 = a*s;
double t2 = (a-1) * s + 1 ;
if(a > b){
cout<<'1';
a = t1;
}else{
cout<<'2';
a = t2;
}
flag++;
}
cout<<endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3760kb
input:
0.5 0.25
output:
1
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
1 0.75
output:
12
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
1 0
output:
11111111111111
result:
ok ok
Test #4:
score: -100
Time Limit Exceeded
input:
0.361954 0.578805
output:
212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121212121...