### XMORE's blog

By XMORE, history, 2 weeks ago, ,

•
• -8
•

By XMORE, history, 3 weeks ago, ,

By XMORE, history, 3 weeks ago, ,

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

By XMORE, history, 3 weeks ago, ,

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

•
• -21
•

By XMORE, history, 4 weeks ago, ,

why the solution to this problem is getting the max distance between two points and if itsmaller than or equal 2*r so its ok else the answer is no
why this solution is wrong
problem https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=946

By XMORE, history, 4 weeks ago, ,

Could anyone explain to me why this solution for this problem is true problem http://codeforces.com/contest/313/problem/E Solution http://codeforces.com/contest/313/submission/9096673

•
• +5
•

By XMORE, history, 5 weeks ago, ,

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

By XMORE, history, 6 weeks ago, ,

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

•
• -13
•

By XMORE, history, 6 weeks ago, ,

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

By XMORE, history, 7 weeks ago, ,

http://codeforces.com/contest/69/problem/D i couldn't understand how in the second test case the second player wins !!

By XMORE, history, 2 months ago, ,

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

By XMORE, history, 2 months ago, ,

What is the complexity of dijkstra algorithm but without the vis array and without checking for dist array code https://ideone.com/VTaE03

By XMORE, history, 3 months ago, ,

Why at the input sample the answer for 4 100 7 is no problem link http://codeforces.com/contest/94/problem/D

By XMORE, history, 3 months ago, ,

•
• -7
•

By XMORE, history, 3 months ago, ,

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

•
• -3
•

By XMORE, history, 3 months ago, ,

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.

•
• +8
•

By XMORE, history, 4 months ago, ,

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 .

•
• +5
•

By XMORE, history, 4 months ago, ,

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.

By XMORE, history, 4 months ago, ,

can anyone explain to me it's solution proof ?

By XMORE, history, 5 months ago, ,

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.

•
• -9
•

By XMORE, history, 5 months ago, ,

Hello everyone

i want to ask if i couldnt solve a problem at all and couldnt understand its editorial or its solutions and i dont have coach to explain it to me what should i do ? :(

•
• -21
•

By XMORE, history, 5 months ago, ,

•
• -9
•

By XMORE, history, 6 months ago, ,

can anyone help me solve this problem ? https://uva.onlinejudge.org/external/102/10218.pdf we can distribute the candles in groups or not ?

•
• -18
•

By XMORE, history, 6 months ago, ,

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

•
• -5
•

By XMORE, history, 6 months ago, ,

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

or anyone comment with a link of a tutorial.