#include<stdio.h>
int main()
{
int num, i, count = 0;
printf("nEnter a number :");
scanf("%d", &num);
for (i = 2; i <= num / 2; i++) {
if (num % i == 0) {
count++;
break;
}
}
if (count == 0)
printf("n%d is a prime number.", num);
else
printf("n%d is not a prime number.", num);
return 0;
}
Computer Science » C Program » Check Whether a Number is Perfect or Not Program : [php]#include<stdio.h> int main() { int num, i = 1, sum = 0; printf("nEnter a number : "); scanf("%d", &num); while (i < num) { if (num % i == 0) { sum = sum + i; } i++; } if (sum == num) printf("n%d is a perfect number.", i); else printf("n%d is not a perfect number.", i); return 0; }[/php] Output 1: [php]Enter a number : 6 6 is a perfect number.[/php] Output 2: [php]Enter a number : 5 is not a perfect number.[/php]
Computer Science » C Program » Check if Number is Odd or Even Program : [php]#include<stdio.h> int main() { int n; printf("nEnter a number : "); scanf("%d",&n); if ( n%2 == 0 ) printf("n%d is an even number.", n); else printf("n%d is an odd number.", n); return 0; }[/php] Output 1: [php]Enter an number : 122 122 is an even number.[/php] Output 2: [php]Enter an number : 123 123 is an odd number.[/php]
Computer Science » C Program » Check Whether a Number is Palindrome or Not Program : [php]#include <stdio.h> int main() { int n, reversedN = 0, remainder, originalN; printf("nEnter an integer : "); scanf("%d", &n); originalN = n; // reversed integer is stored in reversedN while (n != 0) { remainder = n % 10; reversedN = reversedN * 10 + remainder; n /= 10; } // palindrome if orignalN and reversedN are equal if (originalN == reversedN) printf("n%d is a palindrome.", originalN); else printf("n%d is not a palindrome.", originalN); return 0; }[/php] Output 1: [php]Enter an integer: 101 101 is a palindrome.[/php] Output 2: [php]Enter an integer: 102 102 is not a palindrome.[/php]
Computer Science » C Program » Check Whether a Number is Armstrong or Not Program : [php]#include<stdio.h> int main() { int num, temp, sum = 0, rem; printf("nEnter a number : "); scanf("%d", &num); temp = num; while (num != 0) { rem = num % 10; sum = sum + (rem * rem * rem); num = num / 10; } if (temp == sum) printf("n%d is a amstrong number.", temp); else printf("n%d is not a amstrong number", temp); return (0); }[/php] Output 1: [php]Enter a number : 153 153 is a amstrong number.[/php] Output 2: [php]Enter a number : 150 150 is not a amstrong number[/php]
Computer Science » C Program » Prime Number Pyramid Program : [php]#include<stdio.h> int prime(int num); int main() { int i, j; int num = 2; for (i = 0; i < 5; i++) { printf("n"); for (j = 0; j <= i; j++) { while (!prime(num)) { num++; } printf("%dt", num++); } } return (0); } int prime(int num) { int i, flag; for (i = 2; i < num; i++) { if (num % i != 0) flag = 1; else { flag = 0; break; } } if (flag == 1 || num == 2) return (1); else return (0); }[/php] Output : [php]2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 [/php]
Computer Science » C Program » Check Whether a Number is Perfect or Not Program : [php]#include<stdio.h> int main() { int num, i = 1, sum = 0; printf("nEnter a number : "); scanf("%d", &num); while (i < num) { if (num % i == 0) { sum = sum + i; } i++; } if (sum == num) printf("n%d is a perfect number.", i); else printf("n%d is not a perfect number.", i); return 0; }[/php] Output 1: [php]Enter a number : 6 6 is a perfect number.[/php] Output 2: [php]Enter a number : 5 is not a perfect number.[/php]