QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#579346 | #9229. Juliet Unifies Ones | JustinWu# | WA | 1ms | 3880kb | C++14 | 385b | 2024-09-21 12:44:48 | 2024-09-21 12:44:50 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
char s[100];
int ans=1e9;
int main(){
scanf("%s",s+1);
for(int i=1;i<=strlen(s+1);i++){
for(int j=i;j<=strlen(s+1);j++){
int now=0;
for(int k=1;k<=strlen(s+1);k++){
if(k<i&&s[k]=='1')now++;
if(k>=i&&k<=j&&s[k]=='0')now++;
if(k>j&&s[k]=='1')now++;
}
ans=min(ans,now);
}
}
printf("%d",ans);
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3880kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3864kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3868kb
input:
00000000000000000000000000000000000000000000000000
output:
1
result:
wrong answer 1st numbers differ - expected: '0', found: '1'