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:
import queue
import copy
import math
from collections import deque
import bisect


s = str(input())


ll = len(s)

a = ""
for i in range(0, ll):
    a += "x"

print(a)

Submission status: Accepted

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

for char in s:
    ans += 'x'

print(ans)

Submission status: Accepted

Solution code:
S = input() # 数字を変数に格納

result = ''

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

Submission status: Accepted

Solution code:
S = len(list(str(input())))

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

Submission status: Accepted

Solution code:
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
    *a,=map(int,open(0))
def S_():
    return input()
def IS():
    return input().split()
def LS():
    return [i for i in input().split()]
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def NI(n):
    return [int(input()) for i in range(n)]
def NI_(n):
    return [int(input())-1 for i in range(n)]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def LtoS(ls):
    return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0}):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0}) # sample usage
    mp=[1]*(w+2)
    found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[1]+[mp_def[j] for j in s]+[1]
    mp+=[1]*(w+2)
    return h+2,w+2,mp,found
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)]
        rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['YES','NO']

mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
#sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()
 
def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a
 
show_flg=False
show_flg=True
 
ans=0

n=len(input())

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

Submission status: Accepted

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


if __name__ == "__main__":
    answer = solve()
    print(answer)

Submission status: Accepted

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

for i in range(n):
    s = s + 'x'

print(s)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
S=input()

A="x"*len(S)

print(A)

Submission status: Accepted

Solution code:
s=list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

len_s = len(s)

print('x'*len_s)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:

S=input()

result=["x"]*len(S)

print("".join(result))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 文字列の入力
S = input()

print(''.join(['x' for _ in S]))

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()

n = len(s)

print("x"*n)

Submission status: Accepted

Solution code:
S = input()


for n in range(len(S)):
    print("x", end="")

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
lenS = len(S)


print("x"*lenS)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main():
    k = input().replace('\n','')
    a = 'x' * len(k)
    print(a)
if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__=="__main__":
    s = input()

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

    print(t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = input()
a = len(s)

print('x'*a)

Submission status: Accepted

Solution code:
S = input()

N = len(S)

print('x' * N)

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

Solution code:
N = input()
s="x"*100
print(s[:len(N)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()
slist = list(s)#文字列をリストに
length = len(slist)

for i in range(length):
    print('x', end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# vim:fenc=utf-8 ff=unix


def solv(S):
    return 'x' * len(S)


if __name__ == "__main__":

    S = input()
    ans = solv(S)

    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

print("x"*(len(S)))

Submission status: Accepted

Solution code:

if __name__ == '__main__':
    s = input()
    x = ""
    for i in range(len(s)):
        x = x + "x"
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def changex(s):

    ans = ""

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

    return ans

def main():
    s = str(input())
    print(changex(s))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

ans = 'x' * len(S)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC154 B
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
s=input()
s=list(s)
for i in range(len(s)):
    s[i]='x'

ans=''
for ss in s:
    ans+=str(ss)
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

import sys
readline = sys.stdin.readline
read = sys.stdin.read


#n,k,*p = [int(i) for i in read().split()]
s = input()

print("x"*len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
S = input()
leng = len(S)

print("x" * leng)

Submission status: Accepted

Solution code:
S = len(input())

print("x" * S)

Submission status: Accepted

Solution code:
import sys
from pprint import pprint

def solve(s):
    print("x" * len(s))

if __name__ == '__main__':
    s = sys.stdin.readline().strip()
    solve(s)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()


n = len(S)
print("x"*n)

Submission status: Accepted

Solution code:
a = list(input())

print("x"*len(a))

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
u=input()
length=len(u)
t=[]
for i in range(length):
    t.append("x")

print(''.join(t))

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n = input()
size = len(n)
for i in range(size):
    print("x", end = "")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()

result = 'x' * len(S)

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

L = len(S)

print("x"*L)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Feb  9 20:52:25 2020

@author: H_Hoshigi
"""

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

print(answer)

Submission status: Accepted

Solution code:
S = input()

print(''.join(['x' for s in S]))

Submission status: Accepted

Solution code:
S = input()
l= len(S)
A = []
for _ in range(l):
    A.append("x")

print("".join(A))

Submission status: Accepted

Solution code:
#200
S = input()
S1 = ""
n = len(S)
for _ in range(n):
    S1 = S1 + "x"
print(S1)

Submission status: Accepted

Solution code:
import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think('sardine'), 'xxxxxxx')

    def test_2(self):
        self.assertEqual(think('xxxx'), 'xxxx')

    def test_3(self):
        self.assertEqual(think('gone'), 'xxxx')


def solve():
    s = read()
    result = think(s)
    write(result)


def read():
    return read_line()


def read_int(n):
    return read_type(int, n, sep=' ')


def read_float(n):
    return read_type(float, n, sep=' ')


def read_type(t, n, sep):
    return list(map(lambda x: t(x), read_line().split(sep)))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(s):
    return 'x' * len(s)


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()

print (len(s)*'x')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

l = ["x"] * a
print("".join(l))

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()
print('x' * len(s))

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    # S, T = R_str()
    # A, B = R()
    # U = r()
    # if S == U:
    #     print(A-1,B)
    # else:
    #     print(A, B-1)
    
    S = r()
    print('x'*len(S))

    
    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
import sys
import math
import numpy as np
import itertools

# 文字列を一文字ずつのリストに代入 test は['t', 'e', 's', 't']
m = list(input())


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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    resolve()

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()
ans = ""
for i in range(len(S)):
  ans += "x"
print(ans)

Submission status: Accepted

Solution code:
S = input()

temp = 'x' * len(S)

print(temp)

Submission status: Accepted

Solution code:
#import re
import sys
#input = sys.stdin.readline
#import heapq
#import bisect
#from collections import deque
#import math

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


    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
u = input()

a = "x"*len(u)
print(a)

Submission status: Accepted

Solution code:
import math
import itertools
#n, d = list(input().split())
#A, B = list(map(int, input().split()))
s = input()
t = ""
for i in range(len(s)):
    t += "x"

print(t)