Problem:


Score : 100 points

Problem Statement

As a New Year's gift, Dolphin received a string s of length 19.

The string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].

Dolphin wants to convert the comma-separated string s into a space-separated string.

Write a program to perform the conversion for him.  

Constraints

The length of s is 19.

The sixth and fourteenth characters in s are ,.

The other characters in s are lowercase English letters.

Input

The input is given from Standard Input in the following format:

s

Output

Print the string after the conversion.

Sample Input 1

happy,newyear,enjoy

Sample Output 1

happy newyear enjoy

Replace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.

Sample Input 2

haiku,atcoder,tasks

Sample Output 2

haiku atcoder tasks

Sample Input 3

abcde,fghihgf,edcba

Sample Output 3

abcde fghihgf edcba



Sample input:
happy,newyear,enjoy


Sample output:
happy newyear enjoy

Submission status: Runtime Error

Solution code:
s = input()
print(s[:5]+' '+s[6:13]+' '+a[14:])

Submission status: Runtime Error

Solution code:
s = input()
print(s[:5]+' '+s[6:13]+' '+a[14:])

Submission status: Runtime Error

Solution code:
a=input()
print(a.replace(',',' ')

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())
i = 0
x = 0
for x in range(0,k+1):
    for y in range(0,k+1):
        for z in range(0,k+1):
            p = x+y+z
            if x+y+z == s: i += 1

print(i)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())
count = 0
for i in range(K+1):
    for j in range(K+1):
            if 0<=S-i-j<=K:
                count += 1
print(count)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())
count = 0
for i in range(K+1):
    for j in range(K+1):
            if S-i-j<=K:
                count += 1
print(count)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())
count = 0
for i in range(K+1):
    for j in range(K+1):
        for k in range(K+1):
            if i+j+k == S:
                count += 1
print(count)

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print(a,b,c)

Submission status: Runtime Error

Solution code:
a,b,c=map(input().split(","))
print(a,b,c)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())

def fun(k, s):
    count = 0
    for i in range(k+1):
        for j in range(k+1):
            if s - i - j <= k or s - i - j >= 0:
                count += 1

    return count

print(fun(k, s))

Submission status: Runtime Error

Solution code:
happy,newyear,enjoy

Submission status: Runtime Error

Solution code:
S=str(input())
print(S[0:5]+' '+S[6:13]+' 'S[14:19])

Submission status: Runtime Error

Solution code:
K,S = map(int, input().split())

count = 0

for X in range(K+1):
  for Y in range(K+1):
    for Z in range(K+1):
      if X+Y+Z == S:
        count += 1
  
print(count)

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print(a,b,c,="")

Submission status: Runtime Error

Solution code:
s1,s2,s3=map(str,input().split(","))
print(S1,S2,S3)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())

ans = 0
for i in range(0,k+1):
  for j in range(0,k+1):
    if i+j <= s and s-(i+j) <= k:
      ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
s = input()
s[5]=' '
s[13]=' '
print(s)

Submission status: Runtime Error

Solution code:
K,S=map(int,input().split())
ans=0
for i in range(K+1):
    for j in range(K+1):
        if S-i-j<=K and S-i-j>=0:
            ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
cnt=0
for i in range(k+1):
    for j in range(k+1):
        z=s-i-j
        if z>=0 and z<=k:
            cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
                   
K, S = map(int, input().split())
cnt = 0

for X in range(0, K+1):
     for Y in range(0, K+1):
         if 0<=S-X-Y and S-X-Y<=K:
             cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
print(input().replace(',','')

Submission status: Runtime Error

Solution code:
print(s.replace(',', '')

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())
ans = 0
for i in range(k+1):
    for j in range(k+1):
		if 0 < s- (i + j) < k:
			ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())
ans = 0
for i in range(k+1):
    for j in range(k+1):
         for k in range(k+1):
                 if i + j + k ==s:
                        ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

count = 0

for X in range(K + 1):
  for Y in range(K + 1):
      if S - (X + Y) <= K and S - (X + Y) >= 0:
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
k = int(input())
s = int(input())

ans = 0

for x in range(k+1):
  for y in range(k+1):
    r = s - (x + y)
    if r >= 0 and r <= k:
      ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
x = list(map(int,input().split()))
count=0
for a in range(0,x[0]+1):
    for b in range(0,x[0]+1):
        for c in range(0,x[0]+1):
            if(a+b+c==x[1]):
                count+=1
print(count)

Submission status: Runtime Error

Solution code:
x = list(map(int,input().split()))
count=0
for a in range(0,x[1]+1):
    for b in range(0,x[0]+1):
        for c in range(0,x[0]+1):
            if(a+b+c==x[1]):
                count+=1
print(count)

Submission status: Runtime Error

Solution code:
x = list(map(int,input().split()))
count=0
for a in range(0,x[1]):
    for b in range(0,x[0]+1):
        for c in range(0,x[0]+1):
            if(a+b+c==x[1]):
                count+=1
print(count)

Submission status: Runtime Error

Solution code:
a,b,c = input()split(',')
print(a,b,c)

Submission status: Runtime Error

Solution code:
a,b,c = input().split(,)
print(a,b,c)

Submission status: Runtime Error

Solution code:
s1,s2,s3=list(map(str,input().split(,)))
print(s1 , s2 , s3)

Submission status: Runtime Error

Solution code:
s1,s2,s3=list(map(str,input().split(,)))
print(s1 +''+ s2 +''+ s3)

Submission status: Runtime Error

Solution code:
s1,s2,s3=list(map(str,input().split()))
print(s1[:5] +''+ s2[:7] +''+ s3[:5])

Submission status: Runtime Error

Solution code:
a,b,c=input().sprit(',')
print(a,b,c)

Submission status: Runtime Error

Solution code:
a,b,c=input().sprit(",")
print(a,b,c)

Submission status: Runtime Error

Solution code:
# cadidates of no shortest paths
n, m = map(int, input().split())

d = [[float("inf") for i in range(n + 1)] for i in range(n + 1)]
edge_data=[]
connect={i:[] for i in range(1,n+1)}
for i in range(m):
    x, y, z = map(int, input().split())
    # 有向グラフか無向グラフかによってここで場合わけが生じる
    d[x][y] = z
    d[y][x] = z
    connect[x].append(y)
    connect[y].append(x)    
    edge_data.append((x,y,z))
for i in range(n + 1):
    d[i][i] = 0  # 自身のところに行くコストは０


def warshall_floyd(d):
    # d[i][j]=i番目の頂点からj番目の頂点までの最短距離
    for k in range(1, n + 1):
        for i in range(1, n + 1):
            for j in range(1, n + 1):
                d[i][j] = min(d[i][j], d[i][k] + d[k][j])
    return d

warshall_floyd(d)

#最短距離を求めた
cnt=0
for some in edge_data:
    x,y,z=some[0],some[1],some[2]
    if d[x][y]<z:
        cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
# cadidates of no shortest paths
n, m = map(int, input().split())

d = [[float("inf") for i in range(n + 1)] for i in range(n + 1)]
edge_data=[]
connect={i:[] for i in range(1,n+1)}
for i in range(m):
    x, y, z = map(int, input().split())
    # 有向グラフか無向グラフかによってここで場合わけが生じる
    d[x][y] = z
    d[y][x] = z
    connect[x].append(y)
    connect[y].append(x)    
    edge_data.append((x,y,z))
for i in range(n + 1):
    d[i][i] = 0  # 自身のところに行くコストは０


def warshall_floyd(d):
    # d[i][j]=i番目の頂点からj番目の頂点までの最短距離
    for k in range(1, n + 1):
        for i in range(1, n + 1):
            for j in range(1, n + 1):
                d[i][j] = min(d[i][j], d[i][k] + d[k][j])
    return d

warshall_floyd(d)

#最短距離を求めた
cnt=0
for some in edge_data:
    x,y,zsome[0],some[1],some[2]
    if d[x][y]<z:
        cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
x, y, z = input().split()

print (x+" "+y+" "+z)

Submission status: Runtime Error

Solution code:
K,S=map(int,input().split())
cnt=0


for x in range(K+1):
    for y in range(K+1):
        z = S -x-y
        if 0 <= z and z <= K:
            cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
s=list(str(input()))
s[5]=' '
s[13]=' '
print('',join(s))

Submission status: Runtime Error

Solution code:
import sys
 
 
def solve(K: int, S: int):
    cnt = 0
    for x in range(K+1):
        for y in range(K+1):
            z = S - x - y
            if z >= 0 and z <= K:
                cnt += 1
    print(cnt)
    return
  
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    S = int(next(tokens))  # type: int
    solve(K, S)
 
if __name__ == '__main__':
    main()
#!/usr/bin/env python3
import sys


def solve(K: int, S: int):
    cnt = 0
    for x in range(K+1):
        for y in range(K+1):
            z = S - x - y
            if z >= 0 and z <= K:
                cnt += 1
    print(cnt)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    S = int(next(tokens))  # type: int
    solve(K, S)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
k,s = map(int, input().split())

count = 0
for i in range(k+1):
    if s-i > k:
        rang = k
    else:
        rang = s-i
    for j in range(rang+1):
        if s-i-j < 0:
            continue
        elif s-i-j > k:
            rangg = k
        else:
            rang = s-i-j
        for h in range(rang+1):
            if i+j+h == s:
                count += 1

print(count)

Submission status: Runtime Error

Solution code:
k,s = map(int, input().split())

count = 0
for i in range(k+1):
    for j in range(k+1):
        if s - (i+j) <= k:
            count += 1

print(count)

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
print(b,a)

Submission status: Runtime Error

Solution code:
A = input()
for i in range(len(A)):
  if A[i] == ',':
    A[i] = ''

print(A)

Submission status: Runtime Error

Solution code:
sx,sy,tx,ty=map(int,input().split())
dx,dy=tx-sx,ty-sy
st1='U'*dy+'R'*dx
ts1='D'*dy+'L'*dx
st2='L'+'U'*(dy+1)+'R'*(dx+1)+'D'
ts2='R'+'D'*(dy+1)+'L'*(dx+1)+'U'
print(st1+ts1+st2+ts2)

Submission status: Runtime Error

Solution code:
line = input().split(' ')
print(line[0],line[1],line[2])

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
c=0
for i in range(k+1):
  for j in range(k+1):
    for l in range(k+1):
      if i+j+l==s:
        c+=1
        break
print(c)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())
count = 0

for i in range(K+1):
  for j in range(K+1):
    if S - i - j <= K and S - i - j >= 0:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
s=str(input("enter a statment))
z=s.replace(","," ")
print(z)

Submission status: Runtime Error

Solution code:
s=str(input("please enter your statment))
s[3]=" "
s[13]=" "
print(s)

Submission status: Runtime Error

Solution code:
print(input().replace(","," ")

Submission status: Runtime Error

Solution code:
X=list(map(int,input().split()))
#X軸に並行
if X[2]-X[0]==0:
    if X[3]-X[1]>0:
        q=X[3]-X[1]
        U="U"
        D="D"
    else:
        q=X[1]-X[3]
        U="U"
        D="D"
    print(U*(q+1)+R*2+D*(q+2)+L*2+U+L+U*q+R*2+D*q+L)
#Y軸に並行
if X[3]-X[1]==0:
    if X[2]-X[0]>0:
        p=X[2]-X[0]
        R="R"
        L="L"
    else:
        p=X[0]-X[2]
        R="L"
        L="R"
    print(R*(p+1)+U*2+L*(p+2)+D*2+R+D+R*p+U*2+L*p+D)
 
if X[2]-X[0]!=0 and X[3]-X[1]!=0
    if X[2]-X[0]>0:
        p=X[2]-X[0]
        R="R"
        L="L"
    else:
        p=X[0]-X[2]
        R="L"
        L="R"
    if X[3]-X[1]>0:
        q=X[3]-X[1]
        U="U"
        D="D"
    else:
        q=X[1]-X[3]
        U="D"
        D="U"
    print(U*p+R*(q+1)+D*(p+1)+L*(q+1)+U+L+U*(p+1)+R*(q+1)+D*(p+1)+L*q)  
X=list(map(int,input().split()))
#X軸に並行
if X[2]-X[0]==0:
    if X[3]-X[1]>0:
        q=X[3]-X[1]
        U="U"
        D="D"
    else:
        q=X[1]-X[3]
        U="U"
        D="D"
    print(U*(q+1)+R*2+D*(q+2)+L*2+U+L+U*q+R*2+D*q+L)
#Y軸に並行
if X[3]-X[1]==0:
    if X[2]-X[0]>0:
        p=X[2]-X[0]
        R="R"
        L="L"
    else:
        p=X[0]-X[2]
        R="L"
        L="R"
    print(R*(p+1)+U*2+L*(p+2)+D*2+R+D+R*p+U*2+L*p+D)
if X[2]-X[0]!=0 and X[3]-X[1]!=0:
    if X[2]-X[0]>0:
        p=X[2]-X[0]
        R="R"
        L="L"
    else:
        p=X[0]-X[2]
        R="L"
        L="R"
    if X[3]-X[1]>0:
        q=X[3]-X[1]
        U="U"
        D="D"
    else:
        q=X[1]-X[3]
        U="D"
        D="U"
    print(U*p+R*(q+1)+D*(p+1)+L*(q+1)+U+L+U*(p+1)+R*(q+1)+D*(p+1)+L*q)

Submission status: Runtime Error

Solution code:
#adfjklsdjsfljfl;kdjldkjflkdsdfjksfjdklsfjdkjsfdjfsddfsfsdfsdfdfs
print(s.replace(',', ' '))

Submission status: Runtime Error

Solution code:
k, s = list(map(int, input().split()))
cnt = 0
for i in range(k+1):
    for j in range(k+1):
        for k in range(k+1):
            total = i+j+k
            if total==s:
                cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
s = map(str,input())
print(s.replace(","," "))

Submission status: Runtime Error

Solution code:
a,sums=list(map(int,input().split()))
if a*3==sums:
  print(1)
else:
  ret=0
  mai=2 if sums%3==0 & sums//3<=a else 0
  for i in range(a):
    if sums-i <2*a:
      for d in range(a):
        if sums-i-d<a:
          if sums-i-d == d:
            ret+=1
          else:
            ret+=2
    if sums-i == 2*a:
      ret+=1
  print(ret*3-mai)

Submission status: Runtime Error

Solution code:
k, s = [int(x) for x in input().split()]
cnt = 0
for x in range(k + 1):
    if x > s:
        continue
    for y in range(x, k + 1):
        if y > s:
            break
        for z in range(y, k + 1):
            if z > s:
                break
            if x + y + z == s:
                if x == y == z:
                    cnt += 1
                elif x == y or y == z:
                    cnt += 3
                else:
                    cnt += 3
print(cnt)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
 
const int mx=200010;
const ll mod=1e9+7;

int main(){
  string s;
  cin >> s;

  cout << s.substr(0,5) << " " << s.substr(6,7) << " " << s.substr(14,5) << endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
k, s = [int(x) for x in input().split()]
cnt = 0
for x in range(k + 1):
    for y in range(k + 1):
        for z in range(k + 1):
            if x + y + z == s:
                cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
input = list(map(int,input().split()))

ans_count = 0
for i in range(0, input[0]):
  for j in range(0, input[0]):
    for k in range(0, input[0]):
      if (i + j + k == input[1]):
        ans_count+=1
        
print(ans_count)

Submission status: Runtime Error

Solution code:
k,s = map(int,input().strip().split())
count= 0
for x in range(k+1):
    for y in range(k+1):
        if s-x-y >= 0 and s-x-y <= k:
            count += 1
        
        
print(count)

Submission status: Runtime Error

Solution code:
print(input().replace(',',' ')

Submission status: Runtime Error

Solution code:
a = input().split()
k = int(a[0])
s = int(a[1])

count = 0

for x in range(k + 1):
    if x > s:
        break
    for y in range(k + 1):
        if x + y > s:
            break
        else:
            if (k + 1) > (s - x - y):
                # print(x, y, (s - x - y))
                count = count + 1

print(count)

Submission status: Runtime Error

Solution code:
a = input().split()
k = int(a[0])
s = int(a[1])

count = 0

for x in range(k + 1):
    for y in range(k + 1):
        for z in range(k + 1):
            if x + y + z == s:
                count = count + 1
            elif x + y + z > s:
                continue
        if x + y > s:
            continue
    if x > s:
        continue

print(count)

Submission status: Runtime Error

Solution code:
a = input().split()
k = int(a[0])
s = int(a[1])

count = 0

for x in range(k + 1):
    if x > s:
        continue
    for y in range(k + 1):
        if x + y > s:
            continue
        for z in range(k + 1):
            if x + y + z == s:
                count = count + 1
            elif x + y + z > s:
                continue
print(count)

Submission status: Runtime Error

Solution code:
a = input().split()
k = int(a[0])
s = int(a[1])

count = 0

for x in range(k + 1):
    if x > s:
        break
    for y in range(k + 1):
        if x + y > s:
            break
        for z in range(k + 1):
            if x + y + z == s:
                count = count + 1
            elif x + y + z > s:
                break
print(count)

Submission status: Runtime Error

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

print(s[0]+s[1]+s[2]+s[3]+s[4])+" "+s[6]+s[7]+s[8]+s[9]+s[10]+s[11]+s[12]+" "+s[14]+s[15]+s[16]+s[17]+s[18])

Submission status: Runtime Error

Solution code:
a, b, c=input().split()
print(a, b, c)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())

count = 0
for x in range(0, k+1):
   for y in range(0, k+1):
         z = s - (x + y)
         if (z >= 0 and z <= k):
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
S=input()
print(S,replace(',',' ')

Submission status: Runtime Error

Solution code:
# https://atcoder.jp/contests/abc051/tasks/abc051_b

# n n,
k, s = map(int, input().split())

# initialize
ans = 0

# logic: 全探索: 基本形
for i in range(k + 1):
    for j in range(k + 1):
        if 0 <= s - i - j <= k:
            ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
li=input().spl;it(',')
print(li[0]+' '+li[1]+' ' + li[2])

Submission status: Runtime Error

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

K,S = map(int,input().split())
result =0

for x in range(K+1):
    for y in range(K+1):
        z = S - x - y
        if 0 <= z <= K:
            result += 1

print(result)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
s = input().split(,)
print(*s)

Submission status: Runtime Error

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

for i in range(19):
    
    if i==5 or i==13
        ans += ' '

    else:
        ans += s[i]

print(ans)

Submission status: Runtime Error

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

for i in range(19):
    
    if i == 5 or 13
        ans += ' '

    else:
        ans += s[i]

print(ans)

Submission status: Runtime Error

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

for i in range(19):
    
    if i==5 or i==13
        ans += ','
    else:
        ans += s[i]

print(ans)

Submission status: Runtime Error

Solution code:
s = str(input()) 
lst = [s[0:5], , s[6:13], , s[14:]]
print(''.join(lst))

Submission status: Runtime Error

Solution code:
s = str(input())
print(s[0:5]+' '+s[6:13]+' '+s[14:]

Submission status: Runtime Error

Solution code:
a, b, c = map(str, input().split(,))

print(a+''+b+''+c)

Submission status: Runtime Error

Solution code:
print(" ".join(input().split(','))

Submission status: Runtime Error

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

int main()
{
  	string s;
  	cin>>s;
  	for(int i = 0; i < s.length(); i++)
  	{
    	if(s[i] == ',')
      		cout<<" ";
      	else
      		cout<<s[i];
    }
  	cout<<"\n";
	return 0;
}

Submission status: Runtime Error

Solution code:
print(input().replace("," " "))

Submission status: Runtime Error

Solution code:
K, S = [int(i) for i in input().split()]
AA = [1 for X in range(K+1) for Y in range(K+1) if 0<=S-X-Y<=K]
print(len(AA))

Submission status: Runtime Error

Solution code:
s = map( str, input().split(",") )
print( s[0] + " " + s[1] + " " + s[2] )

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
ans = 0
for i in range(k+1):
  if k <=s-i<=2*k:
    ans+= s-i+1
  elif 0<=s-i<=k:
    ans+= k*2-s+1
print(ans)

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
ans = 0
for i in range(k+1):
  if k<=s-i<=2*k:
      ans+= s-i+1
  elif 0<=s-i<=k:
      ans+= k*2-s+1
print(ans)

Submission status: Runtime Error

Solution code:
s_x, s_y, t_x, t_y = map(int, input().split())
#点のインプット
for i in range(t_x - s_x):
  print("R", end="")
for i in range(t_y - s_y):
  print("U", end="")
for i in range(t_x - s_x):
  print("L", end="")
for i in range(t_y - s_y):
  print("D", end="")
t_x = t_x+1
t_y = t_y+1
s_x = s_x
s_y = s_y
print("D", end="")
for i in range(t_x - s_x):
  print("R", end="")
for i in range(t_y - s_y):
  print("U", end="")
print("LU", end="")
for i in range(t_x - s_x):
  print("L", end="")
for i in range(t_y - s_y):
  print("D", end="")
print("R", end="")

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())
count = 0

for x in range(K + 1):
    for y in range(K + 1):
        z = S - (x + y)
        if 0 <= z and z <= K:
            count += 1

print(count)

Submission status: Runtime Error

Solution code:
s=list(input())
for i in range(5):
    print(s[i],end='')
print(' ',end='')
for i in range(7):
    print(i+6,end='')
print(' ',end='')
for i in range(5):
    print(s[i+13],end'')

Submission status: Runtime Error

Solution code:

l = list(map(int,input().split()))

count = 0

for x in range(l[0] + 1):
    for y in range(l[0] + 1):
        for z in range(l[0] + 1):
            if x + y + z == l[1]:
                count += 1
                print(x,y,z)

print(count)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
print(max([a*b,c*d])

Submission status: Runtime Error

Solution code:
s = input().split()
print(s[0]+' '+s[1]+' '+s[2])

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())
count=0
for x in range(K+1):
    for y in range(K+1):
        z = S - (x+y)
        if (z <= K) & (z >= 0):
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
a,b,c = map(str,input().split(,))
print(a,b,c)

Submission status: Runtime Error

Solution code:
K,S=map(int, input().split())
count = 0
for x in range(K+1):
    for y in range(K+1):
        if 0<=S-x-y<=K:
            count=count+1
print(count)

Submission status: Runtime Error

Solution code:
K,S=map(int, input().split())
count = 0
for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if x+y+z==S:
                count = count +1
print(count)

Submission status: Runtime Error

Solution code:
s = list(input())

for i in range(len(s)):
  if s[i] == ',':
    s[i] == ' '

print(''.join())

Submission status: Runtime Error

Solution code:
K,S=map(int,input().split())
count=0
for x in range(K+1):
    for y in range(K+1):
        sumz=S-x-y
        if sumz>=0 and sumz<=K:    
            count+=1
print(count)

Submission status: Runtime Error

Solution code:
s=input()
s[5]=' '
s[13]=' '
print(s)

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
cnt=0

for x in range(k+1):
  for y in range(k+1):
    for z in range(k+1):
      if x+y+z==s:
        cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())

sum_set = []
for i in range(k + 1):
    for j in range(k + 1):
        for m in range(k + 1):
            if i + j + m == s:
                comb = [i, j, m]
                sum_set.append(comb)
                break
print(len(sum_set))

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
cnt=0
for x in range(a+1):
    for y in range(a+1):
        z = b-x-y
        if 0<=z<=a and x+y+z==b:
            cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())


ans = 0
for x in range(K+1):
    for y in range(K+1):
       z = S - x - y
       if z >= 0 and z <= K:
           ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

ans = 0
for i in range(K+1):
    for j in range(K+1):
        for l in range(K+1):
            if i + j + l == S:
                ans += 1


print(ans)

Submission status: Runtime Error

Solution code:
s = [input().split()]
print('{} {} {}'.format(s))

Submission status: Runtime Error

Solution code:
input_ = inpur().split(",")
print(" ".join(str for i in input))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())
OK = 0
for x in range(K+1):
    if(0<=S-x & S-x<=2*K): # 計算の成立条件
        if(S-x<=K): # yとzの和がk以下
            OK += S-x+1
        else: # yとzの和がk以上
            OK += (K-((S-x)-K))+1
print(OK)

Submission status: Runtime Error

Solution code:
s = input()
s[5] = " "
s[:5] = " "
print(s)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())


def calc_yz(target, limit):
    yz_list = []
    for y in range(limit + 1):
        z = target - y
        if 0 <= z <= limit:
            yz_list.append([y, z])
    return yz_list


def calc_xyz(target, limit):
    xyz_list = []
    for x in range(limit + 1):
        yz_sum = target - x
        if yz_sum < 0:
            continue
        yz_list = calc_yz(yz_sum, limit)
        for yz in yz_list:
            xyz_list.append([x] + yz)
    return xyz_list


print(len(calc_xyz(s, min(s, k))))

Submission status: Runtime Error

Solution code:
s = input().split()

s[6], s[14] = ""

print(s)

Submission status: Runtime Error

Solution code:
a,b,c = map(str, input().split())
d = ' '
print(a+d+b+d+c)

Submission status: Runtime Error

Solution code:
k, s = input().split()
k, s = int(k), int(s)
ans = 0
for x in range(0, k+1):
  for y in range(0, k+1):
    for z in range(0, k+1):
      if x+y+z==s:
        ans += 1
        break
print(ans)

Submission status: Runtime Error

Solution code:
s = input()
a, b, c = s.split(',')
print(f'{a} {b} {c}')

Submission status: Runtime Error

Solution code:
s=input().split(,)
print(s[0],s[1],s[2])

Submission status: Runtime Error

Solution code:
s = input()
s[5] = ' '
s[13] = ' '
print(s)

Submission status: Runtime Error

Solution code:
print(" ".jpin(input().split(",")))

Submission status: Runtime Error

Solution code:
k,s = map(int,input().split())
count = 0
for i in range(k+1):
    for j in range(k+1):
        if s-(i+j) <= k and s-(i+j) >= 0:
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
k,s = map(int,input().split())
count = 0
for i in range(k+1):
    for j in range(k+1):
        if s-i-j <= k:
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())
# print(k, s)
count = 0
for i in range(k+1):
    for j in range(k+1):
        for k in range(k+1):
            # print(i, j, k)
            if i + j + k == s:
                count += 1
print(count)

Submission status: Runtime Error

Solution code:
def main():
  k, s = map(int, input().split())
  cnt = 0
  for i in range(k+1):
    for j in range(k+1):
      if 0 <= s - i - j <= k:
        cnt += 1
  print(cnt)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())
cnt = 0
for i in range(k+1):
  if i < s:
    for j in range(k+1):
      if i + j :
        for l in range(k+1):
          if i + j + l == s:
            cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
a = list(map(int,input().split()))
k = int(a[0])
s = int(a[1])
count = 0

for x in range(k+1):
    for y in range(k+1):
        if(s-x-y >= 0) and (s-x-y <= k):
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
K,S=map(int,input().split())
crt=0
for x in range(0,K+1):
  for y in range(0,K+1):
    z=S-x-y
    if 0<=z<=K:
      crt+=1
print(crt)

Submission status: Runtime Error

Solution code:
ks = input()
k, s = [int(x) for x in ks.split(" ")]
comb = []
for x in range(k + 1)[::-1]:
    for y in range(min(x + 1, s - x))[::-1]:
        z = s - x - y
        if (x <= k and y <= k and z <= k and y <= x and z <= x and y <= z):
            comb.append([x,y,z])
count = 0
for c in comb:
    l = len(set(c))
    if l == 1:
        count += 1
    elif l == 2:
        count += 3
    else:
        count += 6

Submission status: Runtime Error

Solution code:
sk = input()
count = 0
s, k = [int(x) for x in sk.split(" ")]
for i in range(s + 2):
    for j in range(i + 1, s + 2):
        x = i
        y = j - i - 1
        z = s - y - x
        if x <= k and y <= k and z <= k:
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())
ans = 0
for x in range(k+1):
    for y in range(k+1):

        for z in range(k+1):
            if s == x+y+z:
                ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
count=0
for x in range(k+1):
    for y in range(k+1):
        z=s-x-y
        if z>=0 and z<=k:
            count+=1
print(count)

Submission status: Runtime Error

Solution code:
print(str(input().split(',',' ')))

Submission status: Runtime Error

Solution code:
K,S = map(int,input().split())

count = 0

for x in range(S+1):
    for y in range(S+1):
        z = S - x - y
        if 0<=z & z<=K:
            count+=1


print(count)

Submission status: Runtime Error

Solution code:
s = input()
s.replace(','. ' ')
print(s)

Submission status: Runtime Error

Solution code:
*a, = map(int,input().split())
print(max(a)-min(a))

Submission status: Runtime Error

Solution code:
num = input().split()

k = int(num[0])
s = int(num[1])

import numpy as np

x = np.arange(k+1)
y = np.arange(k+1).reshape(k+1,1)
z = np.arange(k+1) 
 
xy = x + y

count =0
# p = xy[:,1]
#print(p)
# l=0
for i in range(k+1) :
        a =  z+ xy[:,i]
        # print(a)
        count +=np.count_nonzero(a == s)
        # l +=1
        # print(l)
print(count)

Submission status: Runtime Error

Solution code:
l = list(map(int, input().split()))

print(l[1], l[0])

Submission status: Runtime Error

Solution code:
s = input().split(",")
print(" ".join(s))⏎