Matheletics is a mathematical contest (inspired from PROJECT EULER) where a sound knowledge of mathematics together with computational thinking will be essential to solve problems.

The motivation behind Matheletics is to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational context.

Prizes worth ₹ 65000 on stake and Hackerrank goodies and T-shirts for top performers.

It's a 5 hour long individual contest hosted at HackerRank. Sign up for the event on HackerRank For registration, You must be registered on hackerrank.com.

Check event time in your time zone.

Registration on Technex website is necessary to be eligible for prizes.

For regular updates,join the facebook event page

getting WA constantlyy.....

165C - Another Problem on Strings

i've now tried every way to get the correct answer to ths prob...

initialy ws getting TLE thn i optimized my code...

pre is the vector holding number of 1's encountered till i...

memo is counting the ferquency of ths number of 1's...

my code is here...

1824256

plz help...or suggest smthng i shud keep in mind further...

thanx

the following code is my soln to 38E - Let's Go Rolling!

i m using memoization in table

k is the index of last index to be pinned

and

in is the value of index for which decision will be made

the submission can be found here.. http://www.codeforces.com/contest/38/submission/1811242

plz help...optimizing my code or any general useful suggestions regarding implementation of dp..

thanx..

i am pretty new to programming techniques... i wish two know more on the usage of "two pointers" for solving programming probs.... links to useful ques. and tutorials would be really useful...

thnx in advance.. :)

hello....can sm1 plz help me find a problem..

*it involved printing of only consonants(and not vowels) preceded by a dot(.) from inputted string...

*another problem that involved seperating a given sequence into two AP's..

thank you...

hello frns.... i am new here.. can sm1 help me how to see wat is the test case that my code fails... i mean if my prob fila on some test #6(say) then how do i see wat iz the test case...

thnks....