Place - Bangalore
Learn number theory. Got many interesting resources to learn advanced data structures including heavy light decomposition. Today's plan is to implement maxflow algorithm and solve at-least one problem.
Maxflow is one cool concept and it's application are many.
Today I need solve at-least one srm and I haven solved the srm 300 div21000 pts.
Starting my day with srm 300 div21000 pts.
Cool blog http://praveendhinwacoding.blogspot.in/2013/06/700-problems-to-understand-you-complete.html
Consist of complete reference to learn segment tree, BIT, and also dp.
Need to solve 3-4 dp problem today. Brush up old concept and implement it.
My new-year resolution start using git-up and upload the implemented algorithm :).
Wishing everyone in the world a happy new-year.
Many of us know have to traverse array in anticlockwise manner but I wanted to share this neat code, come in handy for many cases.
Let n denote number of element in the array. startedpos denotes the starting index of the number.
Learn number theory. Got many interesting resources to learn advanced data structures including heavy light decomposition. Today's plan is to implement maxflow algorithm and solve at-least one problem.
Maxflow is one cool concept and it's application are many.
Today I need solve at-least one srm and I haven solved the srm 300 div21000 pts.
Starting my day with srm 300 div21000 pts.
Cool blog http://praveendhinwacoding.blogspot.in/2013/06/700-problems-to-understand-you-complete.html
Consist of complete reference to learn segment tree, BIT, and also dp.
Need to solve 3-4 dp problem today. Brush up old concept and implement it.
My new-year resolution start using git-up and upload the implemented algorithm :).
Wishing everyone in the world a happy new-year.
Many of us know have to traverse array in anticlockwise manner but I wanted to share this neat code, come in handy for many cases.
Let n denote number of element in the array. startedpos denotes the starting index of the number.
for(int i=(startedpos+n-1)%n ; i!=startedpos; i=(i+n-1)%n);
No comments:
Post a Comment