Test results - Codility

Code: 11:47:59 UTC, java, autosave

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

Code: 11:48:20 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    for(int i=0; i>N; i++)
}

Code: 11:48:51 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    
}

Code: 11:49:21 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();

    for()
}

Code: 11:49:35 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();

    for(int i=0; i<len; i++){
        
    }
}

Code: 11:50:05 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;
    
    for(int i=0; i<len; i++){
        
    }
}

Code: 11:50:33 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v.push_back(A[i]);
        if()    
    }
}

Code: 11:50:46 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v.push_back(A[i]);
        if(find)    
    }
}

Code: 11:51:05 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v.push_back(A[i]);
        if(find(v1.begin(), v1.end()))    
    }
}

Code: 11:51:36 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v.push_back(A[i]);
        /
        if(find(v1.begin(), v1.end(), A[i])){
            
        }    
    }
}

Code: 11:51:53 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 있으면
        if(find(v1.begin(), v1.end(), A[i])){
            v1
        }    
    }
}

Code: 11:52:09 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 있으면
        if(find(v1.begin(), v1.end(), A[i])){
            v1[]
        }    
    }
}

Code: 11:53:02 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 있으면
        if(find(v1.begin(), v1.end(), A[i])m){
            v1[]
        }    
    }
}

Code: 11:53:12 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 있으면
        if(find(v1.begin(), v1.end(), A[i]) != v1.end()){
            v1[]
        }    
    }
}

Code: 11:53:43 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 있으면
        if(find(v1.begin(), v1.end(), A[i]) != v1.end()){
            v1[]
        }    
    }
}

Code: 11:53:53 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 있으면
        if(find(v1.begin(), v1.end(), A[i]) != v1.end()){
            v1[]
        }    
    }
}

Code: 11:55:05 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 있으면
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1[]
        }    
    }
}

Code: 11:55:18 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1배열에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1[]
        }    
    }
}

Code: 11:55:35 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back()
        }    
    }
}

Code: 11:55:46 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }    
    }
}

Code: 11:55:56 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }    
    }
    for()
}

Code: 11:56:16 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<pair<int, int>> v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }    
    }
    for()
}

Code: 11:56:34 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<pair<int, int> > v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }    
    }
    for()
}

Code: 11:56:52 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<pair<int, int> > v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i], 1);
        }    
    }
    for(int i=0; i<)
}

Code: 11:57:02 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<pair<int, int> > v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i], 1);
        }else{
            
        }  
    }
    for(int i=0; i<)
}

Code: 11:57:55 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector< > v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i], 1);
        }else{

        }  
    }
    for(int i=0; i<)
}

Code: 11:58:06 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int > v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }else{

        }  
    }
    for(int i=0; i<)
}

Code: 11:58:27 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int > v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }
    for(int i=0; i<len; i++){
        if()
    }
}

Code: 11:58:43 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int len = A.size();
    vector<int > v1;

    for(int i=0; i<len; i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    int len_v1 = v1.size();
    
    for(int i=0; i<len; i++){
        if()
    }
}

Code: 11:58:54 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int > v1;

    for(int i=0; i<A.size(); i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    int len_v1 = v1.size();

    for(int i=0; i<len; i++){
        if()
    }
}

Code: 11:59:04 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int > v1;

    for(int i=0; i<A.size(); i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<v1.size(); i++){
        if()
    }
}

Code: 11:59:17 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int > v1;

    for(int i=0; i<A.size(); i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 11:59:55 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int > v1;

    for(int i=0; i<A.size(); i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:00:10 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        v1.push_back(A[i]);
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:00:34 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //vector에 배열이 없으면 v1에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:01:04 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:01:15 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(find(v1.begin(), v1.end(), A[i]) == v1.end()){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:01:40 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find()){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:01:50 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i])){
            v1.push_back(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:02:03 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(!m1.find(A[i])){
            m1.insert(A[i]);
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:02:13 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(!m1.find(A[i])){
            m1.insert(A[i], 1);
        }else{
            
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:03:03 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(!m1.find(A[i])){
            m1.insert(A[i], 1);
        }else{
            ma
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:03:14 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(!m1.find(A[i])){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] = 
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:03:25 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(!m1.find(A[i])){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(int i=0; i<A.size(); i++){
        if(v1)
    }
}

Code: 12:03:50 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(!m1.find(A[i])){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(it)
}

Code: 12:04:01 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;
    map

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(!m1.find(A[i])){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(it)
}

Code: 12:05:29 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;
    map

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(!m1.find(A[i]) ){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(it)
}

Code: 12:05:41 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int> m1;
    map

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(it)
}

Code: 12:07:36 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<pair<int, int>> m1;
    map

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(it)
}

Code: 12:07:46 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(it)
}

Code: 12:08:00 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(it)
}

Code: 12:08:22 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter)
}

Code: 12:08:32 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=0; i<)
}

Code: 12:09:02 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=0; i<m1.end(); iter++)
}

Code: 12:09:16 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=0; iter<m1.end(); iter++){
        if(i)
    }
}

Code: 12:09:36 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=0; iter<m1.end(); iter++){
        if(iter->)
    }
}

Code: 12:10:00 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=0; iter<m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first
        }
    }
}

Code: 12:10:30 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(int i=0; i<m1.size()){
        if(iter->second %2 == 1){
            return iter->first
        }
    }
}

Code: 12:10:46 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(int i=0; i<m1.size(); i++){
        if(m1[i]->second %2 == 1){
            return iter->first
        }
    }
}

Code: 12:11:43 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(int i=0; i<m1.size();){
        if(iter->second %2 == 1){
            return iter->first
        }
    }
}

Code: 12:11:54 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=0; iter<m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first
        }
    }
}

Code: 12:11:58 UTC, cpp, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++/h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=0; iter<m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Analysis

Compile error

func.cpp:2:25: fatal error: bits/stdc++/h: No such file or directory
 #include <bits/stdc++/h>
                         ^
compilation terminated.

Code: 12:12:08 UTC, cpp, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=0; iter<m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:13:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<A.size(); i++){
                  ~^~~~~~~~~
func.cpp:22:14: error: no match for 'operator=' (operand types are 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' and 'int')
     for(iter=0; iter<m1.end(); iter++){
              ^
In file included from /opt/lang/gcc/include/c++/6.2.0/map:60:0,
                 from /opt/lang/gcc/include/c++/6.2.0/x86_64-pc-linux-gnu/bits/stdc++.h:81,
                 from func.cpp:2:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:178:12: note: candidate: constexpr std::_Rb_tree_iterator<std::pair<const int, int> >& std::_Rb_tree_iterator<std::pair<const int, int> >::operator=(const std::_Rb_tree_iterator<std::pair<const int, int> >&)
     struct _Rb_tree_iterator
            ^~~~~~~~~~~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:178:12: note:   no known conversion for argument 1 from 'int' to 'const std::_Rb_tree_iterator<std::pair<const int, int> >&'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:178:12: note: candidate: constexpr std::_Rb_tree_iterator<std::pair<const int, int> >& std::_Rb_tree_iterator<std::pair<const int, int> >::operator=(std::_Rb_tree_iterator<std::pair<const int, int> >&&)
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:178:12: note:   no known conversion for argument 1 from 'int' to 'std::_Rb_tree_iterator<std::pair<const int, int> >&&'
func.cpp:22:21: error: no match for 'operator<' (operand types are 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' and 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}')
     for(iter=0; iter<m1.end(); iter++){
                 ~~~~^~~~~~~~~
In file included from /opt/lang/gcc/include/c++/6.2.0/regex:62:0,
                 from /opt/lang/gcc/include/c++/6.2.0/x86_64-pc-linux-gnu/bits/stdc++.h:110,
                 from fun

Code: 12:12:49 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iterm1.end(); iter<m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Code: 12:12:55 UTC, cpp, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert(A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=m1.begin(); iter<m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:13:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<A.size(); i++){
                  ~^~~~~~~~~
func.cpp:22:30: error: no match for 'operator<' (operand types are 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' and 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}')
     for(iter=m1.begin(); iter<m1.end(); iter++){
                          ~~~~^~~~~~~~~
In file included from /opt/lang/gcc/include/c++/6.2.0/regex:62:0,
                 from /opt/lang/gcc/include/c++/6.2.0/x86_64-pc-linux-gnu/bits/stdc++.h:110,
                 from func.cpp:2:
/opt/lang/gcc/include/c++/6.2.0/bits/regex.h:959:5: note: candidate: template<class _BiIter> bool std::__cxx11::operator<(const std::__cxx11::sub_match<_BiIter>&, const std::__cxx11::sub_match<_BiIter>&)
     operator<(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
     ^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/regex.h:959:5: note:   template argument deduction/substitution failed:
func.cpp:22:38: note:   'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
     for(iter=m1.begin(); iter<m1.end(); iter++){
                                      ^
In file included from /opt/lang/gcc/include/c++/6.2.0/regex:62:0,
                 from /opt/lang/gcc/include/c++/6.2.0/x86_64-pc-linux-gnu/bits/stdc++.h:110,
                 from func.cpp:2:
/opt/lang/gcc/include/c++/6.2.0/bits/regex.h:1038:5: note: candidate: template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator<(std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const std::__cxx11::sub_match<_BiIter>&)
     operator<(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,
     ^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/regex.h:1038:5: note:   templa

Code: 12:15:23 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert({A[i], 1);
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=m1.begin(); iter<m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Code: 12:15:27 UTC, cpp, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert({A[i], 1});
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=m1.begin(); iter<m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:13:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<A.size(); i++){
                  ~^~~~~~~~~
func.cpp:22:30: error: no match for 'operator<' (operand types are 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' and 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}')
     for(iter=m1.begin(); iter<m1.end(); iter++){
                          ~~~~^~~~~~~~~
In file included from /opt/lang/gcc/include/c++/6.2.0/regex:62:0,
                 from /opt/lang/gcc/include/c++/6.2.0/x86_64-pc-linux-gnu/bits/stdc++.h:110,
                 from func.cpp:2:
/opt/lang/gcc/include/c++/6.2.0/bits/regex.h:959:5: note: candidate: template<class _BiIter> bool std::__cxx11::operator<(const std::__cxx11::sub_match<_BiIter>&, const std::__cxx11::sub_match<_BiIter>&)
     operator<(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
     ^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/regex.h:959:5: note:   template argument deduction/substitution failed:
func.cpp:22:38: note:   'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
     for(iter=m1.begin(); iter<m1.end(); iter++){
                                      ^
In file included from /opt/lang/gcc/include/c++/6.2.0/regex:62:0,
                 from /opt/lang/gcc/include/c++/6.2.0/x86_64-pc-linux-gnu/bits/stdc++.h:110,
                 from func.cpp:2:
/opt/lang/gcc/include/c++/6.2.0/bits/regex.h:1038:5: note: candidate: template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator<(std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const std::__cxx11::sub_match<_BiIter>&)
     operator<(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,
     ^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/regex.h:1038:5: note:   templa

Code: 12:18:55 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert({A[i], 1});
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=m1.begin(); iter!m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Code: 12:19:01 UTC, cpp, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert({A[i], 1});
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=m1.begin(); iter!=m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Analysis

▶

example1
example test

✔

OK

Code: 12:19:27 UTC, cpp, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert({A[i], 1});
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=m1.begin(); iter!=m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Analysis

▶

example1
example test

✔

OK

Code: 12:19:32 UTC, cpp, final, score: 88

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can use includes, for example:
#include <bits/stdc++.h>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    map<int, int> m1;
    map<int, int>::iterator iter;

    for(int i=0; i<A.size(); i++){
        //map에 없으면 map에 넣기
        if(m1.find(A[i]) == m1.end()){
            m1.insert({A[i], 1});
        }else{
            m1[A[i]] += 1;
        }
    }

    for(iter=m1.begin(); iter!=m1.end(); iter++){
        if(iter->second %2 == 1){
            return iter->first;
        }
    }
}

Analysis summary

The following issues have been detected: timeout errors.

Analysis

Detected time complexity:

O(N) or O(N*log(N))

▶

example1
example test

✔

OK

▶

simple1
simple test n=5

✔

OK

▶

simple2
simple test n=11

✔

OK

▶

extreme_single_item
[42]

✔

OK

▶

small1
small random test n=201

✔

OK

▶

small2
small random test n=601

✔

OK

▶

medium1
medium random test n=2,001

✔

OK

▶

medium2
medium random test n=100,003

✔

OK

▶

big1
big random test n=999,999, multiple repetitions

✔

OK

▶

big2
big random test n=999,999

✘

TIMEOUT ERROR
running time: 0.652 sec., time limit: 0.352 sec.

Task description