Skip to content

Instantly share code, notes, and snippets.

View MitI-7's full-sized avatar

MitI_7 MitI-7

View GitHub Profile
@MitI-7
MitI-7 / generateHtml.py
Last active August 29, 2015 14:15
Greedが生成したhtmlから問題文を抜き出して,日本語に翻訳&挿入したhtmlを作成
import sys
import subprocess
from html.parser import HTMLParser
from microsofttranslator import Translator
client_id = ""
client_secret = ""
class TestHTMLParser(HTMLParser):
import com.intellij.notification.Notification;
import com.intellij.notification.NotificationType;
import com.intellij.notification.Notifications;
import com.intellij.openapi.actionSystem.AnAction;
import com.intellij.openapi.actionSystem.AnActionEvent;
import com.intellij.openapi.wm.WindowManager;
import javax.swing.*;
@MitI-7
MitI-7 / TrieTree.py
Created May 4, 2015 05:05
テーブルによるトライ木の実装
class TrieTree:
def __init__(self):
size = 256
self.table = [[None for c in range(size)] for n in range(size)]
self.node_value = [None for n in range(size)]
self.last_node = 0
def insert(self, key, value):
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int longestCommonSubsequence(string s, string t) {
vector<vector<int>> v(s.size() + 1, vector<int>(t.size() + 1, 0));
for (int i = 0; i < s.size() + 1; ++i) {
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
map<pair<string, string>, int> memo;
int longestCommonSubsequence(string s, string t) {
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
vector<int> v_list;
vector<int> w_list;
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
vector<int> v_list;
vector<int> w_list;
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int longestIncreasingSubsequence(const vector<int> &v) {
vector<int> dp(v.size(), INT_MAX);
for (int n : v ) {
*lower_bound(dp.begin(), dp.end(), n) = n;
import sys
# 各ノードのコスト
nodes = {"BOS": 0, "EOS": 0,
"さ": 100, "さか": 200, "さかな": 100, "かな": 200, "なだ": 200, "だ": 10, "よ": 10}
# ノードのつながりのコスト
edges = {("BOS", "さ"): 30,
("BOS", "さか"): 30,
("BOS", "さかな"): 30,
@MitI-7
MitI-7 / viterbi.py
Created May 27, 2015 06:41
ビタビアルゴリズムでN-bestをだす
import sys
from collections import defaultdict
import queue
class Node:
def __init__(self, id_, name, weight):
self.id = id_
self.name = name
self.weight = weight