ALGORITHM ๐Ÿค–/Baekjoon

๋ฐฑ์ค€ - 10807

daxx0ne 2023. 3. 23. 10:17

https://www.acmicpc.net/problem/10807

 

10807๋ฒˆ: ๊ฐœ์ˆ˜ ์„ธ๊ธฐ

์ฒซ์งธ ์ค„์— ์ •์ˆ˜์˜ ๊ฐœ์ˆ˜ N(1 ≤ N ≤ 100)์ด ์ฃผ์–ด์ง„๋‹ค. ๋‘˜์งธ ์ค„์—๋Š” ์ •์ˆ˜๊ฐ€ ๊ณต๋ฐฑ์œผ๋กœ ๊ตฌ๋ถ„๋˜์–ด์ ธ์žˆ๋‹ค. ์…‹์งธ ์ค„์—๋Š” ์ฐพ์œผ๋ ค๊ณ  ํ•˜๋Š” ์ •์ˆ˜ v๊ฐ€ ์ฃผ์–ด์ง„๋‹ค. ์ž…๋ ฅ์œผ๋กœ ์ฃผ์–ด์ง€๋Š” ์ •์ˆ˜์™€ v๋Š” -100๋ณด๋‹ค ํฌ๊ฑฐ

www.acmicpc.net

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(); // ์ •์ˆ˜์˜ ๊ฐœ์ˆ˜
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt(); // ์ •์ˆ˜ ์ž…๋ ฅ ๋ฐ›๊ธฐ
        }
        int v = sc.nextInt(); // ์ฐพ์œผ๋ ค๋Š” ์ •์ˆ˜
        int count = 0;
        for (int j = 0; j < n; j++){
            if(v == arr[j]){ // ์ž…๋ ฅ๋ฐ›์€ ์ •์ˆ˜ ์ค‘์— ์ฐพ์œผ๋ ค๋Š” ์ •์ˆ˜๊ฐ€ ๋ช‡ ๊ฐœ์ธ์ง€ ์„ธ๊ธฐ
                count++;
            }
        }
        System.out.println(count);
    }
}