fastest implementation of segment tree
Someone please post or suggest some link to what could be the fastest implementation of simple range minimum query segment tree in C/C++ ?
View Articleinbuilt functions
does codechef not support inbuilt functions like ltoa? i got a warning for that.
View ArticleONP i think my logic is correct.... bt not gettng submittd.....need help
#include<iostream> using namespace std; void push(char ch); char pop(); int top=-1; char infix[400]; char postfix[400],stack[400]; int p=-1; int priority(char symbol); int main() { int t;...
View ArticleC concepts
Hi, Can anybody tell me what is the advantage of using the below C concepts in embeddded systems (application wise) 1. pointers 2. Function pointers 3. structure 4. union 5. structure pointer 6....
View ArticleA small doubt in Binary indexed tree
Given an array, 1-D, how e have to kake the corresponding BIT for that? ex. if the array is 10 8 5 9 1 what will the BIT for this?
View ArticleICPC Practice Contest by IIIT-H Programming Club
IIIT-H Programming Club presentsICPC Practice Contest 3 (Onsite prelims)Starts at 11th Dec 05:00 PM - 10:00 PM (5 hrs)Register at http://felicity.iiit.ac.in/domjudge/Please note that people who had...
View Articlesegment tree with lazy update problem?
Hi, I am getting tle on this problem in UVA, http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2397 .. Here is my solution. I used segment tree...
View Articleadvantage of using assert in program
i want to know that some programmer use assert in their program , is there any advantage of using assert while running the program on judge where all the constraints are defined and are guaranteed that...
View ArticleBIT ALGORITHM
if anyone can please explain Binary Indexed Tree algorithm because i've read Top Coder tutorial and didnt get it i think it was somehow hard ! if someone can give a detailed explanation . Thanks
View ArticleLOWSUM - Editorial
PROBLEM LINK:PracticeContestAuthor:Vineet PaliwalTester:Roman RubanenkoEditorialist:Jingbo ShangDIFFICULTY:EASYPREREQUISITES:Sort, Priority Queue, Binary SearchPROBLEM:Given two arrays A[1..K],...
View ArticleFacebook Interviewstreet Sample Question
I have been trying to work on the sample problem on Facebook's Interviewstreet page for quite a while. Here is the problem:-An Arithmetic Progression is defined as one in which there is a constant...
View ArticleCodechef Shirt
I heard that the top five contributers in Codechef Discuss get a t-shirt. How do these shirts look like? @kunal361,@kuruma?
View Articlecode is not getting submitted
When I press the submit button, it doesn't give any verdict.
View ArticleTime complexity of CUBE
@admin is the time limit too tight for the problem.My O(n^4) is getting a TLE.
View ArticleWhy I'm getting runtime error?
include <iostream>using namespace std;int factorial (int temp);int main() { int n,t; long long int q; cin>>t; while(t--) { cin>>n; for(int i=0;i<n;i++) cin="">>q; int...
View Articlebug on december challange
when i am on the december challange problems page:site said: "You are not authorized to access this page." but i am authorized? what is problem?
View ArticleGRAVEL : codechef problem
What is the difference between following two codes?? One gives WA bt other gives AC.. took so many wa's? just the diff. of cout and printf();...
View ArticleConfusion regarding grading.
In December contest I got a tick mark but the time limit is 1 sec and my time shows 1.14 secs.I am confused regarding will I be graded for this?
View ArticleConfusion over scanf and getchar()
Well I was solving Buy1-Get1 from the practice problems(easy) and came across something strangeMy code would get accepted if i took the string input as follows and then did the neccessary...
View Article