Submission #1082166

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <fstream>
#include <string>
#include <map>
#include <queue>
#include <utility>
#include <stack>
#include <cstdio>
#include <cmath>
#include <iterator>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
using namespace std;

#define in cin
#define out cout

#define REP(i,n) for(int i=0; i<n; i++)
#define REP2(i,s,e) for(int i=s; i<e; i++)
#define REPE(i,s,e) for(int i=s; i<=e; i++)
#define REPR(i,s,e) for(int i=s; i>=e; i--)

#define all(v) v.begin(), v.end()
#define pb push_back

#define ll long long
#define pii pair<int, int>

#define x first
#define y second
#define intINF 2147483647
#define llINF 9223372036854775807LL
#define MOD 1000000007

// 1 2 3 4 5 // 6 7 8 9 10 11 // 12 13 14 15 16 //

int main()
{
    ll x; in >> x;
    ll r = 0;

    if(x > 0)
    {
        r += ((x-1) / 11)*2;
        x = (x-1+11)%11 + 1;

        if(x < 6) r += 1;
        else r += 2;
    }

    out << r << endl;

    return 0;
}

Submission Info

Judge Result