Prob 1

#include<stdio.h>
int main()
{
int n, i = 1, fact = 1;
scanf("%d", &n);
while(i <= n){
fact = fact*i;
i++;}

printf("Factorial = %d ", fact);

}

Prob 2
#include<stdio.h>
int main()
{
int i = 1, sume = 0, sumo = 0, n;
scanf("%d", &n);
while (i <= n){
int p;
scanf("%d", &p);
if (p%2 == 0){
sume = sume + p;

} else {
sumo = sumo + p;
}
i++;
}
printf("Sum of even: %d\n", sume);
printf("Sum of odd: %d", sumo);
}

Prob 3

#include<stdio.h>
int main()
{
int n, rev = 0, i;
scanf("%d", &n);
i = n;
while(n != 0){
 int last = n%10;
rev = rev*10 + last;
n = n/10;

}
printf("Reverse: %d \n", rev);
if(i == rev){
printf("Palindromic");
} else{
printf("Not palindromic");
}
}

Prob 4

#include<stdio.h>
int main()
{
int n, i = 1, count = 0;
scanf("%d", &n);
while (i <= n){
if(n%i == 0){
printf("%d ", i);
count++;
}
i++;
}
if(count <= 2){
printf("\nPrime");
} else {
printf("\nNot prime");
}

Prob 5 (Take n integers and print the sum of prime numbers)

#include<stdio.h>
int main()
{
int n, i = 1, sum = 0;
scanf("%d", &n);
while (i <= n){
int p;
scanf("%d", &p);
int count = 0;
 for (int m = 1; m <= p; m++){
if(p%m == 0){
count++;
}
}
if(count == 2){
sum = sum + p;
}
i++;

}
printf("%d", sum);
}

#include<stdio.h>
int main()
{
/// 1 -2 +3 -4......
int term, i = 1, sum = 1, ab = 1;
scanf("%d", term);
while(i <= term){
printf("%d", i);
i =
}

Binary to decimal pow(2, i) = 2i

Print all the prime numbers up to 100
****
****
****
****

Take n integers as input. Then print sum of the prime numbers.

#include<stdio.h>

int main()
{
int n, i = 1, count = 0, sum = 0;
scanf("%d", &n);
while (i <= n){
int p;
scanf("%d", &p);
for (int m = 1; m <= p; m++){
if(p%m == 0){
count++;
}
}
if(count <= 2){
sum = sum + p;
}
i++;

}
printf("%d", sum);
}

Take a binary number as input. Then convert it into decimal and

print.

#include<stdio.h>
int main(){
int n, term, rest, mult = 1, sum = 0;
scanf("%d", &n);
rest = n;
while(rest > 0){
term = rest%10;
sum = sum + (mult * term);
mult = mult * 2;
rest = rest/10;
}
printf("Decimal: %d", sum);
}

Take an integer n. Then print all the prime numbers between 1 to

n. Then print count of the prime numbers.

#include<stdio.h>
int main()
{
int n, i = 1, prime = 0;
scanf("%d", &n);
printf("The prime numbers between 1 to %d: ", n);
while (i <= n){
int j = 1, count = 0;
while(j <= i){
if(i%j == 0){
count++;
}
j++;
}
if(count == 2){
printf("%d ", i);
prime++;}
i++;
}
printf("\nTotal prime number: %d", prime);

Take two integers n and p. Then print np.

#include <stdio.h>
int main(){
int n, p, i = 1, po = 1;
scanf("%d%d", &n, &p);
while(i <= p){
po = po * n;
i++;
} printf("%d to the power of %d = %d ", n, p, po);
}

Print the sum of the series 1^1 + 2^2 + 3^3 +……+ n^n

#include <stdio.h>
int main(){
int n, i = 1, sum = 0;
scanf("%d", &n);
while(i <= n){
int j, k = 1, po = 1;
while(k <= i){
po = po * i;
k++;

 } if(i < n){
printf("%d^%d +", i, k-1);} else if(i == n){
printf("%d^%d", i, k-1);
}
j = po;
sum = sum + j;
i++;
} printf("\nSum = %d", sum);
}

Print the sum of the series: 1.2 + 2.3 + 3.4 +……+ n.(n+1)

#include <stdio.h>
int main(){
int n, i = 1, sum = 0;
scanf("%d", &n);
while(i <= n){
int j;
j = i + 1;
sum = sum + i*j;
if(i == n){
printf("%d.%d", i, j);
} else{printf("%d.%d + ", i, j);}
i++;
} printf("\nSum: %d", sum);
}

Print the sum of all digits of a number.

#include <stdio.h>
int main(){
int n, sum = 0, term, rest;
scanf("%d", &n);
rest = n;
while(rest > 0){
term = rest%10;
sum = sum + term;
rest = rest/10;
}
printf("Sum: %d", sum);
}
 *
***
*****
*******
*********

#include <stdio.h>
int main(){
int n, i = 1, st = 1;
scanf("%d", &n);
while(i <= n){
int sp;
sp = n - st;
while(sp > 0){
printf(" ");
sp--;
}
int j = 1;
while(j <= i){
printf("*");
int p = j - 1;
if(j == i){
while(p > 0){
printf("*");
p--;
}}
j++;
}
printf("\n");
i++; st++;
}
}

1
121
12321
1234321
123454321

#include <stdio.h>
int main(){
int n, i = 1, st = 1;
scanf("%d", &n);
while(i <= n){
int sp;
 sp = n - st;
while(sp > 0){
printf(" ");
sp--;
}
int j = 1;
while(j <= i){
printf("%d", j);
int p = j - 1;
if(j == i){
while(p > 0){
printf("%d", p);
p--;
}}
j++;
}
printf("\n");
i++; st++;
}
}

1
123
12345
1234567
123456789

#include <stdio.h>
int main(){
int n, i = 1, st = 1;
scanf("%d", &n);
while(i <= n){
int sp;
sp = n - st;
while(sp > 0){
printf(" ");
sp--;
}
int j = 1;
while(j <= i){
printf("%d", j);
int p = j + 1;
if(j == i){
while(p <= 2*j - 1){
printf("%d", p);
p++;
 }}
j++;
}
printf("\n");
i++; st++;
}
}

J + I = n + 1

I = n + 1 - j

5
545
54345
5432345
543212345

#include <stdio.h>
int main(){
int n, i = 1, st = 1;
scanf("%d", &n);
while(i <= n){
int sp;
sp = n - st;
while(sp > 0){
printf(" ");
sp--;
}
int j = n;
while(j >= n + 1 - i){
printf("%d", j);
int p = j + 1;
if(j == n + 1 - i){
while(p <= n){
printf("%d", p);
p++;
}}
j--;
}
printf("\n");
i++; st++;
}
}
*********
*******
*****
***
*

#include <stdio.h>
int main(){
int n, i, sp = 0;
scanf("%d", &n);
i = n;
while(i >= 1){
int st = 1;
while(st <= sp){
printf(" ");
st++;
}
int j = 1;
while(j <= i){
printf("*");
int p = 1;
if(j == i){
while(p < j){
printf("*");
p++;
}}
j++;
}
printf("\n");
i--; sp++;
}}

123456789
1234567
12345
123
1

#include <stdio.h>
int main(){
int n, i, sp = 0;
scanf("%d", &n);
i = n;
while(i >= 1){
int st = 1;
 while(st <= sp){
printf(" ");
st++;
}
int j = 1;
while(j <= i){
printf("%d", j);
int p = j + 1;
if(j == i){
while(p <= 2*j - 1){
printf("%d", p);
p++;
}}
j++;
}
printf("\n");
i--; sp++;
}}

543212345
5432345
54345
545
5

#include <stdio.h>
int main(){
int n, i, sp = 0;
scanf("%d", &n);
i = n;
while(i >= 1){
int st = 1;
while(st <= sp){
printf(" ");
st++;
}
int j = n;
while(j >= n - i + 1){
printf("%d", j);
int p = j + 1;
if(j == n - i + 1){
while(p <= n){
printf("%d", p);
p++;
}}
j--;
 }
printf("\n");
i--; sp++;
}}