please someone help me debug my problem
Hello codeforces , I am a beginner , and I started learning Dynamic programming a few days ago . I haven't learned any specific algorithm yet , but i wanna practice some DP problems , can anyone suggest some easy DP problems please ??
Hello everybody , I have tried a lot to solve the light oj 1087 — Diablo problem .
problem link : http://www.lightoj.com/volume_showproblem.php?problem=1087
My test sample output is not matching , I have tried a lot , I am a noob , please help me to debug my code . Why does it occur ??
my code : https://paste.ubuntu.com/26080511/
Please help me , Downvote ?? It's okay . But please help me ..................
Hello , I can't realize why the judge output is much strange !!! problem link : http://codeforces.com/contest/451/problem/B
my code : https://paste.ubuntu.com/25939858/
judge status : http://codeforces.com/contest/451/submission/32225322
in my compiler , answer is okay , but where is the problem ?? I have also tested in different online compilers also
I have tried a lot to solve the "milking cow" problem of USACO . But WA in test 7 . I don't know what is the problem , i have tried multiple approaches , but it still wrong in test 7 . can you please help me to find my bug please ????
my code : https://paste.ubuntu.com/25901070/
problem source : http://train.usaco.org/usacoprob2?a=pxSIvVnwAXn&S=milk2
please please please help me guys , I have tried my best .
Just one question , am I doing any kinds of segmentation violation ?? such as -> wrong ara indexing or accessing memory out of bounds etc etc ???
memory limit : 256 mb
Hello everybody , please help me , i was solving problems in light oj , "curious Robin Hood" and getting wrong answer. problem link : http://lightoj.com/volume_showproblem.php?problem=1112
code link : https://paste.ubuntu.com/25753376/
i am a beginner and i recently learned a bit about segment tree , i used segment tree in this solution , but i can't find my faults , can anyone please help me ?
I was solving problems in light online judge , and got "output Limit Exceeded" ! but I still don't know about it . Can you please tell me what does it mean ? and when it happens ? problem link :http://www.lightoj.com/volume_showproblem.php?problem=1212 my code : https://paste.ubuntu.com/25534441/
Hello everybody , how are you ? Today I am going to describe some contents (programming) Which can be helpful for contestants.
At first I assume that you all know about C/C++ language . But It doesn't matter . I think you also know about conditional logic , loop , datatype(input/output) , strings, array, function , basic bitwise operation etc . I think then you should learn lots of Mathematical terms such as :
Prime number , GCD , LCM , Eular's Totirnt Function , Bigmod , Modular inverse , Extended GCD , combinatorics, permutation , combination , inclusion exclusion principle ,probability , Expected value , Base conversation , Big integer , cycle , Gawssian elimination etc etc........
you have to learn about sorting and searching . like : Insertion sort , bubble sort , merge sort , selection sort , merge sort , county sort etc . NOTE : THERE IS A THING NAMED "qsort" function is C language.....don't use it . There is an algorithm named "anti-qsort" . If you use it in codeforces , anyone can easily hack your solution because anti-qsort algorithm generates worst case for qsort and in the worst case , it's time complexity will be O(n^2) . But you can use Standerd Template Library .
You have to learn Binary search , Backtraking , ternary search etc...
you have a task to learn lots of data structures . Such as : Linked list , Stack,Queue,heap , vector,graph,tree,segment tree , binary search tree , sqare root segmentation , disjoint set union , Lazy with proposition , lazy without proposition , Binary indexed tree , map , set , pair etc etc....
You haVe to learn greedy technique , Dyanamic programming , Graph algorithm , Flow , Adhoc , Geometry etc etc , I have summarized the contents bellow : 1. Dynamic Programming 2. Greedy 3 .Complete Search 4 . Flood Fill 5 . Shortest Path 6 . Recursive Search Techniques 7 . Minimum Spanning Tree 8 . Knapsack 9 . Computational Geometry 10 .Network Flow 11 . Eulerian Path 12 . Two-Dimensional Convex Hull 13 . BigNums 14 . Heuristic Search 15 . Approximate Search 16 . Ad Hoc Problems
If you clearup all those above , you will find a great programmer inside you , but mind it , It is not an easy tusk....You have to practice a lot . If you don't practice , you will never be able to be a good programmer .....!!!
SO , NO MORE TODAY ,,,, STAY WELL EVERYBODY,,,,ALWAYS TRY TO HELP OTHERS...HAPPY CODING !
Hello everybody . I have got some problems . In the last contest I solved a problem within 11 minutes . But someone hacked my submission . I still have no idea about hacking a submission . Please help me . How can I hack others' submission ? And how or why they can hack mine ? If there anyone who can help me ?????