CodeForces - 670A Holidays (模拟) 水

CodeForces - 670A Holidays Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Submit Status Description 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 Input 14 Output 4 4 Input 2 Output 0 2 Source Codeforces Round #350 (Div. 2) //题意： 给你一个数n，表示火星上一年的天数，火星上一年也是一周七天，五个工作日，两个节假日，问火星上一年最少休息几天，最多休息几天 //思路： 水题，直接模拟 #include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> using namespace std; int main() { int n,m,mm; int l,r,i,j; while(scanf("%d",&n)!=EOF) { if(n<2) { l=0;r=n; } else if(n<=5) { l=0;r=2; } else if(n<=7) { l=n-5;r=2; } else if(n>7) { m=n/7; m*=2; mm=n%7; if(mm<2) { l=m;r=m+mm; } else if(mm<=5) { l=m;r=m+2; } else if(mm<7) { l=m+mm-5;r=m+2; } } printf("%d %d\n",l,r); } return 0; }