Created
May 13, 2022 15:13
-
-
Save jtprogru/1d3cc245c5d7d16d4f27115c7d7c86f0 to your computer and use it in GitHub Desktop.
Найдите количество минимальных элементов в последовательности. Вводится натуральное число N, а затем N целых чисел последовательности. Выведите количество минимальных элементов последовательности.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import ( | |
"fmt" | |
"sort" | |
) | |
func main() { | |
var inputNumber int | |
var counter uint = 1 | |
var min int | |
_, _ = fmt.Scan(&inputNumber) | |
inputArray := make([]int, inputNumber) | |
for i := 0; i < inputNumber; i++ { | |
_, _ = fmt.Scan(&inputArray[i]) | |
} | |
sort.Ints(inputArray) | |
min = inputArray[0] | |
for i := 1; i < inputNumber; i++ { | |
if min == inputArray[i] { | |
counter += 1 | |
} | |
} | |
fmt.Println(counter) | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment