Go: package main

import (
	"fmt"
)

func main() {
	var A, B, N int
	fmt.Scanf("%d %d %d", &A, &B, &N)

	login := 0
	week := 0
	sum := 0

	for sum < N {
		login++
		week++
		sum += A

		if week%7 == 0 {
			sum += B
			week = 0
		}
	}

	fmt.Println(login)
}

C++: #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    int a,b,c;
    cin >> a >> b >> c;
    int w = a*7+b;
    int ans = c/w;
    int sum = ans*w;
    ans *= 7;
    rep(i,7)if(sum < c){
        ans++;
        sum += a;
    }
    cout << ans << endl;
}

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

int main(void){
    int a, b, c; cin >> a >> b >> c;
    if(c <= a * 7 + b && c >= a * 7) cout << 7 << endl;
    else if(c < a * 7) {
        cout << (c + a - 1)/a << endl;
    } else {
        long long ans = 0;
        ans += c/(7*a+b) * 7;
        c %= 7*a+b;
        if(c >=7 * a) ans+= 7;
        else ans += (c+a-1)/a;
        cout << ans << endl;
    }
    return 0;
}

C++: #include <iostream>

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

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

  std::cout << login << std::endl;

  return 0;
}

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

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

C++: #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  int a, b, c;
  cin >> a >> b >> c;
  int coins = 0;
  int ans = 0;
  while (true) {
    if (coins >= c) {
      cout << ans << endl;
      return 0;
    }
    coins += a;
    ans++;
    if (ans % 7 == 0) coins += b;
  }
  return 0;
}

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

using namespace std;

int main(){
	int a, b, c;
	int d = 0;
	int ans = 0;
	cin >> a >> b >> c;
	for (int i = 1;;i++){
		d += a;
		if (i % 7 == 0){
			d += b;
		}
		if (d >= c){
			ans += i;
			break;
		}
	}
	cout << ans << endl;
	return 0;
}

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

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); i++)
int num_n(int a, int b, int c){
    int i=0;
  	int ans=0;
    while (c>0){
        c -= a;
      	i++;
      	if (i && i%7 ==0) c-=b;
      	ans++;
    }
    return ans;
}
int main(){
    int a, b, c; cin >> a >> b >> c;
    int n=num_n(a, b, c);
    cout << n << 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));
	c -= (7 * a + b) * (c / (7 * a + b));
	
	int cnt = 0;
	while (c > 0)
	{
		ans++;
		c -= a;
		cnt++;
		if (cnt == 7)
		{
			c -= b;
			cnt = 0;
		}
	}

	cout << ans << endl;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<math.h>
using namespace std;
int main(){
    int a,b,c,ans=0,s=0;
    cin>>a>>b>>c;
    while(s<c){
        s=s+a;
        ans++;
        if(ans%7==0)s=s+b;
    }
    cout<<ans<<endl;
}

C++: #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;




int main(){

	int A,B,C;

	scanf("%d %d %d",&A,&B,&C);

	int ans = C,left = 0,right= C,mid = (left+right)/2;

	while(left <= right){

		if(mid*A+mid/7*B >= C){

			ans = mid;
			right = mid-1;

		}else{

			left = mid+1;
		}
		mid = (left+right)/2;
	}

	printf("%d\n",ans);

	return 0;
}

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

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

C++: # include<iostream>
using namespace std;
int main(){
    int a, b, c;
    cin >> a >> b >> c;
    int cnt_day=0, cnt_coin=0, conte=1;

    while(true){
        if(conte % 7 == 0){conte=1; cnt_coin+=(a+b);}
        else {cnt_coin+=a; conte++;}
        cnt_day++;
        if(cnt_coin>=c) break;
    } 
    cout << cnt_day <<"\n";
    return 0;
}

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
	int a,b,c,i,cnt;
	scanf("%d %d %d",&a,&b,&c);
	cnt=0;
	i=1;
	while(1){
		cnt+=a;
		if(i%7==0){
			cnt+=b;
		}
		if(cnt>=c){
			break;
		}
		i++;
	}
	printf("%d\n",i);
	return 0;
}

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

int main()
{
    int a, b, c;
    cin >> a >> b >> c;
    int i = 0, sum = 0;
    while(c > sum){
        i++;
        sum += a + (i % 7 == 0 ? b : 0);
    }
    cout << i << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template<class T> inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int ctoi(char c) {
  if (c >= '0' && c <= '9') {
    return c - '0';
  }
  return 0;
}
ll factorial(ll n) {
  if (n == 1) {
    return 1;
  }
  ll ans = factorial(n-1);
  return ans*n;
}
ll gcd(ll a, ll b) {
  if (a < b) {
    ll tmp = a;
    a = b;
    b = tmp;
  }
  ll r = a%b;
  while(r != 0) {
    a = b;
    b = r;
    r = a%b;
  }
  return b;
}
ll lcm(ll a, ll b) {
  return (a/gcd(a, b))*b;
}

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