QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#342535	#4832. Telepathy	nguyentunglam	0	7ms	4212kb	C++17	643b	2024-03-01 12:24:37	2024-03-01 12:24:37

Judging History

你现在查看的是最新测评结果

[2024-03-01 12:24:37]
评测

测评结果：0
用时：7ms
内存：4212kb

查看

[2024-03-01 12:24:37]
提交

answer

#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;

int32_t main() {
  #define task ""

  cin.tie(0) -> sync_with_stdio(0);

  if (fopen("task.inp", "r")) {
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
  }

  if (fopen(task".inp", "r")) {
    freopen (task".inp", "r", stdin);
    freopen (task".out", "w", stdout);
  }

  string player; cin >> player;

  int n, k; cin >> n >> k;

  string str; cin >> str;
  for(int i = 0; i < n; i += 10) {
    int j = i;
    while (j < i + 9 && str[j] == '1') j++;
    cout << j << " ";
  }
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0

Wrong Answer

time: 7ms

memory: 4212kb

input:

Flim
1000000 100000
1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...

output:

2 11 21 30 41 51 66 72 80 90 100 110 123 130 142 151 161 170 182 190 200 210 221 230 242 250 260 271 280 290 300 310 320 332 341 350 360 371 380 390 402 411 423 434 445 451 460 470 483 490 507 512 523 531 541 550 560 571 580 590 600 611 620 630 640 650 660 670 684 690 700 711 720 732 747 752 761 772...

input:

Flam
1000000 100000
0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...

output:

0 10 21 34 40 50 61 70 83 92 100 111 120 131 142 152 160 171 181 190 200 214 220 230 241 250 262 270 280 294 300 312 320 330 343 352 360 370 380 391 400 411 420 431 440 450 465 470 480 490 500 510 520 536 541 552 563 572 582 590 600 610 622 637 640 650 660 671 680 691 704 712 722 731 744 750 760 771...

result:

wrong answer