Code Submission Evaluation System Login

Datatähti 2018 alku

Start:2017-10-02 00:00:00
End:2017-10-16 00:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - Datatähti 2018 alku - Results
History
2017-10-11 11:15:13100
2017-10-04 20:58:2212
Task:Kyselyt
Sender:Tanko
Submission time:2017-10-11 11:15:13
Language:Haskell
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED12
#2ACCEPTED25
#3ACCEPTED63

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.001details
#2ACCEPTED0.07 / 1.002details
#3ACCEPTED0.14 / 1.003details

Compiler report

input/code.hs:3:1: Warning:
    Top-level binding with no type signature:
      skipsum :: forall a. Integral a => a -> a

input/code.hs:6:19: Warning:
    This binding for `n' shadows the existing binding
      bound at input/code.hs:3:9

input/code.hs:13:1: Warning:
    Top-level binding with no type signature:
      num :: Integer -> (Integer, Integer)

input/code.hs:19:1: Warning:
    Top-level binding with no type signature: main :: IO ()

input/code.hs:21:15: Warning:
    Defaulting the following constraint(s) to type `Integer'
      (Enum a0)
        arising from the arithmetic sequence `1 .. n'
        at input/code.hs:21:15-20
      (Num a0) arising from the literal `1' at input/code.hs:21:16
      (Read a0) arising from a use of `readLn' at input/code.hs:20:14-19
    In the first argument of `forM_', namely `[1 .. n]'
    In the expression: forM_ [1 .. n]
    In a stmt of a 'do' block:
      forM_ [1 .. n]
      $ const
        $ do { m <- readLn;
               let (res, pos) = num $ m - 1;
               putChar $ (!! (fromIntegral pos)) $ show res;
               putChar '\n' }

Code

import Control.Monad

skipsum n = sum (map f [1..n])
	where
		-- f 1 = 10
		f n = (10^n - 10^(n-1)) * n

-- Log10 of the number at positon n
poslog :: Integer -> Integer
poslog n = head $ filter (\x -> skipsum x > n) [1..]

-- Number at position n
num n = let
	l = poslog n
	r = n - skipsum (l-1)
	b = 10^(l-1) 
	in (b + (r `div` l), r `mod` l)

main = do
	n <- readLn
	forM_ [1..n] $ const $ do
		m <- readLn
		let (res, pos) = num $ m - 1
		putChar $ (!! (fromIntegral pos)) $ show res
		putChar '\n'

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1000
582
214
723
273
480
280
237
204
134
210
565
640
784
508
846
532
465
952
205
...
view   save

correct output
0
1
7
7
6
1
5
4
7
6
2
2
2
2
8
2
1
3
1
8
...
view   save

user output
0
1
7
7
6
1
5
4
7
6
2
2
2
2
8
2
1
3
1
8
...
view   save

Test 2

Group: 2

Verdict: ACCEPTED

input
1000
615664
916441
627600
279508
126605
944125
25887
440405
352957
206746
951305
821686
716797
333476
430123
167570
619834
411383
459670
...
view   save

correct output
1
2
3
2
2
8
7
9
8
3
7
1
9
8
4
3
1
9
9
6
...
view   save

user output
1
2
3
2
2
8
7
9
8
3
7
1
9
8
4
3
1
9
9
6
...
view   save

Test 3

Group: 3

Verdict: ACCEPTED

input
1000
672274832941907421
260504693279721732
646999966092970935
100853063389774434
469646937576313460
292789544562527987
202678876957048242
921044261294332160
293497307441838185
889420403130803486
887773296767104352
272588988734184089
900854413164191389
306838570888252671
321818592757748092
632312861733842235
590425060048634753
921705179835679834
711775852688052272
...
view   save

correct output
7
2
2
0
9
7
7
2
0
4
0
3
0
5
9
9
3
1
2
7
...
view   save

user output
7
2
2
0
9
7
7
2
0
4
0
3
0
5
9
9
3
1
2
7
...
view   save