Submission #1178479

---

Source Code Expand

#include<iostream>
#include<vector>
#include<math.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi > vvi;

#define pb push_back
#define mod 1000000007
#define rep(n) for(int i = 0; i < n; i++)
#define drep(n) for(int i = n; i >= 0; i--)
#define For(n, m) for(int i = n; i < m; i++)
#define dfor(n, m) for(int i = n; i >= m; i--)
#define out(n) cout << n << endl;
#define vout(a) for(int i = 0; i < a.size(); i++) COUT(a[i])
#define aout(a) for(int i = 0; i < a.length(); i++) COUT(a[i])
#define sort(a) for(int i = 0; i < a.size() - 1; i++) for(int j = 0; j < a.size() - i - 1; j++) if(a[j] > a[j + 1]) swap(a[j], a[j + 1]);
#define dsort(a) for(int i = 0; i < a.size() - 1; i++) for(int j = 0; j < a.size() - i - 1; j++) if(a[j] < a[j + 1]) swap(a[j], a[j + 1]);

int main() {
  ll a, b, c;
  cin >> a;

  b = a / 11;
  c = a % 11;

  out(b * 2 + (c <= 6 ? 1 : 2));
}

Submission Info

Judge Result