006
n = int(input())
list = []
while n > 0:
list.append(n % 10)
n = int(n/10)
if(len(list) == 3):
for i in range(list[2]):
print("B", end="")
for i in range(list[1]):
print("S", end="")
for i in range(list[0]):
print(i+1, end="")
elif(len(list) == 2):
for i in range(list[1]):
print("S", end="")
for i in range(list[0]):
print(i+1, end="")
else:
for i in range(list[0]):
print(i+1, end="")
007
import math
x = int(input())
num = 0
su_list = [3]
l = 0
def sushu(j, primes):
updata = math.sqrt(j) + 1
for prime in primes:#传入的j为奇数 ,偶数除2外全不是素数
if prime > updata:
break
if j % prime == 0:#只需检测是否会被素数整除
return 0
return 1
for i in range(5, x + 1, 2):#步距为1会加入偶数
if sushu(i, su_list):
su_list.append(i)
l = l + 1
if su_list[l] - su_list[l - 1] == 2:#相差为2
num = num + 1
print(num)
008
n = [x for x in input().split()]
list=[i for i in input().split()]
x=list[int(n[0])-int(n[1]):]# :之后的数据
y=list[:int(n[0])-int(n[1])]# :之前的数据
result=x+y
print(' '.join(result))
009
n = [x for x in input().split()]
for r in range(len(n)):
print(n[-r-1], end='')
if r < len(n)-1:
print(' ', end='')
010
e = [int(x) for x in input().split()]
if e[1] == 0:
print(0, 0)
else:
for i in range(len(e) // 2):# //表示整除
a = e[2 * i]
b = e[2 * i + 1]
if i == 0 and b > 0:
print(a * b, b - 1, end='')
elif b > 0:
print(' ' + str(a * b), b - 1, end='')
print()