In your opinion , is it better to refresh a problem to see if its AC or to move on to the next problem. Now , for the later problems time doesnt matter that much , but its really a different story for AB. So , what do you think?

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

1 | tourist | 3843 |

2 | jiangly | 3705 |

3 | Benq | 3628 |

4 | orzdevinwang | 3571 |

5 | Geothermal | 3569 |

5 | cnnfls_csy | 3569 |

7 | jqdai0815 | 3530 |

8 | ecnerwala | 3499 |

9 | gyh20 | 3447 |

10 | Rebelz | 3409 |

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

1 | maomao90 | 171 |

2 | awoo | 164 |

3 | adamant | 162 |

4 | TheScrasse | 159 |

5 | nor | 154 |

6 | maroonrk | 153 |

7 | -is-this-fft- | 152 |

8 | Petr | 146 |

9 | orz | 145 |

10 | pajenegod | 144 |

Just look at my rating , why?

1397

Lets do the following: write what inspires us to do cf. This way we will for sure inspire those who dont feel that way. I'll start

Last year I qualified for my nations EJOI team , and i have to admit visiting Georgia and hanging out with great people was quite fun. But i didnt do well in the contest , i only managed to get 3.38 points , which placed me 93rd. But i still have a chance. This year will be my last my EJOI , and i want to make it great. This is what keeps me going , i practiced so much I even managed to get HM on JBOI which took place just 2 and a half months after EJOI. And i dont intend to stop practicing even after EJOI.

So the problem is as following: You are given two integers n and q , and there is an array length n with all zeroes. There are q operations of 3 types: -output the sum in array a from i to j; -a[i] becomes 1; -a[i] becomes 0.

I know this can be done using segment trees but I think that is complicating it.

Is there any website like codeforces but for math? I need to work on my programming math.

A few days ago i stumbeld upon a 1200 which gave me a headache 1822D - Super-Permutation , and just now i solved it. What i want you to do is look at this problem and try figuring it out , then read the rest of this post.

The way i solved it , and what i believe to be the easiest way of solving it looking at last test case and finding the pattern, after this you should be all set , the implementation is really easy.

This problem taught me that i really need to observe the test cases more , even if there is really only one useful test case.

Enjoy the rest of your day.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/14/2024 15:23:18 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|