QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #490353 | #4832. Telepathy | TheRaptor | 0 | 8ms | 4176kb | C++14 | 295b | 2024-07-25 14:49:02 | 2024-07-25 14:49:02 |
answer
#include <bits/stdc++.h>
using namespace std;
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int n,k;
cin >> n >> k;
cin >> s;
int cnt=0;
for(int i=0; i<n; i++){
if(s[i]=='1'){
cout << i+1 << ' ';
cnt++;
}
if(cnt==k) break;
}
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 8ms
memory: 4176kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
1 2 4 5 6 7 8 9 10 11 15 18 19 20 21 23 24 25 28 29 30 33 34 35 36 38 39 41 47 48 49 50 51 54 55 56 57 58 59 60 61 62 63 64 65 66 68 69 70 71 72 74 82 85 92 93 95 96 97 104 106 107 108 115 116 119 120 121 122 123 125 128 134 138 140 141 142 145 147 148 149 150 151 153 157 161 163 164 167 169 170 175...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
7 8 10 14 18 21 25 28 30 31 32 33 34 38 40 42 45 46 48 49 52 54 56 59 61 64 65 66 68 70 73 75 76 79 81 82 83 88 90 91 92 95 96 98 102 103 104 105 108 109 111 113 116 118 119 120 122 124 125 127 128 130 131 134 136 137 138 139 141 142 146 147 148 151 152 154 157 158 162 168 171 173 175 176 177 179 18...
result:
wrong answer 49792 matched, but you need to match at least 66666 positions