Abhishek Kusnoor | CommonLounge

Follow

Abhishek Kusnoor

Tutorials

Discussions

Comments

Follower

Course Completions

Active In

Competitive Programming

6 replies. 3 discussions. Member

International Olympiad in Informatics

Member

Sphere Online Judge (SPOJ)

Member

Machine Learning

Member

Indian Computing Olympiad (ICO)

Member

USA Computing Olympiad

Member

Artificial Intelligence

Member

Deep Learning

Member

Algorithms and Data Structures

Member

Thinkers and Dreamers

Member

Featured Contributions

NaN.

discussion

[LEADGAME] Lead Gameby Keshav Dhandhania

Problem statement clarification:

Now I get it, I was misinterpreting question all thi...

Read more…(49 words)

Category: Indian Computing Olympiad (ICO)

comment in this discussion

Abhishek Kusnoor3y

Hi! Where is the problem statement? Clicking on [LEADGAME] takes me to this discussion page.

Read more… (15 words)

NaN.

discussion

How to approach SPOJ problem AMR12A?by Abhishek Kusnoor

I am struggling to come up with something but I am not even close. Didn't find any clue online too. It seems like Bipartite Matching, but it would be great to have any hints, if it's a well known algorithm, few links with similar problems would be helpful. Thanks!

Read more…(49 words)

Category: Competitive Programming

comment in this discussion

Abhishek Kusnoor3y

Thanks a lot. I will refrain from clicking any hints for now. Time to learn flow!

Read more… (16 words)

4.

discussion

How to approach SPOJ problem AMR12A?

I am struggling to come up with something but I am not even close. Didn't find any clue online too. It seems like Bipartite Matching, but it would be great to have any hints, if it's a well known algorithm, few links with similar problems would be helpful. Thanks!

Read more…(49 words)

http://spoj.com/problems/AMR12A/

Category: Competitive Programming

NaN.

discussion

Help for uva 10739by Abhishek Kusnoor

This problem has really annoyed me. Its a simple dp, If I do not memoize it I am getting correct answer for the test cases. If I memoize, I am getting 1 greater than the actual answer for the last couple of test cases. Any help appreciated. There are several solutions to this problem already available. I do not want to refer those because first time I am so close. How can memoization change the answer. I am baffled. Thanks for your time.

This is my code with memoization:

#include<iostream>
using namespace std;
 
string a;
int n;
int dp[1005][1005];
 
int solve(int i, int j, int moves)
{
	if(i>=j)
		return dp[i][j] =  moves;

Read more…(89 words)

Category: Competitive Programming

comment in this discussion

Abhishek Kusnoor3y

Absolutely clear. Thanks a ton!

Read more… (5 words)

NaN.

discussion

Help for uva 10739by Abhishek Kusnoor

This problem has really annoyed me. Its a simple dp, If I do not memoize it I am getting correct answer for the test cases. If I memoize, I am getting 1 greater than the actual answer for the last couple of test cases. Any help appreciated. There are several solutions to this problem already available. I do not want to refer those because first time I am so close. How can memoization change the answer. I am baffled. Thanks for your time.

This is my code with memoization:

#include<iostream>
using namespace std;
 
string a;
int n;
int dp[1005][1005];
 
int solve(int i, int j, int moves)
{
	if(i>=j)
		return dp[i][j] =  moves;

Read more…(89 words)

Category: Competitive Programming

comment in this discussion

Abhishek Kusnoor3y

Please check o/p of the above recursion. I believe its correct. I can post my memoized version where answer for only the last couple test cases is differing in sometime.

Read more… (30 words)

NaN.

discussion

Help for uva 10739by Abhishek Kusnoor

This problem has really annoyed me. Its a simple dp, If I do not memoize it I am getting correct answer for the test cases. If I memoize, I am getting 1 greater than the actual answer for the last couple of test cases. Any help appreciated. There are several solutions to this problem already available. I do not want to refer those because first time I am so close. How can memoization change the answer. I am baffled. Thanks for your time.

This is my code with memoization:

#include<iostream>
using namespace std;
 
string a;
int n;
int dp[1005][1005];
 
int solve(int i, int j, int moves)
{
	if(i>=j)
		return dp[i][j] =  moves;

Read more…(89 words)

Category: Competitive Programming

comment in this discussion

Abhishek Kusnoor3y

Keshav, thanks for taking time to run the code. I find this very strange because if check out the exact same non memoized version which is giving the right outputs Online C++0x Compiler & Debugging Tool I only momized this and nothing else. Why do you think the answers differ? Also I am pretty sure I was getting wrong answer only for last couple of tests. I will probably check with the code I wrote once again if there are issues. Appreciate your help.

Read more… (84 words)

NaN.

discussion

Help for uva 10739by Abhishek Kusnoor

This problem has really annoyed me. Its a simple dp, If I do not memoize it I am getting correct answer for the test cases. If I memoize, I am getting 1 greater than the actual answer for the last couple of test cases. Any help appreciated. There are several solutions to this problem already available. I do not want to refer those because first time I am so close. How can memoization change the answer. I am baffled. Thanks for your time.

This is my code with memoization:

#include<iostream>
using namespace std;
 
string a;
int n;
int dp[1005][1005];
 
int solve(int i, int j, int moves)
{
	if(i>=j)
		return dp[i][j] =  moves;

Read more…(89 words)

Category: Competitive Programming

comment in this discussion

Abhishek Kusnoor3y

Thanks for the reply Keshav. I understand your point. Nevertheless, why is the memoization making a difference anyway. I just remove all dp[i][j] and keep it just recursive, it works for the sample cases at least. If I add dp[i][j], it makes a difference for the last couple test cases. This is what's confusing me a bit.

Read more… (57 words)

9.

discussion

Help for uva 10739

This problem has really annoyed me. Its a simple dp, If I do not memoize it I am getting correct answer for the test cases. If I memoize, I am getting 1 greater than the actual answer for the last couple of test cases. Any help appreciated. There are several solutions to this problem already available. I do not want to refer those because first time I am so close. How can memoization change the answer. I am baffled. Thanks for your time.

This is my code with memoization:

#include<iostream>
using namespace std;
 
string a;
int n;
int dp[1005][1005];
 
int solve(int i, int j, int moves)
{
	if(i>=j)
		return dp[i][j] =  moves;

Read more…(89 words)

UVa Online Judge

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1680

Category: Competitive Programming

NaN.

course

Competitive Programming: From Beginner to Expertby Keshav Dhandhania

Overview

This is a very comprehensive 94-part course on competitive programming. It gets you from knowing basic programming to being a yellow-red rated coder on Codeforces / CodeChef / TopCoder / etc.

Read more…(214 words)

Category: Competitive Programming

comment in this discussion

Abhishek Kusnoor3y

Thanks!

Read more… (1 word)

11.

discussion

Help for a hackerrank problem

I am trying to understand the editorial for this problem, Modifying sequences ( link ). I understood most part except, "Eliminate the negative values, then find longest increasing subsequence". Why do we need to "Eliminate negative values". Aren't they a part of the solution and shouldn't they be taken into consideration? Thanks for your time.

Read more…(55 words)

Category: Competitive Programming

Load More