Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() (int, error) {
	return strconv.Atoi(nextString())
}

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func printArr(arr []string) {
	fmt.Println(strings.TrimRight(fmt.Sprintf("%+v", arr)[1:], "]"))
}

func main() {
	scanner.Split(bufio.ScanWords)

	coinDaily, _ := nextInt()
	coinWeekly, _ := nextInt()
	coinTarget, _ := nextInt()

	coinCurrent := 0
	i := 0
	for i = 0; i <= 1000000; i++ {
		coinCurrent += coinDaily
		if (i+1)%7 == 0 {
			coinCurrent += coinWeekly
		}
		if coinCurrent >= coinTarget {
			break
		}
	}
	fmt.Println(i + 1)
}

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

int main()
{
    int A, B, C;
    cin >> A >> B >> C;
    int c = 0;
    for(int i = 1;;i++){
        c += A;
        if(i % 7 == 0) c += B;
        if(c >= C){
            cout << i << endl;
            break;
        }
    }
    return 0;
}

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

int main(){ 
    int A, B, C;
    cin >> A >> B >> C;
    
    int ans = 0;
    while(C>0){
        for(int i=0;i<7;i++){
            C -= A;
            ans++;
            if(C <= 0) goto end;
        }
        C -= B;
    }
    end: cout << ans << endl;
    return 0;
}

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

C++: #include <iostream>
using namespace std;
int main(void){
    int A,B,C,x,y,w;
    cin>>A>>B>>C;
    if(C<A*7){
     cout<<C/A+1<<endl;   
    }
    if(C>A*7){
        x=C/(7*A+B);
        y=C-x*(7*A+B);
        if(y%A==0){w=y/A;}else{w=y/A+1;}
        
        cout<<x*7+w<<endl;
    }
}

C++: #include<cstdio>


int main(){
    int a,b,c,t=0,d=0;
    scanf("%d %d %d",&a,&b,&c);
    while(t < c){
        d++;
        t += a;
        if(d % 7 == 0) t += b;
    }
    printf("%d\n",d);
}

C++: #include<bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<int>(m,0));
#define Twovec(a,n,m) vector<vector<double>> a(n,vector<double>(m,0));
#define P pair<int,int>
#define All(a) (a).begin(),(a).end()
#define Sort(a) sort(All(a));
#define Reverse(a) reverse(All(a));
#define PQ(n) priority_queue<P,vector<P>,greater<P>> (n)
#define pq(n) priority_queue<int> (n)
#define print(a) cout << (a) << endl;
#define printD(a) cout << setprecision(10) << ans << endl;
using namespace std;
int max_int = 1000000007;
void Debug(auto a);
int nibul(auto a,auto b);
int nibuu(auto a,auto b);
void input(vector<int>& a,int n);

int n;
struct UnionFind {
    vector<int> par; // par[i]:iの親の番号　(例) par[3] = 2 : 3の親が2

    UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
        for(int i = 0; i < N; i++) par[i] = i;
    }

    int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }

    void unite(int x, int y) { // xとyの木を併合
        int rx = root(x); //xの根をrx
        int ry = root(y); //yの根をry
        if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
        par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
    }

    bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
};


signed main(){
    int a,b,c;
    cin >> a >> b >> c;
    int mon = a*7+b;
    int ans = (c/mon)*7;
    c %= mon;
    if(c>a*7){
        ans += 7;
    }
    else{
        while(c>0){
            ans++;
            c -= a;
        }
    }
    print(ans)
    return 0;
}

void Debug(auto a){
    cout << "{ ";
    for(auto b: a){
        cout << b << " ";
    }
    cout << "}" << endl;
}
int nibul(auto a,auto b){
    int x = lower_bound(All(a),b) - a.begin();
    //key以上の初めてのitr
    return x;
}
int nibuu(auto a,auto b){
    int x = upper_bound(All(a),b) - a.begin();
    //key以下の最後のitr
    return x-1;
}

void input(vector<int>& a,int n){
    REP(i,n){
        cin >> a[i];
    }
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<tuple>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#define int long long
using namespace std;
const int INF = 1e10;
const int ZERO = 0;

signed main() {
	int A,B,C;
	cin >> A >> B >> C;
	int N = C / (A * 7 + B);
	int M = C % (A * 7 + B);
	if(M > A * 7) {
		cout << N * 7 + 7 << endl;
	}
	else {
		cout << N * 7 + (M + A - 1) / A << 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 <iostream>
using namespace std;
int main(void){
    int a,b,c,sum=0,n;
    cin >> a >> b >>c;
    //if(c/a > 7){
        for(int i=0; i<100000000; i++){
            sum=i*a+i/7*b;
            if(c<=sum){
                cout << i << endl;
                break;
            }
        }
    //}
    //else{
        //n=c/a;
        //cout << n << endl;
    //}
}

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

using namespace std;

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

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

int main()
{
	int A, B, C;
	std::cin >> A >> B >> C;

	int weekCoin = 7 * A + B;

	int weekNum = C / weekCoin;

	C -= weekNum * weekCoin;

	int dayNum =0;
	if (C / A >= 7) dayNum = 7;
	else dayNum = C / A + ((C%A) ? 1 : 0);
	
	
	std::cout << weekNum * 7 + dayNum << std::endl;

    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int A,B,C;
    cin >> A >> B >> C;
    
    int o=0;
    o+=(C/(7*A+B))*7+min(7,(C%(7*A+B))/A);
   if((C%(7*A+B))%A>0 and (C%(7*A+B))<7*A)o++;
    cout << o <<endl;
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<limits>
#include<algorithm>
#include<numeric>
#include<utility>

using ull = unsigned long long int;
using ll = long long int; 

int main(){
    ll A,B,C;
    std::cin >> A >> B >> C;
    int login = 7;
    int cnt=0;

    while(C>0){
        C-=A;
        login--;
        if(login==0){
            C-=B;
            login=7;
        }
        cnt++;
    }

    std::cout << cnt << std::endl;

    return 0;
}