Go: package main

import "fmt"
	
func main()  {
	// ログインするたびに A 枚のコインが得られる
	// 7 日連続でログインすると，そのたびに，追加で B 枚
	// 少なくとも C 枚のコインを得るためにログインしなければならない回数
	var a, b , c int
	_, _ = fmt.Scan(&a, &b, &c)
	fmt.Printf("%d\n",calc(a, b, c))
}

func calc(a int, b int, c int) int{
	var day int
	for c > 0 {
		day++
		c -= a
		if day % 7 == 0 {
			c -= b
		}
	}
	return day
}

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 x, y, z, w, u;
    w = 0,u = 0; 
    cin >> x >> y >> z;
    while(true){
        u += 1;
        w += x;
        if(u%7 == 0){
           w += y;
        }
        if (w >= z){
           break;
        }
    }
    cout << u <<endl;
}

C++: #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"

using namespace std;

const long long int MOD = 1000000007;
//const int MOD = 998244353;

long long int N, M, K, H, W, L, R;
//int N, M, K, H, W, L, R

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N >> M >> K;
	for (int i = 0; K > 0; i++) {
		K -= N;
		if (i % 7 == 6)K -= M;
		if (K <= 0)cout << i + 1 << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;

int main(){
    int A,B,C;
    cin >> A >> B >> C;
    int total=0;
    int date=0;
    while(C>total){
        date++;
        total+=A;
        if(date%7==0) total+=B;
    }
    cout << date << endl;

    return 0;
}

C++: // 2019/06/26 Tazoe

#include <iostream>
using namespace std;

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

    int W = C/(A*7+B);
    C %= (A*7+B);
    if(C>A*7){
        W++;
        C = 0;
    }

    int D = C/A;
    C %= A;
    if(C>0){
        D++;
    }

    cout << W*7+D << endl;

    return 0;
}

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

C++: #include <iostream>
int main(){
  int a,b,c;
  std::cin>>a>>b>>c;
  int coin = 0;
  int day = 0;
  while(coin < c){
    day += 1;
    coin += a;
    if(day%7==0){
      coin += b;
    }
  }
  std::cout<<day<<"\n";
}

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