*Author:* Aryan KD

*Tester:* Aryan KD

*Editorialist:* Aryan KD

# DIFFICULTY:

CAKEWALK, SIMPLE, EASY.

# PREREQUISITES:

Math .

# PROBLEM:

Chef has given an array of size N , and one number K you have to how many element is less than k in this array and print it.

# EXPLANATION:

We have given an array and one number k simply we have to compare all the element of array with given k and count the number of element in array less than k and print the count

for example

n=5 k=3

3 4 1 2 6

here number of element less than 3 is 1 and 2

that is 2 element is less than k there for answer is 2

# SOLUTIONS:

## Setter's Solution

indent whole code by 4 spaces

## Tester's Solution

indent whole code by 4 spaces

## Editorialist's Solution

indent whole code by 4 spaces