11.7 C语言作业

#include<stdio.h>
int main()
{
	int i;
	int n=0;
	int isprime = 1;
	scanf_s("%d", &n);
	for (i = 2; i < n; i++) {
		if (n% i == 0) {
			isprime = 0;
			break;
		}
		
	}
	if (isprime == 1) {
		printf("Yes,%d is prime",n);
	}
	else if (isprime == 0) {
		printf("NO,%d not a prime",n);
	}
	return 0;
}

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

#include <stdio.h>

int main() {
    int x, i;

    for (x = 1; x <= 100000; x++) {
        int found1 = 0, found2 = 0;
        for (i = 1; i * i <= x + 100; i++) {
            if (i * i == x + 100) {
                found1 = 1;
                break;
            }
        }
        if (found1) {
            for (i = 1; i * i <= x + 268; i++) {
                if (i * i == x + 268) {
                    found2 = 1;
                    break;
                }
            }
        }
        if (found1 && found2) {
            printf("%d\n", x);
        }
    }

    return 0;
}

#include <stdio.h>

int isPrime(int n) {
    int i;
    if (n < 2) return 0;  
    for (i = 2; i < n; i++) {
        if (n % i == 0) {
            return 0;  
        }
    }
    return 1;  
}
int powerOfTwo(int p) {
    int result = 1;
    int i;
    for (i = 0; i < p; i++) {
        result = result * 2;
    }
    return result;
}
int main() {
    int count = 0;  
    int p = 2;      
    int found = 0;  
    printf("前5个莫尼森数：\n");
    while (found < 5) {
        
        if (isPrime(p)) {
            
            int M = powerOfTwo(p) - 1;
            if (isPrime(M)) {
                printf("%d\n", M);  
                found++;            
            }
        }
        p++; 
    }

    return 0;
}

#include <stdio.h>

int main() {
    double scores[10];
    double sum = 0;
    double max = 0, min = 100;
    printf("请输入10个分数（1-100）：");
    for (int i = 0; i < 10; i++) {
        scanf_s("%lf", &scores[i]);
        sum += scores[i];
        if (scores[i] > max) max = scores[i];
        if (scores[i] < min) min = scores[i];
    }
    double final_score = (sum - max - min) / 8;
    printf("选手最后得分：%.2f\n", final_score);

    return 0;
}

#include <stdio.h>

int main() {
    int count = 0;  
    int x, y, z;    
    for (z = 0; z <= 20; z++) {        
        for (y = 0; y <= 50; y++) {    
            for (x = 0; x <= 100; x++) { 
                if (x + 2 * y + 5 * z == 100) {
                    count++;  
                }
            }
        }
    }

    printf("共有%d种不同的换法\n", count);

    return 0;
}

#include<stdio.h>
int main() {
	int day = 10;
	int peach = 1;
	int i ;
	for (i = day - 1; i >= 1; i--) {
		peach = (peach + 1) * 2;
	}
	printf("第一天摘了%d个桃", peach);
	return 0;
}