UNIT -5

Simple Arithmetic Problem

1. Addition of two integer
#include<stdio.h>
int main( )
{
int a, b, sum;

printf("Enter two numbers: ");

scanf("%d%d", &a, &b);
sum = a + b;
printf("The sum of %d and %d is: %d\n", a, b, sum);

return 0;
}

2. Multiplying two integers

#include<stdio.h>

int main() {
int a, b, product;

printf("Enter two integers: ");

scanf("%d%d", &a, &b);

product = a * b;

printf("The product of %d and %d is: %d\n", a, b, product);

return 0;
}
3.Determining if a number is +ve / -ve

#include<studio.h>

int main() {
int num;

printf("Enter a number: ");

scanf("%d", &num);

if (num >= 0) {

printf("%d is a positive number.\n", num);

} else {

printf("%d is a negative number.\n", num);

return 0;

4.determining if a number is even or odd

#include<studio.h>

int main() {
int num;
 printf("Enter a number: ");

scanf("%d", &num);

if (num % 2 == 0) {

printf("%d is an even number.\n", num);

} else {

printf("%d is an odd number.\n", num);

return 0;

5.Maximum of 2 numbers, 3 numbers

#include <stdio.h>

int main() {
int num1, num2, max;

printf("Enter two numbers: ");

scanf("%d%d", &num1, &num2);

max = (num1 > num2) ? num1 : num2;

printf("The maximum of %d and %d is: %d\n", num1, num2, max);

return 0;
}
finding the maximum of two numbers in C:

#include <stdio.h>
int main() {
int num1, num2, max;

printf("Enter two numbers: ");

scanf("%d%d", &num1, &num2);

max = (num1 > num2) ? num1 : num2;

printf("The maximum of %d and %d is: %d\n", num1, num2, max);

return 0;
}
finding the maximum of three numbers

#include <stdio.h>

int main() {
int num1, num2, num3, max;

printf("Enter three numbers: ");

scanf("%d%d%d", &num1, &num2, &num3);

max = num1;
if (num2 > max) max = num2;
if (num3 > max) max = num3;

printf("The maximum of %d, %d and %d is: %d\n", num1, num2, num3,

max);

return 0;
}
6.Sum of first n numbers

#include <stdio.h>

int main() {
int n, i, sum = 0;
 printf("Enter a positive integer: ");
scanf("%d", &n);

for (i = 1; i <= n; i++) {

sum += i;
}

printf("The sum of the first %d numbers is: %d\n", n, sum);

return 0;
}

7.sum of given n numbers

#include <stdio.h>

int main() {
int n, i, num, sum = 0;

printf("Enter the number of numbers: ");

scanf("%d", &n);

for (i = 1; i <= n; i++) {

printf("Enter number %d: ", i);
scanf("%d", &num);
sum += num;
}

printf("The sum of the %d numbers is: %d\n", n, sum);

return 0;
}

8.Integer division
#include <stdio.h>

int main() {
int num1, num2, result;

printf("Enter two numbers: ");

scanf("%d%d", &num1, &num2);

result = num1 / num2;

printf("The result of %d / %d is: %d\n", num1, num2, result);

return 0;
}
9.digit reversal

#include <stdio.h>

int main() {
int num, reversed = 0, remainder;

printf("Enter an integer: ");

scanf("%d", &num);

while (num != 0) {
remainder = num % 10;
reversed = reversed * 10 + remainder;
num /= 10;
}

printf("The reversed number is: %d\n", reversed);

return 0;
}
10.Table generation for n

#include <stdio.h>

int main() {
int n, i;

printf("Enter a positive integer: ");

scanf("%d", &n);

for (i = 1; i <= 10; i++) {

printf("%d * %d = %d\n", n, i, n * i);
}

return 0;
}
11.factorial of n

#include <stdio.h>

int main() {
int num, i, factorial = 1;

printf("Enter an integer: ");

scanf("%d", &num);

for (i = 1; i <= num; i++) {

factorial *= i;
}

printf("The factorial of %d is: %d\n", num, factorial);

return 0;
}
12.sine series

#include <math.h>
#include <stdio.h>

int main() {
double angle, radian, sum = 0, term;
int i, n, sign;

printf("Enter the angle in degrees: ");

scanf("%lf", &angle);

// Convert the angle from degrees to radians

radian = angle * M_PI / 180.0;

printf("Enter the number of terms: ");

scanf("%d", &n);

sign = 1;
for (i = 0; i < n; i++) {
term = sign * pow(radian, 2 * i + 1) / (2 * i + 1);
sum += term;
sign = -sign;
}

printf("The sine of %lf degrees is approximately %lf\n", angle, sum);

return 0;
}
13.cosine series

#include <math.h>
#include <stdio.h>

int main() {
double angle, radian, sum = 0, term;
int i, n;

printf("Enter the angle in degrees: ");

scanf("%lf", &angle);

// Convert the angle from degrees to radians

radian = angle * M_PI / 180.0;

printf("Enter the number of terms: ");

scanf("%d", &n);

for (i = 0; i < n; i++) {

term = pow(-1, i) * pow(radian, 2 * i) / (2 * i)!;
sum += term;
}

printf("The cosine of %lf degrees is approximately %lf\n", angle, sum);

return 0;
}
14.pascal triangle

#include <stdio.h>

int factorial(int n) {
int i, result = 1;
for (i = 1; i <= n; i++) {
result *= i;
}
return result;
}

int nCr(int n, int r) {

return factorial(n) / (factorial(r) * factorial(n - r));
}

int main() {
int i, j, rows, value;

printf("Enter the number of rows: ");

scanf("%d", &rows);

for (i = 0; i < rows; i++) {

for (j = 0; j <= i; j++) {
value = nCr(i, j);
printf("%d ", value);
}
printf("\n");
}

return 0;
}
15.perfect number

#include <stdio.h>

int main()
{
int num, i, sum = 0;

printf("Enter a positive integer: ");

scanf("%d", &num);

for (i = 1; i < num; i++)

{
if (num % i == 0)
{
sum += i;
}
}

if (sum == num)
printf("%d is a perfect number", num);
else
printf("%d is not a perfect number", num);

return 0;
}
16.GCD numbers

#include <stdio.h>

int main()
{
int num, i, sum = 0;

printf("Enter a positive integer: ");

scanf("%d", &num);

for (i = 1; i < num; i++)

{
if (num % i == 0)
{
sum += i;
}
}

if (sum == num)
printf("%d is a perfect number", num);
else
printf("%d is not a perfect number", num);

return 0;
}
17.swapping

#include <stdio.h>

void swap(int *a, int *b) {

int temp = *a;
*a = *b;
*b = temp;
}

int main() {
int x = 10, y = 20;
 printf("Before swapping: x = %d, y = %d\n", x, y);

swap(&x, &y);

printf("After swapping: x = %d, y = %d\n", x, y);

return 0;
}

18.Factorial

#include <stdio.h>

int factorial(int n) {
int i, result = 1;
for (i = 1; i <= n; i++) {
result *= i;
}
return result;
}

int nCr(int n, int r) {

return factorial(n) / (factorial(r) * factorial(n - r));
}

int main() {
int n, r, result;

printf("Enter the values of n and r: ");

scanf("%d%d", &n, &r);

result = nCr(n, r);

printf("%dC%d = %d\n", n, r, result);

return 0;
}