QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #465715 | #4832. Telepathy | BalintR | 0 | 6ms | 1612kb | C++20 | 279b | 2024-07-07 06:13:00 | 2024-07-07 06:13:01 |
answer
#include <stdio.h>
#define gc (getchar()-48)
int n, m, strat[8] = {1, 2, 1, 2, 0, 0, 1, 3};
int main(){
scanf("%*s %d %d ", &n, &m);
for(int i = 0; i < m; i++){
int v = gc + gc*2 + gc*4; gc;
printf("%d%c", i*4+v+1, " \n"[i == m-1]);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 6ms
memory: 1612kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
4 12 16 17 23 26 26 32 40 43 42 49 56 59 64 68 68 76 75 77 83 86 89 98 98 101 111 109 117 121 128 126 129 135 139 144 150 156 154 158 166 169 172 177 180 184 188 190 193 198 205 207 212 217 223 226 227 230 237 244 244 252 252 256 262 261 271 273 276 278 281 288 292 298 302 305 310 311 315 319 327 32...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
1 9 11 15 19 22 26 35 36 39 43 48 50 55 61 62 68 71 78 81 88 85 95 97 99 107 106 114 114 123 123 130 135 135 144 144 151 153 155 160 163 165 173 178 182 186 192 190 196 200 205 205 213 216 221 221 230 232 236 239 246 250 251 253 264 264 272 270 273 277 285 289 293 296 298 305 310 316 319 320 323 328...
result:
wrong answer