could anyone explain to me this approach http://codeforces.com/contest/280/submission/5767471 to solve this problem

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

1 | Petr | 3353 |

2 | fateice | 3306 |

3 | Syloviaely | 3274 |

4 | tourist | 3235 |

5 | OO0OOO00O0OOO0O0…O | 3181 |

6 | Um_nik | 3158 |

7 | V--o_o--V | 3148 |

8 | dotorya | 3145 |

9 | LHiC | 3115 |

10 | mnbvmar | 3096 |

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

1 | tourist | 178 |

2 | rng_58 | 168 |

3 | Petr | 158 |

4 | csacademy | 157 |

5 | lewin | 150 |

5 | Swistakk | 150 |

7 | Errichto | 140 |

8 | ko_osaga | 139 |

8 | matthew99 | 139 |

10 | adamant | 138 |

where is the editorial for this contest ? http://codeforces.com/gym/100200/attachments

Why at this testcase {"..58..", "..47.."} at this problem the output is zero the grid can be for example be 2 1 5 8 7 6

3 4 4 7 9 2 and there are many other ways

the problem https://arena.topcoder.com/#/u/practiceCode/14604/17047/11482/1/309521

why this solution is wrong

problem https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=946

Hi the problem https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2259 this solution to this problem is AC https://github.com/Diusrex/UVA-Solutions/blob/master/11284%20Shopping%20Trip.cpp

and this solution is AC too https://github.com/BRAINOOO/CompetitiveProgramming/blob/master/UVA/V-112/UVA%2011284.Cpp

But for this test case the 2 codes results in different result so there is some thing wrong with the problem ?

1

3 3 0 1 1 1 2 2 1 3 20 3 1 7 2 9 3 1

for this problem why at the first test case it can't be EP = 25 http://www.spoj.com/problems/ICPCS/

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

hello everyone :)

if anyone from any country wants to join me in training targeting ACM ICPC, during the training everyone will solve alone but we may share ideas on different problems entering contests together discuss some topics, the target of this is when you work with someone this influence your spirit and create a competitive environment leads you to work harder, it isn't about helping each other technically in problems .

anyone from any country wants just comment :) have a nice day.

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.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/25/2018 02:04:27 (d1).

Desktop version, switch to mobile version.

User lists

Name |
---|