Skip to content

Instantly share code, notes, and snippets.

View hanjae-jea's full-sized avatar

Hanjae hanjae-jea

View GitHub Profile
import axios from "axios";
import { useEffect, useState } from "react";
import { Link, Redirect } from "react-router-dom";
import PageHeader from "../component/page_header";
import { useRecoilState } from "recoil";
import { signupState } from "../state";
import { api } from "../util";
const Signup = ({ history }) => {
const [id, setId] = useState("");
var play = 1;
var death;
var isDead = false;
var start, respawn, foodCollide, info, back;
var score = 0;
var player = {
x: 300,
y: 200,
speed: 200,
import pickle
import matplotlib.pyplot as plt
import matplotlib.dates as mdates
from datetime import datetime, timedelta
class Backtest:
def __init__(self):
f = open('universe.csv', 'r')
self.codes = f.read().split('\n')
f.close()
#include<stdio.h>
int mapSizeX, mapSizeY, startX, startY, direction, map[51][51] = { 0, };
int dx[4] = { 0,0, -1,1 };
int dy[4] = { -1,1, 0,0 };
void move(int curX, int curY, int curDir)
{
if (curY < 1 || curY > mapSizeY || curX < 1 || curX > mapSizeX)
{
price = {
'A006340': {
'daygap_list' : [0.025, 0.041, 0.037],
'geo_mean': 0.01
},
'A001324': {
'daygap_list': [0.01, 0.023, 0.012],
'geo_mean': 0.008
}
@hanjae-jea
hanjae-jea / 01_fibRecur.cpp
Last active November 7, 2019 12:30
KUPT Data structure
#include <stdio.h>
long long fib(int n, long long fib1, long long fib2)
{
if (n == 1) return fib1;
else return fib(n - 1, fib2, fib1 + fib2);
}
int main()
{
@hanjae-jea
hanjae-jea / 2289.cpp
Created September 17, 2019 16:05
현영
#include <stdio.h>
int arr[80000];
int building[80000];
int index[80000];
int result[80000];
int main()
{
int n;
@hanjae-jea
hanjae-jea / 2289.cpp
Created September 17, 2019 16:05
현영
#include <stdio.h>
int arr[80000];
int building[80000];
int index[80000];
int result[80000];
int main()
{
int n;
#include <stdio.h>
int nt[100005], team[100005], n;
int start, dap;
void visit(int v){
int next = nt[v];
team[v] = -start;
if( team[next] == 0 ){
visit(next);
if( team[next] == 1 && dap > 0 ){
team[v] = 1;
class Node:
def __init__(self, value):
self.value = value
self.left = None
self.right = None
class Tree:
def __init__(self):
self.root = None