Codeforces 158A - Next Round Solution In Java

Program

import java.util.Scanner; public class x { public static void main(String args[]) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int k = sc.nextInt(); int a[] = new int[n]; int cnt = 0; for(int i=0;i<n;i++) { a[i] = sc.nextInt(); } int key = a[k-1]; for(int j=0;j<n;j++) { if(a[j]>=key && a[j]>0) { cnt++; } } System.out.println(cnt); } }

Output

I/P: 8 5 10 9 8 7 7 7 5 5 O/P: 6

Codeforces 1328A - Divisibility Problem Solution In Python-

https://www.techrcoding.com/2020/07/codeforces-1328a.html

Codeforces 231A - Team Problem Solution In Java-

https://www.techrcoding.com/2020/07/codeforces-231a.html