Skip to content

Instantly share code, notes, and snippets.

View junichiro's full-sized avatar

Junichiro Tobe junichiro

  • Novasell
  • Tokyo, Japan
View GitHub Profile
@junichiro
junichiro / openai_test.rs
Created May 18, 2023 00:48
Rust で OpenAI を呼ぶコードのテストコード
use app::openai::OpenAi;
#[tokio::test]
async fn test_openai() {
let input_text = "Hello, world!";
let client = OpenAi::new("text-davinci-003".to_string(), 400_u16);
let response_text = client.ask(input_text).await;
assert!(
response_text.contains(input_text),
"Expected '{}' to contain '{}'",
@junichiro
junichiro / openai.rs
Created May 18, 2023 00:46
Rust で OpenAI API を呼ぶ例
use async_openai::{Client, types::{CreateCompletionRequestArgs}};
pub struct OpenAi {
client: Client,
model: String,
max_tokens: u16,
}
impl OpenAi {
pub fn new(model: String, max_tokens: u16) -> Self {
@junichiro
junichiro / file0.txt
Created February 19, 2018 08:43
会社で少し盛り上がった Project Euler をやってみる 018 ref: https://qiita.com/junichiro/items/176ccccf09d66c59ba17
以下の三角形の頂点から下まで移動するとき, その数値の和の最大値は23になる.
3
7 4
2 4 6
8 5 9 3
この例では 3 + 7 + 4 + 9 = 23.
以下の三角形を頂点から下まで移動するとき, その最大の和を求めよ.
@junichiro
junichiro / file0.txt
Created February 14, 2018 03:57
会社で少し盛り上がった Project Euler をやってみる 017 ref: https://qiita.com/junichiro/items/ee3a312fca2510d82d94
import sys
class Problem17:
COUNT = {
0: '',
1: 'one',
2: 'two',
3: 'three',
@junichiro
junichiro / file0.txt
Created February 13, 2018 04:21
会社で少し盛り上がった Project Euler をやってみる 016 ref: https://qiita.com/junichiro/items/2e17dd0220a3281b2dfd
import sys
class Problem16:
def main(self, n):
return sum(int(i) for i in str(2 ** n))
if __name__ == '__main__':
@junichiro
junichiro / file0.txt
Last active February 9, 2018 00:36
会社で少し盛り上がった Project Euler をやってみる 015 ref: https://qiita.com/junichiro/items/76c0bf6ab32cb5121857
import sys
class Problem15:
def main(self, n):
tensor = [list(range(n + 1)) for i in range(n + 1)]
for i in range(n + 1):
for j in range(n + 1):
if i > 0 and j > 0:
@junichiro
junichiro / file0.txt
Created February 8, 2018 03:46
会社で少し盛り上がった Project Euler をやってみる 014 ref: https://qiita.com/junichiro/items/42b5dea47b5030097ddf
import sys
from multiprocessing import Pool
class Problem14:
CASH = {}
def main(self, n):
result = 1
num = 1
@junichiro
junichiro / file0.txt
Created February 7, 2018 00:44
会社で少し盛り上がった Project Euler をやってみる 013 ref: https://qiita.com/junichiro/items/0748701c5256500ca532
37107287533902102798797998220837590246510135740250
46376937677490009712648124896970078050417018260538
74324986199524741059474233309513058123726617309629
91942213363574161572522430563301811072406154908250
23067588207539346171171980310421047513778063246676
89261670696623633820136378418383684178734361726757
28112879812849979408065481931592621691275889832738
44274228917432520321923589422876796487670272189318
47451445736001306439091167216856844588711603153276
70386486105843025439939619828917593665686757934951
@junichiro
junichiro / file0.txt
Created February 6, 2018 00:50
会社で少し盛り上がった Project Euler をやってみる 012 ref: https://qiita.com/junichiro/items/0986beef482a699af266
角数の最初の10項は:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
となる.
最初の7項について, その約数を列挙すると, 以下のとおり.
1: 1
3: 1,3
6: 1,2,3,6
@junichiro
junichiro / file0.txt
Created February 5, 2018 01:27
会社で少し盛り上がった Project Euler をやってみる 011 ref: https://qiita.com/junichiro/items/9249a4e419de62a6fb37
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95