201509-1,201509-2

//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-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;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值