基于vs 2019
8.1
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdbool.h>
int main()
{
bool digit_seen[10] = { false };
int a[10], l = 0;
int digit, i = 0;
long n;
printf("Enter a number: ");
scanf("%ld", &n);
while (n > 0) {
digit = n % 10;
if (digit_seen[digit]) {
a[i++] = digit;
l++;
}
digit_seen[digit] = true;
n /= 10;
}
if (i) {
printf("Repeated digit: ");
for (i = 0; i < l; i++) {
printf(" %d", a[i]);
}
}
else {
printf("No repeated digit(s)");
}
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdbool.h>
int main(void)
{
int a[10], b[10];
int i = 0, n, x = 0,j;
printf("Enter a number: ");
scanf("%d", &n);
for (i = 0; n>0; i++) {
int digit = n % 10;
a[i] = digit;
for (j = 0; j < i; j++) {
if (a[j] == digit) {
b[j] = digit;
x = 1;
}
}
n /= 10;
}
if (x) {
printf("Repeated digit(s): ");
for (i = 0; i < j+1; i++) {
if (a[i] == b[i] && a[i] != 0) {
printf(" %d", a[i]);
}
}
}
else {
printf("No Repeated digits.");
}
return 0;
}
8.2
#include <stdio.h>
int main(void)
{
int digit_count[10] = {0};
int digit;
long n;
printf("Enter a number: ");
scanf("%ld", &n);
while (n > 0) {
digit = n % 10;
digit_count[digit]++;
n /= 10;
}
printf ("Digit: ");
for (digit = 0; digit <= 9; digit++)
printf("%3d", digit);
printf("\nOccurrences:");
for (digit = 0; digit <= 9; digit++)
printf("%3d", digit_count[digit]);
printf("\n");
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdbool.h>
int main(void)
{
int a[10], b[10] = { 0 };
int i = 0, n;
printf("Enter a number: ");
scanf("%d", &n);
for (i = 0; n > 0; i++) {
int digit = n % 10;
a[i] = digit;
b[digit]++;
n /= 10;
}
printf("digit: 0 1 2 3 4 5 6 7 8 9\n");
printf("Occurences: ");
for (i = 0; i < 10; i++) {
printf("%d ", b[i]);
}
return 0;
}
8.3
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdbool.h>
int main(void)
{
int a[10], b[10] = { false };
int i = 0, n;
printf("Enter a number: ");
while (1) {
scanf("%d", &n);
if (n < 1) { break; }
for (int j = 0; j <= i; j++) {
if (a[j] == n) { b[j]++; }
}
a[i++] = n;
}
printf("Repeated tigits: ");
for (i = 0; i < 10; i++) {
if (b[i]) {
printf("%d ", a[i]);
}
}
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdbool.h>
int main()
{
int digit;
long n;
while (true) {
bool digit_seen[10] = { false }, flag = false;
printf("Enter a number: ");
scanf("%ld", &n);
int l=1;
if (n <= 0) {
break;
}
while(n>0) {
digit = n % 10;
if (digit_seen[digit]) {
l = 0;
}digit_seen[digit] = true;
n /= 10;
}
if (l==0) {
printf("Repeated digit\n");
}
else {
printf("No Repeated digit\n");
}
}
return 0;
}
8.5
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#define NUM_RATES ((int)(sizeof(value))/sizeof(value[0]))
#define INITIAL_BALANCE 100.00
int main()
{
int i, low_rate, month, num_years, year;
double value[5];
printf("Enter interest rate: ");
scanf("%d", &low_rate);
printf("Enter number of years: ");
scanf("%d", &num_years);
printf("\nYears");
for (i = 0; i < NUM_RATES; i++) {
printf("%6d%%", low_rate + i);
value[i] = INITIAL_BALANCE;
}
printf("\n");
for (year = 1; year <= num_years; year++) {
printf("%3d ", year);
for (i = 0; i < NUM_RATES; i++) {
for (month = 1; month <= 12; month++) {
value[i] += ((double)(low_rate + i) / 12) / 100.00 * value[i];
}
printf("%7.2f", value[i]);
}
printf("\n");
}
return 0;
}
*****************************************************************************************
for (month = 1; month <= 12; month++) { *
value[i] += ((double)(low_rate + i) / 12) / 100.00 * value[i]; *
} *
*****************************************************************************************
alue[i] += (low_rate + i) / 100.0 * value[i]; *
这两段代码表面上等价 *
*****************************************************************************************
8.6
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
int main()
{
char ch[6] = { 'A','B','E','I','O','S' };
int tigit[6] = { 4,8,3,1,0,5 };
char ch1;
int j = 0, i = 0;
printf("Enter message: ");
while ((ch1 = getchar()) != '\n') {
if (i == 0) {
printf("In BiFF-speak: ");
}
for ( i = 0; i < 6; i++) {
if (toupper(ch1) == ch[i]) {
printf("%d", tigit[i]);
j = 1;
break;
}
}
if (!j) {
putchar(toupper(ch1));
}
else { j = 0; }
}
printf("!!!!!!!!!!");
return 0;
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
int main()
{
char a[100];
int i=0, j;
printf("Enter message: ");
while (((a[i]) = getchar()) != '\n') {
i++;
}
printf("In B1FF-speak: ");
for (j = 0; j < i;j++) {
if ('a' <= a[j] && a[j] <= 'z') {
a[j] = toupper(a[j]);
}
switch (a[i]) {
case 'A':printf("4"); break;
case 'B':printf("8"); break;
case 'E':printf("3"); break;
case 'I':printf("1"); break;
case 'O':printf("0"); break;
case 'S':printf("5"); break;
default:printf("%c", a[j]); break;
}
}
printf("!!!!!!!!!!");
return 0;
}
8.7
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#define N 5
int main()
{
int a[N][N] = { 0 };
int i=0, j=0, w=0;
for (; i < N; i++) {
printf("Enter row %d: ", i+1);
for (j = 0; j < N; j++) {
scanf("%d", &a[i][j]);
}
}
int sum=0;
printf("Row totals: ");
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
sum += a[i][j];
}
printf("%d ", sum);
sum = 0;
}
printf("\nColumn totals: ");
for (j = 0; j < N; j++) {
for (i = 0; i < N; i++) {
sum += a[i][j];
}
printf("%d ", sum);
sum = 0;
}
return 0;
}
8.8
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void)
{
int a[5][5];
int i = 0, j = 0, sum = 0, sum1 = 0;
int min = 0, max = 0;
for (i=0; i < 5; i++) {
printf("Enter the score for each student %d: ", i + 1);
for (j=0; j < 5; j++) {
scanf("%d", &a[i][j]);
}
//printf("\n");
}
printf("The student's total score : ");
for (i=0; i < 5; i++) {
for (j=0; j < 5; j++) {
sum += a[i][j];
}
printf(" %d", sum);
sum = 0;
}
printf("\nThe student's average score: ");
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++) {
sum += a[i][j];
}
printf(" %.2f", sum*1.0/5);
sum = 0;
}
printf("\n");
printf("The total score of this subject : ");
for (j=0; j < 5; j++) {
for (i=0; i < 5; i++) {
sum += a[i][j];
}
printf(" %d", sum);
sum = 0;
}
printf("\nAverage score of each subject: ");
for (j = 0; j < 5; j++) {
for (i = 0; i < 5; i++) {
sum += a[i][j];
}
printf(" %.2f", sum*1.0/5);
sum = 0;
}
printf("\n每门科的最大值 || 最小值 ");
for (j = 0; j < 5; j++) {
min = max = a[0][j];
for (i = 0; i < 5; i++) {
if (a[i][j] > max) { max = a[i][j]; }
else if (a[i][j] < min) { min = a[i][j]; }
}
printf(" %d||%d ", max, min);
}
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#define N 5
int main()
{
int a[N][N];
int i = 0, j = 0;
int min = 0, max = 0;
for (i = 0; i < N; i++) {
printf("输入第 %d 个学生的成绩: ", i + 1);
for (j = 0; j < N; j++) {
scanf("%d", &a[i][j]);
}
}
int sum=0; double average;
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
sum += a[i][j];
}
printf("第%d个的总成绩为:%d 平均成绩为 %.2f\n", i + 1, sum, sum * 1.0 / N);
sum = 0;
}
for (j = 0; j < N; j++) {
min = max = a[0][j];
for (i = 0; i < N; i++) {
if (a[i][j] > max) {
max = a[i][j];
}if (a[i][j] < min) {
min = a[i][j];
}
sum += a[i][j];
}
printf("第%d科的总成绩为:%d 平均成绩为 %.2f 均分最高为:%d 最低为 %d\n", \
j + 1, sum, sum * 1.0 / N,max,min);
sum = 0;
}
return 0;
}
8.9
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <stdbool.h>
#define N 10
#define WAY 4
int main(void)
{
bool a[N][N] = { false };
char b[N][N];
int i, j;
//初始化表
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
b[i][j] = '.';
}
}
srand((unsigned)time(NULL));
int ways;
i = 0; j = 0;
b[0][0] = 'A';
a[0][0] = true;
for (int m = 0; m < 25; ) {
//余0表上, 1表下, 2表左, 3表右
ways = rand() % WAY;
if (ways == 0) {
//如果往上走有字母了或走出表格, 进行判断
if (a[i - 1][j] == true||i-1<0) {
//如果四面都是字母,退出
if ((a[i + 1][j] == true && a[i][j - 1] == true && a[i][j + 1] == true)
// 考虑左边和左下角情况
|| j - 1 < 0 && a[i + 1][j] == true && a[i][j + 1] == true
|| j - 1 < 0 && i + 1 > 9 && a[i][j + 1] == true
// 右边和右下角
|| j + 1 > 9 && a[i + 1][j] == true && a[i][j - 1] == true
|| j - 1 < 0 && i + 1 > 9 && a[i][j + 1] == true
//下边
|| i + 1 > 9 && a[i][j + 1] == true && a[i][j - 1] == true) break;
//如果都不是,重新选方向
}
else {
a[i - 1][j] = true;
b[i - 1][j] = 'B' + m;
m++;
i--;
continue;
}
}
if (ways == 1) {
if (a[i + 1][j] == true||i+1>9) {
if (a[i - 1][j] == true && a[i][j - 1] == true && a[i][j + 1] == true
//右边和右上角
|| j + 1 > 9 && a[i][j - 1] == true && a[i - 1][j] == true
|| j + 1 > 9 && i - 1 < 0 && a[i][j - 1] == true
//左边
|| j - 1 < 0 && a[i - 1][j] == true && a[i][j + 1] == true
//上边
|| i - 1 < 0 && a[i][j + 1] == true && a[i][j - 1] == true) break;
}
else {
a[i + 1][j] = true;
b[i + 1][j] = 'B' + m;
m++;
i++;
continue;
}
}
if (ways == 2) {
if (j-1<0||a[i][j - 1] == true) {
if (a[i + 1][j] == true && a[i - 1][j] == true && a[i][j + 1] == true
// 考虑下边和右下角情况
|| i + 1 > 9 && a[i - 1][j] == true && a[i][j + 1] == true
|| j + 1 > 9 && i + 1 > 9 && a[i - 1][j] == true
// 上边和右上角
|| i - 1 < 0 && a[i + 1][j] == true && a[i][j + 1] == true
|| j + 1 > 9 && i - 1 < 0 && a[i][j + 1] == true
// 右边
|| j + 1 > 9 && a[i - 1][j] == true && a[i + 1][j] == true) break;
}
else {
a[i][j - 1] = true;
b[i][j - 1] = 'B' + m;
m++;
j--;
continue;
}
}
if (ways == 3) {
if (j+1>9||a[i][j + 1] == true) {
if (a[i + 1][j] == true && a[i][j - 1] == true && a[i - 1][j] == true
//左边和左下角
|| j - 1 < 0 && a[i - 1][j] == true && a[i + 1][j] == true
|| j - 1 < 0 && i + 1 > 9 && a[i - 1][j] == true
//下边
|| i + 1 > 9 && a[i - 1][j] == true && a[i][j - 1] == true
//上边
|| i - 1 < 0 && a[i][j - 1] == true && a[i + 1][j] == true) break;
}
else {
a[i][j + 1] = true;
b[i][j + 1] = 'B' + m;
m++;
j++;
continue;
}
}
}
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
printf("%c ", b[i][j]);
}
printf("\n");
}
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <time.h>
#define bool int
#define TRUE 1
#define falst 0
void xians(); // 显示函数
int kais(); //开始处函数
bool way(char x, char y); //判断是否有路径函数
static char map[10][10], num = 0;
char coordinate_x, coordinate_y; //最后一个字母的位置
int main(int argc, char* argv[])
{
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
map[i][j] = '.';
}
}
map[0][0] = 'A'; //初始字母
num += 1;
coordinate_x = 0; // 初始位置
coordinate_y = 0;
xians();
kais();
getchar();
return 0;
}
int kais()
{
srand(time(NULL));
int direction; // 方向变量
while (num <= 25)
{
if (way(coordinate_x, coordinate_y)) //判断是否有路径
{
printf("No way out!!!\n");
getchar();
return 0;
}
direction = rand() % 4; //产生方向
switch (direction) //移动位置
{
case 0:
if (coordinate_y < 9)
{
if (map[coordinate_x][coordinate_y + 1] == '.')
{
map[coordinate_x][++coordinate_y] = 'A' + (num++);
}
}break;
case 1:
if (coordinate_x > 0)
{
if (map[coordinate_x - 1][coordinate_y] == '.')
{
map[--coordinate_x][coordinate_y] = 'A' + (num++);
}
}break;
case 2:
if (coordinate_x < 9)
{
if (map[1 + coordinate_x][coordinate_y] == '.')
{
map[++coordinate_x][coordinate_y] = 'A' + (num++);
}
}break;
case 3:
if (coordinate_y > 0)
{
if (map[coordinate_x][coordinate_y - 1] == '.')
{
map[coordinate_x][--coordinate_y] = 'A' + (num++);
}
}break;
}
xians();
}
}
bool way(char x, char y)
{
if (x > 0) //超界限判断
{
if (map[x - 1][y] == '.') //是否为空
{
return 0;
}
}
if (x < 9)
{
if (map[x + 1][y] == '.')
{
return 0;
}
}
if (y > 0)
{
if (map[x][y - 1] == '.')
{
return 0;
}
}
if (y < 9)
{
if (map[x][y + 1] == '.')
{
return 0;
}
}
return 1;
}
void xians()
{
system("cls");
int x, y;
for (x = 0; x < 10; x++)
{
for (y = 0; y < 10; y++)
{
putchar(map[x][y]);
putchar(' ');
}
putchar('\n');
}
printf("%d\n", num); //到达地num个字符
}
8.10
## 法一
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main()
{
int time, i, j,hour1,hour,minute,minute1;
int launch[8] = { 480,9*60+43,11*60+19,12*60+47,14*60,15*60+45,19*60,21*60+45 };
int arrive[8] = { 10 * 60 + 16,11 * 60 + 52,13 * 60 + 31,15 * 60,
16 * 60 + 8,17 * 60 + 55,21 * 60 + 20,23 * 60 + 58 };
//printf("%d", a[1]);
printf("Enter a 24-hour time: ");
scanf("%d : %d", &i,&j);
time = i * 60 + j;
int a, b;
for (i = 0; i < 8; i++) {
if (time < launch[i]) {
a = launch[i] - time;
b = time - launch[i - 1];
if (a > b) {
hour1 = (launch[i-1]) / 60;
minute1 = (launch[i-1]) % 60;
hour = (arrive[i-1]) / 60;
minute = (arrive[i-1]) % 60;
break;
}
else {
hour1 = (launch[i]) / 60;
minute1 = (launch[i]) % 60;
hour = (arrive[i]) / 60;
minute = (arrive[i]) % 60;
break;
}
}
}
if (hour1 < 12) { printf("Closest departure time is %.2d :%.2dAM., ", hour1, minute1); }
else { printf("Closest departure time is %.2d :%.2dPM., ", hour1, minute1); }
if (hour < 12) { printf("arriving at %.2d : %.2d AM", hour, minute); }
else { printf("arriving at %.2d : %.2d PM", hour, minute); }
return 0;
}
法二、
#include <stdio.h>
#include <math.h>
int main(void)
{
const int lea[8] = {480, 583, 679, 767, 840, 945, 1140, 1305};
const int arr[8] = {616, 712, 811, 900, 968, 1075, 1280, 1438};
int hours, minutes;
int time;
printf ("Enter a 24-hour time:");
scanf ("%d:%d", &hours, &minutes);
//将时间换算成分钟
time = hours * 60 + minutes;
int mix = 1440, m;
//找到距离最近的时间,并记录其下标
for (int i = 0; i < 8; i++) {
if (fabs(lea[i] - time) < mix) {
mix = fabs(lea[i] - time);
m = i;
}
}
int hour, minute;
//判断是上午还是下午并输出
if (lea[m] / 60 > 12) {
if (arr[m] / 60 > 12) {
printf("CLosest departure time is %d:%.2d p.m.", lea[m] / 60 - 12, lea[m] % 60);
printf(", arriving at %d:%.2d p.m.", arr[m] / 60 -12, arr[m] % 60);
}
} else {
if (arr[m] / 60 > 12) {
printf("CLosest departure time is %d:%.2d a.m.", lea[m] / 60, lea[m] % 60);
printf(", arriving at %d:%.2d p.m.", arr[m] / 60 -12, arr[m] % 60);
} else {
printf("CLosest departure time is %d:%.2d a.m.", lea[m] / 60, lea[m] % 60);
printf(", arriving at %d:%.2d p.m.", arr[m] / 60, arr[m] % 60);
}
}
return 0;
}
8.11
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
#define N 15
int main(void)
{
char ch[N];
printf("Enter phone number: ");
for (int i = 0; i < N; i++) {
ch[i] = getchar();
}
printf("In number form: ");
for (int i = 0; i < N; i++) {
switch (toupper(ch[i])) {
case 'A':case 'B':case 'C':
printf("2"); break;
case 'D':case 'E':case 'F':
printf("3"); break;
case 'G':case 'H':case 'I':
printf("4"); break;
case 'J':case 'EK':case 'L':
printf("5"); break;
case 'M':case 'O':case 'N':
printf("6"); break;
case 'P':case 'S':case 'R':
printf("7"); break;
case 'V':case 'T':case 'U':
printf("8"); break;
case 'W':case 'X':case 'Y':
printf("9"); break;
default:
putchar(ch[i]);
break;
}
}
return 0;
}
8.12
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
int main()
{
char ch; int sum=0;
int a[26] = { 1, 3, 3, 2, 1,
4, 2, 4, 1, 8, 5,
1, 3, 1, 1, 3, 10,
1, 1, 1, 1, 4, 4,
8, 4, 10 };
while ((ch = getchar()) != '\n') {
sum += a[toupper(ch) - 'A'];
}
printf("%d\n", sum);
return 0;
}
8.13
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
int main()
{
char ch, ch1, a[20]; int n,i;
printf("ENter a first and last name :");
scanf("%c", &ch1);
while ((ch = getchar()) != ' ');
for (i = 0; (ch = getchar()) != '\n'; a[i] = ch,i++);
/*while ((ch = getchar()) != '\n') {
a[i] = ch;
i++;
}*/
printf("You enered the name:");
for (n = 0; n < i; n++) {
printf("%c", a[n]);
}
printf(", %c\n", ch1);
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
#define N 15
int main(void)
{
char ch[20];
int i = 0;int x = 0;
printf("Enter a first and last name: ");
while ((ch[i++] = getchar()) != '\n') { ; }
for (int j=0; j < i-1; j++) {
while (ch[j] == ' ') {
x = j+1;
break;
}
}
for (x; x < i-1; x++) {
printf("%c", ch[x]);
}
printf(", %c.\n", ch[0]);
return 0;
}
8.14
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
#define N 100
int main()
{
char ch[N];
char ch1;
int i = 0;
for (;;) {
ch1 = getchar();
if (ch1 == '?' || ch1 == '.' || ch1 == '!') { ch[i] = ch1; break;}
else {
ch[i] = ch1; i++;
}
}
int max = i;//max 是非数字字符的位置
for (int j=i; j >= 0; j--) {
if (j==0|| !isalnum(ch[j])) {
if (j == 0) {
for (int n = j ; n < max; n++) {
putchar(ch[n]);
}
}
else {
for (int n = j + 1; n < max; n++) {
putchar(ch[n]);
}
putchar(ch[j]);
}
max = j;
}
}
return 0;
}
8.15
推荐第一种方法
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
#define N 100
int main()
{
char ch;
char ch1[N];
int i = 0, n;
printf("Enter message to be encrypted: ");
/*for ( i = 0; i < N; i++) {
scanf("%c", &ch1[i]);
if (ch1[i] == '\n') { break; }
}*/
for (i = 0; i < N, (ch = getchar()) != '\n'; i++) {
ch1[i] = ch;
}
printf("Enter shift amount (1-25) :");
scanf("%d", &n);
printf("Encrypted message: ");
for (int j = 0; j <i; j++) {
if (isalpha(ch1[j])) { //(isalpha islower)库函数
if (islower(ch1[j])) {
ch1[j] = ((ch1[j] - 'a') + n) % 26 + 'a';
}
else{
ch1[j] = ((ch1[j] - 'A') + n) % 26 + 'A';
}
}
printf("%c", ch1[j]);
//putchar(ch1[j]);
}
return 0;
}
#include <stdio.h>
int main(void)
{
//sen为原句子
char sen[80], sen1[80];
int n;
//初始化数组
int i;
printf("Enter message to be encrypted: ");
for (i = 0; ; i++) {
sen[i] = getchar();
if (sen[i] == '\n') break;
}
printf("Enter shift amout (1~25): ");
scanf("%d", &n);
printf("Encrypted message: ");
for (int j = 0; j < i + 1; j++) {
if (sen[j] <= 'z' && sen[j] >= 'a') {
printf("%c", ((sen[j] - 'a') + n) % 26 + 'a');
} else if (sen[j] <= 'Z' && sen[j] >= 'A') {
printf("%c", ((sen[j] - 'A') + n) % 26 + 'A');
} else {
printf("%c", sen[j]);
}
}
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#define N 100
int main(void)
{
char sentence1[N], sentence2[N],ch;
int n,i,j;
printf("Enter massage to be encrypted:");
for ( j = 0; j < N, (ch = getchar()) != '\n'; j++) {
sentence1[j] = ch;
}
printf("Enter shift amount (1-25):");
scanf("%d", &n);
for (int i = 0; i < j;
i++) {
if (sentence1[i] <'A'|| sentence1[i]>'Z'&& sentence1[i]<'a'|| sentence1[i]>'z') {
sentence2[i] = sentence1[i];
//printf("herehhh\n");
}
else if (sentence1[i] + n>'z'){
//printf("here1\n");
sentence2[i] = sentence1[i] + n-'z'+'`';
}
else if (sentence1[i]<='Z' &&sentence1[i] + n > 'Z') {
//printf("here2\n");
sentence2[i] = sentence1[i] + n - 'Z' + '@';
}
else {
sentence2[i] = sentence1[i] + n;
//printf("here3\n");
}
printf("%c", sentence2[i]);
}
return 0;
}
8.16
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
#define N 26
int main(void)
{
int a[N] = { 0 };
int i;
char ch;
printf("Enter first word: ");
while ((ch = toupper(getchar())) != '\n'){
if (!isalpha(ch)) {
continue;
}
a[ch % 65]++;
}
printf("Enter second word: ");
while ((ch = toupper(getchar())) != '\n') {
if (!isalpha(ch)) {
continue;
}
a[ch % 65]--;
}
for (i = 0; i < N; i++) {
if (a[i] != 0) {
printf("The word are not anagrams.");
return 0;
}
}
printf("The word are anagrams.");
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <ctype.h>
int main(void)
{
int num[26] = { 0 }, result=0;
char word[26],ch;
int i;
printf("Enter first word: ");
for (i = 0; i < 20; i++) {
ch = getchar();
if (!isalpha(ch) && ch != '\n') {
continue;
}
if (ch == '\n') break;
word[i] = ch;
word[i] = tolower(word[i]);
num[word[i] - 'a']++;
}
printf("Enter second word: ");
for (i = 0; i < 20; i++) {
ch = getchar();
if (!isalpha(ch) && ch != '\n') {
continue;
}
if (ch == '\n') break;
word[i] = ch;
word[i] = tolower(word[i]);
num[word[i] - 'a']--;
}
for (i = 0; i < 26; i++) {
if (num[i]) {
result = 1;
//printf("Here 5\n");
break;
}
}
if (result==1){
//printf("Here 6\n");
printf("The words are not anagrams\n");
}
else {
//printf("Here 7\n");
printf("The words are anagrams\n");
}
return 0;
}
8.17
#define _CRE_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void)
{
printf("This is program creates a magic square of a specified size.\n");
printf("The size must be an odd number between 1 and 99.\n");
printf("Enter size of magic square: ");
int size;
scanf("%d", &size);
int square[size][size];
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
square[i][j] = 0;
}
}
int i = 0, j = size / 2, num = 1;
for (; ; ) {
if (square[i][j] == 0) {
square[i][j] = num;
i = i + size - 1; j++;
i = i % size;
j = j % size;
} else {
i++; i++; j = j + size - 1;
i = i % size;
j = j % size;
square[i][j] = num;
i = i + size - 1; j++;
i = i % size;
j = j % size;
}
num++;
if (num > size * size) break;
}
for (i = 0; i < size; i++) {
for (j = 0; j < size; j++) {
printf("%3d", square[i][j]);
}
printf("\n");
}
return 0;
}