mynk322.0's blog

By mynk322.0, history, 7 weeks ago,

Hello Everyone!

I would like to invite you to participate in an upcoming HackerEarth contest — Data Structures and Algorithms Coding Contest. An exciting contest short contest that will start on August 08, 04:00 UTC and will run for 1 hour 30 minutes.

This time, the problems are prepared by me mynk322.0 Mayank Padia, SickMyDuck Roman Derkach, anay_07 Anay Loya. Thanks to Arpa(AmirReza PoorAkhavan) for testing the problems and being the contest coordinator.

The contest is rated!

Happy Coding!

• +32

 » 7 weeks ago, # |   +1 Peldia bro sab denge tera contest.
 » 7 weeks ago, # |   +11 I don't think the function given in the 3rd problem is correct. Can the problem setter check it once?
•  » » 7 weeks ago, # ^ |   0 From weak testcases to wrong problem statements, Hackerearth never fails to disappoint.
 » 7 weeks ago, # |   0 how to do 3rd problem , I solve sample test by my own in paper, even then it does not match the expected output. my code seems correct to me.
 » 7 weeks ago, # | ← Rev. 2 →   +1 In 3rd problem- The output of a function:The pseudocode given in the problem statement is wrong. If we try switching i & j, then the correct output comes. Pretty Low hackerearth standards. Correct pseudo codedef f(p,q,r): ans=0 for(int i=0;i<=p;i++) { temp = 0 for(int j=1;j<=q;j++) { ta = pow(r,j); // where pow() is the power function tb = (ta-1)/ta temp + = pow(tb,i); } temp2 = fact(p)/(fact(p-i)*fact(i)) // where fact() is the factorial function if(i&1) ans-=temp*temp2; else ans+=temp*temp2; } return ans 
•  » » 7 weeks ago, # ^ |   +6 Yes. You are right. I remember that I found this issue in the statement and fixed it. But I don't know what happened next. I'm sorry and I'll try next time to check statements more carefully. Thanks for your bug report.