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

1 | MiFaFaOvO | 3681 |

2 | Um_nik | 3567 |

3 | tourist | 3520 |

4 | maroonrk | 3421 |

5 | apiadu | 3397 |

6 | 300iq | 3317 |

7 | ecnerwala | 3309 |

8 | Benq | 3283 |

9 | LHiC | 3229 |

10 | TLE | 3223 |

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

1 | Errichto | 194 |

2 | antontrygubO_o | 191 |

3 | vovuh | 178 |

4 | pikmike | 177 |

5 | Radewoosh | 166 |

5 | tourist | 166 |

7 | Um_nik | 165 |

8 | ko_osaga | 163 |

8 | McDic | 163 |

10 | Geothermal | 158 |

↑

↓

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/05/2020 07:21:20 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

One of the bugs can be on the last line in main() where you are subtracting two numbers which are % MOD. It can go negative. Do it in this way: (a — b + MOD) % MOD

Thanks! that was the exact problem. Still can you explain why we exactly do that(a-b+MOD)%MOD I now get it that a-b can be negative but still can't understand why we exactly add MOD to a-b (won't adding affect our answer ?)

Adding by mod is equivalent to adding by zero.

Oh!!!!! Damn I am stupid Thanks for clearing that out.