QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#745338 | #9746. 平方根 | hhoppitree# | AC ✓ | 17ms | 5324kb | C++17 | 418b | 2024-11-14 09:16:06 | 2024-11-14 09:16:07 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
double calc(int x) {
if (!x) return 0;
return (x + 1) / 2 + (!(x & 1) ? sqrt(2) - 1 : 0);
}
signed main() {
string S; cin >> S;
int n = S.size();
double res = 0;
for (int i = 0, z = 0; i <= n; ++i) {
if (i != n && S[i] == '1') ++z;
else res += calc(z), z = 0;
}
printf("%.12lf\n", res);
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3848kb
input:
1100110111
output:
4.828427124746
result:
ok found '4.828427125', expected '4.828427125', error '0.000000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
0
output:
0.000000000000
result:
ok found '0.000000000', expected '0.000000000', error '-0.000000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
1
output:
1.000000000000
result:
ok found '1.000000000', expected '1.000000000', error '0.000000000'
Test #4:
score: 0
Accepted
time: 13ms
memory: 5324kb
input:
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
0.000000000000
result:
ok found '0.000000000', expected '0.000000000', error '-0.000000000'
Test #5:
score: 0
Accepted
time: 12ms
memory: 5248kb
input:
111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
output:
500000.414213562384
result:
ok found '500000.414213562', expected '500000.414213562', error '0.000000000'
Test #6:
score: 0
Accepted
time: 17ms
memory: 5316kb
input:
010101111011001000011101100000011110101010000110011110101010111011010011100001100000001011100111110000100101100011101101000100110100111101001100011000101000000101011101000011011001111011101101100010110110001111011001010100110011111101000010010011011101100001101001101010011011100110101001101111010101...
output:
367851.986787611502
result:
ok found '367851.986787612', expected '367851.986787086', error '0.000000000'
Test #7:
score: 0
Accepted
time: 12ms
memory: 5260kb
input:
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
299931.313708499016
result:
ok found '299931.313708499', expected '299931.313708499', error '0.000000000'
Extra Test:
score: 0
Extra Test Passed