SPOJ-Solutions

SPOJ solutions by anmol_varshney

Suggestions are welcome. You can mail me at anmolvarshney695@gmail.com

Name		Name	Last commit message	Last commit date
Latest commit History 13 Commits
README.md		README.md
SPOJ ABCPATH.cpp		SPOJ ABCPATH.cpp
SPOJ ABSP1.cpp		SPOJ ABSP1.cpp
SPOJ ABSYS.cpp		SPOJ ABSYS.cpp
SPOJ ACMT.cpp		SPOJ ACMT.cpp
SPOJ ACODE (DP with a special requirement).cpp		SPOJ ACODE (DP with a special requirement).cpp
SPOJ ACPC10A.cpp		SPOJ ACPC10A.cpp
SPOJ ADDREV.cpp		SPOJ ADDREV.cpp
SPOJ AGGRCOW.cpp		SPOJ AGGRCOW.cpp
SPOJ AIBOHP.c		SPOJ AIBOHP.c
SPOJ ALIEN (Modified Kadane's Algorithm) ( Here if number of steps is same then we choose the one with the lesser sum ) ( Like SPOJ HOTELS ).cpp		SPOJ ALIEN (Modified Kadane's Algorithm) ( Here if number of steps is same then we choose the one with the lesser sum ) ( Like SPOJ HOTELS ).cpp
SPOJ ANARC09A (Check if the expression is balanced using Stack ( here it's variation is used )).cpp		SPOJ ANARC09A (Check if the expression is balanced using Stack ( here it's variation is used )).cpp
SPOJ AP2.cpp		SPOJ AP2.cpp
SPOJ ARRAYSUB ( Find the maximum for each and every contiguous subarray of size k ).cpp		SPOJ ARRAYSUB ( Find the maximum for each and every contiguous subarray of size k ).cpp
SPOJ ATOMS.cpp		SPOJ ATOMS.cpp
SPOJ BEENUMS.cpp		SPOJ BEENUMS.cpp
SPOJ BITMAP.cpp		SPOJ BITMAP.cpp
SPOJ BOMARBLE (Pentagonal Numbers).cpp		SPOJ BOMARBLE (Pentagonal Numbers).cpp
SPOJ BRCKTS.cpp		SPOJ BRCKTS.cpp
SPOJ BUGLIFE (Bipartite Graph - Read the Comments ).cpp		SPOJ BUGLIFE (Bipartite Graph - Read the Comments ).cpp
SPOJ BUSYMAN.cpp		SPOJ BUSYMAN.cpp
SPOJ BWIDOW.cpp		SPOJ BWIDOW.cpp
SPOJ BYTELANDIAN COINS.c		SPOJ BYTELANDIAN COINS.c
SPOJ CANDY.cpp		SPOJ CANDY.cpp
SPOJ CATM.cpp		SPOJ CATM.cpp
SPOJ CNTPRIME.cpp		SPOJ CNTPRIME.cpp
SPOJ CODERE2.cpp		SPOJ CODERE2.cpp
SPOJ CODFURY ( Same as SPOJ ALIEN ).cpp		SPOJ CODFURY ( Same as SPOJ ALIEN ).cpp
SPOJ COMDIV.cpp		SPOJ COMDIV.cpp
SPOJ COUNTISL ( DFS in 2D Matrix ).cpp		SPOJ COUNTISL ( DFS in 2D Matrix ).cpp
SPOJ CRDS.c		SPOJ CRDS.c
SPOJ CSTREET (MST).cpp		SPOJ CSTREET (MST).cpp
SPOJ D-query (Using MO's Algorithm).cpp		SPOJ D-query (Using MO's Algorithm).cpp
SPOJ DIEHARD.cpp		SPOJ DIEHARD.cpp
SPOJ DIVFACT.cpp		SPOJ DIVFACT.cpp
SPOJ EDIST.c		SPOJ EDIST.c
SPOJ EZDIJKST (using REP(i,a,b)).cpp		SPOJ EZDIJKST (using REP(i,a,b)).cpp
SPOJ EZDIJKST.cpp		SPOJ EZDIJKST.cpp
SPOJ FARIDA (DP).cpp		SPOJ FARIDA (DP).cpp
SPOJ FAVDICE (Read the Comments).cpp		SPOJ FAVDICE (Read the Comments).cpp
SPOJ FIBOSUM( Matrix Expo and for Fibonacci Series S(n)=F(n 2)-1 ).cpp		SPOJ FIBOSUM( Matrix Expo and for Fibonacci Series S(n)=F(n 2)-1 ).cpp
SPOJ GIRLSNBS.cpp		SPOJ GIRLSNBS.cpp
SPOJ GONE.cpp		SPOJ GONE.cpp
SPOJ GSS1.cpp		SPOJ GSS1.cpp
SPOJ GSS3.cpp		SPOJ GSS3.cpp
SPOJ HAYBALE.cpp		SPOJ HAYBALE.cpp
SPOJ HC.cpp		SPOJ HC.cpp
SPOJ HDEVIL.cpp		SPOJ HDEVIL.cpp
SPOJ HIGHWAYS.cpp		SPOJ HIGHWAYS.cpp
SPOJ HOMO.cpp		SPOJ HOMO.cpp
SPOJ HORRIBLE.cpp		SPOJ HORRIBLE.cpp
SPOJ HOTELS ( Variation of Kardane's Algorithm (Used to find Maximum Sum Subarray ) here modified for a maxsum ).cpp		SPOJ HOTELS ( Variation of Kardane's Algorithm (Used to find Maximum Sum Subarray ) here modified for a maxsum ).cpp
SPOJ HPYNOS.cpp		SPOJ HPYNOS.cpp
SPOJ IOIPALIN.c		SPOJ IOIPALIN.c
SPOJ IOIPALIN.cpp		SPOJ IOIPALIN.cpp
SPOJ KGSS (Query Differently).cpp		SPOJ KGSS (Query Differently).cpp
SPOJ KGSS - Simple Solution.cpp		SPOJ KGSS - Simple Solution.cpp
SPOJ KGSS.cpp		SPOJ KGSS.cpp
SPOJ KNAPSACK.cpp		SPOJ KNAPSACK.cpp
SPOJ LITE.cpp		SPOJ LITE.cpp
SPOJ LKS.cpp		SPOJ LKS.cpp
SPOJ LUCIFER.cpp		SPOJ LUCIFER.cpp
SPOJ MANGOES.cpp		SPOJ MANGOES.cpp
SPOJ MARBLES (Calculating Factorial the Maths Way).cpp		SPOJ MARBLES (Calculating Factorial the Maths Way).cpp
SPOJ MCOINS ( Game Theory - Read the Comments ).cpp		SPOJ MCOINS ( Game Theory - Read the Comments ).cpp
SPOJ MECGROUP.cpp		SPOJ MECGROUP.cpp
SPOJ MIRRORED ( As soon as Input String is two spaces break ( Check the code for implementation ) ).cpp		SPOJ MIRRORED ( As soon as Input String is two spaces break ( Check the code for implementation ) ).cpp
SPOJ MIXTURE DP O(n^3) [Only above diagonal elements required, values of rows and columns chosen smartly and all the values in between them considered].cpp		SPOJ MIXTURE DP O(n^3) [Only above diagonal elements required, values of rows and columns chosen smartly and all the values in between them considered].cpp
SPOJ MLK.cpp		SPOJ MLK.cpp
SPOJ MMAXPER.c		SPOJ MMAXPER.c
SPOJ MOHIB.cpp		SPOJ MOHIB.cpp
SPOJ NICEBTRE.cpp		SPOJ NICEBTRE.cpp
SPOJ NOVICE63 (DP).cpp		SPOJ NOVICE63 (DP).cpp
SPOJ NSTEPS.cpp		SPOJ NSTEPS.cpp
SPOJ OFORTUNE.cpp		SPOJ OFORTUNE.cpp
SPOJ OHANISER.cpp		SPOJ OHANISER.cpp
SPOJ ONEZERO (String Remainder Function there but not used).cpp		SPOJ ONEZERO (String Remainder Function there but not used).cpp
SPOJ ORDERSET (Segment Tree offline query) (Read the Comments).cpp		SPOJ ORDERSET (Segment Tree offline query) (Read the Comments).cpp
SPOJ ORDERSET(Using C++14 Features).cpp		SPOJ ORDERSET(Using C++14 Features).cpp
SPOJ PARTY SCHEDULE.cpp		SPOJ PARTY SCHEDULE.cpp
SPOJ PEBBLE.cpp		SPOJ PEBBLE.cpp
SPOJ POTHOLE.cpp		SPOJ POTHOLE.cpp
SPOJ PQUEUE ( Priority Queue and STL ).cpp		SPOJ PQUEUE ( Priority Queue and STL ).cpp
SPOJ PT07X - Vertex Cover.cpp		SPOJ PT07X - Vertex Cover.cpp
SPOJ PT07Y.cpp		SPOJ PT07Y.cpp
SPOJ PT07Z.cpp		SPOJ PT07Z.cpp
SPOJ QUEST5 (Count Overlapping Intervals).cpp		SPOJ QUEST5 (Count Overlapping Intervals).cpp
SPOJ RAONE (Digit DP).cpp		SPOJ RAONE (Digit DP).cpp
SPOJ RPLD.cpp		SPOJ RPLD.cpp
SPOJ RPLN ( Range Minimum Query ).cpp		SPOJ RPLN ( Range Minimum Query ).cpp
SPOJ SHPATH (Dijsktra).cpp		SPOJ SHPATH (Dijsktra).cpp
SPOJ THEATRE.cpp		SPOJ THEATRE.cpp
SPOJ TOANDFRO.cpp		SPOJ TOANDFRO.cpp
SPOJ TRVCOST.cpp		SPOJ TRVCOST.cpp
SPOJ UJ ( Using JAVA BigInteger ).java		SPOJ UJ ( Using JAVA BigInteger ).java
SPOJ UPDATEIT ( Done like CHOC on CODECHEF ).cpp		SPOJ UPDATEIT ( Done like CHOC on CODECHEF ).cpp
SPOJ UPDATEIT ( FAST IO Required for Segment Trees ).cpp		SPOJ UPDATEIT ( FAST IO Required for Segment Trees ).cpp
SPOJ WACHOVIA (KNAPSACK).cpp		SPOJ WACHOVIA (KNAPSACK).cpp
SPOJ WILLITST ( Check if Number is a power of 2 ).cpp		SPOJ WILLITST ( Check if Number is a power of 2 ).cpp
SPOJ WPC5D.cpp		SPOJ WPC5D.cpp

anmolvarshney05/SPOJ-Solutions

Folders and files

Latest commit

History