結果
| 問題 |
No.2400 Product of Gaussian Integer
|
| ユーザー |
cleantted
|
| 提出日時 | 2023-08-04 21:32:52 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 172 ms / 2,000 ms |
| コード長 | 1,395 bytes |
| コンパイル時間 | 259 ms |
| コンパイル使用メモリ | 82,324 KB |
| 実行使用メモリ | 90,472 KB |
| 最終ジャッジ日時 | 2024-10-14 19:31:27 |
| 合計ジャッジ時間 | 4,095 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 13 |
ソースコード
# import bisect
import copy
import heapq
import itertools
import math
import operator
import random
import sys
from bisect import bisect, bisect_left, bisect_right, insort
from collections import Counter, deque
from fractions import Fraction
from functools import cmp_to_key, lru_cache, partial
from inspect import currentframe
from math import ceil, gcd, log10, pi, sqrt
from typing import Iterable, Iterator, List, Tuple, TypeVar, Union
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import string
# import networkx as nx
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
# mod = 10 ** 9 + 7
mod = 998244353
# mod = 1 << 128
# mod = 10 ** 30 + 1
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]
def read_values(): return tuple(map(int, input().split()))
def read_index(): return tuple(map(lambda x: int(x) - 1, input().split()))
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
def dprint(*values): print(*values, file=sys.stderr)
def dprint2(*values):
names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values))
def main():
A, B = read_values()
C, D = read_values()
print(A * C - B * D, A * D + B * C)
if __name__ == "__main__":
main()
cleantted