結果

問題 No.816 Beautiful tuples
ユーザー torus711
提出日時 2019-06-22 15:13:08
言語 Haskell
(9.10.1)
結果
AC  
実行時間 18 ms / 1,500 ms
コード長 1,017 bytes
コンパイル時間 2,130 ms
コンパイル使用メモリ 180,304 KB
実行使用メモリ 13,952 KB
最終ジャッジ日時 2024-12-26 09:03:34
合計ジャッジ時間 2,882 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 15
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )

Main.hs:33:1: warning: [GHC-94817] [-Wtabs]
    Tab character found here, and in 12 further locations.
    Suggested fix: Please use spaces instead.
   |
33 |         [ a, b ] <- readInts
   | ^^^^^^^^

Main.hs:40:22: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
40 |                 else head res
   |                      ^^^^
[2 of 2] Linking a.out

ソースコード

diff #

{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}

import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST

import Data.Char
import Data.List
import Data.Maybe

import qualified Data.ByteString.Char8 as B

import Data.Array.ST.Safe
import Data.STRef

import Debug.Trace
import Text.Printf

readInt = readLn :: IO Int
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readNInts = readInt >>= flip replicateM readInt

which a b f = if f then a else b
mp [ a, b ] = ( a, b )

main = do
	[ a, b ] <- readInts
	let
		divs1 = takeWhile ( \i -> i * i <= a + b ) [ 1 .. ]
		divs2 = map ( \i -> ( a + b ) `div` i ) divs1
		res = filter ( f a b ) $ sort $ divs1 ++ divs2
	print $ if null res
		then -1
		else head res

f a b c = ( a + b ) `mod` c == 0 && ( a + c ) `mod` b == 0 && ( b + c ) `mod` a == 0 && a /= b && a /= c && b /= c
0