結果

問題 No.528 10^9と10^9+7と回文
ユーザー aimy
提出日時 2017-06-10 14:45:07
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 685 bytes
コンパイル時間 2,130 ms
コンパイル使用メモリ 171,736 KB
実行使用メモリ 21,248 KB
最終ジャッジ日時 2024-09-24 15:37:11
合計ジャッジ時間 6,768 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 8 WA * 20
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:17:20: 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."
   |
17 |   nh = digitToInt (head n)
   |                    ^^^^

Main.hs:22:78: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, 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."
   |
22 |         (if nh<=nt then 1 else 0) * max 1 (sum (zipWith min (map digitToInt (tail (n1 ++ "9"))) (map digitToInt (tail (reverse n2)))))
   |                                                                              ^^^^

Main.hs:22:114: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, 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."
   |
22 |         (if nh<=nt then 1 else 0) * max 1 (sum (zipWith min (map digitToInt (tail (n1 ++ "9"))) (map digitToInt (tail (reverse n2)))))
   |                                                                                                                  ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.Char
import Data.List

pow q x n
 | n == 0 = 1
 | odd n = mod (x * pow q x (n-1)) q
 | otherwise = mod ((pow q x (div n 2))^2) q

main = do
 n <- getLine
 print (npalin (10^9) n)
 print (npalin (10^9+7) n)

npalin q n = mod (np1 + np2) q
 where
  l = length n
  nh = digitToInt (head n)
  nt = digitToInt (last n)
  (n1,n2) = splitAt (div l 2) n
  np1 = foldr (\p acc -> mod (acc+p) q) 0 (take (l-1) (palins q))
  np2 = (nh-1) * pow q 10 ((div (l+1) 2) - 1) + 
        (if nh<=nt then 1 else 0) * max 1 (sum (zipWith min (map digitToInt (tail (n1 ++ "9"))) (map digitToInt (tail (reverse n2)))))

palins q = unfoldr (\n -> Just (9 * pow q 10 ((div (n+1) 2) - 1), succ n)) 1
0