Problem:


Score : 200 points

Problem Statement

Given is a string S. Replace every character in S with x and print the result.

Constraints

S is a string consisting of lowercase English letters.

The length of S is between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

S

Output

Replace every character in S with x and print the result.

Sample Input 1

sardine

Sample Output 1

xxxxxxx

Replacing every character in S with x results in xxxxxxx.

Sample Input 2

xxxx

Sample Output 2

xxxx

Sample Input 3

gone

Sample Output 3

xxxx



Sample input:
sardine


Sample output:
xxxxxxx

Submission status: Accepted

Solution code:
S = input().rstrip()
print('x' * len(S))

Submission status: Accepted

Solution code:
S=input()
Sa=len(S)
a="x"*Sa
print(a)

Submission status: Accepted

Solution code:
a=input()
s=len(a)
print(s*'x')

Submission status: Accepted

Solution code:
s = input()
a = "x"*len(s)
print(a)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    S = input()
    print("x" * len(S))


def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
t = ""

for _ in range(len(s)):
  t += "x"
  
print(t)

Submission status: Accepted

Solution code:
s = input()
for _ in range(len(s)):
    print("x", end="")

Submission status: Accepted

Solution code:
S=input()
print('x'*(len(S)))

Submission status: Accepted

Solution code:
print('x'*(len(input())))

Submission status: Accepted

Solution code:
s = input()
ans=""
for i in range(len(s)):
    ans+="x"

print(ans)

Submission status: Accepted

Solution code:
s = len(input())
print('x'*s)

Submission status: Accepted

Solution code:
S = input()

res = ''
for i in range(len(S)):
    res += 'x'

print(res)

Submission status: Accepted

Solution code:
def main():
    s = input()
    ans = 'x' * len(s)
    print(ans)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = len(str(input()))
print("x"*N)

Submission status: Accepted

Solution code:
s = input()
n = len(s)
print("x"*n)

Submission status: Accepted

Solution code:
S = input()

print('x'*len(S))

Submission status: Accepted

Solution code:
s = str(input())
print('x'*len(s))

Submission status: Accepted

Solution code:
s = input()
lenth = len(s)
print("x"*lenth)

Submission status: Accepted

Solution code:
s = input()
l = len(s)
print('x' * l)

Submission status: Accepted

Solution code:
S=input()
A='x'*len(S)
print(A)

Submission status: Accepted

Solution code:
score = input()
leng = len(score)
answer = 'x'*leng
print(answer)

Submission status: Accepted

Solution code:
s = len(input())
print("x"*s)

Submission status: Accepted

Solution code:
S = input()
l = len(S)
print('x' * l)

Submission status: Accepted

Solution code:
a = input()
b = 'x'*len(a)
print(b)

Submission status: Accepted

Solution code:
print(''.join(['x' for _ in range(len(input()))]))

Submission status: Accepted

Solution code:
from sys import stdin 

def main():
    s = input()
    print(len(s)*"x")
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = input()

print(len(S)*"x")

Submission status: Accepted

Solution code:
s = input()
ans = ''

for p in range(len(s)):
  ans += 'x'
  
print(ans)

Submission status: Accepted

Solution code:
import sys
S = sys.stdin.read().strip()
print('x' * len(S))

Submission status: Accepted

Solution code:
s=input()
k=len(s)
print("x"*k)

Submission status: Accepted

Solution code:
S=list(str(input()))
for i in range(len(S)):
    S[i]='x'
print(''.join(S))

Submission status: Accepted

Solution code:
s=input()

a=['x' for _ in  range(len(s))]
ans=''
for aa in a:
  ans+=aa
print(ans)

Submission status: Accepted

Solution code:
S = input()
print("x"*len(S))

Submission status: Accepted

Solution code:
# I miss you
S = input()
ans = ''.join(['x' for _ in range(len(S))])
print(ans)

Submission status: Accepted

Solution code:
S = input()
print('x' * len(S))

Submission status: Accepted

Solution code:
S = input()
for i in range(len(S)):
    tmp = S[i]
    S = S.replace(tmp,"x")
print(S)

Submission status: Accepted

Solution code:
s = input()
ans=""
for i in s :
    ans +="x"
print(ans)

Submission status: Accepted

Solution code:
a = input()
print('x' * len(a))

Submission status: Accepted

Solution code:
import re

s = str(input())

print(re.sub('[a-z]', 'x', s))

Submission status: Accepted

Solution code:
s = input()
for x in s:
	print('x', end='')
print()

Submission status: Accepted

Solution code:
def resolve():
    S = input()
    print("x"*len(S))

if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
s=str(input())
ans=""
for i in range(len(s)):
    ans+="x"
print(ans)

Submission status: Accepted

Solution code:
print(''.join(['x'] * len(input())))

Submission status: Accepted

Solution code:
S = input()
i = 0
while i < len(S):
    print('x', end='')
    i += 1

Submission status: Accepted

Solution code:
l = len(input())
ans = ""
for i in range(l):
  ans += "x"
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


def solve(S: str):
    return 'x'*len(S)


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    print(f'{solve(S)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
ans = 'x' * len(S)
print(ans)

Submission status: Accepted

Solution code:
def main():
    s = input()
    n = len(s)
    print("x" * n)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def solve():
    S = input()
    print('x'*len(S))

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
S = input()
bb = 'x'*len(S)
print(bb)

Submission status: Accepted

Solution code:
S = input()
Ans = ''
for i in range(len(S)):
    Ans += 'x'
print(Ans)

Submission status: Accepted

Solution code:
S = input()

print('x' * len(S))

Submission status: Accepted

Solution code:
s = str(input())
ans = ''
for i in range(len(s)):
    ans += 'x'
print(ans)

Submission status: Accepted

Solution code:
n = len(input())
a = "x" * n
print(a)

Submission status: Accepted

Solution code:
s=input()
a = len(s)
print("x"*a)

Submission status: Accepted

Solution code:
s=input()
for i in range(len(s)):
    print('x',end='')

Submission status: Accepted

Solution code:
def main():
  s = input()
  ans=""
  for i in range(0,len(s)):
    ans+='x'
  print(ans)

main()

Submission status: Accepted

Solution code:
s = input()
print('x'*len(s))

Submission status: Accepted

Solution code:
S=str(input())
ans = ""
for i in range(len(S)):
    ans += "x"
print(ans)

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

s = input()
ans = []
for i in range(len(s)):
    ans.append('x')

print(''.join(ans))

Submission status: Accepted

Solution code:
s = input()

print('x'*len(s))

Submission status: Accepted

Solution code:
def main():
    S = input()
    L = len(S)

    print('x' * L)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print("x"*len(input()))

Submission status: Accepted

Solution code:
s = input()
print(''.join(['x' for _ in range(len(s))]))

Submission status: Accepted

Solution code:
s = input()

print("x" * len(s))

Submission status: Accepted

Solution code:
S=input()
N=len(S)
M=[]
for i in range(N):
  M.append('x')
  
L=''.join(M)
print(L)

Submission status: Accepted

Solution code:
def i_miss_you():
    # 入力
    S = input()
    # 初期処理
    string = ''
    # 処理
    for _ in range(len(S)):
        string += 'x'
    return string

result = i_miss_you()
print(result)

Submission status: Accepted

Solution code:
print("x" * len(input()))

Submission status: Accepted

Solution code:
s = input()
q = len(s)
print("x"*q)

Submission status: Accepted

Solution code:
s=input()
num=len(s)
print("x"*num)

Submission status: Accepted

Solution code:
s=input()

print(len(s)*"x")

Submission status: Accepted

Solution code:
S = len(list(input()))
a = 'x'
x = ''
for i in range(S):
  x +=a
print(x)

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

s = input()

for i in s:
    print("x", end="")

print("")

Submission status: Accepted

Solution code:
s=list(input())
for i in range(len(s)):
    if s[i]!="x":
        s[i]="x"
print("".join(s))

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    return ''.join(['x']*len(input()))


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:
s = input()
print(int(len(s))*"x")

Submission status: Accepted

Solution code:
# abc154_b.py
# https://atcoder.jp/contests/abc154/tasks/abc154_b

# B - I miss you... /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点: 200点

# 問題文
# 文字列 Sが与えられます。Sのすべての文字を x で置き換えて出力してください。

# 制約
#     Sは英小文字のみからなる文字列
#     Sの長さは 1 以上 100以下

# 入力
# 入力は以下の形式で標準入力から与えられる。
# S

# 出力
# Sのすべての文字を x で置き換えて出力せよ。

# 入力例 1
# sardine

# 出力例 1
# xxxxxxx

# sardine のすべての文字を x で置き換えると xxxxxxx となります。

# 入力例 2
# xxxx

# 出力例 2
# xxxx

# 入力例 3
# gone

# 出力例 3
# xxxx


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    # N = int(lines[0])
    # N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = 'x' * len(S)

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['sardine']
        lines_export = ['xxxxxxx']
    if pattern == 2:
        lines_input = ['xxxx']
        lines_export = ['xxxx']
    if pattern == 3:
        lines_input = ['gone']
        lines_export = ['xxxx']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def main():
  S = input()
  print('x'*len(S))
  return

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
s = input()
n = len(s)

a = 'x'*n
print(a)

Submission status: Accepted

Solution code:
S = input().strip()
N = len(S)
print(*["x"]*N, sep="")

Submission status: Accepted

Solution code:
s = input()

[print("x",end="") for x in range(len(s))]

Submission status: Accepted

Solution code:
S = input()
ans = 'x'*len(S)
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
s=input().strip()
n=len(s)
print("x"*n)

Submission status: Accepted

Solution code:
import sys
S = input()

if not S.islower(): sys.exit()
if not ( 1 <= len(S) <= 100 ): sys.exit()

print('x'*len(S))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections as cl
import sys


def II():
    return int(sys.stdin.readline())


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    s = input()
    for i in range(len(s)):
        print("x", end="")


main()

Submission status: Accepted

Solution code:
s = input()
n = len(s)
print("".join(['x' for i in range(n)]))

Submission status: Accepted

Solution code:
S = input()
x = len(S)
list = []

for i in range(x):
    list.append('x')
    
print(''.join(list))

Submission status: Accepted

Solution code:
s = input()
output = ""
for i in range(len(s)):
    output = output + 'x'
print(output)

Submission status: Accepted

Solution code:
S = input()
res = ""
for i in range(len(S)):
  res += "x"
print(res)

Submission status: Accepted

Solution code:
S = input()
L = len(S)
for i in range(L):
    print("x",end='')

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# b,r = map(str, readline().split())
# A,B = map(int, readline().split())
S = _S()

def main():
    ans = ''
    for _ in range(len(S)):
        ans += 'x'
    return ans
print(main())

Submission status: Accepted

Solution code:
s = str(input())

print('x' * len(s))

Submission status: Accepted

Solution code:
S = input()
T = ''
for _ in range(len(S)):
  T += 'x'
print(T)

Submission status: Accepted

Solution code:
s = input()
print( "x" * len( s ) )

Submission status: Accepted

Solution code:
S = input()

a = ""

for i in range(len(S)):
    a = a + "x"

print(a)

Submission status: Accepted

Solution code:
S=input()
ans=""
for x in range(len(S)):
  ans += "x"
print(ans)

Submission status: Accepted

Solution code:
S = input()
arr = ["x" for i in range(len(S))]
print("".join(arr))

Submission status: Accepted

Solution code:
S=input()
T=""
for i in range(len(S)):
  T+="x"
print(T)

Submission status: Accepted

Solution code:
s = input()
output = ""
for i in range(len(s)):
    output += "x"
    
print(output)

Submission status: Accepted

Solution code:
S = input()

ans = ""
for i in range(len(S)):
    ans += "x"
    
print(ans)

Submission status: Accepted

Solution code:
n = input()
print(n.replace(n,'x'*len(n)))

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

s = s()
for i in range(len(s)):
	print("x",end="")

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

s = s()
ans = ""
for i in range(len(s)):
	ans += "x"
print(ans)

Submission status: Accepted

Solution code:
s=input()
s_count = len(s)

print("x"*s_count)

Submission status: Accepted

Solution code:
#154_B
s = input()
n = len(s)

ans = ''
for _ in range(n):
    ans += 'x'

print(ans)

Submission status: Accepted

Solution code:
ln = len(input())
print('x'*ln)

Submission status: Accepted

Solution code:
S = input().strip()
a = "x"*len(S)
print(a)

Submission status: Accepted

Solution code:
for i in range(len(input()) - 1):print("x",end="")
print("x")

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s) - 1):
    print("x",end="")
print("x")

Submission status: Accepted

Solution code:
s=input()
a=""

l=len(s)

for i in range (l):
  a=a+"x"
print(a)

Submission status: Accepted

Solution code:
#Macで実行する時
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	#print(name)
	sys.stdin = open(name)

s = input()

#print(len(s))

ans=[]
for i in range(len(s)):
    ans.append("x")

print("".join(ans))

Submission status: Accepted

Solution code:
# B I miss you...

S = input()

print("x" * len(S))

Submission status: Accepted

Solution code:
S=input()
a=len(S)
print('x'*a)

Submission status: Accepted

Solution code:
s = list(input())
count = len(s)
for i in range(count):
  s[i] = "x"
changed = "".join(s)
print(changed)

Submission status: Accepted

Solution code:
s = input()
print('x' * len(s))

Submission status: Accepted

Solution code:
S=str(input())
s=len(S)
print(s*'x')

Submission status: Accepted

Solution code:
s = input()
l = len(s)
L = ['x']*l
K = ''.join(L)

print(K)

Submission status: Accepted

Solution code:
def main():
    s = (input())
    l = ['x' for i in range(len(s))]
    print(''.join(l))
    
main()

Submission status: Accepted

Solution code:
s = input()
for i in s:
    print('x',end='')

Submission status: Accepted

Solution code:
S = input()

N = len(S)
s = 'x'*N
print(s)

Submission status: Accepted

Solution code:
s = input()
long = len(s)

res = 'x' * long
print(res)

Submission status: Accepted

Solution code:
s=input()
print("x"*(len(s)))

Submission status: Accepted

Solution code:
S = input()
Sx = ""
for _ in range(len(S)):
  Sx += "x"
S = Sx
print(S)

Submission status: Accepted

Solution code:
l=len(input())
print("x"*l)

Submission status: Accepted

Solution code:
S=input()
n=len(S)
print('x'*n)

Submission status: Accepted

Solution code:
s = input()
t = ''

for _ in range(len(s)):
  t += 'x'
print(t)

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    print("".join(["x" for _ in range(len(_S()))]))

main()

Submission status: Accepted

Solution code:
S = input()

S_len = len(S)
ans = ""
for i in range(S_len):
    ans += "x"

print(ans)

Submission status: Accepted

Solution code:
s=input()
n=len(s)
X=[]
for i in range(n):
  X.append('x')
print(''.join(X))

Submission status: Accepted

Solution code:
print('x'*len(input()))

Submission status: Accepted

Solution code:
N=input()
i=0
while i<len(N):
  print("x" ,end='')
  i+=1

Submission status: Accepted

Solution code:
# Template 1.0
import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

s = input()

print('x'*len(s))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	
	s = input()
	print("x" * len(s))

Submission status: Accepted

Solution code:
def main():
    S = str(input())
    s = ''
    for i in range(len(S)):
        s = s + 'x'
    print(s)

main()

Submission status: Accepted

Solution code:
print(len(str(input())) * 'x')

Submission status: Accepted

Solution code:
print(''.join('x' for i in range(len(input()))))

Submission status: Accepted

Solution code:
S = input()
s = ""
for i in range(0,len(S)):
    s += "x"
print(s)

Submission status: Accepted

Solution code:
n = len(input())
print("x" * n)

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s)):
  print("x",end="")

Submission status: Accepted

Solution code:
def main():
    S = input().rstrip()
    print("x" * len(S))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = str(input())
b = len(a)
print(b*"x")

Submission status: Accepted

Solution code:
S = input()

N = len(S)

print('x'*N)

Submission status: Accepted

Solution code:
s = input()
n = len(s)
print('x' * n)

Submission status: Accepted

Solution code:
def main():

    S = input()
    return 'x' * len(S)
if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
s=str(input())
x=len(s)
s1=''
for i in range(0,x):
    s1+='x'
print(s1)

Submission status: Accepted

Solution code:
S = input()
ans = ''
for _ in range(len(S)):
    ans += 'x'

print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

s = input().rstrip()

n = len(s)
print('x'*n)

Submission status: Accepted

Solution code:
u = str(input())

len_ =len(u)

tmp = str()

for i in range(len_):
      tmp = tmp + 'x'

print(tmp)

Submission status: Accepted

Solution code:
s = input()
S = len(s)
print("x"*S)

Submission status: Accepted

Solution code:
s=input()
n=len(s)
a="x"
for i in range(n-1):
    a+="x"
print(a)

Submission status: Accepted

Solution code:
s = input()
print("x" * len(s))

Submission status: Accepted

Solution code:
S=input()
x=""
for i in range(len(S)):
  x+="x"
print(x)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline

print("x"*len(input().rstrip()))

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
ln = len(input())
print('x'*ln)

Submission status: Accepted

Solution code:
# coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial,sqrt
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

s=SI()
for i in range(len(s)):
    print("x",end="")

Submission status: Accepted

Solution code:
S = input()
N = len(S)
ans = ['x' for i in range(N)]
ans = ''.join(ans)
print(ans)

Submission status: Accepted

Solution code:
s = str(input())
print('x'*len(s))

Submission status: Accepted

Solution code:
S = input().strip()
print("x"*len(S))

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    S = ins()
    return "x" * len(S)


print(solve())

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    S = readline().strip()

    print('x' * len(S))

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print(''.join(['x']*len(input())))

Submission status: Accepted

Solution code:
s = input()

s = "".join(["x" for i in s])
print(s)

Submission status: Accepted

Solution code:
S=input()
ans = ["x"]*len(S)
print(*ans,sep="")

Submission status: Accepted

Solution code:
S = input()
a = len(S)*"x"
print(a)

Submission status: Accepted

Solution code:
S = str(input())
print(len(S)*"x")

Submission status: Accepted

Solution code:
s = input()

ans = "x" * len(s)
print(ans)

Submission status: Accepted

Solution code:
import math
import collections

def main():
  S = input()
  
  lenth = len(S)
  a = ''
  
  for _ in range(lenth):
    a += 'x' 
  print(a)
  
main()

Submission status: Accepted

Solution code:
print("".join('x' for i in range(len(input()))))

Submission status: Accepted

Solution code:
S = len(input())
print("x"*S)

Submission status: Accepted

Solution code:
S = list(input())

for i in S:
    print("x",end="")

Submission status: Accepted

Solution code:
S = len(input())

print("x"*S)

Submission status: Accepted

Solution code:
S=input()
ans=""
for i in range(len(S)):
  ans+="x"
print(ans)

Submission status: Accepted

Solution code:
s_len = len(input())

ans = ''
for i in range(s_len):
    ans += 'x'
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
print("x"*len(input()))

Submission status: Accepted

Solution code:
S = input()
for _ in range(len(S)):
    print("x", end="")

Submission status: Accepted

Solution code:
s = input()
print( 'x' * len(s))

Submission status: Accepted

Solution code:
s=input()
print("".join(["x"]*len(s)))

Submission status: Accepted

Solution code:
s=input('')
t=''
for a in s:
    t=t+'x'

print(t)

Submission status: Accepted

Solution code:
S=len(input())
print('x'*S)

Submission status: Accepted

Solution code:
import re

N = input()
N = re.sub(r'[A-z]', 'x', N)

print(N)

Submission status: Accepted

Solution code:
s=input()
lis=list(s)
n=len(lis)
X=["x" for i in range(n)]
print("".join(X))

Submission status: Accepted

Solution code:
Ss = input().rstrip()

print('x' * len(Ss))

Submission status: Accepted

Solution code:
s = input()
ans = ''
for _ in range(len(s)):
  ans += 'x'
print(ans)

Submission status: Accepted

Solution code:
s = input()
new = len(s)*'x'
print(new)

Submission status: Accepted

Solution code:
s = input()
a = list(s)

for i in range(len(s)):
    a[i] = 'x'
    
ans = "".join(a)
    
print(ans)

Submission status: Accepted

Solution code:
a=input()
b=len(list(str(a)))
print(b*'x')

Submission status: Accepted

Solution code:
S = list(map(str,input()))

for i in range(len(S)):
    S[i] = 'x'
print(''.join(map(str,S)))

Submission status: Accepted

Solution code:
s = input()
ans = "x"*len(s)
print(ans)

Submission status: Accepted

Solution code:
s=list(input())
for i in range(len(s)):
    s[i]="x"
print("".join(s))

Submission status: Accepted

Solution code:
S = str(input())
T = "x" * len(S)
print(T)

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


s = input()
print("x"*len(s))

Submission status: Accepted

Solution code:
s = input()

answer = 'x' * len(s)
print(answer)

Submission status: Accepted

Solution code:
mod = int(1e9+7)
def add(a, b):
    c = a + b
    if c >= mod:
        c -= mod
    return c

def main():
  	n = len(raw_input())
  	temp = ['x' for _ in range(n)]
  	#print(temp)
  	print(''.join(temp))
    #ans = ''.join(temp)
	#print(ans)
    

main()

Submission status: Accepted

Solution code:
n = input()

for i in n:
  print("x", end="")

print()

Submission status: Accepted

Solution code:
n = input()
l = len(n)

ans = ""
for i in range(l):
  ans += "x"
print(ans)

Submission status: Accepted

Solution code:
s=input()
n=len(s)
print("x"*n)

Submission status: Accepted

Solution code:
s = input()
k = "x"*len(s)
print(k)

Submission status: Accepted

Solution code:
S = input()
a = ['x']*len(S)
print(''.join(a))

Submission status: Accepted

Solution code:
s = input()
a = ['x'] * len(s)
print(''.join(a))

Submission status: Accepted

Solution code:
s=input()
con=len(s)
ans=['x']*con
ANS=''
for i in ans:
    ANS+=i
print(ANS)

Submission status: Accepted

Solution code:
s = len(str(input()))
print('x'*s)

Submission status: Accepted

Solution code:
inp = input()
print("x"*len(inp))

Submission status: Accepted

Solution code:
string = input()

print("x" * len(string))

Submission status: Accepted

Solution code:
S = input()
a = len(S)
print("x"*a)

Submission status: Accepted

Solution code:
S=input()
print("x"*len(S))

Submission status: Accepted

Solution code:
S = input()
print("{}".format('x'*len(S)))

Submission status: Accepted

Solution code:
s = input()
len_s = len(s)
print('x'*len_s)

Submission status: Accepted

Solution code:
# 154 B

s = input()

for i in s:
    print('x', end = "")