Submission #2544574

---

Source Code Expand

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;
#define EPS (1e-7)
#define DEF (1e+9 + 7)

#define SORT(c) sort((c).begin(),(c).end())
#define ANS(ans) cout<<(ans)<<endl;
typedef vector<int> VI;


//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n)  for (int i = 0; i < (n); ++i)





int main() {
	long long x = 1;
	long long ans;

	cin >> x;

	ans = x / 11 * 2;
	int i;
	i = x - 11 * ans / 2;
	if (i >= 7 && i <= 10) {
		ans += 2;
	}
	else if (i >= 1 && i <= 6) {
		ans++;
	}
	cout << ans << endl;


	return 0;
}

Submission Info

Judge Result