Submission #5546847

---

Source Code Expand

#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define SORTD(a) sort(a.rbegin(), a.rend());
#define UNIQUE(a) unique(a.begin(), a.end())
#define ll long long
#define INF 1000000000000000000
#define INT_MAX 2147483647

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <numeric>
#include <algorithm>
#include <queue>
#include <set>
#include <utility>
#include <ios>
#include <iomanip>

using namespace std;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;


int main() {
	ll x;
	cin >> x;
	ll ans = floor(x / 11) * 2;
	ll mod = x % 11;
	if (mod > 0 && mod <= 6) {
		ans += 1;
	}
	else if (mod > 6) {
		ans += 2;
	}

	cout << ans << endl;

}

Submission Info

Judge Result