Can anyone help me with how to approach this problem?

I am completely blank on how to proceed.

I tried reading the editorial but couldn't understand it.

# | User | Rating |
---|---|---|

1 | MiFaFaOvO | 3681 |

2 | Um_nik | 3553 |

3 | tourist | 3515 |

4 | Benq | 3508 |

5 | ecnerwala | 3390 |

6 | TLE | 3223 |

7 | scott_wu | 3209 |

8 | Petr | 3205 |

9 | ksun48 | 3197 |

10 | Radewoosh | 3188 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 204 |

2 | antontrygubO_o | 189 |

2 | pikmike | 189 |

4 | Monogon | 186 |

5 | vovuh | 184 |

6 | Ashishgup | 182 |

7 | Um_nik | 180 |

8 | SecondThread | 174 |

9 | Radewoosh | 172 |

10 | ko_osaga | 161 |

I am completely blank on how to proceed.

I tried reading the editorial but couldn't understand it.

Hi Codeforces Community,

I have made an extension to be able to practice speed problem solving on Codeforces.

It can set a timer within Codeforces site so that you get the native contest like feel but for an individual problem.

You can select different timers. Once selected, if you open any problem from Problem set or Contest it will automatically start the timer if it is a new problem for you.

I am not writing much here because I have already written instructions on the github repo.

Suggestions, improvements, and Pull Requests are welcomed!

Looking forward to hearing from the community

**Update:**

Custom Timer Added.

Thanks!

I could filter by type of contest on vjudge.net but don't know if vjudge can filter level of problem too.

Can someone help, please?

Is there any other site which lists AtCoder problems by level and contest?

Editorials are not available in English and I am not able to approach this problem on my own.

I tried to understand the editorial, but couldn't understand.

Can someone please explain to me it more clearly?

I am getting a runtime error on test case 6. Since it is a large test case, I am unable to find what's giving RE in my code.

Can someone please have a look at my code, or give me some small test case similar to case 6.

In normal Nim game, the player taking the last object wins.

And terminal position here is always a P -position.

Now, I have a question where you are given the terminal P and N positions unlike the only terminal condition in normal Nim.

Is this a variation of Nim? If yes, how to analyze it, how should I go about assigning grundy numbers?

**Formally:**

I have n heaps with represented by a set S={a_{1},a_{2},a_{3}, .... a_{n}}.

And, I have a set T which gives terminal positions and tell whether it is a P-position or N-position.

One element of the set can be {{k_{1},k_{2},k_{3}, .... k_{n}},P}

where,

k_{1}<=a_{1}

k_{2}<=a_{2}

k_{3}<=a_{3}

.

.

k_{n}<=a_{n}

It means the set {k_{1},k_{2},k_{3}, .... k_{n}} is a terminal position.

And, the second parameter denotes either 'P' or 'N' as P-position or N-position.

Can this be made equivalent to Nim?

How to analyze this?

Can someone please help me on how to arrive at the conclusion stated in the editorial?

Thanks!

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/15/2020 05:46:59 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|