We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Security
  3. Functions
  4. Security Bijective Functions
  5. Discussions

Security Bijective Functions

  • ako_abdelhaq
     + 0 comments

    C++ solution with std::map like a table of frequencies :

    #include <iostream>
#include <map>

using namespace std;

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    cin>>n;
    map<int,int> freqeuncy;
    bool isTrue = true;
    for(int i=0;i<n;i++){
        int t;
        cin>>t;
        if(freqeuncy.find(t)==freqeuncy.end()){
            freqeuncy[t] = 1;
        }else {
            isTrue = false;
        }
    }
    isTrue ? cout<<"YES" : cout<<"NO";
    cout<<endl;  
    return 0;
}