[알고리즘] 백준 11549 - Identifying tea (C++)

[문제 링크] : https://www.acmicpc.net/problem/11549

#include <iostream>
using namespace std;
 
int main(){
    int N, inp, Ans = 0;
    cin >> N;
    for(int i=0; i<5; i++){
        cin >> inp;
        if(N == inp){
            Ans += 1;
        }
    }
    cout << Ans << "\n";
    return 0;
}