201509-1(数列分段),201509-2(日期计算)

最新推荐文章于 2022-03-15 20:13:14 发布

xiaozhou163

最新推荐文章于 2022-03-15 20:13:14 发布

阅读量120

点赞数

本文链接：https://blog.csdn.net/xiaozhou163/article/details/105843040

版权

//201509-1
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    scanf("%d", &n);

    int arr[n];
    for (int i = 0; i < n; i++)
        scanf("%d", &arr[i]);

    int count = 1;
    for (int i = 1; i < n; i++)
        if (arr[i] != arr[i - 1])
            count++;

    printf("%d\n", count);
    return 0;
}

//201509-1
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, num;
    scanf("%d", &n);
    int res = 0, pre = -1;
    while (n--) {
        scanf("%d", &num);
        if (num != pre)
            pre = num, res++;
    }
    printf("%d\n", res);
    return 0;
}

//201509-2
#include <bits/stdc++.h>

using namespace std;

int main() {
    int year, day;
    scanf("%d%d", &year, &day);
    if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0) {
        int arr1[12] = {31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366};
        for (int i = 0; i < 12; i++)
            if (arr1[i] == day) {
                printf("%d\n", i + 1);
                switch (i) {
                    case 0:
                        printf("31");
                        break;
                    case 1:
                        printf("29");
                        break;
                    case 2:
                        printf("31");
                        break;
                    case 3:
                        printf("30");
                        break;
                    case 4:
                        printf("31");
                        break;
                    case 5:
                        printf("30");
                        break;
                    case 6:
                        printf("31");
                        break;
                    case 7:
                        printf("31");
                        break;
                    case 8:
                        printf("30");
                        break;
                    case 9:
                        printf("31");
                        break;
                    case 10:
                        printf("30");
                        break;
                    case 11:
                        printf("31");
                        break;
                }
                return 0;
            }
        for (int i = 0; i < 12; i++) {
            if (arr1[i] > day) {
                printf("%d\n%d", i + 1, day - arr1[i - 1]);
                return 0;
            }
        }
    } else {
        int arr2[12] = {31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365};
        for (int i = 0; i < 12; i++)
            if (arr2[i] == day) {
                printf("%d\n", i + 1);
                switch (i) {
                    case 0:
                        printf("31");
                        break;
                    case 1:
                        printf("29");
                        break;
                    case 2:
                        printf("31");
                        break;
                    case 3:
                        printf("30");
                        break;
                    case 4:
                        printf("31");
                        break;
                    case 5:
                        printf("30");
                        break;
                    case 6:
                        printf("31");
                        break;
                    case 7:
                        printf("31");
                        break;
                    case 8:
                        printf("30");
                        break;
                    case 9:
                        printf("31");
                        break;
                    case 10:
                        printf("30");
                        break;
                    case 11:
                        printf("31");
                        break;
                }
                return 0;
            }
        for (int i = 0; i < 12; i++) {
            if (arr2[i] > day) {
                printf("%d\n%d", i + 1, day - arr2[i - 1]);
                return 0;
            }
        }
    }
    return 0;
}

//201509-2
#include <bits/stdc++.h>

using namespace std;

int main() {
    int y, d;
    scanf("%d%d", &y, &d);
    vector<int> v{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    if ((y % 4 == 0 && y % 100 != 0) || y % 400 == 0) v[1] = 29;
    int num = 0;
    int month;
    for (int i = 0; i < v.size(); i++)
        if (d > num + v[i])
            num += v[i];
        else {
            month = i + 1;
            break;
        }
    printf("%d\n%d\n", month, d - num);
    return 0;
}