c语言作业5

#include <stdio.h>

double power(double x, int n) {
    double result = 1.0;
    int abs_n = n < 0 ? -n : n;
    
    for (int i = 0; i < abs_n; i++) {
        result *= x;
    }
    
    return n < 0 ? 1.0 / result : result;
}

int main() {
    int n;
    double x;
    scanf("%d %lf", &n, &x);
    printf("%.2f\n", power(x, n));
    return 0;
}

#include <stdio.h>

double power(double x, int n) {
    if (n == 0) {
        return 1.0;
    }
    else if (n == 1) {
        return x;
    }   
    else if (n < 0) {
        return 1.0 / power(x, -n);
    }
    else {
        return x * power(x, n - 1);
    }
}

int main() {
    int n;
    double x;
    scanf("%d %lf", &n, &x);
    printf("%.2f\n", power(x, n));
    return 0;
}

#include <stdio.h>

const int denominations[] = {5000, 2000, 1000, 500, 200, 100, 50, 20, 10};
const char* names[] = {"50元", "20元", "10元", "5元", "2元", "1元", "5角", "2角", "1角"};
const int deno_count = 9;

void change(double m, double c) {
    int price = (int)(m * 100 + 0.5);  
    int payment = (int)(c * 100 + 0.5); 
    int change = payment - price;       
    
    int total_count = 0; 
    int count[deno_count] = {0}; 
    
    for (int i = 0; i < deno_count; i++) {
        if (change >= denominations[i]) {
            count[i] = change / denominations[i];
            change = change % denominations[i];
            total_count += count[i];
        }
    }
    for (int i = 0; i < deno_count; i++) {
        printf("%s:%d\n", names[i], count[i]);
    }
    printf("找零 %d 张！\n", total_count);
}

int main() {
    double m, c;
    scanf("%lf %lf", &m, &c);
    change(m, c);
    return 0;
}

#include <stdio.h>

int gcd(int a, int b) {
    while (b != 0) {
        int temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}

int main() {
    int N;
    scanf("%d", &N);
    
    int friend_count = 0;
    for (int i = 1; i < N; i++) {
        if (gcd(i, N) == 1) {
            friend_count++;
        }
    }
    
    printf("%d\n", friend_count);
    return 0;
}

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


int isPrime(int n, int i) {
    if (n <= 1) {
        return 0;
    }
    if (n == 2) {
        return 1;
    }
    if (i > sqrt(n)) {
        return 1;
    }
    if (n % i == 0) {
        return 0;
    }
    return isPrime(n, i + 1);
}

int prime(int n) {
    return isPrime(n, 2);
}

int main() {
    int n;
    scanf("%d", &n);
    printf("%d\n", prime(n));
    return 0;
}

#include <stdio.h>

int getAge(int k) {
    if (k == 1) {
        return 10;
    }
    return getAge(k - 1) + 2;
}

int main() {
    printf("%d\n", getAge(5));
    return 0;
}

#include <stdio.h>

int huiwen(long n) {
    long original = n;
    long reversed = 0;
    if (n == 0) {
        return 1;
    }
   while (n > 0) {
        reversed = reversed * 10 + n % 10;
        n = n / 10;
    }
    return original == reversed ? 1 : 0;
}

int main() {
    printf("300以内的所有的对称回文数:");
    for (int i = 1; i <= 300; i++) {
        long square = (long)i * i;
        if (huiwen(i) && huiwen(square)) {
            printf(" %d", i);
        }
    }
    printf("\n");
    return 0;
}