Codeforces

Codeforces next round solution in C,Python || Codeforces 158A. Next Round Solution

by
codeforces next round solution in c

Codeforces next round solution in C,Python QUESTION 158A. Next Round Solution solution in C #include<stdio.h> int main() { int n,i,k,count=0; int a[100]; scanf(“%d%d”,&n,&k); for(i=0;i<n;i++){ scanf(“%d”,&a[i]);} k=k-1; for(i=0;i<n;i++){ if(a[i]>=a[k]&&a[i]>0){ count++; } } printf(“%d\n”,count); return 0; } 158A. Next Round Solution in Python n,k = map(int,raw_input().split()) L = map(int,raw_input().split()) temp = L[k-1] count=0 for i in range(0,len(L)): … Read more

1A.Theatre square Codeforces Solution in C, CPP, Python

by
Theatre square Codeforces Solution

Theatre square Codeforces solution || Codeforces theatre square solution Theatre square Solution in C, CPP, Python Question Cover a square with tiles — Codeforces Problem “Theatre Square” We are given a square of size n x m the square has side large cells, and we can place only square tiles on it also each tile … Read more

Codeforces 71a Solution in C, C++

by
way too long words codeforces solution

Codeforces 71a solution in c ||Codeforces 71a way too long words C, C++ Codeforces 71a Solution ||way too long words Code forces solution Step1: Learning the Problem The question is asking you to abbreviate words that are “so lengthy. A word has been fixed to 10 characters. Anyway, the process for abbreviating it is to … Read more

Codeforces watermelon solution in C ,C++,python

by
Codeforces Watermelon Solution

Codeforces watermelon solution || a. watermelon codeforces solution || codeforces watermelon solution ||watermelon codeforces solution in python we will follow the following step-wise approach to address this problem: Step 1:- Know your Problem:- The question: Can we divide a watermelon of fixed even weighting into two same-sized pieces where both parts are whole numbers? The … Read more