CodeForces 670A Holidays
Posted Calm微笑
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了CodeForces 670A Holidays相关的知识,希望对你有一定的参考价值。
K - Holidays Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescription
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.
Sample Input
Input14Output
4 4Input
2Output
0 2
题意;给你n天,5天为工作日,2天为休息日,问最多可以休息几天,最少可以休息几天
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
int n,min,max;
while(scanf("%d",&n)!=EOF)
min=0;
max=0;
if(n%7==0)
min=n/7*2;
max=n/7*2;
else
if(n%7==1)
max=n/7*2+1;
min=n/7*2;
else if(n%7>1&&n%7<=5)
max=n/7*2+2;
min=n/7*2;
else if(n%7==6)
max=n/7*2+2;
min=n/7*2+1;
printf("%d %d\\n",min,max);
return 0;
以上是关于CodeForces 670A Holidays的主要内容,如果未能解决你的问题,请参考以下文章
1-The INRIA Holidays dataset 数据集