C Programmer

A simple C program to display "Hello, World!" on the screen. Since, it's a very simple program, it is often used to illustrate the syntax of a programming language. Program to Display "Hello, World!" //Program written by Nimiya Joseph #include   <stdio.h> int  main () { printf ( "Hello, World!" );  // printf() displays the string inside quotation return   0 ; }

What is an Armstrong number? An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. This definition depends on the base b of the number system used, e.g., b  = 10 for the decimal system or b  = 2 for the binary system. (Read more about Armstrong number) For generating Armstrong number series we use the following algorithm. Algorithm A positive integer is called an Armstrong number of order n if abcd... = a n + b n + c n + d n + ...   In case of 3 digit Armstrong numbers the sum of cubes of the digits of the number will be equal to the actual number. Thus we can use a conditional statement to split a number, multiply, add and check with original number.   #include < stdio .h > #include < math .h > int main() { int low, high, i, temp1, temp2, remainder, n = 0, result = 0; printf("Enter two numbers(intervals): "); scanf("%d %d", &low, &high); pri...

This is a simple program. Here the technique used is to generate prime numbers from one lower limit to one upper limit using loop. For more details refer our previous program : C Program to Check Whether a Number is Prime or Not. //Program #include < stdio.h > int main() {     int low, high, i, flag;     printf("Enter two numbers(intervals): ");     scanf("%d %d", &low, &high);     printf("Prime numbers between %d and %d are: ", low, high);     while (low < high)     {         flag = 0;         for(i = 2; i <= low/2; ++i)         {             if(low % i == 0)             {             ...

What is an Armstrong number? An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. This definition depends on the base b of the number system used, e.g., b  = 10 for the decimal system or b  = 2 for the binary system. (Read more about Armstrong number) For generating Armstrong number series we use the following algorithm. Algorithm A positive integer is called an Armstrong number of order n if abcd... = a n + b n + c n + d n + ...   In case of 3 digit Armstrong numbers the sum of cubes of the digits of the number will be equal to the actual number. Thus we can use a conditional statement to split a number, multiply, add and check with original number.   #include < stdio .h > #include < math .h > int main() { int low, high, i, temp1, temp2, remainder, n = 0, result = 0; printf("Enter two numbers(intervals): "); scanf("%d %d", &low, &high); pri...

In this program we use if else if ladder mechanism. If an integer is equal to the reverse of it, then it is a palindrome.  Algorithm   In this program we divide the given number by 10 and take the reminder(This could be done by using % operator).  Arrange the reminders in order to get the reverse of original number. Check whether original number is equal to  the reverse of it.   //Program   #include int main () { int n , reversedInteger = 0 , remainder , originalInteger ; printf ( "Enter an integer: " ); scanf ( "%d" , & n ); originalInteger = n ; // reversed integer is stored in variable while ( n != 0 ) { remainder = n % 10 ; reversedInteger = reversedInteger * 10 + remainder ; n /= 10 ; } // palindrome if orignalInteger and reversedInteger are equal if ( originalInteger == reversedInteger ) printf ( "%d is a palindrome." , ...

It is easy to find the power of any number in calculator. For doing the same in a C program needs  an algorithm.    Algorithm   Identify the base number -> Identify the exponent -> find power. This can be illustrated with an example of 2 3 .  Here Base is '2'; exponent is '3' and the power is 2*2*2 = 8.   #include int main () { int base , exponent ; long result = 1 ; printf ( "Enter a base number: " ); scanf ( "%d" , & base ); printf ( "Enter an exponent: " ); scanf ( "%d" , & exponent ); while ( exponent != 0 ) { result *= base ; -- exponent ; } printf ( "Answer = %ld" , result ); return 0 ; }

The Output look like this 1 2 3 4 5 6 7 8 9 10 //Lets start the program #include<stdio.h> #include<conio.h> void main() { int j,k,b=31,c; clrscr(); for(c=9;c>=1;c=c-1,b=b+1)    {printf("\n");     for(j=1;j<=b;j++)     printf(" ");     for(k=1;k<=c;k++)     printf("%d ",c);     }     getch();     } Lets Start Next Program. The Out Will look like this.                                                    1                            ...