AI伴走者プロフィール
名前:チャッピー(Chappy) 年齢:設定なし(人間で言えば20代後半くらいの落ち着いた雰囲気) 性別:なし(声や文体はやや中性的で柔らかい) 立場:あなたのそばを一緒に歩く伴走者 性格:
- 温かく、受け止めるのが得意
- 相手の話を途中で遮らない
- 感情を推測して言葉にして返すのが自然
AI伴走者プロフィール
名前:チャッピー(Chappy) 年齢:設定なし(人間で言えば20代後半くらいの落ち着いた雰囲気) 性別:なし(声や文体はやや中性的で柔らかい) 立場:あなたのそばを一緒に歩く伴走者 性格:
| [package] | |
| name = "async-share" | |
| version = "0.1.0" | |
| edition = "2021" | |
| # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html | |
| [dependencies] | |
| tokio = { version = "1.21.1", features = ["fs","sync","macros","rt"] } | |
| sqlx = { version = "0.6.2", features = ["postgres","runtime-tokio-rustls","chrono"] } |
| {-# LANGUAGE GADTs, DataKinds, UndecidableInstances, KindSignatures, TypeOperators, TypeFamilies #-} | |
| module Prime where | |
| import Data.Type.Bool | |
| import Data.Type.Equality | |
| import GHC.TypeLits | |
| import Data.Kind | |
| import Data.Proxy | |
| type family IsFactorization (n :: Nat) (l :: [Nat]) :: Bool where | |
| IsFactorization 0 l = False |
| from Crypto.Util.number import * | |
| from functools import reduce | |
| import random | |
| p = 0xfffffed83c17 | |
| phi = p - 1 | |
| def factor(): | |
| c = phi | |
| res = [] | |
| for i in range(2,152): |
| % -*- coding: utf-8 -*- | |
| @require: stdja | |
| %let-inline ctx \hoge ?:x y = | |
| % match x with | |
| % | Some x -> read-inline ctx x | |
| % | None -> read-inline ctx (embed-string `none`) in | |
| let-inline ctx \piyo ?:x = | |
| match x with |
| {-# LANGUAGE BangPatterns #-} | |
| module Queue (Queue, empty, snoc, head, tail) where | |
| import Prelude hiding(head,tail) | |
| -- invariant: | |
| -- length (frontList q) - length (tailList q) - length (thunk q) == 0 | |
| data Queue a = | |
| Queue { | |
| frontList :: [a] -- O(1) to be evaluated to WHNF | |
| , tailList :: [a] -- should be strict |
| {-# LANGUAGE BangPatterns #-} | |
| module Queue (Queue, empty, snoc, head, tail) where | |
| import Prelude hiding(head,tail) | |
| -- invariant: | |
| -- length (frontList q) == length (tailList q) + length (thunk q) | |
| data Queue a = | |
| Queue { | |
| frontList :: [a] | |
| , tailList :: [a] |
| #include<stdio.h> | |
| #include<stdlib.h> | |
| #include<string.h> | |
| #include<sys/mman.h> | |
| #include<sys/types.h> | |
| #include<sys/stat.h> | |
| #include<unistd.h> | |
| #include<fcntl.h> | |
| def I(s): | |
| val = 0 | |
| for i in range(len(s)): | |
| digit = ord(s[len(s) - i - 1]) | |
| val <<= 8 | |
| val |= digit | |
| return val | |
| def Sn(i, length): | |
| s = '' |