Restriction on submissions per minute
I know that the restriction of 1 submission per 30 seconds is put because people submit a lot of codes continuously. But i think that it is only for challenge problem.Then why is this restriction put...
View Articlebytelandian gold
import java.io.BufferedReader; import java.io.InputStreamReader; class test { public static long coin(long n) { if((coin(n/4)+coin(n/3)+coin(n/2))>n) { return coin(n/4)+coin(n/3)+coin(n/2); } else {...
View Articlethreaded binary tree and morris traversal
can anyone explain me threaded binary tree and how we can do inorder traversal with the help of this.(an example will we useful) thanks in advance reply soon please
View ArticleSorting strings in C
I was trying to sort c-strings using qsort(). Below is the comp function.> int comp(const void *a,const void *b) > {const char **ia=(const char **)a; > const char **ib=(const char **)b; >...
View ArticleCOUPON - Editorial
Author: Vamsi Kavala Tester: Roman Rubanenko Editorialist: Bruno OliveiraPROBLEM LINKSPracticeContestDIFFICULTYSimplePRE-REQUISITESSimple Math, Dynamic ProgrammingProblem:You are shopping to buy N...
View Articleprime1 medium
import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayList; class test { static ArrayList<Integer> a = new ArrayList<Integer>(); public static boolean...
View Articlei managed to learn c. now what should be my next step?
i am a beginner. i have finished learning c. what should be my next step??
View Articlediscrete mathematics
want to know good courses on discrete mathematics on coursera or udacity or nptel and also suggest a good book as it is also very necessary
View ArticleHow to find my friend ?
How Do I find my college mates in Codechef ? Is there any direct means to find members by college name...?
View ArticleMountain Holidays Problem statement not clear
Can someone please explain me the problem statement of mountain holidays. In the problem it states "Two climbs, say i1 to j1 and i2 to j2, are different if and only if (j1 – i1 != j2 – i2) or...
View Articlemalloc vs std::vector
please could anyone tell me is malloc a better way of declaring a variable 2d array or std::vector(i mean to ask which ones faster ?)
View ArticleHow to create a Method that would return indices of an element in some 2D...
I am trying to generate a function find_indices(int num) in java which when called with a certain parameter would check the presence of that parameter in a 2D array say K,and would return its indices...
View Articleknp algorithm
algorithm kmp_table: input: an array of characters, W (the word to be analyzed) an array of integers, T (the table to be filled) output: nothing (but during operation, it populates the table)define...
View Articleprime number : Sieve of Eratosthenes
import java.io.BufferedReader; import java.io.InputStreamReader;class test4 {public static void main(String[] args)throws Exception { BufferedReader br = new BufferedReader(new...
View ArticleC tutorials
Hello, I have a reasonably knowledge regarding java and I would like to learn the C language, it's just curiosity and I want to have a better understanding of the lower level languages (comparing to...
View ArticleGenerating test cases
How to generate good test cases such that all the cases like corner cases or any hidden case can be covered in that.And how any online judge generate test cases both for straight forward and challenge...
View ArticleIOI 2013 grader and/or test data
Does anyone know of a place (a grader) where I can submit a solution to a problem of IOI 2013 online. Can I get the test data somewhere on the net? I want to check my solution to a problem.
View Articleprime no. generation
please anyone provide me with fastest code for generating prime no.
View ArticleRanking of Lunch Time
Is there any rank list and rating list of lunch time to be declared? If yes, when???
View Articlewhats wrong with dis code? the problem is internet media types...........the...
n,q=map(int,input().split()) d=dict() for i in range(n): s1,s2=map(str,input().split()) d[s1]=s2 for j in range(q): s3=input();k=len(s3) if '.' in s3: j=s3[::-1].index('.') i=k-j-1 value=s3[i+1:] if...
View Article