Algorithm

B. Quiz League
time limit per test
1 second
memory limit per test
256 megabytes
Problem Link- https://codeforces.com/problemset/problem/120/B
input
input.txt
output
output.txt

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.

Input

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: ai = 0 if the question from sector i has already been asked and ai = 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.

Output

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.

Examples
input
Copy
5 5
0 1 0 1 0
output
Copy
2
input
Copy
2 1
1 1
output
Copy
1



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>

int main(){

    FILE * inputFile = fopen("input.txt","r");
    int n(0), k(0); fscanf(inputFile, "%d %d", &n, &k);

    bool noneSoFar(1); 
    int firstUnanswered(0);

    for(int p = 1; p <= n; p++){
        int temp(0); fscanf(inputFile, "%d", &temp);
        if(temp){
            if(p >= k){firstUnanswered = p; break;}
            else if(noneSoFar){firstUnanswered = p; noneSoFar = 0;}
        }
    }
    fclose(inputFile);

    FILE * outputFile = fopen("output.txt","w");
    fprintf(outputFile, "%d\n", firstUnanswered);
    fclose(outputFile);

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
5 5
0 1 0 1 0

Output

x
–
+
cmd
2
Advertisements

Demonstration

Codeforces Solution-B. Quiz League-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+