《算法笔记》3.1小节——入门模拟-＞简单模拟

问题 A: 剩下的树

#include <cstdio>

int main() {
    int m, n,x,y,z = 0;
    
    int L[10000] = { 0 };
    while (scanf("%d %d",&m,&n) != EOF) {
        if (m == 0&&n==0)break;
        for (int i = 0; i <=m; i++) { L[i] = 1;}
        for (int i = 0; i < n; i++) {
            scanf("%d %d",&x, &y);
            for (int j = x; j <= y; j++) { L[j] = 0; }
        }
        for (int i = 0; i <= m; i++) {
            z = z + L[i];
        }
        printf("%d\n", z);
        z = 0;
    }

    return 0;

}

问题 B: A+B

#include <cstdio>
#include <cstring>

int divert(char a[15]) {
    char temp[15];
    int A,n,z=0,x=0;
    n = strlen(a);
    if(a[0]=='-'){
        x = 1;
        for (int i = 1; i < n; i++) {
            if (a[i] != ',') { temp[z] = a[i]; z++; }
        }
    }
    else {
        for (int i = 0; i < n; i++) {
            if (a[i] != ',') { temp[z] = a[i]; z++; }
        }
    }
    temp[z] = '\0';
    strcpy(a, temp);
    sscanf(a, "%d", &A); 
    if (x == 1)return -1 * A;
    else return A;
    
}
int main() {
    char A[15], B[15];
    int a, b;
    while (~scanf("%s %s", A, B)) {
        a = divert(A);
        b = divert(B);
        printf("%d\n", a + b);
    }
    return 0;

}

问题 C: 特殊乘法

#include <cstdio>
#include <cstring>
#include <cmath>

int divert(int A,int a[]) {
    int count=0,x = 1;
    while (((A / x) != 0) && ((A % x )<= x)) {
        x *= 10;
        count++;
    }
    for (int i = 0; i <= count - 1; i++) {
        a[i] = A / (int)pow(10, count - 1-i);
        A = A %(int)pow(10, count - 1-i);
    }
    return count;
}

int funmulti(int a[], int n1, int b[], int n2) {
    int sum = 0;
    for (int i = 0; i < n1; i++) {
        for (int j = 0; j < n2; j++) {
            sum = sum + a[i] * b[j];
        }
    }
    return sum;
}
    

int main() {
    int A, B,n1,n2,sum;
    int a[15],b[15];
    while(~scanf("%d %d", &A,&B)){
       n1 = divert(A, a);
       n2 = divert(B, b);
       sum = funmulti(a, n1, b, n2);
       printf("%d\n", sum);
    }
    return 0;

}

问题 D: 比较奇偶数个数

#include <cstdio>
#include <cstring>
#include <cmath>

bool judge(int a) {
    if (a % 2 == 0)return true;
    else return false;
}


int main() {
    int n, a,x,y;
    while (~scanf("%d", &n)) {
        x = 0; y = 0;
        for (int i = 0; i < n; i++) {
            scanf("%d", &a);
            if (judge(a))x++;
            else y++;
        }
        if (x > y)printf("NO\n");
        else printf("YES\n");
    }
    return 0;

}

问题 E: Shortest Distance (20)

#include <cstdio>
#include <cmath>
void swap(int &a, int &b) {
    int temp;
    temp = a;
    a = b;
    b = temp;
}

int main() {
    int n, m, x, y, sum = 0, d = 0;
    scanf("%d", &n);
    int a[100000],b[100000];
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        sum = sum + a[i];
        if (i == 1) { b[i] = 0; b[i + 1] = a[i]; }
        else b[i+1] = b[i] + a[i];
    }
    scanf("%d", &m);
    for (int i = 0; i < m; i++) {
        scanf("%d %d", &x, &y);
        d = fabs(b[x] - b[y]);
        if (d < (sum - d))printf("%d\n", d);
        else printf("%d\n", sum - d);
    }
    return 0;

}

问题 F: A+B和C (15)

#include <cstdio>

bool judge(long long a, long long b, long long c) {
    if ((a + b) > c)return true;
    else return false;
}

int main() {
    int n;
    long long a, b, c;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%lld %lld %lld", &a, &b, &c);
        if (judge(a, b, c))printf("Case #%d: true\n", i + 1);
        else printf("Case #%d: false\n", i + 1);
    }
    return 0;

}

问题 G: 数字分类 (20)

#include <cstdio>
#include <cmath>

int main() {
    int n, temp;
    double s = 0;
    int a[5] = { 0 };
    int t[5] = { 0 };
    while (~scanf("%d", &n)) {
        for (int i=0; i < n; i++) {
            scanf("%d", &temp);
            if (temp % 5 == 0 && temp % 2 == 0) { a[0] += temp; t[0]++; }
            else if (temp % 5 == 1) { a[1] += temp * (int)pow(-1.0, t[1]); t[1]++; }
            else if (temp % 5 == 2) { a[2]++; t[2]++; }
            else if (temp % 5 == 3) { s += temp; t[3]++; }
            else if(temp%5 ==4) {
                if (a[4] < temp) a[4] = temp;
                t[4]++;
            }
        }

        for (int i = 0; i < 5; i++) {
            if (i != 4) {
                if (i != 3) {
                    if (t[i] == 0)printf("N ");
                    else printf("%d ", a[i]);
                }
                else {
                    if (t[i] == 0)printf("N ");
                    else printf("%.1f ", s/t[i]);
                }
            }
            else {
                if (t[i] == 0)printf("N\n");
                else printf("%d\n", a[i]);
            }
            a[i] = 0;
            t[i] = 0;
        }
    }
    return 0;

}

问题 H: 部分A+B (15)

#include <cstdio>
#include <cstring>

int opearate(char a[], char da) {
    int n,k = 0,x =0,t;
    n = strlen(a);
    for (int i = 0; i < n; i++) {
        if (a[i] == da)k++;
    }
    if (k != 0) {
        t = da - '0';
        x = t;
        for (int i = 1; i < k; i++) {
            x = x * 10 + t;
        }
    }
    return x;
}
int main() {
    char a[15], b[15];
    char da, db;
    while (~scanf("%s %c %s %c", a, &da, b, &db)) {


    printf("%d\n", opearate(a, da) + opearate(b, db));
}
    return 0;

}

问题 I: 锤子剪刀布 (20)

#include <cstdio>


int main() {

    int n;
    char a, b;
    int x[6] = { 0 }, y[6] = { 0 };
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        getchar();
        scanf("%c %c", &a, &b);
        if (a == b) { x[1]++; y[1]++; }
        else if (((a == 'C' && b == 'J') )|| ((a == 'J') && (b == 'B') )||( (a == 'B') && (b == 'C'))) {
            x[0]++; y[2]++;
            if (a == 'B')x[3]++;
            else if (a == 'C')x[4]++;
            else x[5]++;
        }
        else {
            x[2]++; y[0]++;
            if (b == 'B')y[3]++;
            else if (b == 'C')y[4]++;
            else y[5]++;
        }
    }
    printf("%d %d %d\n", x[0], x[1], x[2]);
    printf("%d %d %d\n", y[0], y[1], y[2]);
    if (x[3] >= x[4] && x[3] >= x[5])printf("B");
    else if(x[4] >= x[5])printf("C");
    else printf("J");
    if (y[3] >= y[4] && y[3] >= y[5])printf(" B\n");
    else if (y[4] >= y[5])printf(" C\n");
    else printf(" J\n");
    return 0;

}