Lightoj problem 1189 sum of factorials

Read the problem several times to understand the input constraints present. By observing deeply we can know for sure that, given the input size if small (the largest factorial we...

Lightoj problem 1069 Lift solution

Problem source: LightOJ Problem no: 1069-Lift This is not a tough problem, just slightly tricky. I’ve commented out some error prone codes to demonstrate the tricky section. I suggest you...

cpp program to count digits

Often programmers are faced with the task of counting digits for a number with some special phenomena. Like, how many digit’s there for the factorial of a number n in...

Lightoj 1001 Opposite task problem solution

##Solution for the LightOJ problem 1001: “Opposite Task” Here, I’m giving the solve of LightOJ prob. 1001. Please, try hard first before checking the solution and try to come up...

Fundamental Concepts In Programming

Here, I’m giving notes on some of the fundamental concepts common in every programming languages. These are common for a reason, every programming problem you’ll face in your life needs...