Submission #1531655

---

Source Code Expand

#include<bits/stdc++.h>
#include<string>
#include<cctype>
#include<cmath>
#include<queue>
#include<stack> 
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;

int main(){
  
  int N,i,ans=0;
  cin >> N;
  int A[N];
  for(i=0;i<N;i++){
    cin >> A[i];
  }
  
  sort(A,A+N);
  int count=0;
  for(i=1;i<N;i++){
    
    if(A[i-1]==A[i]){
      count += 1;
      ans += 1;
    }else{
      count =0;
    }
  }

  cout << ans << endl;
  return 0;
}
 

Submission Info

Judge Result