codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

120B.md (2182B)


      1 Source: https://codeforces.com/problemset/problem/120/B
      2 
      3 B. Quiz League
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 input.txt
     16 
     17 output
     18 
     19 output.txt
     20 
     21 A team quiz game called "What? Where? When?" is very popular in Berland. The game is centered on two teams competing. They are the team of six Experts versus the team of the Audience. A person from the audience asks a question and the experts are allowed a minute on brainstorming and finding the right answer to the question. All it takes to answer a typical question is general knowledge and common logic. The question sent be the audience are in envelops lain out in a circle on a round table. Each envelop is marked by the name of the asker's town. Each question is positioned in a separate sector. In the centre of the table is a spinning arrow. Thus, the table rather resembles a roulette table with no ball but with a spinning arrow instead. The host sets off the spinning arrow to choose a question for the experts: when the arrow stops spinning, the question it is pointing at is chosen. If the arrow points at the question that has already been asked, the host chooses the next unanswered question in the clockwise direction. Your task is to determine which will be the number of the next asked question if the arrow points at sector number *k*.
     22 
     23 Input
     24 
     25 The first line contains two positive integers *n* and *k* (1 ≤ *n* ≤ 1000 and 1 ≤ *k* ≤ *n*) — the numbers of sectors on the table and the number of the sector where the arrow is pointing. The second line contains *n* numbers: *a**i* = 0 if the question from sector *i* has already been asked and *a**i* = 1 if the question from sector *i* hasn't been asked yet (1 ≤ *i* ≤ *n*). The sectors are given in the clockwise order, the first sector follows after the *n*-th one.
     26 
     27 Output
     28 
     29 Print the single number — the number of the sector containing the question the experts will be asked. It is guaranteed that the answer exists, that is that not all the questions have already been asked.
     30 
     31 Examples
     32 
     33 Input
     34 
     35 ```
     36 5 5  
     37 0 1 0 1 0
     38 ```
     39 
     40 Output
     41 
     42 ```
     43 2
     44 ```
     45 
     46 Input
     47 
     48 ```
     49 2 1  
     50 1 1
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 1
     57 ```