23级新生第二次周赛

题目传送门

A

#include <stdio.h>

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

B

#include <stdio.h>

int main () {
    int x, y, z, n, m, cnt =0;
    scanf ("%d %d %d %d %d", &x, &y, &z, &n, &m);
    for (int i = 0; i <= m; i++) {//公鸡数
        for (int j = 0; j <= m - i; j++) {//母鸡数
            int k = m - i - j;//小鸡数
            if (i * x + j * y > n) break;
            if (k % z != 0) continue;
            if(i * x + y * j + k / z == n)
                cnt ++;
        }
    }
    printf ("%d", cnt);
    return 0;
}

C

#include <stdio.h>

int main () {
    int n;
    scanf ("%d", &n);
    if (n % 3 == 0)
        printf ("3 ");
    if (n % 5 == 0)
        printf ("5 ");
    if (n % 7 == 0)
        printf ("7");
    return 0;
}

D

#include <stdio.h>

int main () {
    // 1239
    // 9 > 1 + 2 + 3
    int x, cnt = 0;
    scanf ("%d", &x);
    for (int i = 0; i < x; i++) {
        int n;
        scanf ("%d", &n);
        int t = n % 10;//9
        n /= 10; // n =123
        int s = 0;
        while (n != 0) {
            s = s + n % 10;// s = 3, 5, 6;
            n = n / 10;
        }
        if (t > s)
            cnt++;
    }
    printf ("%d", cnt);
    return 0;
}

E

#include <stdio.h>

int main () {
    // 5
    // 16 -> 8 -> 4 -> 2 -> 1 ->End
    long long n;
    scanf ("%lld", &n);
    for (; n != 1;) {
        if (n % 2 == 1) {
            printf ("%lld*3+1=%lld\n", n, 3 * n + 1);
            n = n * 3 + 1;
        } else {
            printf ("%lld/2=%lld\n", n, n / 2);
            n = n / 2;
        }
    }
    printf ("End");
    return 0;
}

F

(数组做法) 拓展排序方法

#include <stdio.h>

int main () {
    int a[3];
    scanf ("%d %d %d", &a[0], &a[1], &a[2]);
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3 - i - 1; j++) {
            if (a[j + 1] < a[j]) {
                int t = a[j + 1];
                a[j + 1] = a[j];
                a[j] = t;
            }
        }
    }
    if (a[0] + a[1] > a[2] && a[2] - a[1] < a[0])
        printf ("1");
    else
        printf ("0");
    return 0;
}

#include <stdio.h>

int main () {
    int a, b, c;
    scanf ("%d%d%d", &a, &b, &c);
    if (a + b > c && a + c > b && b + c > a)
        printf ("1");
    else
        printf ("0");
    return 0;
}

G

#include <stdio.h>

int main () {
    int n, ans = 0;
    scanf ("%d", &n);
    for (int i = n; i >= 1; i--) {
        for (int j = i - 1; j >= 1; j--) {
            for (int k = j - 1; k >= 1; k--) {
                if (i * i == j * j + k * k) {
                    ans++;
                }
            }
        }
    }
    printf ("%d", ans);
    return 0;
}

H

#include <stdio.h>

int main () {
    int n;
    scanf ("%d", &n);
    if (n % 2 == 1)
        printf ("odd");
    else
        printf ("even");
    return 0;
}

I

#include <stdio.h>
#include <math.h>
int a[1005], b[1005];
int main () {
    int n;
    scanf ("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf ("%d", &a[i]);
    }
    for (int i = 0; i < n - 1; i++) {
        int s = abs (a[i + 1] - a[i]);
        if (s <= 1000) {
            b[s] = 1;
        }
    }
    for (int i = 1; i < n; i++) {
        if (b[i] == 0) {
            printf ("Not jolly");
            return 0;
        }
    }
    printf ("Jolly");
    return 0;
}

J

#include <stdio.h>
int main () {
    double a;
    scanf ("%lf", &a);
    printf ("%lld", (long long) a);
    return 0;
}

K

#include <stdio.h>

int main () {
    int n;
    scanf ("%d", &n);
    for (int i = 2;; i++) {
        int f = 1;
        for (int j = 2; j <= i / j; j++) {
            if (i % j == 0) {
                f = 0;
                break;
            }
        }
        if (f == 1) n--;
        if (n == 0) {
            printf ("%d", i);
            return 0;
        }
    }
    return 0;
}