Share
Embed
Transcript
73 slides
-
)BTLFMM ͜ΜͳϓϩάϥϛϯάݴޠͰ͢ • ७ਮؔܕݴޠ • ࣜ ͷੈքͰಈ͘ࢀরಁ໌ͳݴޠ – ໋ྩܕݴޠ $
1ZUIPOͳͲ ͱࠜఈͷύϥμΠϜ͕ҟͳΔ • ੩తܕ͚ɺܕΫϥεɺܕਪɺߴ֊ؔ • ෆมσʔλͱؔͷ߹ – NBQGPME߹ʹΑΔҙຯߏͰΞϧΰϦζϜΛهड़͢Δ • ӬଓσʔλϓϩάϥϛϯάɺӬଓσʔλߏ • ԆධՁ • Ϟφυ • Մมσʔλɺ໋ྩܕϓϩάϥϛϯάͰ͖Δ -
·ͣงғؾΛɻྫ͑ "#$$ .BOZ3FQMBDFNFOUͷ࣮ main :: IO () main = do
_ <- getInt s <- getLine q <- getInt qs <- replicateM q $ auto @(Char, Char) let acc' = foldl' f ['a' .. 'z'] qs where f acc (c, d) = [if x == c then d else x | x <- acc] ix = listArray @UArray ('a', 'z') acc' putStrLn $ map (ix !) s -
໋ྩܕݴޠͰ TVN • ͑ΒΕ͍ͯΔΛॻ͖͑Δૢ࡞Λ܁Γฦͯ͠ɺͦͷ͔Β݁ՌΛಘΔ • จɺૢ࡞ ܭࢉػͷ໋ྩ ͕த৺ int total
= 0; for (int i = 1; i <= n; i++) { total += i; } -
)BTLFMMͰ TVN f x y = x + y main
= do -- 1 + 2 + 3 + 4 = 10 let s = f 4 (f 3 (f 1 2)) print s ؔͷΓʹ࠶ؔΛద༻͢Δɺͭ·Γʮ࠶ؼʯͰɺෆมͳͰঢ়ଶભҠΛදݱͰ͖Δ sum acc [] = acc sum acc (x : xs) = sum (acc + x) xs main = do print $ sum 0 [1 .. 10] -- 55 ϦετΛղ͠ͳ͕Β࠶ؼతʹؔΛద༻͢Δ͜ͱͰTVNؔΛ࣮Ͱ͖Δ -
GPMEuuu TVNΈ͍ͨͳϦετ࠶ؼͷύλʔϯΛҰൠԽͨ͠ͷ • GPMEͷҙຯ uuu ΈࠐΈɺू ࠶ؼతͳߏΛ݁߹نଇ ೋ߲ԋࢉ ʹΑͬͯͻͱͭͷʹΈࠐΉ •
ΑΓநతʹϞϊΠυԋࢉͷҰൠԽ uuu ݁߹ɺ୯Ґݩ • ʮTVN ʹΑΔΈࠐΈʯ main = do let s = foldl' (+) 0 [1 .. 10] print s -- 55 -
ΈࠐΈͷաఔΛ͢ͱྦྷੵ • scanl fold աఔͰಘΒΕΔྦྷੵঢ়ଶͯ͢Λฦ͢ • fold ͷҙຯܭࢉͷيΛશ෦Ϧετʹ্࣋ͪ͛ͯฦ͢ͷ͕ scanl
main = do let s = scanl' (+) 0 [1 .. 10] print s -- [0,1,3,6,10,15,21,28,36,45,55] foldl' :: [a] -> b scanl' :: [a] -> [b] -- 状態遷移の軌跡 -
NBQuuuࣸ૾ • map σʔλߏʹର͢Δࣸ૾ɺܗΛอͬͨҙຯม • map Λʮ֤ཁૉͷߋ৽ॲཧʯͰͳ͘ʮࣸ૾ʯͱҙຯతʹଊ͑Δ main = do
print $ map (*2) [1,2,3,4] -- [2,4,6,8] -
)BTLFMMͰ NBQ GJMUFSɺGPMEͳͲΛͬͯΛղ͘ main = do [n, _] <- getInts
as <- getInts bs <- getInts let a = listArray @UArray (1, n) as ans = foldl' (+) 0 $ map (a !) bs print ans ͜ͷͱ͖ࢲͷ಄ͷதͰʮCTΛࣸ૾ͯ͠ɺ ͰΈࠐΈʯͱߟ͑Δ map foldl' Ͱ͕Ͳ͏มΘ͍͔ͬͯ͘γϛϡϨʔγϣϯ͠ͳ͍ -
8 12 40 4 6 20 2 3 10 ۮ͔͠ͳ͍ͷͰૢ࡞͢Δ
·ͩۮ͔͠ͳ͍ͷͰૢ࡞͢Δ ح͕ग़͖ͯͨͷͰऴΘΓ -
໋ྩܕϓϩάϥϛϯάͰ࣮ uuu ໋σʔλߏΛ܁Γฦ͠ॻ͖͑ͯ͑ΛಘΔ count = 0 while all(a % 2
== 0 for a in as): for i in range(n): as[i] //= 2 count += 1 print(count) -
ؔܕ Ӭଓσʔλϓϩάϥϛϯά ͳΒʮ࠶ؼతͳࣸ૾ NBQ ʯͱߟ͑Δ let res = takeWhile (all
even) $ iterate (map (`div` 2)) as print $ length res -
ʮҙਤ JOUFOUJPO ʯͰͳ͘ʮҙຯ NFBOJOH ʯ • ࠓͷͰͷʮҙຯʯ uuu ϓϩάϥϜ͕ࣗͭߏతɾֶతͳʮԿΛද͔͢ʯͷ͜ͱ –
ϓϩάϥϚ͕ԿΛҙਤ͔ͨ͠ͱ͍͏ಈػɾҙਤͰͳ͘ɺϓϩάϥϜͦͷͷ͕࣋ͭߏɾؔɾҐஔ ͚ͮͷ – ʮͳͥͦ͏͔ͨ͠ʯͰͳ͘ʮͦΕԿͱͯ͠ଘࡏ͍ͯ͠Δ͔ʯ -
)BTLFMMͰʮࣸ૾ɺ߹ɺूʯ ᴷͦͷҙຯͷ··࣮Ͱ͖Δ main = do [ha, wa] <- getInts gridA
<- getCharGrid ((1, 1), (ha, wa)) [hb, wb] <- getInts -- (省略) -- -- グリッド (二次元配列) を Set 表現に写像 let [a, b, x] = map (fromArrayGS (== '#')) [gridA, gridB, gridX] cs = [ c | dx <- [-100 .. 100], -- X 方向、Y 方向の移動範囲の直積 (合成) dy <- [-100 .. 100], let a' = Set.map (+ (dx, dy)) a -- 平行移動 (写像) c = Set.union a' b -- 集合の和 (結合) ] printYn $ any (`isShiftedGS` x) cs -
͜ͷͱ͖ͷࢲͷࢥߟ • ʮ"Λ͋ΔఔͷൣғɺฏߦҠಈͯ͠ #ͱॏͶͯɺ9ͱಉ͡ܗΛ͍ͯ͠Δ͔Λ֬ೝ͢ΕΑͦ͞͏ͩ ͳʯ • ʮ"Λಈ͔͢ൣғ Yํͱ ZํͷೋํΛ ʙ
͙Β͍ͰेͩΖ͏ʯ • ʮฏߦҠಈ ࣸ૾ NBQ ɺ"ͱ #ΛॏͶΔͷू߹ VOJPO ɺ୳ࡧൣғ Yͱ ZͷҠಈൣғͷ ੵɺಉ͡ܗΛ͍ͯ͠Δ͔ࣸ૾ ࠩͷूͰఆʯ ͜͏ͯ͠ߟ͑ͨ͜ͱΛ۩ମతૢ࡞ʹม͢Δ͜ͱͳ͘ɺͦͷ··࣮Ͱ͖Δ -
ϓϩάϥϜΛૢ࡞ͷཏྻͰͳ͘ɺҙຯͷߏͰهड़Ͱ͖Δ ˠΛҙຯͰߟͰ͖ΔΑ͏ʹͳΔ main = do [ha, wa] <- getInts gridA
<- getCharGrid ((1, 1), (ha, wa)) [hb, wb] <- getInts -- (省略) -- -- グリッド (二次元配列) を Set 表現に写像 let [a, b, x] = map (fromArrayGS (== '#')) [gridA, gridB, gridX] cs = [ c | dx <- [-100 .. 100], -- X 方向、Y 方向の移動範囲の直積 (合成) dy <- [-100 .. 100], let a' = Set.map (+ (dx, dy)) a -- 平行移動 (写像) c = Set.union a' b -- 集合の和 (結合) ] printYn $ any (`isShiftedGS` x) cs -
)BTLFMM࠶ؼతσʔλߏΛσʔλߏͷجຊͱ͍ͯ͠Δ data List a = Nil | Cons a (List
a) • )BTLFMMͷσʔλߏ uuu తσʔλܕʹΑΔ࠶ؼతσʔλߏ • ࠶ؼతσʔλߏʹదͨ͠࠷খͷૢ࡞͕ NBQͱ GPME – NBQ a -> b Λ֤ཁૉʹద༻͠ɺߏΛอͬͨ··ม ࠶ؼߏʹର͢Δؔద༻ͷ࠷খ୯Ґ – SFEVDF GPME ͦͷߏΛյ͠ͳ͕ΒҰͭͷʹΈࠐΉ ߏΛͨͨΉ࠶ؼతύλʔϯͷ࠷খ୯Ґ -
ૢ࡞Ͱͳ͘ҙຯͰهड़͢Δͱɺίʔυ͕ʮҙຯͷ·ͱ·Γʯʹ • ໋ྩܕɾखଓ͖ܕϓϩάϥϛϯά – GPSจ JGจ ೖจ – ܭࢉػͷ໋ྩ –
໋ྩΛΈ߹ΘͤͯϓϩάϥϜΛߏ͢Δ ˠૢ࡞ͷ·ͱ·Γ • )BTLFMM – ࠶ؼɺNBQɺGPMEʜ – ࣜɻࣜҙຯΛ࣋ͭ – ҙຯΛΈ߹ΘͤͯϓϩάϥϜΛߏ͢Δ ˠҙຯͷ·ͱ·Γ ໋ྩܕɺΈ্͕ͬͨίʔυͷղऍʹ࣌ؒతखଓ͖ ૢ࡞ ͷ͕ඞཁ )BTLFMMͷͦΕҙຯʹࢹ͕͍ͯ͢ -
)BTLFMMͷσʔλߏ جຊతʹ Ӭଓσʔλߏ main = do let as1 = [1,
2, 3, 4, 5] as2 = 100 : as1 as3 = as2 ++ [500] as4 = delete 3 as3 print as1 -- [1,2,3,4,5] print as2 -- [100,1,2,3,4,5] print as3 -- [100,1,2,3,4,5,500] print as4 -- [100,1,2,4,5,500] • σʔλߏΛߋ৽ͨ͠ޙɺߋ৽લͷͦΕ͕ΓΞΫηεͰ͖Δ • σʔλߏશମͷίϐʔൃੜ͓ͯ͠ΒͣɺϝϞϦۭؒͱܭࢉྔখ͑͘͞ΒΕΔ -
ӬଓσʔλߏʹΑΓɺΠϛϡʔλϒϧͳ ࣜࢦͰΔ͜ͱͱύϑΥʔϚϯεΛཱ྆ main = do -- 10^6 個の要素をもつ Set let
s0 = Set.fromList [1 .. 10 ^ 6] -- 10^6 個値を追加していく、その過程の 10^6 個の Set 全部をメモリに残す ss = scanl' (flip Set.insert) s0 [2 * 10 ^ 6, 2 * 10 ^ 6 - 1 .. 10 ^ 6 + 1] print $ length ss -- 10^6 + 1 個 print $ Set.size (last ss) -- 2 * 10^6 個 େྔͷ 4FUΛେྔʹߋ৽ͯͦ͠ͷաఔͷେྔͷ 4FUΛϝϞϦʹͯ͠ͳ͍ -
ӬଓσʔλߏͳΒʮճసɺฏߦҠಈͨ͠શ෦ 4FU Λ·ͣྻڍʯ͢Δ͜ͱ͕Ͱ͖Δ main = do [gridA, gridB, gridC] <-
replicateM 3 $ getCharGrid ((1, 1), (4, 4)) let [a, b, c] = map (fromArrayGS (== '#')) [gridA, gridB, gridC] -- グリッド (二次元配列) を Set に写像 ds = [(dx, dy) | dx <- [0 .. 3], dy <- [0 .. 3]] -- 平行移動の範囲 (直積) -- 回転、平行移動を行ったポリオミノの全パターンを写像で作り出す as = [Set.map (+ d) (normalizeGS a') | a' <- take 4 $ iterate rotateRightGS a, d <- ds] bs = [Set.map (+ d) (normalizeGS b') | b' <- take 4 $ iterate rotateRightGS b, d <- ds] cs = [Set.map (+ d) (normalizeGS c') | c' <- take 4 $ iterate rotateRightGS c, d <- ds] -- (続く) -- )BTLFMMͰϦετʮՄೳੑͷҰཡʯͱ͍͏จ຺ͱݟͳͤΔ ϙϦΦϛϊ"ͷશՄೳੑɺϙϦΦϛϊ#ͷશՄೳੑɺϙϦΦϛϊ$ͷશՄೳੑΛͦΕͧΕྻڍͨ͠ ӬଓσʔλϓϩάϥϛϯάͳΒۤͳͦ͘Ε͕Ͱ͖Δ -
ͦΕ͕Ͱ͖ͨΒɺ͋ͱશΈ͋ΘͤΛ୳ࡧ ੵ ɺ݁߹ ू ͯ͠ఆ main = do -- (省略)
-- res = [ isSquare (Set.unions [x, y, z]) | x <- as, y <- bs, z <- cs, all (¥(p, q) -> Set.disjoint p q) (comb2 [x, y, z]) ] printYn $ or res isSquare s | Set.size s /= 16 = False | otherwise = all (¥v -> Set.member v s) (range ((1, 1), (4, 4))) -
)BTLFMMͷྻ "SSBZ let as = listArray (1, 5) [10, 20,
30, 40, 50] print $ as ! 3 -- 30 let as = listArray ('a', 'z') [1 .. 26] print $ as ! 'r' -- 18 • ࡧҾͷߏɺԼքɺ্քΛࣗͰܾΊΔ͜ͱ͕Ͱ͖Δ -
)BTLFMMͷྻͷߏɺཁૉଆͷߏͰͳ͘ɺࡧҾͷߏͰܾ·Δ • )BTLFMMͷྻͷํߏԽ͞Ε͓ͯΒͣϑϥοτ • ڥքͰ͋Δ
ͷࢦఆͰͦͷߏΛࢦఆ͢Δ main = do -- 3 x 3 の配列 -- 1,2,3 -- 4,5,6 -- 7,8,9 let as = listArray @UArray ((1, 1), (3, 3)) [1 .. 9 :: Int] print $ as ! (2, 2) -- 5 -
ࡧҾʹࣗͰએݴͨ͠σʔλܕΛ͏͜ͱͰ͖Δ • ࡧҾ͕ҙຯ͢ΔͷʢʹϞσϧʣΛɺܕͱͯ͠એݴ͢Δ͜ͱͰఆٛͰ͖Δ data Direction = L | R |
U | D deriving (Eq, Ord, Enum, Ix) main = do let dist = listArray @UArray (((1, 1), L), ((h, w), D)) [ ... ] print $ dist ! ((2, 2), R) -
ྻʮࡧҾू߹ ˠཁૉʯͷࣸ૾ɻࡧҾۭؒΛࣗ༝ʹઃܭ͢Δ͜ͱ͕Ͱ͖Δ • ࡧҾۭؒΛͲ͏ઃܭ͢Δ͔ʹʹΑͬͯɺྻͷʮ࣍ݩʯʮҙຯʯΛܾఆͰ͖Δ – *OUuuu ྫάϥϑ – *OU *OU
uuu ྫάϦου – *OU *OU #PPM uuu ྫঢ়ଶ͖ͭάϦου – *OU *OU %JSFDUJPO uuu ྫํ͖ͭάϦου • ෦දݱҰ࣍ݩྻͰɺҙຯͱͯ͠ଟ࣍ݩʹߏʹͰ͖Δ – )BTLFMMྻͷࡧҾɺͷΑ͏ͳͪΐͬͱͨ͜͠ͱͰந͕ߴ͍ ͜Ε͕ΞϧΰϦζϜͷநԽʹ େ͖ͳׂΛՌͨ͠·͢ -
άϥϑΛʮྡϦετʯʹߏԽͯ͠ #'4 ෯༏ઌ୳ࡧ ͢Δ main = do [n, m] <-
getInts uvs <- replicateM m getTuple -- 1 => [(2, 1), (4, 1)] という構造の「隣接リスト」にする let g = accumArray @Array (flip (:)) [] (1, n) $ concatMap (¥(u, v) -> [(u, (v, 1)), (v, (u, 1))]) uvs -- 幅優先探索する dist = bfs g [(1, 0)] for_ [1 .. n] $ ¥s -> print $ dist ! s -
ઌͷ #'4 ͷ࣮ bfs :: (Ix v, IArray a [(v,
e)], Num e, Eq e) => a v [(v, e)] -> [(v, e)] -> Array v e bfs g v0s = runSTArray $ do dist <- newArray (bounds g) (-1) for_ v0s $ ¥(v0, d0) -> do writeArray dist v0 d0 aux (Seq.fromList [v0 | (v0, _) <- v0s]) dist return dist where aux Empty _ = return () aux (v :<| queue) dist = do acc <- readArray dist v us <- filterM ( ¥(u, _) -> (fmap (== -1) . readArray dist) u ) (g ! v) queue' <- foldForM queue us $ ¥q (u, w) -> do writeArray dist u $! acc + w return $ q |> u aux queue' dist ͍ɻຖճॻ͖ͨ͘ͳ͍ɻ ϥΠϒϥϦԽ͠Α͏ -
ʮάϥϑͷྡϦετʯͷͨΊͷ࣮ʹͳͬͯ͠·͍ͬͯΔ let dist = bfs g [(1, 0)] • #'4άϥϑͷྡϦετͷͨΊ͚ͩͷ୳ࡧΞϧΰϦζϜͰͳ͍
• ྡϦετʹґଘ͍ͯ͠ΔՕॴΛύϥϝʔλԽ͠ɺநΛ্͛Α͏ -
நΛ্͛Δ uuuάϥϑͷσʔλߏʹґଘ͠ͳ͍ؔʹ • (g !) uuuʮW͔ΒḷΕΔ ʯͱ͍͏ࣸ૾ – ʮ ͔Βɺ
̎ ͱ ɺͦΕͧΕॏΈ ͰભҠͰ͖ΔʯΛهड़͢Δؔ – f v = g ! v • ڑͷ݁߹ԋࢉ (+) • (1, n) uuu CGT ͕ؔ෦Ͱར༻͍ͯ͠ΔྻͷࡧҾΛ֎෦͔Βύϥϝʔλͱͯ͢͠ let dist = bfs (g !) (+) (-1) (1, n) [(1, 0)] -
ࡧҾͷߏͱɺભҠͷؔΛܾΊ͕ͯͤղ͚Δ main = do [h, w] <- getInts grid <-
getCharGrid ((1, 1), (h, w)) let dist = bfs f (+) (-1) (bounds grid) [((1, 1), 0)] where f v = [ (u, 1) | d <- [(1, 0), (0, 1), (-1, 0), (0, -1)], let u = v + d, inRange (bounds grid) u, case (grid ! v, grid ! u) of ('s', 'n') -> True ('n', 'u') -> True ('u', 'k') -> True ('k', 'e') -> True ('e', 's') -> True _ -> False ] printYn $ dist ! (h, w) /= -1 ʮϚε WˠW͔Β౸ୡͰ͖ΔϚε VͷϦετʯ ͱ͍͏ࣸ૾ άϦουͷ্Լࠨӈʹ݅Λຬͨ͢ભҠઌ͕͋ΔͳΒ ͦΕΛྻڍ -
main = do [a, n] <- getInts let bounds =
(1, 10 ^ 6 + 1 :: Int) let dist = bfs f (+) (-1) bounds [(1, 0 :: Int)] where f x | x >= 10 && x `mod` 10 /= 0 = [(x', 1) | x' <- [rotate x, a * x], inRange bounds x'] | otherwise = [(a * x, 1) | inRange bounds (a * x)] rotate y = let ys = toDigits 10 y in fromDigits 10 (last ys : init ys) print $ dist ! n ಉ༷ʹղ͚Δ -
୳ࡧରͷۭؒΛεΠονͷঢ়ଶΛؚΉߏʹͯ͠ #'4 lrud@[left, right, up, down] = [(0, -1), (0,
1), (-1, 0), (1, 0)] :: [(Int, Int)] main = do [h, w] <- getInts grid <- getCharGrid ((1, 1), (h, w)) let start = fromJust $ findArrayIndex (== 'S') grid goal = fromJust $ findArrayIndex (== 'G') grid let dist = bfs f (+) (-1) (((1, 1), False), ((h, w), True)) [((start, True), 0)] where f (v, flag) = [ ((u, flag'), 1) | d <- lrud, let u = v + d, inRange (bounds grid) u, if flag then grid ! u `elem` ['S', '.', 'o', 'G', '?'] else grid ! u `elem` ['S', '.', 'x', 'G', '?'], let flag' = if grid ! u == '?' then not flag else flag ] -- (省略) -- -
վΊͯ #'4ʹ͍ͯ͠ΔύϥϝʔλͷҙຯΛߟ͑ͯΈΔ let dist = bfs f (+) (-1) bounds
[(1, 0 :: Int)] • ࡧҾͷߏ bounds ͱ f Λهड़͢Δ͚ͩͰ͕ղ͚Δ͕͜ΕΒԿऀ – bounds : ୳ࡧ͢Δۭؒ (ঢ়ଶͷू߹) Λنఆ͢Δͷ = ঢ়ଶۭؒ – f : ͋Δঢ়ଶ͔ΒͲ͜ભҠͰ͖Δ͔ = ભҠنଇ 💡#'4ҙͷঢ়ଶۭؒʹ͓͚Δঢ়ଶભҠΛ࠷εςοϓͰ୳ࡧ͢Δ൚༻ϑϨʔϜ -
)BTLFMMͰநԽ͠ɺࣗͰ࣮ͨؔ͠ͷҙຯΛߟ͑Δ͏ͪ #'4ͷϝϯλϧϞσ ϧ͕Ξοϓσʔτ͞ΕΔ • #'4άϥϑΛ୳ࡧ͢ΔΞϧΰϦζϜ • #'4άϦουΛ୳ࡧ͢ΔΞϧΰϦζϜ uuu άϦουάϥϑͷҰछ •
#'4ঢ়ଶΛ୳ࡧ͢ΔΞϧΰϦζϜ uuu ͲΜͳࢄঢ়ଶۭؒͰભҠنଇΛهड़͕ͨؔ͠ ͋Εಈ͘ )BTLFMMҙຯࢥߟΛ༠ൃ͢Δ͚ͩͰͳ͘ɺࣗͰॻ͍࣮ͨͷҙຯΛ࠶ൃݟͤͯ͘͞ΕΔ -
)BTLFMMͷநͷɺڝٕϓϩάϥϛϯάʹ͓͚ΔҖྗ • ΞϧΰϦζϜͷநʹग़͖ͯͨࣸ૾݁߹ʮάϥϑͷભҠʯʮঢ়ଶભҠͷࣸ૾ʯͳͲҙຯ ͚ͮ͢Δ͜ͱ͕Ͱ͖Δ – ͨͩͷύϥϝʔλͰͳ͘ɺղऍΛՃ͑Δ͜ͱ͕Ͱ͖Δ – ͦͯͦ͠ΕΛతߏͷͰΈͯɺֶతੑ࣭Λҙࣝ͢Δ͜ͱͰ͖Δ • ڝٕϓϩάϥϛϯάͷ͕ɺͦͷҙຯʹैͬͯߟ͢Δ͜ͱͰղ͚Δ
– ෦Λղ͚ͩ͘Ͱɺશମ͕ղ͚Δ – ͜ͷࢥߟͷϑϨʔϜϫʔΫಛʹ %1άϥϑ୳ࡧͳͲʹ͓͍ͯڧྗͳثʹͳΔ -
ʮૢ࡞ʯ͔Βʮҙຯʯ • )BTLFMM ૢ࡞Ͱͳ͘ɺҙຯͰهड़ɺࢥߟ͢Δ͜ͱΛଅਐ͢Δϓϩάϥϛϯάݴޠ ͩͱ উखʹࢥ͍ͬͯΔ • )BTLFMM ʹΑͬͯϓϩάϥϛϯάɺΞϧΰϦζϜʹର͢ΔϝϯλϧϞσϧ͕ߋ৽͞ΕΔ •
ࠓհͨ͠ཁૉҎ֎ʹʮҙຯϞσϧࢥߟʯΛଅਐ͢Δཁૉ΄͔ʹ͋Δ – తσʔλܕ – ܕɺܕΫϥε ֶత੍͕ܕΫϥεͰܗࣜԽ͞Ε͍ͯΔ FUD – Ϟφυ ΑΓநͷߴ͍ܭࢉߏͷҙຯ – ༥߹ม มΛҙຯ୯Ґʹׂͯ͠ύϑΥʔϚϯεΛ٘ਜ਼ʹ͠ͳ͍ – ԆධՁ -
ϓϩάϥϛϯάʹମੑ͕͏ • ϓϩάϥϛϯάݴޠΛࣗࡏʹૢΕΔΑ͏ʹͳΔʹɺ෮࿅श͕ඞཁ • ڝٕϓϩάϥϛϯάయܕΛࣹͰղ͚ΔΑ͏ʹͳΔͷ͕ɺڧ͘ͳΔํ๏ͷ ͻͱͭ • ࣹͰղ͚Δ uuu ೝΤωϧΪʔΛΘͳ͍ɻۭ͍ͨೝΤωϧΪʔΛΑΓॏཁ
ͳ෦ʹ͚Δ͜ͱ͕Ͱ͖Δ • ϓϩάϥϛϯάΞϧΰϦζϜΛମԽ͢ΔաఔͰɺૢ࡞తࢥߟͰΔ͔ҙຯత ࢥߟͰΔ͔Ͱ౸ୡ͕େ͖͘มΘΔͷͰͳ͍͔ -
΅͘ૢ࡞తਪʹ͞΄Ͳڧ͘ͳ͔ͬͨɻ͔ͩΒڝϓϩڧ͘ͳΕͳ͍ͱࢥ͍ࠐΜͰ͍ͨ • ࣗͷ͜Ε·ͰͷਓੜͰʮֶʯͱ͔ʮΛղ͘ʯͱ͍͏Α͏ͳྖҬͰɺ͕ࣗͦΕΛಘ ҙͱࢥ͑Δ͜ͱͳ͔ͬͨ – ͲͪΒ͔ͱ͍͑ɺۤखͳํͩͬͨ – Ռͨͯࣗ͠ϓϩάϥϚʹ͍͍ͯΔͷ͔ ͱࣗࣗ͢Δ͜ͱଟ͔ͬͨ •
ϓϩάϥϜΛૢ࡞Ͱͳ͘ҙຯͰଊ͑Δͱ͍͏ࢥߟࣗʹ߹͍ͬͯͯɺಘҙͩͱײ͡ΒΕ ͨɻ͜ͷ͜ͱʹؾ͔ͮͤͯ͘Εͨͷ͕ɺ)BTLFMM ڝٕϓϩάϥϛϯάͩͬͨ ࣗͷڧΈʹ߹ͬͨɺϓϩάϥϛϯάͷ͖߹͍ํ ؒϓϩάϥϚΛ͖ͬͯͯॳΊͯɺ͕ࣗϓϩάϥϛϯάΛಘҙͩͱ֬৴Ͱ͖ͨॠؒͰͨ͠ -
)BTLFMMͰෆมͳσʔλߏ͔͑͠ͳ͍ • )BTLFMM ͰՄมͳσʔλߏ ྫՄมྻ ."SSBZ ѻ͑·͢ɻܭࢉػͷ໋ྩɺͭ·Γखଓ͖త ϓϩάϥϛϯάͰѻ͏ͱָͰ͢ɻϞφυ͕ͦΕΛՄೳʹ͠·͢ɻ • ηάϝϯτ
6OJPO'JOEͳͲͷ࣮ͰύϑΥʔϚϯεΛ༏ઌ͢ΔͷʹՄมྻΛ͏͜ͱΑ͋͘ Γ·͢ • ·ͨՄมྻͰखଓ͖తʹ࣮͢Δ΄͏ָ͕ͳͰɺී௨ʹՄมྻΛ͍·͢ -
)BTLFMMͷ ੩తܕ͚ • ײ uuu ͘ͳ͍͚Ͳ͘ͳ͍ – $ 3VTUΑΓવɺͣͬͱ͍
– $ (PΑΓ͍ – εΫϦϓτݴޠΑΓ݁ߏ͍ • ੩తܕ͚ – ڧྗͳܕਪ͕͋ΔͷͰɺܕ͕࣮εϐʔυͷᐫʹͳΒͳ͍ – ಈతܕ͚ݴޠΛॻ͍ͯΔͷͱಉ͡Α͏ͳײ৮ – Ή͠Ζܕ͕͋Δ͓͔͛Ͱɺຌϛεʹؾ͖͍ͮ͢ ͜͏͍͏ධՁ࣠Ͱબ ͢Δͷ͓͢͢Ί ͠ͳ͍ -
ࢀߟ )BTLFMMʹΑΔΞϧΰϦζϜநͱతߏ • ࠶ؼతσʔλߏࣸ૾ͱ݁߹ʹࣗવʹؐݩͰ͖Δ • ঢ়ଶͷʮൖʯͱʮूʯతੑ࣭Λඞཁͱ͢Δ – ʮൖʯ֤ঢ়ଶΛ৽͍͠ঢ়ଶʹࣸ͢ ˠࣸ૾ –
ʮूʯෳͷ݁ՌΛҰͭʹ·ͱΊΔ ˠ݁߹ – ͜Ε͕݁߹తͰͳ͚Ε࠶ؼɾޮԽ͕͍͠ ˠతߏͷཁ ΞϧΰϦζϜΛநԽ͢Δͱࣸ૾ͱ݁߹͕ܭࢉͷຊ࣭తͳߏཁૉͱͯ͠ݱΕΔ ঢ়ଶۭؒΛू߹ͱΈͳ͢ͱɺతߏʢ'VODUPS .POPJE 4FNJSJOHʣʹରԠ͢Δ )BTLFMMͷܕͱߴ֊ؔɺͦͷߏΛࣗવʹΠϯλϑΣʔεͱͯ͠࿐ग़ͤ͞Δ நԽʮܭࢉͷʯΛՄࢹԽ͢ΔաఔͰ͋Δ https://speakerdeck.com/naoya/guan-shu-xing-yan-yu-dejing-ji-puroguramingu ΑΓৄ͘͠