PTA 第四期答案+笔记

PTA 第四期答案+笔记

7-1 统计素数并求和

#pragma warning (disable:4996)
#include <stdio.h>
int main()
{
	int M, N,i,k,h=0,sum=0;
	scanf("%d %d", &M, &N);
	for (i = M; i <= N; i++)
	{
		for (k = 2; k <= i; k++)
		{
			if (i % k == 0)
				break;
		}
		if (i == k)
		{
			sum += i;
			h++;
		}
	}
	printf("%d %d",h,sum);
	return 0;
}

7-2 换硬币

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

int main() 
{
    int x, fen5 = 1, fen2 = 1, fen1 = 1, count = 0;
    scanf("%d", &x);
    int max_fen5 = x / 5;//最多能有多少个五元，然后从最大的情况往下数
    for (fen5 = max_fen5; fen5 >=1; fen5--)
    {
        int left1 = x - fen5 * 5;//用了n个五元后开始算剩下的
        int max_fen2 = left1 / 2;//剩下的钱最多几个两元
        for (fen2 = max_fen2; fen2>=1; fen2--)
        {
            int left2 = left1 - fen2 * 2;//之后还剩多少前
            int max_fen1 = left2;
            for (fen1 = max_fen1; fen1>=1; fen1--)
            {
                if (fen1 + fen2 * 2 + fen5 * 5 == x && fen1 * fen2 * fen5 != 0)
                {
                    printf("fen5:%d, fen2:%d, fen1:%d, total:%d\n", fen5, fen2, fen1, fen5 + fen2 + fen1);
                    count++;
                }
            }
        }
    }
    printf("count = %d", count);
    return 0;
}

7-3 最大公约数和最小公倍数

#include <stdio.h>

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

    int gcd, lcm;
    for (i = 1; i <= M && i <= N; i++) 
    {
        if (M % i == 0 && N % i == 0)
        {
            gcd = i;
        }
    }

    lcm = M * N / gcd;//求出最小公倍数

    printf("%d %d", gcd, lcm);
    return 0;
}

7-4 打印九九口诀表

#include<stdio.h>

int main()
{
    int i,j,temp;
    scanf("%d",&temp);
    for(i=1;i<=temp;i++)
    {
        int j=1;
        for(;j<=i;j++)
        {
            printf("%d*%d=%-4d",j,i,i*j);//%m.nd意思是输出长度为m的整型数（包括有效数值），取小数点后n位。-号意思为左对齐，没有-号为右对齐。
        }
        printf("\n");
    }
}

7-5 π/4≈1-1/3+1/5……求π——格雷戈里公式

#include<stdio.h>

int main()
{
    double PI1=1,temp=0,temp1;
    double i=1;
	int count=1;
    do
    {
         temp1=1.0/i;//取分数
        
        if(count%2==0)
        {
            temp=temp-temp1;
        }
        else
        {
            temp=temp+temp1;
        }
        count++;
        i+=2;
    }while(temp1>0.000001);//1e-6
    printf("pi=%10.4lf",temp*4);//注意格雷戈里公式是最后要×4才是Π。
}

7-6 统计学生成绩

#include<stdio.h>

int main()
{
    int a=0,b=0,c=0,d=0,e=0;
    int num,temp,i;
    scanf("%d",&num);
    for( i=0;i<num;i++)
    {
        scanf("%d",&temp);
        switch(temp/10)
        {
            case 10:
            case 9:a++;break;
            case 8:b++;break;
         
                case 7:c++;break;
                case 6:d++;break;
                case 5:
                case 4:
                case 3:
                case 2:
                case 1:
                case 0:e++;break;
        }
    }
    printf("%d %d %d %d %d",a,b,c,d,e);
}

7-7 水仙花数

快速幂C语言版

//pow计算效率过低需要自己写个pow函数，加快计算速率避免超时。可以看看快速幂计算。

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

long int pow1(int a, int b)
{
    int i = b;
    int sum = 1;
    while (i--)
    {
        sum = sum * a;
    }
    return sum;
}

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

    for (i = pow1(10, n - 1); i < pow1(10, n); i++)
    {
        int temp = i, sum = 0;
        while (temp != 0)//这个while的意思是：首先取范围内的数字temp
        {
            sum += pow1(temp % 10, n);//然后获取temp的个位数（取模10是得到个位），之后计算他（那个个位）的n次方。
            temp /= 10;//把个位去掉，所有位数降低一位。
        }
        if (sum == i)
        {
            printf("%d\n", i);
        }
    }

    return 0;
}

7-8 兔子繁衍问题

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

int main() 
{
    int N;
    scanf("%d", &N);
    if(N==1)
	{
    printf("1");
    return 0;
	}//为了通过pta必须判断
    int month = 2;
    int previous = 1;
    int current = 1;

    while (current < N) 
    {
        int temp = current;
        current = previous + current;
        previous = temp;
        month++;
    }

    printf("%d\n", month);

    return 0;
}

7-9 计算阶乘和

#include<stdio.h>

int main()
{
    int n,i=1,sum=0,j=1,temp=1;
    scanf("%d",&n);
    for(;i<=n;i++)
    {
        temp=1;
        for(j=1;j<=i;j++)
        {
            temp*=j;
        }
        sum+=temp;
    }
    printf("%d",sum);
}

7-10 猴子吃桃问题

#include<stdio.h>

int main()
{
    int n,sum=0,temp=1;//temp为第一天的苹果，倒着算好算一些
    scanf("%d",&n);
    for(;n>1;n--)
    {
        sum=(temp+1)*2;
        temp=sum;//获取下一天的个数
    }
    printf("%d",sum);
    return 0;
}

7-11 求1到100的和

#include<stdio.h>
int main()
{
    int i=1,sum=0;
    for(;i<=100;i++)
    {
        sum+=i;
    }
    printf("sum = %d",sum);
}

7-12 韩信点兵

#include<stdio.h>

int main()
{
    int sum=1;
    while(sum%5!=1||sum%6!=5||sum%7!=4||sum%11!=10)//就是一群士兵按照不同进制进行报数
    {
        sum++;
    }
    printf("%d",sum);
    return 0;
}

//可以直接printf("2111");

7-13 找出一批学生的最高分

#include <stdio.h>

int main() {
    int score;
    int maxScore = 0; // 最高分的初始值设为0

    while (scanf("%d", &score) && score >= 0) //while里面写个语句也是可以的，这样还简单一些如果不想就把括号里的scanf写到大括号里就可以啦
    {
        if (score > maxScore) 
        {
            maxScore = score; // 如果输入的整数大于当前最高分，则更新最高分的值
        }
    }

    printf("%d\n", maxScore);

    return 0;
}
//不能直接开数组，pta过不去

7-14 百鸡问题扩展-N鸡问题

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

int main() 
{
    int n, son = 0, male = 0, female = 0, count = 0, sum_male = 0;
    scanf("%d", &n);
    int max_male = n / 5;
    for (male = 0; male <= max_male; male++) 
    {
        int m1 = n - male * 5;
        int max_female = m1 / 3;
        for (female = 0; female <= max_female; female++) 
        {
            int m2 = m1 - female * 3;
            int max_son = m2 * 3;
            for (son = 0; son <= max_son; son+=3) 
            {
                if ((male + female + son) == n&&(5*male+3*female+son/3)==n) 
                {
                    count++;
                    sum_male += male;
                }
            }
        }
    }
    if (count == 0)
        printf("0 -1\n");
    else
        printf("%d %d\n", count, sum_male);
    return 0;
}
//和抛硬币很像，方法一模一样

7-15 被7或17整除的偶数和

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

int main() 
{
    int n = 0, sum = 0,i;
    for (i = 14; i < 300; i += 2)
    {
        if (i % 7 == 0 || i % 17 == 0)
        {
            sum += i;
            printf("%6d", i);
            n++;
        }
        if (n / 5 ==1)
        {
            printf("\n");
            n=0;
        }
    }
    printf("\nsum=%d",sum);
    return 0;
}