結果

問題 No.3278 Avoid Division
コンテスト
ユーザー lif4635
提出日時 2025-09-19 22:10:52
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,159 bytes
コンパイル時間 181 ms
コンパイル使用メモリ 82,776 KB
実行使用メモリ 70,056 KB
最終ジャッジ日時 2025-09-19 22:10:58
合計ジャッジ時間 5,121 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 1
other WA * 2 RE * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


alplow = "abcdefghijklmnopqrstuvwxyz"

def pri(op, i, j, k):
    print(op, end = " ")
    for p in [i, j, k]:
        if p < n:
            print("A[", i+1, "]", sep = "", end = " ")
        else:
            print(alplow[p-n], sep = "", end = " ")
    print()

n = II()
f = {"+":"add", "*":"mul", "/":"div"}
op = []
a = [0] * (n + 26)
for i in range(n):
    o, x = input().split()
    op.append(f[o])
    a[i] = int(x)


alp = n
for i in reversed(range(n)):
    if op[i] == "div":
        if a[alp] == 0:
            pri("add", alp+1, i, alp+1)
        else:
            pri("mul", alp+1, i, alp+1)

if a[alp+1] != 0:
    pri("mul", alp+4, alp+1, alp+1)
    pri("div", alp+1, alp+1, alp+4)

for i in range(n):
    if op[i] == "add" or op[i] == "mul":
        pri(op[i], alp+2, a[i], alp+2)
    else:
        # div が入っているはず
        pri("mul", alp+3, alp+1, alp+2)
        pri("add", alp, alp, alp+3)
        pri("mul", alp+1, alp+1, i)
0