結果
| 問題 | 
                            No.16 累乗の加算
                             | 
                    
| コンテスト | |
| ユーザー | 
                             くれちー
                         | 
                    
| 提出日時 | 2017-01-21 02:58:43 | 
| 言語 | Haskell  (9.10.1)  | 
                    
| 結果 | 
                             
                                TLE
                                 
                             
                            
                         | 
                    
| 実行時間 | - | 
| コード長 | 324 bytes | 
| コンパイル時間 | 8,315 ms | 
| コンパイル使用メモリ | 172,160 KB | 
| 実行使用メモリ | 322,032 KB | 
| 最終ジャッジ日時 | 2024-12-23 04:12:32 | 
| 合計ジャッジ時間 | 75,329 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge1 / judge3 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| other | AC * 3 TLE * 11 | 
コンパイルメッセージ
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:9:19: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, 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."
  |
9 | solve x xs = x ^ (head xs) `mod` m + solve x (tail xs)
  |                   ^^^^
Main.hs:9:47: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  |
9 | solve x xs = x ^ (head xs) `mod` m + solve x (tail xs)
  |                                               ^^^^
[2 of 2] Linking a.out
            
            ソースコード
import Control.Monad
import Control.Applicative
m :: Integral a => a
m = 1000003
solve :: Integral a => a -> [a] -> a
solve _ [] = 0
solve x xs = x ^ (head xs) `mod` m + solve x (tail xs)
main = do
    [x, n]  <- map read . words <$> getLine
    as <- map read . words <$> getLine
    putStrLn $ show $ solve x as `mod` m
            
            
            
        
            
くれちー