이호진

T = int(input()) for test_case in range(1, T + 1): n=int(input()) num=[] for i in range(len(str(n))): num.append(str(n)[i]) num=list(set(num)) temp=1 while len(num)!=10: temp+=1 for i in range(len(str(n*temp))): num.append(str(n*temp)[i]) num=list(set(num)) print('#%d %d'%(test_case,temp*n))

T = int(input()) for test_case in range(1, T + 1): money=[0]*8 arr=[50000,10000,5000,1000,500,100,50,10] n=int(input()) count=0 for i in range(len(arr)): count=n//arr[i] money[i]=count n%=arr[i] print('#{}'.format(test_case)) print(*money)

T = int(input()) for test_case in range(1, T + 1): arr=input() result=[] for i in arr: if i.isalpha(): result.append(i) flag=1 for i in range(int(len(result)/2)): if result[i]!=result[-i-1]: flag=0 print('#%d %d'%(test_case,flag))

T = int(input()) for test_case in range(1, T + 1): n,m=map(int,input().split()) graph=[] for i in range(n): graph.append(list(map(int,input().split()))) count=0 for i in range(n): current=0 for j in range(n): if graph[i][j]==1: current+=1 if graph[i][j]==0 or j==n-1: if current==m: count+=1 current=0 for j in range(n): if graph[j][i]==1: current+=1 if graph[j][i]==0 or j==n-1: if current==m: cou..

T = int(input()) for test_case in range(1, T + 1): n,m=map(int,input().split()) graph=[] for i in range(n): graph.append(list(map(int,input().split()))) mx=0 for i in range(n-m+1): for j in range(n-m+1): c=0 for k in range(m): for l in range(m): c+=graph[j+l][i+k] if c>mx: mx=c print('#%d %d'%(test_case,mx))

T = int(input()) for test_case in range(1, T + 1): arr=input() for i in range(1,len(arr)+1): if arr[:i]==arr[i:i+i]: print('#%d %d'%(test_case,i)) break

T = int(input()) for test_case in range(1, T + 1): n=int(input()) result=[] for i in range(1,n+1): if len(str(i))==1: if i%3==0: result.append('-') else: result.append(i) elif len(str(i))==2: if int(str(i)[0])%3==0 and int(str(i)[1])%3!=0: result.append('-') elif int(str(i)[0])%3!=0 and int(str(i)[1])%3==0: result.append('-') elif int(str(i)[0])%3==0 and int(str(i)[1])%3==0: result.append('--') ..