Go: package main

import "fmt"

func main() {
	var A, B, C int
	fmt.Scan(&A, &B, &C)
	weekly := 7*A + B
	weeks := C / weekly
	tmp := C % weekly
	if tmp > 7*A {
		fmt.Println(weeks*7 + 7)
	} else {
		fmt.Println(weeks*7 + (tmp+(A-1))/A)
	}
}

C++: #include <bits/stdc++.h>

#define INF (2e9)
#define FOR(i, a, b) for (ll (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)

using namespace std;

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ld = long double;

#define ALL(x) (x).begin(), (x).end()
template<class T>
using vc = vector<T>;
using vi = vc<ll>;
using vvi = vc<vi>;

template<class T>
using va = valarray<T>;
using vad = va<ld>;
using vai = va<ll>;

using pii = pair<ll, ll>;

vi Read(ll n) {
    auto      v = vi(n);
    for (auto i = std::size_t(0); i < n; ++i) {
        cin >> v[i];
    }
    return v;
}

template<class T>
void DumpRow(const T& A) {
    for (const auto& value : A)
        cout << value << "\n";
}

template<class T>
void DumpColumn(const T& A) {
    auto isFirst = true;
    for (const auto& value : A) {
        if (isFirst) {
            cout << value;
            isFirst = false;
        } else {
            cout << " " << value;
        }

    }
    cout << endl;
}

ll SmallerThanWeekP(ll a, ll b, ll c) {
    //if (c <= a) return 1;
    if (7 * a < c) return 7;
    else if (c % a != 0) return ll(c / a) + 1;
    else return c / a;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(20) << fixed;

    ll a, b, c;

    cin >> a >> b >> c;

    const auto week_p = 7 * a + b;

    ll ans = 0;
    if (week_p >= c) {
        ans = SmallerThanWeekP(a, b, c);
    } else {
        ans = ll(c / week_p) * 7;
        const auto rest = c % week_p;
        if (rest != 0) ans += SmallerThanWeekP(a, b, rest);
    }
    cout << ans << endl;
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(void){
  int A, B, C;
  cin >> A >> B >> C;
  int login = 0, cnt = 0;
  while(1){
    cnt++;
    login += A;
    if(cnt % 7 == 0)
      login += B;
    if(login >= C)
      break;
  }
  cout << cnt << "\n";
  return 0;
}

C++: #include<iostream>
using namespace std;

int main()
{
	int a, b, c;
	cin >> a >> b >> c;
	int cnt = 0;
	int tt = 0;
	while (cnt < c) {
		cnt += a;
		tt++;
		if (tt % 7 == 0) cnt += b;
	}
	cout << tt << endl;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);

  int a, b, c;
  cin >> a >> b >> c;

  int day = 0;
  int coins = 0;

  while (coins < c) {
    day++;
    coins += a;
    if (day % 7 == 0) {
      coins += b;
    }
  }

  cout << day << endl;
}

C++: #include <iostream>
using namespace std;
int main (void){
    int a,b,c;
    int now_point   =0;
    int day         =0;
    cin >> a >> b >> c;
    for (;now_point < c;){
        day++;
        now_point+=a;
        if (day % 7 == 0) now_point +=b;
    }
    cout << day << endl;
    return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
  int a, b, c;
  int coins_per_week;
  int residue_coins;
  int weeks, days;
  
  cin >> a >> b >> c;

  coins_per_week = a * 7 + b;
  weeks = c / coins_per_week;
  residue_coins = c % coins_per_week;

  if (residue_coins >= a * 7) {
    days = 7;
  } else if (!(residue_coins % a)) {
    days = residue_coins / a;
  } else {
    days = residue_coins / a + 1;
  }
  cout << days + weeks * 7 << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
    int a,b,c;
    cin>>a>>b>>c;
    for(int i=1,tmp=0;;i++){
        tmp+=a;
        if(i%7==0)
            tmp+=b;
        if(tmp>=c){
            cout<<i<<endl;
            return 0;
        }
    }
}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {

	int a, b, c;
	cin >> a >> b >> c;
	
	int counter = 0;
	while (c > 0) {
		counter++;
		c -= a;
		if (counter != 0 && counter % 7 == 0) { c -= b; }

	}
	cout << counter << endl;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;

template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T& t, const V& v) { t = v; }
template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T& t, const V& v) {
	for (auto& e : t) fill_v(e, v);
}


#define ARRAY_MAX 105
const int INF = 1e9 + 7;



int main() {

	int a, b, c;
	cin >> a >> b >> c;

	int ans = 7 * (c / (7 * a + b));
	//cout << a << " " << b << " " << c << endl;
	c -= (7 * a + b) * (c / (7 * a + b));
	
	//cout << c << endl;
	ans += (c - 1) / a + 1;

	cout << ans << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main (){
  int A,B,C,X;
  int i=0;
  cin>>A>>B>>C;
    while(C>X){
      i++;
 if(i%7==0){
   X=X+(A+B);
 }else{
  X=X+A; 
 }  
  
}
cout<<i<<endl;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;

int main()
{
	int a, b, c, count=0, sum = 0, day = 0;

	cin >> a >> b >> c;

	while (sum < c) {
		sum += a;
		count++;
		day++;
		if (count == 7) {
			sum += b;
			count = 0;
		}
	}

	cout << day << endl;

	return 0;
}

C++: #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9+7;



int main(){
  int a, b, c;
  cin >> a >> b >> c;
  int sum = 0;
  int cnt = 1;
  while(1){
    sum += a;
    if(cnt%7 == 0) sum += b;
    if(sum >= c) break;
    cnt++;
  }

  cout << cnt << endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
   int a,b,c,coin,day;
   coin=0;
   day=0;
   cin>>a>>b>>c;
   while(1){
       if(coin>=c){
           break;
       }
       coin=coin+a;
       day=day+1;
       if(day%7==0){
           coin=coin+b;
       }
   }
   cout<<day<<endl;
}

C++: #include <iostream>
#include <math.h>
#include <bits/stdc++.h>

using namespace std;

int main(){
    int a,b,c;
    cin>>a>>b>>c;
    int ans=0;
    int money=0;
    
    while(money<c){
        ans++;
        money+=a;
        if(ans%7==0 && ans!=0) money+=b;
    }
    
    cout<<ans<<endl;
    
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int a,b,c,x,y,cnt;
int main(){
  cin>>a>>b>>c;
  x=7*a+b;
  cnt+=c/x*7;
  y=c%x;
  if(y>0)cnt+=min((y-1+a)/a,7);
  cout<<cnt<<endl;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef pair<int,int> P;

#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define all(x) x.begin(),x.end()

const ll mod = 1e9+7;
const ll INF = 1e9;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int main()
{
	int a,b,c;
	cin>>a>>b>>c;
	int d=0;
	while(c>0){
		d++;
		c-=a;
		if(d%7==0)c-=b;
	}
	cout<<d<<endl;
	return 0;
}