Go: package main

import (
	"fmt"
	"strings"
	"bufio"
	"os"
	// "reflect"
	"strconv"
)

func oneLineInt(s string) []int {
	temp := strings.Split(s, " ")
	// fmt.Println(len(temp))
	ints := []int{}
	for _, elem := range(temp) {
		int_elem, _ := strconv.Atoi(elem)
		ints = append(ints, int_elem)
	}
	return ints
}

func coinCount(ints []int) int {
	cons := ints[0]
	bonus := ints[1]
	target := ints[2]
	count := 0
	day := 0
	var dc int
	for day_count, _ := range(make([]int, target)) {
		day++
		if day % 7 == 0 {
			count += bonus
		}
		count += cons
		if count >= target {
			dc = day_count + 1
			break
		}
	}
	return dc
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	var txt string
	if scanner.Scan() {
		txt = scanner.Text()
	}
	ints := oneLineInt(txt)
	// fmt.Println(ints[1])
	// fmt.Println(reflect.TypeOf(ints[0]))
	result := coinCount(ints)
	fmt.Println(result)
}

C++: #include<iostream>
#include<cstdio>

using namespace std;

int main(){
	
	int a,b,c,sum=0,i=0,j=0;
	
	cin >> a >> b >> c;

	while(1){
	if(sum>=c){
	break;
	}
	i++;
	j++;
	sum+=a;
	if(i==7){
	sum+=b;
	i=0;
	}
	}
	cout << j << endl;
	
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
  int a,b,c;
  cin >> a >> b >> c;
  int coin,d = 1;
  while(1){
    coin = a * d + (d/7)*b;
    if(coin >= c) break;
    d++;
  }
  cout << d << endl;
  return 0;
}

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

C++: #include <iostream>
using namespace std;
int main(void){
    int a;
    int b;
    int c;
    int d;
    int e;
    int f;
    int g;
    int h;
    cin>>a;
    cin>>b;
    cin>>c;
    d=c/a;
    if(d<7){
        cout<<d<<endl;
    }else{
        e=c/(a*7+b);
        f=c%(a*7+b);
        g=f/a;
        h=f%a;
        if(h<0){
            cout<<e*7+g<<endl;
        }else{
            cout<<e*7+g+1<<endl;
        }
    }
}

C++: #include <stdio.h>
#include <iostream>
#include <string>

using namespace std;

int main(){
	int A, B, C;
	cin >> A >> B >> C;
	int sum = 0;
	int days = 0;
	while(true){
		if(sum + A*7 + B >= C){
			for(int i = 0; i < 7; i++){
				sum += A;
				days++;
				if(i == 6){
					sum += B;
				}
				if(sum >= C){
					break;
				}
			}
		}
		else{
			sum += A*7 + B;
			days += 7;
		}
		if(sum >= C){
			break;
		}
	}
	cout << days << "\n";
}

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

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

int main(){
  cin.tie(0);
 	ios::sync_with_stdio(false);
  int A, B, C;
  cin >> A >> B >> C;
  int x = 0;
  int coin = 0;
  while(coin < C){
    x++;
    coin = A * x + (x / 7) * B;
  }
  cout << x <<"\n";
  return 0;
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
ll fac[200005], finv[200005], inv[200005];
vector<ll>dij;
struct edge { ll to, cost; };
vector<vector<edge> >G;

ll mod_pow(ll a, ll b) {
	ll res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}


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);
}

//↑template↑

int main() {
	int a, b, c, d;
	cin >> a >> b >> c;
	d = 7 * a + b;
	cout << 7 * (c / d) + min(((c % d) + a - 1) / a, 7) << endl;
}

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

typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;

// ====================================================================

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