Category: ACM

12
May
2017

Find Is It Armstrong Number or Not

code by me: #include<stdio.h> #include<math.h> int getTotalDigits(int); int isArmStrong(int,int); int getTotalDigits(int n) { int count=0; while(n>0) {…

12
May
2017

How to improve Algorithmic Thinking ?

https://www.quora.com/Im-not-good-with-algorithms-and-I-cant-figure-out-a-solution-until-someone-tells-me-How-can-I-fix-this

12
May
2017

Check The Number Is Prime Or Not in C, Easy and Details Explanation

Simple Logic For Finding Prime Number is primarility test is 2 to root of n..Source: Wikipedia The…

11
May
2017

String Secret Revealed in C

String Input Take Without any gets function just scanf is enough for taking any input withlout gets function #include<stdio.h>…

11
May
2017

Modulo in Details

We can easuly get a range of output value after mod: Code: for 100 here print from…

09
May
2017

Learn Modulo in Easy Way

One thing was confusion for me but after watching this tut it is clear to me now….