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 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 161 |
| 2 | adamant | 146 |
| 3 | Um_nik | 145 |
| 4 | Dominater069 | 142 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
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 |
|---|


