Skip to content

Instantly share code, notes, and snippets.

View gist:0cc8f0a32af0dcf47f38b3b219c132a8
S score rank
1 85.46756 20
4 95.85490 2
9 103.80185 1
16 109.08974 1
25 104.58557 1
36 98.93205 1
49 101.83187 1
64 100.53326 1
81 99.02612 1
View HTTF2021予選
RIDDRIDDDDDDIDRIRRIUUUUILLLLIUUILIDIUUUURRRILIDDRRIULIDDLIDDRIRORORRODORORORORODODORODORORODODRORIDILIDILOLODODDDDDILLLLILLLILLLIURIUUOROUROROLLILIRRIDIRIRRIUROUOROUORORIDDRRRRIDRIURILLLILILOLLOLOLLOLOLIRRIUULLLILLLIULILIDDLIDIDDRIURRRIDDRIURIUUOLOUUOUOUOUOUOUOUOROROUIRIRIDLODLODIDDDLLIRIRRRRRODDIDIUORRRODDDDDIUURRIDIUULIUUUUUUUOUURIUILOUUUOUOUIRRIDDIDLLIDDIDILLODODDOLODDODIULIDIDILIDIRRIUIULOUOLOUOROUOUOUUURIURILLILIDIDODODDODLOLIUIROUIURRIDDDDRRRODIUIROUILLIDDODDIUIUUUUUUUUIDDDDRIURILLIRIDORIUULILLLODLIRIDLIDRIDIUUUOURIDDDIURIDDDIDDDDDDLLLLLIRRRRRRRRRRIUUUUUIUUUIUILLLOLLOULIUUUUUUUUUIDDDIRRIUUIDRIUUIDDDILODODOLOLOLODIUIRILLLLIDOLOLODIRRIUIUULIUURIRIDDDRORORODODRILIDRIDDIDLODIDLIDLOLLIDIURIUUUUIRRIRIDIUUROUOROUUOURRRRIUIURIDLLLLOLIUIDRIDIDODDDDILIUOUILILOLLIUILLLILODOLIUIUORILIUUUIDDRRIDIDDILLODILIURIURIUULLIRIDDDRIDDDDDDOLIDDIURILIUUUUUIRRROUUUUUORORIDDDDDDDDDIRRRRIUUUILLOUUUIUUIUIDLODDIUIUIRRRRILIDDDLIRIDDDORILLILLOLIRIURILLILILOUIDILLLIDDIDRIDDRRRRRIURRRIUUUIUUULLLIUUUUILLILILLIRRRRRRRIRI
View icpc_challenge_2020.cr
INITIAL_COOLER = 4e5
FINAL_COOLER = 2e7
TIME_LIMIT_ALL = 600 * 1000
TIME_LIMIT_SINGLE = 80 * 1000
init_time = Time.utc.to_unix_ms
edges = [] of Tuple(Int32, Int32)
n = 0
while true
line = gets
break if !line
@tomerun
tomerun / seed2.txt
Last active January 20, 2019 15:29
MM106
View seed2.txt
60
284
11050922
478
218
203568
94
531
12435389
110
View LawnMowingVis.java
/*
Change log
----------
*/
import javax.swing.*;
import java.awt.*;
import java.awt.event.KeyAdapter;
import java.awt.event.KeyEvent;
import java.awt.event.WindowAdapter;
View IPSC2017 H2
input;jump 15
pop;*
pop;*
pop;*
pop;*
pop;*
pop;*
pop;*
pop;dup
pop;dup
@tomerun
tomerun / G.java
Last active November 30, 2015 12:54
ICPC2015つくばG問題
View G.java
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
char[] S = sc.next().toCharArray();
int N = S.length;
long K = sc.nextLong();
int[][] minApp = new int[N + 1][N + 1];
@tomerun
tomerun / gist:aedbe6a780fe0a762c9b
Created November 4, 2014 10:55
CODE RUNNER予選B
View gist:aedbe6a780fe0a762c9b
import java.io.BufferedReader;
import java.io.File;
import java.io.IOException;
import java.io.InputStreamReader;
import java.net.HttpURLConnection;
import java.net.URL;
import java.nio.charset.StandardCharsets;
import java.util.Arrays;
import java.util.Scanner;
View CODE FESTIVALの内容を妄想
題目 | 登壇者
---------------------------------------------------------------------------------------
講演「プログラミングコンテストとdata science」 | iwi
講演「プログラミングコンテストの大衆化」 | colun
講演「AOJを支える技術」 | 会津大の人?
講演「ICFPCのおもいで」 | shinh
講演「ICPC審判団の考えていること」 | kinaba
対談「この過去問がすごい!」 | simezi_tan,Komaki
会談「問題セットのつくりかた」 | rng_58,chokudai,LayCurse
@tomerun
tomerun / BinTree.java
Created August 25, 2012 16:21
Introduction to Algorithm exercise 12.3-6
View BinTree.java
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Random;
public class BinTree {
static Random rand = new Random();
public static void main(String[] args) throws Exception {