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
}

Python: ABC=list(map(int,input().split()))
coin=0
date=0
days=0

while(1):
    days+=1
    
    if not date==6:
        coin=coin+ABC[0]
    else:
        coin=coin+ABC[1]
        coin=coin+ABC[0]

    if coin>=ABC[2]:
        print(days)
        break
    date=(date+1)%7

Python: A,B,C=(int(x) for x in input().split())

i=0
N=C
while N>0:
    N=C-A*i
    if N<=0:
        print(i)
        break
            
    else:
         i+=1
         if i%7==0:
            C-=B

Python: A,B,C=map(int,input().split())
point=0
if C>7*A+B:
    warareru=C%((7*A)+B)
    ans=C//((7*A)+B)
    while warareru>0:
        point+=1
        if point%7!=0:
            warareru-=A

        else:
            warareru-=A+B


    print(ans*7+point)
elif C>=7*A and C<=7*A+B:
    print("7")
else:
    if C%A==0:
        print(C//A)
    else:print((C//A)+1)

Python: # -*- coding: utf-8 -*-
"""
Social Game
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0652

"""
import sys
from math import ceil

def solve(a, b, c):
    q, r = divmod(c, (a*7 + b))
    return q * 7 + min(ceil(r / a), 7)


def main(args):
    a, b, c = map(int, input().split())
    ans = solve(a, b, c)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Python: import math
a,b,c=map(int,input().split())
s=a*7+b
w=c//s
if c%s==0:
  d=0
else:
  d=min(math.ceil((c%s)/a),7)
print(7*w+d)

Python: A,B,C=map(int,input().split())
day=0
coin=0
while coin<C:
    day+=1
    coin+=A
    if day%7==0:
        coin+=B
print(day)

Python: import math
a, b, c = map(int, input().split())

n = 0

while True:
    n += 1
    if (a * n + math.floor(n / 7) * b >= c):
        break

print(n)

Python: A, B, C = map(int, input().split())
coin = 0
week = 0
day = 0

while 1:
    day += 1
    coin += A
    week += 1
    if week == 7:
        coin += B
        week = 0
    if coin >= C:
        break
print(day)

Python: a, b, c = map(int, input().split())
d = 0
s = 0
while s < c:
    d += 1
    if d%7 == 0:
        s += b
    s += a
print(d)

Python: def main():
    a,b,c = map(int,input().split())
    target = c
    daily_coin = a
    weekly_coin = b
    weekly_daily_total_coin = 7 * a + b
    counter = 0

    counter += (target // weekly_daily_total_coin) * 7
    target %= weekly_daily_total_coin
    #print(counter,target)
    temp = 0
    if target % daily_coin != 0 :
        temp += 1
    counter += min(target // daily_coin + temp,7)
    print(counter)



if __name__ == '__main__':
    main()

Python: #! /usr/bin/env python
# -*- coding: utf-8 -*-
import sys


def main():
    day = 0
    data = map(int,input().split())
    data = list(data)
    while( data[2] > 0):
        day = day +1
        data[2] -= data[0]
        if(day % 7 == 0):
            data[2] -= data[1]
    print(day)

if __name__ == '__main__':
    main()

Python: A, B, C = map(int, input().split())
i = 0
coin = 0
while i < 10**6:
    if coin >= C:
        break
    
    i = i + 1
        
    coin = coin + A
    if i%7 == 0:
        coin = coin + B
    
print(i)

Python: a,b,c = map(int,input().split())

day=0
coin=0

while coin<c:
    day+=1
    coin+=a
    if day%7==0:
        coin+=b
        
    
print(day)

Python: A,B,C=map(int,input().split())
S=0
i=0
while C>S:
    S=S+A
    if C>S and i+1>=7 and (i+1)%7==0:
        S=S+B
    i=i+1
print(i)

Python: A, B, C = map(int,input().split())
import math
n = 0
while True :
    x = A*n+(B*math.floor(n/7))
    if x >= C :
        break
    n += 1
print(n)

Python: day=0
sum=0

a,b,c=map(int,input().split())

while True:
    day+=1
    
    if day%7==0:
        sum+=(a+b)
    else:
        sum+=a
    
    if sum>=c:
        print(day)
        break

Python: A, B, C = map(int, input().split())

week_value = A * 7 + B

weeks = C // week_value
rest = C % week_value

day = 0
if rest != 0 and A * 7 < rest:
    day = 7
else:
    day = rest // A
    if rest % A != 0:
        day += 1

print(weeks * 7 + day)

Python: A,B,C=map(int,input().split())
Day=0
coin=0
while C>coin:
    Day+=1
    coin+=A
    if Day%7==0:
        coin+=B
print(Day)

Python: A,B,C = map(int, input().split())

coin = 0
for day in range(1, C+1):
    coin=coin+A
    if day % 7 == 0:
        coin = coin + B
    if coin >= C:
        break
print(day)

Python: #
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A,B,C = MI()
    ans = 7*(C//(A*7+B)) #1週間
    C %= A*7+B
    ans += min(7,ceil(C/A))
    print(ans)


if __name__ == '__main__':
    main()

Python: A, B, C = map(int, input().split())
ans = 0
k = C // (7*A+B)
C -= k*(7*A+B)
if C <= 7*A:
    print(7*k + (C+A-1)//A)
else:
    print(7*(k+1))

Python: A,B,C=map(int,input().split())

coin=0
for day in range(1,C+1):
    coin+=A
    if day%7==0:
        coin+=B
    if coin>=C:
        break

print(day)

Python: A, B, C = map(int,input().split())

coin = 0
for day in range(1, C+1):
    coin+=A
    
    if day%7==0:
        coin+=B
    if coin >= C: break

print(day)

Python: A,B,C = map(int,input().split())

coin=0
for day in range(1, C+1):
    coin+=A
    #月曜日から日曜日まで 7 日連続でログインすると
    if day % 7 == 0:
        coin+=B
    if coin >= C: break

print(day)

Python: import math
line = input().split(" ")
A = int(line[0])
B = int(line[1])
C = int(line[2])

W = C//(7*A+B)
remain = C - (7*A+B)*W
#print(W, " ", remain)
D = 0
if(remain >= 7*A):
    D = 7 
else:
    D = math.ceil(remain/A)

ans = 7*W + D

print(ans)

Python: a,b,c=map(int,input().split())

d=0
s=0
while s<c:
    d +=1
    if d%7==0:
        s +=b
    s +=a
print(d)

Python: a,b,c = map(int,input().split())

d = 0
s = 0
while s < c:
    d += 1
    if d%7 == 0:
        s += b
    s += a
print(d)

Python: # -*- coding: utf-8 -*-
# 学籍番号 17D8101029G 石塚 博之 ID: mcatpolo 言語: python3

a,b,c = map(int, input().split())

n = int(0)
i = int(0)

while True:
    i += 1
    n += a
    if i%7 == 0:
        n+=b

    if n >= c:
        break

print(i)

Python: 
a,b,c=map(int,input().split())
#b=int(input())
#c=int(input())
day=0
cnt=0
while(True):
    day+=1
    #print(day)
    #print(c)
    if day%7==0:
        c-=b
    c-=a
    if c<=0:
        break
print(day)

Python: A,B,C = map(int,input().split())

coin=0
for day in range(1,C+1):
    coin+=A
    if day % 7 == 0:
        coin+=B
    if coin >=C:
        break
        
print(day)

Python: a,b,c=map(int,input().split())

coin=0
for day in range(1,c+1):
    coin+=a
    #月曜から日曜まで連続でログイン
    if day % 7 == 0:
        coin+=b
    if coin >= c: break
print(day)