CodeForces 670A Holidays

Posted 2020-08-09 Fighting Heart

简单题。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-6;
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
template <class T>
inline void read(T &x)
{
    char c=getchar(); x=0;
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) {x=x*10+c-‘0‘; c=getchar();}
}

int n;

int main()
{
    scanf("%d",&n);
    int ans1=0,ans2=0;
    for(int i=1;i<=n;i++)
    {
        if(i%7==1||i%7==2) ans1++;
        if(i%7==6||i%7==0) ans2++;
    }
    printf("%d %d\n",ans2,ans1);

    return 0;
}