CMP 201 Codes
CMP 201 Codes
#include <stdio.h>
int main() {
int number, originalNumber, reversal = 0;
originalNumber = number;
if(originalNumber == reversal) {
printf("\n %d is a palindrome number", originalNumber);
} else {
printf("\n %d is not a palindrome number", originalNumber);
}
return 0;
}
#include <stdio.h>
#include <math.h>
int main() {
int number, originalNumber, sum = 0;
originalNumber = number;
if(originalNumber == sum) {
printf("\n %d is an armstrong number", numberClone);
} else {
printf("\n %d is not an armstrong number", numberClone);
}
return 0;
}
PERMUTATION (LONG)
#include <stdio.h>
int main() {
int n, r, factorialOfN = 1, factorialOfDiff = 1, permutation,
iteration = 1, difference;
difference = n - r;
iteration = 1;
PERMUTATION (SHORT)
#include <stdio.h>
int main() {
int n, r, permutation = 1, difference;
printf("\n\nWhat is your value for n? ");
scanf("%d", &n);
difference = n - r;
COMBINATION
#include <stdio.h>
int combination() {
int n, r, factorialOfN = 1, factorialOfDiff = 1, factorialOfR =
1, combination, iteration = 1, difference;
difference = n - r;
iteration = 1;
iteration = 1;
#include <stdio.h>
int main(){
int number, reversal = 0;
while(number > 0) {
reversal = (reversal * 10) + (number % 10);
number = number / 10;
}
#include <stdio.h>
int main() {
int amount, number, max = 0, i;
printf("How many numbers do you want to calculate the max of? ");
scanf("%d", &amount);
#include <stdio.h>
int main() {
int number, i, factorial = 1;
printf("Enter number: ");
scanf("%d", &number);
#include <stdio.h>
int main() {
int a, b, m, c, d, n;
float x, y;
#include <stdio.h>
int main() {
int i, i2, row, column;
printf("What are the dimensions of your array?\n");
printf("Row: ");
scanf("%d", &row);
printf("Column: ");
scanf("%d", &column);
int normalArr[row][column];
int transposeArr[column][row];
for (i = 0; i < row; i++) {
for(i2 = 0; i2 < column; i2++) {
printf("Enter entry: ");
scanf("%d", &normalArr[i][i2]);
}
}
for (i = 0; i < column; i++) {
for(i2 = 0; i2 < row; i2++) {
transposeArr[i][i2] = normalArr[i2][i];
}
}
return 0;
}
USING 1/2 X B X H
USING HERON’S FORMULA