NOIP 2016普及组复赛C/C++详细题解报告

#include <iostream>
#include <climits>
#include <cstdio>
using namespace std;

int main()
{
    freopen(".\\pencil.in", "r", stdin);
    freopen(".\\pencil.out", "w", stdout);

    int n;
    cin >> n;
    int c[3], p[3];
    int ans;
    int mn = INT_MAX;
    for(int i = 0; i < 3; i++)
    {
        cin >> c[i] >> p[i];
        ans = (n / c[i]) * p[i];

        // 如果不能整除还要再来一包
        if(n % c[i])
        {
            ans += p[i];
        }

        if(ans < mn)
        {
            mn = ans;
        }
    }

    cout << mn << endl;

    return 0;
}

#include<iostream>
using namespace std;
int main()
{
    freopen(".\\date.in", "r", stdin);
    freopen(".\\date.out", "w", stdout);

    // date对应日期,m-月倒置后的数值,d-日倒置后的数值
    long m, d, t, date, date1, date2, sum = 0;
    long mon[13] = {0,31,29,31,30,31,30,31,31,30,31,30,31};
     cin >> date1 >> date2;//输入起始结束日期

    for(int i = 1; i <= 12; i++)
    {
        m = i % 10 * 10 + i / 10;//1-12月份倒置之后的值
        t = mon[i];
        for(int j = 1; j <= t; j++)
        {
            d = j % 10 * 10 + j / 10;//1-t日倒置之后的值
            date = (d * 100 + m) * 10000 + i * 100 + j;//对应回文的日期
            if(date >= date1 && date <= date2)
            {
                sum++;//判断这个日期在不在查询范围内
            }
        }
    }

    cout << sum << endl;

     return 0;
}