美文网首页
CUC-SUMMER-9-A

CUC-SUMMER-9-A

作者: Nioge | 来源:发表于2017-08-16 23:43 被阅读0次
    A - Holidays
    Codeforces Round #350 (Div. 2)

    On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible number of days off per year on Mars.

    Input
    The first line of the input contains a positive integer n (1 ≤ n ≤ 1 000 000) — the number of days in a year on Mars.

    Output
    Print two integers — the minimum possible and the maximum possible number of days off per year on Mars.

    Example
    Input
    14
    Output
    4 4
    Input
    2
    Output
    0 2

    Note
    In the first sample there are 14 days in a year on Mars, and therefore independently of the day a year starts with there will be exactly 4 days off .

    In the second sample there are only 2 days in a year on Mars, and they can both be either work days or days off.


    题意:在火星上一周与地球相同,周一到周五为工作日,周六周日为周末,已知火星一年有x天,求周末最多和最少有几天

    解法:总天数除以7,余数分三种情况讨论,x<=2, 2<x<=5, 5<x

    代码:

    #include<iostream>
    using namespace std;
    int main()
    {
        int n,r,x,y;
        cin>>n;
        r=n%7;
        x=n/7*2;
        y=x;
        if(r<=2)
            y+=r;
        else if(r<=5)
            y+=2;
        else{
            y+=2;
            x+=r-5;
        }
        cout<<x<<" "<<y<<endl;
        return 0;
    }
    

    相关文章

      网友评论

          本文标题:CUC-SUMMER-9-A

          本文链接:https://www.haomeiwen.com/subject/klnwrxtx.html