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

C++: #include<iostream>

using namespace std;

int main(){
//int W,H,x,y,r;
    int a,b,c;
    int i=0;
    cin>>a>>b>>c;
int ans=0;
while(ans<c){
i++;
ans+=a;
if(i%7==0)
ans+=b;
}
   cout<<i<<endl;   
  
  
  return 0;
}

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

C++: #include <iostream>
using namespace std;
int main(void){
    int a,b,c,d,day;
    d=0;
    day=0;
    cin>>a>>b>>c;
    while(1){
       if(d>=c){
           break;
       } 
       d=a+d;
       day=day+1;
       if(day%7==0){
           d=d+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){if(C%A==0){cout<<C/A<<endl;}else{
     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 <iostream>
using namespace std;
int main(void){
    int A,B,C;
    int cnt=0,sum=0;
    
    cin>>A;
    cin>>B;
    cin>>C;
    
    while(sum<C){
        cnt++;
        sum+=A;
        if(cnt!=0 && cnt%7==0){
            sum+=B;
        }
    }
    
    cout<<cnt<<"\n";
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<iomanip>
#include<set>
#include<numeric>
#include<sstream>
#include<random>
#include<cassert>
#include<list>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {1, 1, 0, -1, -1, 0};
int dx[] = {1, 0, -1, -1, 0, 1};
#define ceil(a, b) a / b + !!(a % b)

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

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


int main(){
	ll A,B,C,S;
	cin >> A >> B >> C;
	S = 7*A+B;
	ll ans = min( (C/S)*7 + (C%S+A-1)/A, (C+S-1)/S * 7);
	cout << ans << endl;
}

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

using namespace std;

int main() {
	int a, b, c, cnt, sum;

	cnt = 0;
	sum = 0;
	cin >> a >> b >> c;
	while (true) {
		if (sum >= c) {
			break;
		}
		sum += a;
		++cnt;
		if (cnt % 7 == 0) {
			sum += b;
		}
	}
	cout << cnt << endl;

	return 0;
}

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

using namespace std;

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

  return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define max0(a,b,c) max(max(a,b),c)
#define min0(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
using namespace std;
using Graph = vector<vector<int>>;
typedef long long lint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldouble;
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<ull> ulvec;
typedef vector<double> dvec;
typedef vector<pair<int,int>> pvec;
typedef vector<pair<ll,ll>> plvec;
typedef vector<tuple<ll,ll,ll>> tvec;
typedef vector<string> svec;

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

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
signed main() {
	int a, b, c; cin >> a >> b >> c;
	int ans = (c / (a * 7 + b)) * 7; c %= (a * 7 + b);
	cout << ans + min((c + a - 1) / a, 7) << endl;
}

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

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

using namespace std;

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

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

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

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

    cin >> A >> B >> C;

    int week=0;
    int day=0;

    while(7*A+B<=C){
        C-=7*A+B;
        week++;
    }
    
    while(day<7 && C>0){
        C-=A;
        day++;
    }

    cout << 7*week+day << endl;

    return 0;

}

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

int main(){

    int day=0, money=0, a, b, goal;
    cin >> a >> b >> goal ;

    while (money < goal){
        day += 1;
        money += a;
        if (day % 7 == 0)money += b;
    }

    cout << day << endl;
}

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

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

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