I was doing this question asked in recent HackFest in Hackerrank . I know its too simple but anyhow i m not able to score all 20 points.
my code
Please help ..i m not able to find the solution.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
Simple game theory question
I was doing this question asked in recent HackFest in Hackerrank . I know its too simple but anyhow i m not able to score all 20 points.
string whoIsTheWinner(vector<int> v) {
set<int> s;
for(unsigned int i=0;i<v.size();i++) s.insert(v[i]);
if(int(v.size()-s.size())%2==0 or s.size()%2==0) return "First";
return "Second"; }
Please help ..i m not able to find the solution.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | Sahilamin219 | 2020-10-18 07:43:24 | 14 | |||
en2 | Sahilamin219 | 2020-10-18 07:31:06 | 1 | |||
en1 | Sahilamin219 | 2020-10-18 07:30:27 | 588 | Initial revision (published) |
Name |
---|