| タイトル | 作者 | アニメ化 | おすすめ度 | 既刊数 | 備考 |
|---|---|---|---|---|---|
| アリスと蔵六 | 今井哲也 | してる | ★★★ | 13 | |
| きみが死ぬまで恋をしたい | あおのなち | 予定あり | ★★★ | 8 | |
| ぱらのま | kashmir | してない | ★★★ | 8 | |
| クプルムの花嫁 | namo | してない | ★★★ | 7 | |
| 瑠璃の宝石 | 渋谷圭一郎 | してる | ★★★ | 7 | |
| 放課後帰宅びより | 松田舞 | 予定あり | ★★★ | 5 | |
| チハヤリスタート! | たけうちホロウ | してない | ★★★ | 3 | |
| バカに告白 | 矢坂しゅう | してない | ★★★ | 1 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| ".CodeMirror.vim-mode": {}, | |
| ".CodeMirror.vim-mode.normal-mode textarea": { | |
| "escape": "vim:reset-normal-mode" | |
| }, | |
| ".CodeMirror.vim-mode:not(.insert-mode):not(.key-buffering) textarea": { | |
| "h": "vim:move-left", | |
| "left": "vim:move-left", | |
| "backspace": "vim:move-left", | |
| "l": "vim:move-right", |
Blogの微調整が間に合わなかったのでこちらで書きますその2
年があけてしまいましたが、例年通り2022を振り返ります。
新作アニメに関しては 話数単位で選ぶ、2022年TVアニメ10選 に書いたことがだいたい全部です。
Blogの微調整が間に合わなかったのでこちらで書きます。
今年もaninado さんが集計したくださっている「話数単位で選ぶ、2022年TVアニメ10選」に参加させていただきます。
ページに記載されているルールは以下の通り
■「話数単位で選ぶ、2022年TVアニメ10選」ルール
- 2022年1月1日~12月31日までに放送されたTVアニメ(再放送を除く)から選定。
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Disable the newline at the start of the prompt | |
| add_newline = false | |
| [character] | |
| symbol = "( ╹◡╹)" | |
| style_success = "green" | |
| style_failure= "red" | |
| [battery] | |
| full_symbol = "🔋" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "Use Non-ASCII Font" : true, | |
| "Tags" : [ | |
| ], | |
| "Ansi 12 Color" : { | |
| "Red Component" : 0.51372549019607838, | |
| "Color Space" : "sRGB", | |
| "Blue Component" : 0.58823529411764708, | |
| "Green Component" : 0.58039215686274515 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [Global] | |
| I: FocusToInput | |
| Tab: FocusToTimeline | |
| S: FocusToSearch | |
| [Timeline] | |
| Ctrl+H: SelectLeftTab | |
| H: SelectLeftColumn | |
| J: MoveDown | |
| K: MoveUp | |
| Space: MoveTop |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <stdlib.h> | |
| void ReverseSearch(int x[], int i, int n){ | |
| int j; | |
| printf("{ "); | |
| if(i == 0)printf("{} ");//Empty set | |
| for(j = 1; j <= n ; j++){ | |
| if(x[j] == 1)printf("%d ", j); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <time.h> | |
| unsigned int next; | |
| unsigned int A = 1103515245, C = 12345, M = 2147482648; | |
| double my_rand(void){ | |
| next = (next * A + C) % M; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function G = JointDiagonalize( S ) | |
| [ ~, N ] = size( S ); | |
| halfN = N / 2; | |
| % Make two Correlation matrices | |
| S1 = S(:,1:halfN); | |
| S2 = S(:,halfN + 1:N); | |
| Ex1 = (S1 * S1')/halfN; |
NewerOlder