CSP历年第一题代码

202212-1

现值计算

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<math.h>
#include<iostream>
using namespace std;

int main() {
    int n;
    double i, sum = 0;
    double num[60];
    cin >> n >> i;
    for (int t = 0; t <= n; t++)
        scanf("%lf", &num[t]);
    sum = num[0];
    for (int t = 1; t <= n; t++)
        sum += num[t] * pow((1 + i), -t);
    printf("%.3f", sum);
    return 0;
}

202206-1

归一化处理

#include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;

int main() {
    int n;
    double num[1005], temp;
    double sum = 0, a = 0, D = 0;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> num[i];
        sum += num[i];
    }
    a = sum / n;
    for (int i = 1; i <= n; i++)
        D += pow(num[i] - a, 2) / n;
    for (int i = 1; i <= n; i++)
    {
        temp = (num[i] - a) / (sqrt(D));
        printf("%f\n", temp);
    }
    return 0;
}

202203-1

未初始化警告

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int num[100005][2], s[100005] = { 0 };

int main() {
    int n, k, count = 0;
    s[0] = 1;
    scanf("%d %d", &n, &k);
    for (int i = 0; i < k; i++)
        scanf("%d %d", &num[i][0], &num[i][1]);
    for (int i = 0; i < k; i++)
    {
        if (!s[num[i][1]])
            count++;
        s[num[i][0]] = 1;
    }
    printf("%d", count);
    return 0;
}

202209-1

如此编码

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>

int main() {
    int n, m;
    int a[25], c[25], mmod[25];
    c[0] = 1;
    mmod[0] = 0;
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        c[i] = a[i] * c[i - 1];
        mmod[i] = m % c[i];
    }
    for (int i = 1; i <= n; i++)
        printf("%d ", (mmod[i] - mmod[i - 1]) / c[i - 1]);
    return 0;
}

202109-1

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int main() {
    int n;
    scanf("%d", &n);
    int max = 0, min = 0;
    int temp = -1;
    int B[105];
    for (int i = 1; i <= n; i++)
        scanf("%d", &B[i]);
    for (int i = 1; i <= n; i++)
        max += B[i];
    for (int i = 1; i <= n; i++)
    {
        if (temp != B[i])
        {
            temp = B[i];
            min += B[i];
        }
    }
    printf("%d\n%d", max, min);
    return 0;
}

202104-1

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int A[505][505];
int L[130] = { 0 };

int main() {
    int n, m, l;
    scanf("%d %d %d", &n, &m, &l);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            scanf("%d", &A[i][j]);
            L[A[i][j]]++;
        }
    for (int i = 0; i < l; i++)
        printf("%d ", L[i]);
    return 0;
}

202012-1

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int main() {
    int n;
    int w[100005], s[100005];
    int relu = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d %d", &w[i], &s[i]);
    for (int i = 1; i <= n; i++)
        relu += w[i] * s[i];
    if (relu < 0)
        relu = 0;
    printf("%d", relu);
    return 0;
}

202009-1

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

int main() {
    int n, X, Y;
    int x[205], y[205];
    int near[4] = { 0 };
    double dist[4] = { 9999999,9999999,9999999,9999999 };
    double temp;
    scanf("%d %d %d", &n, &X, &Y);
    for (int i = 1; i <= n; i++)
        scanf("%d %d", &x[i], &y[i]);
    for (int i = 1; i <= n; i++)
    {
        temp = pow(X - x[i], 2) + pow(Y - y[i], 2);
        if (temp < dist[1])
        {
            dist[3] = dist[2];
            dist[2] = dist[1];
            dist[1] = temp;
            near[3] = near[2];
            near[2] = near[1];
            near[1] = i;
        }
        else if (temp < dist[2])
        {
            dist[3] = dist[2];
            dist[2] = temp;
            near[3] = near[2];
            near[2] = i;
        }
        else if (temp < dist[3])
        {
            dist[3] = temp;
            near[3] = i;
        }
    }
    printf("%d\n%d\n%d", near[1], near[2], near[3]);
    return 0;
}

201912-1

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>

int process(int n) {
    int temp, flag = 0;
    while (n) {
        temp = n % 10;
        if (temp == 7)
        {
            flag = 1;
            break;
        }
        n /= 10;
    }
    return flag;
}

int main() {
    int n;
    int count = 0;
    scanf("%d", &n);
    int s[5] = { 0 };
    for (int i = 1; ; i++)
    {
        count++;
        if (i % 4 == 1)
        {
            if (i % 7 == 0 || process(i))
            {
                s[1]++;
                count--;
            }
        }
        else if (i % 4 == 2)
        {
            if (i % 7 == 0 || process(i))
            {
                s[2]++;
                count--;
            }
        }
        else if (i % 4 == 3)
        {
            if (i % 7 == 0 || process(i))
            {
                s[3]++;
                count--;
            }
        }
        else
        {
            if (i % 7 == 0 || process(i))
            {
                s[4]++;
                count--;
            }
        }
        if (count == n)
            break;
    }
    for (int i = 1; i <= 4; i++)
        printf("%d\n", s[i]);
    return 0;
}

201909-1

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<iostream>
#include <math.h>
using namespace std;

int a[1005][1005] = { 0 };

int main() {
    int n, m;
    int max = -1, maxpos = -1;
    int tota = 0, totb = 0;
    cin >> n >> m;
    int tot[1005] = { 0 };
    for (int i = 1; i <= n; i++)
        for (int j = 0; j <= m; j++)
            cin >> a[i][j];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            tot[i] += abs(a[i][j]);
    for (int i = 1; i <= n; i++)
    {
        if (tot[i] > max)
        {
            max = tot[i];
            maxpos = i;
        }
        tota += a[i][0];
        totb += tot[i];
    }
    cout << tota - totb << " " << maxpos << " " << max;
    return 0;
}