結果

問題 No.233 めぐるはめぐる (3)
ユーザー Tsubajiro
提出日時 2022-05-19 00:06:33
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
WA  
実行時間 -
コード長 1,144 bytes
コンパイル時間 91 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 28,140 KB
最終ジャッジ日時 2024-09-17 04:20:30
合計ジャッジ時間 8,531 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample WA * 3
other WA * 11
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import copy
N = int(input())
S = []
candi = set()
for _ in range(N):
s=input()
candi.add(s)
s = ["n","b","m","g","r"]
b = ["i","a","a","e","u","u"]
print(candi)
s5=[]
b6=[]
for i in range(6):
if i<5:
s5.append(i)
b6.append(i)
import itertools
ss = list(itertools.permutations(s5,5))
bb = list(itertools.permutations(b6,6))
#print(ss)
flag=False
for i in ss:
c = [[] for _ in range(16)]
#print(c[0])
#print(s[i[0]])
for j in bb:
c[1] = (s[i[0]])
c[4] = (s[i[1]])
c[7] = (s[i[2]])
c[10] = (s[i[3]])
c[13] = (s[i[4]])
c[2] = (b[j[0]])
c[5] = (b[j[1]])
c[8] = (b[j[2]])
c[11] = (b[j[3]])
c[14] = (b[j[4]])
#cc=c.copy()
cc=copy.deepcopy(c)
for k in range(0,16,3):
cc[k]=b[j[5]]
candidate = ""
#print(cc)
for ccc in cc:
if not ccc==[]:
#print(ccc)
candidate+=ccc
print(candidate)
if candidate not in candi:
print(candidate)
exit()
print("No")
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0