WA IN PRIME1
Why this code http://ideone.com/3puswp giving RTE for this question.. http://www.codechef.com/problems/PRIME1/I implemented using segmented seive.
View ArticlePaying Up, answer is wrong
All kinds of test cases are giving the right output but when i submit it , it always shows "wrong answer"can anyone tell me whats wrong??#include <algorithm> #include <iostream> #include...
View Articlemy code is compiled fine..but gives NZEC error please help
my code is compiled fine..but gives NZEC error please help
View ArticleCHSEQ22-Editorial
PROBLEM LINK:PracticeContestAuthor:Roman FurkoTester:Hiroto Sekido, Gerald AgapovEditorialist:Ajay K. VermaDIFFICULTY:Easy-MediumPREREQUISITES:Connected componentsPROBLEM:We are given an array of N...
View ArticleGood books on advanced data structures?
Please suggest me some good books on advanced data structures like segment trees and binary interval trees.Thank you.
View ArticleOnline Programming contest - Algorythmus 2014.
Synapse 2014 (Cultural Fest of DA-IICT) presents "Algorythmus 2014". It will be an ACM-ICPC style online programming contest.(1) Contest will be of 3 hours. There will be 5 problems of varying...
View ArticleNZEC error in java in FARASA
I am new to the concept of Fast Fourier Transformation. So I looked up at the codes of few very good coders like Ankit Shrivastava. In the solution of Ankit Shrivastava with solution link :...
View ArticleKINGSHIP - Editorial
PROBLEM LINK:PracticeContestAuthor:Shiplu HawladerTester:Tasnim Imran SunnyEditorialist:Lalit KunduDIFFICULTY:SIMPLE-EASY PREREQUISITES:Connected GraphTreePROBLEM:Connect all the N(<=10^5) cities to...
View ArticleHow to read a big XML file in JAVA and Spilt it into small XML files Based on...
Hi , I am new to JAVA programming and Parsers, now I in need of JAVA program to read a big XML file that containing .. tags. Sample input as follows. Input.xml <row>...
View ArticleSUBMIN-Editorial
PROBLEM LINK:PracticeContestAuthor:Lalit KunduTester:Hiroto Sekido, Gerald AgapovEditorialist:Ajay K. VermaDIFFICULTY:EasyPREREQUISITES:Ad-hoc, StackPROBLEM:Given an array A of size N, support the...
View ArticleCOTA - Editorial
PROBLEM LINK:PracticeContestAuthor:Shiplu HawladerTester:Tasnim Imran SunnyEditorialist:Lalit KunduDIFFICULTY:MEDIUM-HARD PREREQUISITES:GraphsDynamic ProgrammingMatchingShortest PathPROBLEM:There will...
View ArticleTWODOGS-Editorial
PROBLEM LINK:PracticeContestAuthor:A Surya KiranTester:Hiroto Sekido, Gerald AgapovEditorialist:Ajay K. VermaDIFFICULTY:EasyPREREQUISITES:Ad-hocPROBLEM:Given a list of integers A and an integer k, pick...
View Articlemarblegef DOUBT..
i did this problem http://www.codechef.com/problems/MARBLEGF using segmented tree concept..but i am getting tle...editorial say to use fenwick tree concept......But i came to know both fenwick tree and...
View ArticleLCPESY-Editorial
PROBLEM LINK:PracticeContestAuthor:ShipluTester:Hiroto Sekido, Gerald AgapovEditorialist:Ajay K. VermaDIFFICULTY:CAKEWALK PREREQUISITES:Ad-hocPROBLEM:Given two alphanumeric strings, find the number...
View ArticleLEMOVIE-Editorial
PROBLEM LINK:PracticeContestAuthor:VitaliyTester:Hiroto Sekido, Gerald AgapovEditorialist:Ajay K. VermaDIFFICULTY:Easy-MediumPREREQUISITES:Dynamic programming, CombinatoricsPROBLEM:Given an array A of...
View ArticleFIRESC, wrong answer
my solution is not working although it is working on the small size input . could someone tell my what is wrong ? I am using disjoint sets data structure.
View ArticleWHY TLE ???
Was trying to solve http://www.codechef.com/problems/KAN13C . but its giving TLE though it almost matches with the codes submitted with AC. eg-http://www.codechef.com/viewsolution/3104494. AND here is...
View ArticleWord Counting wrong answer
http://www.codechef.com/problems/WCOUNT/using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.Text; namespace WordCounting { class MainClass {...
View ArticleDRGHTS-Editorial
PROBLEM LINK:PracticeContestAuthor:Sergey NaginTester:Hiroto Sekido, Gerald AgapovEditorialist:Ajay K. VermaDIFFICULTY:EasyPREREQUISITES:Depth first traversalPROBLEM:Given a forest with N nodes, where...
View Article