Quantcast
Browsing all 40121 articles
Browse latest View live

WHY my solution is giving wa for DIGJUMP where ive tried all the test cases

please help i am fed up please can you provide a test casee`include<iostream>include<cstdio>include<map>using namespace std; int mat[10][10]; map<int,int>m; void update(int a){...

View Article


MKSQR please suggest the logic?

http://www.codechef.com/problems/MKSQR i am not getting d logic to solve this question. I thought it has something to do with linear independence of vectors but i guess i am wrong, i need only a slight...

View Article


Want to break the barrier ...

i m participating in long events of codechef from last 5 months . my best efforts could make only 4-5 questions..i want to break this 4-5 question barrier and wanna solve more than this...any...

View Article

wrong ans in DIGIT JUMP

Why this code (http://ideone.com/p0KN5v)is giving wrong ans.Can someone give a test case which fails this solution??

View Article

Get bit value from a char array.

Hi guys, I'm trying to activate the lock bit of an Ultra Light nfc card. It has the following structure. there are 16 pages. 1 page contains 4 bytes. Lock bytes are available in the 2nd page 3rd byte...

View Article


Image may be NSFW.
Clik here to view.

College wise ranking on contest page

Hello friends, As everyone might be knowing already about Codechef college wise ranking website present on www.okrdx.com. Here is it's Chrome plugin, now you can just see ranks without going anywhere...

View Article

Why people take services from seo consultants india and which type of...

Why people take services from seo consultants india and which type of benefits they provide?

View Article

Spoj VPARTY .. hint

I have been trying to solve this question for quite some time now. I have realised we cannot use maximum flow here (I could be wrong). Can some please point to me towards an approach for this...

View Article


MAXPR .. PLZ HELP

plz help me in solving this question ...http://www.codechef.com/JUNE14/problems/MAXPRi need clarification .... !! for example if the series is 1 2 3 then the AP sequences are 1 2 3 1 2 2 3 1 3 1 2 3 so...

View Article


TLE in MAXPR

Why is the following solution giving TLE? http://www.codechef.com/viewsolution/4032512

View Article

Forgot password. Kindly help

i have tried all possible test cases....... plz check from my submissions...n REPLY @admin

View Article

WA in NAME2

#include<iostream> #include<algorithm> using namespace std; class test{ public: string f,l; }; bool ispresent( char ch , string &k ) { for(int i=0;i<k.size();i++) { if(k.at(i)==ch)...

View Article

ways of graph

In how many ways we can make a graph? please mention all of them.

View Article


DIVIDING - Editorial

PROBLEM LINK:PracticeContestAuthor:Konstantin SokolTester:Gerald AgapovEditorialist:Tasnim Imran SunnyDIFFICULTY:CakewalkPREREQUISITES:Simple MathPROBLEM:Given a list of N integers check if their sum...

View Article

Header files included in bits/stdc++.h

I recently came across bits/stdc++.h . However, it turns out that it isn't there on OSX. Can someone please share the contents of the file with me, so that I can add this header file manually?

View Article


getting wrong answer

#include<stdio.h> int main(){ int n,c,t,k,a[100]; long unsigned int candy; for(scanf("%d",&t);t>0;t--){ scanf("%d%d",&n,&candy); for(k=0,c=0;k<n;k++) {scanf("%d",&a[k]);...

View Article

what is wrong in my code...? it is working without any error in my machine.

include<iostream>using namespace std;int main() { int n,t=1,pos=1; cin>>n; int A[n+1];int P[n+1]; int C[n+1];int B[n+1]; for(int i=1;i<=n;i++) {cin>>A[i]; C[i]=0;P[i]=0; }for(int...

View Article


why WA in digjump

why my code is giving WA in digjump here is my code http://www.ideone.com/rcZw8e plz help i need to know the fault i ve tried the test cases which were randomly generated and all others given in the...

View Article

can't get rid of SIGSEGV error in this code,please help

#include<iostream> using namespace std; int c[50],a[100][100]; int main() { int z=0,k=0,t,n,i,j; cin>>t; while(z<t) { cin>>n; for(i=0;i<n;++i) for(j=0;j<=i;++j) {...

View Article

getting WA in Maxim and Progressions (June Challenge 2014 )

Question Maxim and Progressions Can you tell me whats wrong with my solution I am applying the same logic as given in editorial but i am having problem in applying modulus operator. in my fast...

View Article
Browsing all 40121 articles
Browse latest View live


<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>