PTA第五期答案+笔记

PTA第五期答案+笔记

7-1 将数组中的数逆序存放

#include <stdio.h>

int main() 
{
    
    int n;
    scanf("%d", &n);

    int num[10];
    for (int i = 0; i < n; i++) 
    {
        scanf("%d", &num[i]);
    }

    for (int i = 0; i < n / 2; i++) 
    {
        int temp = num[i];
        num[i] = num[n - i - 1];
        num[n - i - 1] = temp;
    }

    for (int i = 0; i < n; i++) 
    {
        printf("%d", num[i]);
        if (i < n - 1) 
        {
            printf(" ");
        }
    }

    return 0;
}

7-2 查找整数

#include <stdio.h>

int main() 
{
    int n, x;
    scanf("%d %d", &n, &x);

    int num[20]={0};
    for (int i = 0; i < n; i++) 
    {
        scanf("%d", &num[i]);
    }

    int found = 0;
    for (int i = 0; i < n; i++) 
    {
        if (num[i] == x) 
        {
            printf("%d", i);
            found = 1;
            break;
        }
    }

    if (!found) 
    {
        printf("Not Found");
    }

    return 0;
}

7-3 交换最小值和最大值

#include<stdio.h>
#pragma warning(disable:4996)

int main()
{

	int num[10] = { 0 }, max = 0, min = 0,temp=0,temp1=0,ma=0,mi=0;
	scanf("%d", &temp);
	for (int i = 0; i < temp; i++)
	{
		scanf("%d", &num[i]);
	}
	max = 0;
	min = num[0];
	for (int i = 0; i < temp; i++)
	{
		if (num[i] < min)
		{
			min = num[i];
			mi = i;
		}
		
	}
	temp1 = num[0];
	num[0] = min;
	num[mi] = temp1;
	for (int i = 0; i < temp; i++)
	{
		if (max<num[i])
		{
			max = num[i];
			ma = i;
		}
		
	}
	temp1 = num[temp - 1];
	num[temp-1] = max;
	num[ma] = temp1;
	for (int i = 0; i < temp; i++)
	{
		printf("%d ", num[i]);
	}
	return 0;
}

7-4 求整数序列中出现次数最多的数

#include <stdio.h>

int main() 
{
    int N;
    scanf("%d", &N);

    int numbers[1000];
    for (int i = 0; i < N; i++) 
    {
        scanf("%d", &numbers[i]);
    }

    int mc = 0;
    int mn = numbers[0];

    for (int i = 0; i < N; i++) 
    {
        int count = 0;
        for (int j = 0; j < N; j++) 
        {
            if (numbers[j] == numbers[i]) 
            {
                count++;
            }
        }
        if (count > mc) 
        {
            mc = count;
            mn = numbers[i];
        }
    }

    printf("%d %d\n", mn, mc);

    return 0;
}

7-5 字符串字母大小写转换

#include <stdio.h>

int main()
{
    char str[31];
    int i = 0;
    gets(str);//scanf("%[^\n]d",&str)也可以。

    for (i = 0; str[i] != '#'; i++)
    {
        if (str[i] >= 'a' && str[i] <= 'z')
        {
            str[i] = str[i] - 32;
        }
        else if (str[i] >= 'A' && str[i] <= 'Z')
        {
            str[i] = str[i] + 32;
        }

    }
    if (str[i] == '#')
    {
        str[i] = 0;
    }

    printf("%s", str);
    return 0;
}

7-6 统计字符出现次数

#include<stdio.h>
#include<string.h>
int main()
{
    int i,len,count=0;
    char str[80];
    char ch;
    gets(str);
    ch=getchar();
    len=strlen(str);
    for(i=0;i<len;i++)
    {
        if(str[i]==ch)
            count++;
    }
    printf("%d",count);
    return 0;
}

7-7 IP地址转换

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

int main()
{
    char arr[33] = { 0 };
    gets(arr);

    for (int i = 0; i < 32; i++)
    {
        arr[i] -= '0';
    }
   //ip地址正位计算，注意是从前面加到后面
   //11001100100101000001010101110010的输出结果是逆置了的，不能这样干
  /*  for (int i = 3; i >= 0; i--)
    {
        int temp=0;
        for (int j = i*8; j < (i+1) * 8; j++)
        {
            int n = 7-j % 8;
            if (arr[j])
                temp += pow(2, n);
        }
        if (i > 0)
            printf("%d.", temp);
        else
            printf("%d\n", temp);
    }*/
    //ip地址如果是想从后面开始算到前面（2的0次幂开始）
    for (int i = 1; i <= 4; i++)
    {
        int temp = 0;
        for (int j = (i-1)*8; j < i * 8; j++)
        {
            int n = 7 - j % 8;
            if (arr[j])
                temp += pow(2, n);
        }
        if (i <4)
            printf("%d.", temp);
        else
            printf("%d\n", temp);
    }

    return 0;
}

下面这个方法简单一些

#include<stdio.h>
#include<math.h>
int main()
{  
char a[32];  
int i,j,sum[4]={0};  
scanf("%s",a);    
for(j=0;j<4;j++)    
    for(i=7;i>=0;i--)      
        if(a[i+8*j]=='1')
            sum[j]+=pow(2,7-i); 
printf("%d.%d.%d.%d",sum[0],sum[1],sum[2],sum[3]);  
return 0;
}

7-8 连接两个字符串

#include<stdio.h>
#include<string.h>
#pragma warning (disable:4996)
int main()
{
    char arr1[42], arr2[21];
    gets(arr1);
    gets(arr2);
    int lenth = strlen(arr1), i,j;
        for (i = lenth, j = 0; arr2[j] != 0; i++, j++)
        {
            arr1[i] = arr2[j];
        }
        arr1[lenth + j ] = '\0';
        puts(arr1);
    return 0;
}

7-9 把一个字符串中的所有字符按从小到大排序(冒泡）

#include<stdio.h>
#include<string.h>
#pragma warning (disable:4996)
int main()
{
    char arr1[21] = { 0 };
    gets(arr1);
    
	for (int i = 0; i < strlen(arr1) - 1; i++)
	{
		for (int j = 0; j < strlen(arr1) - i - 1; j++)
		{
			if (arr1[j] > arr1[j + 1])
			{
				int tmp = arr1[j];
				arr1[j] = arr1[j + 1];
				arr1[j + 1] = tmp;
			}
		}
	}
    puts(arr1);
    return 0;
}

7-10 数组中偶数除以2，奇数乘以2

#include<stdio.h>
#include<string.h>
#pragma warning (disable:4996)
int main()
{
    int arr1[42] = { 0 },i,j;
    for (i = 0;i<10; i++)
    {
        scanf("%d", &arr1[i]);

    }
    
    for (i = 0; i < 10; i++)
    {
        if (arr1[i] % 2 != 0)
        {
            arr1[i] *= 2;
        }
        else if(arr1[i]%2==0)
        {
            arr1[i] /= 2;
        }
     }
    for (j = 0; j < 10; j++)
    {
        printf("%4d", arr1[j]);
    }
    return 0;
}