Here's the thing, I messed up my ZCO and is getting 0.
ZIO is my last shot as I am in 12th, and when I sat down to solve ZIO qpaper 2013, I was stumped by the very first question.
So, how do you come to an algorithm for problems in ...
Thanks!
In same situation bro!
Contest Page
Yesterday night I went to the nearby cyber cafe to attend the first programming contest of my life. But I had to complete ...
Same happened to me! Haha
Hey Guys! I just wanna ask that how programmers manage school, coding and health when preparing of IOI(especially) in their 11 and 12 grades.
I am asking this question that I am also suffering f...
What we really mean is the system under which the pure sense of school has been disappeared.
Hey guys,
I was just trying to implement Longest Increasing Subsequence through recursion. I implemented it and test it on Contest Page. But it's giving me WA.
I know how to implement it through DP. Please don't give links for GOG or others. Just let me know what's wrong with my recursion.
Code -
#include <bits/stdc++.h> using namespace std; int n; int lis(int a[], int i, int last){ if(i == n-1){ if(a[i] > last){ return 1; } else { return 0;
#include <bits/stdc++.h>
using namespace std;
int n;
int lis(int a[], int i, int last){
if(i == n-1){
if(a[i] > last){
return 1;
} else {
return 0;
Hey Guys,
I coded according to the editorial only but getting WA in subtask 2 and 3, Can anyone tell me why?
Here are the links -
Problem - Contest Page
Editorial - CodeChef Discuss
My code - Solution: 15414836
Thanks! :)
Kulesh – How to prepare for ZCO?
Keshav – Firstly, you need to know about some algorithms such as – quicksort, merge sort, etc. Then you should go for solv...
No. In 12th.
Yeah
Yeah. I will reply whenever I am free!