I am solving this problem and I couldn't find any source code for the solution online so if anyone solved it before or find a source code for it please comment with the link.

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

1 | tourist | 3775 |

2 | Benq | 3724 |

3 | orzdevinwang | 3697 |

4 | Radewoosh | 3651 |

5 | jiangly | 3632 |

6 | cnnfls_csy | 3620 |

7 | -0.5 | 3545 |

8 | inaFSTream | 3478 |

9 | fantasy | 3468 |

10 | Rebelz | 3415 |

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

1 | adamant | 178 |

2 | awoo | 167 |

3 | BledDest | 165 |

4 | Um_nik | 163 |

5 | maroonrk | 162 |

6 | SecondThread | 159 |

7 | nor | 158 |

8 | -is-this-fft- | 153 |

9 | kostka | 146 |

10 | TheScrasse | 144 |

Could anyone explain to me the proof for such a method of checking whether a number is primitive root or not http://zobayer.blogspot.com/2010/02/primitive-root.html

why should i check only certain numbers to be equal to one or not ?

why at the second test case the answer 2133 is wrong ? http://codeforces.com/contest/681/problem/D

Could any one explain to me the solution of this problem ?

why in the second testcase the answer is not ...XXX http://codeforces.com/contest/104/problem/D

Could anyone explain the problem statement to me ? http://www.spoj.com/problems/ORDERS/

the problem is http://codeforces.com/contest/513/problem/C

the solution is http://codeforces.com/contest/513/submission/9761274

i wonder how this solution not TLE it is 1009*1009*6*6*6 which is TLE

Why the solution to this problem is not by dynamic programming and how the solution is to sum up the average among each group multiplied by the probability .

link https://arena.topcoder.com/#/u/practiceCode/15638/31722/12514/1/317232

i couldn't understand this problem solution okay i understand that he get the LIS in nlogn twice from both sides preprocess for the length of increasing subsequence till now then he makes a loop and calculate the min of LIS from both sides what i don't understand is how he guaranteed that the LIS max number will be smaller than ith element in the original array.

problem https://uva.onlinejudge.org/external/105/10534.pdf

solution https://github.com/Diusrex/UVA-Solutions/blob/master/10534%20Wavio%20Sequence.cpp

can anyone explain to me it's solution proof ?

Hello everyone i was solving a problem which wants the number of faces in a planar graph of N nodes E edges. it is solvable by euler formula but what is the proof of this formula this link has alot of helpful proofs but i could understand the 3rd proof if anyone intersting in understanding it please explain it to me.

thanks in advance :)

could anyone explai the problem to me and it is solution ? http://poj.org/problem?id=2096

http://codeforces.com/contest/157/problem/D

or anyone comment with a link of a tutorial.

any suggest to solve this problem using rmq(segment tree) http://codeforces.com/contest/71/problem/D

could any one please explain this problem solution to me

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/03/2023 23:18:04 (k1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|