Hanjae hanjae-jea

hanjae-jea / cowjump.cpp

Created April 1, 2019 17:40

USACO 2019 Silver Open #2 Cowjump implementation with Shamos-Hoey algorithm.

hanjae-jea / LuxuryHelloJava.java

Created March 31, 2019 09:41

소연이꺼

	import java.util.Scanner;

	public class LuxuryHelloJava {
	static char k;
	static int number;

	public static void main(String[] args) {
	Scanner input = new Scanner(System.in);
	System.out.print("입력하고싶은 문자는?");
	k = input.nextLine().charAt(0);

hanjae-jea / cls_atr_vs_ins_atr.py

Last active December 5, 2018 00:11

Blog

hanjae-jea / 1-1.py

Last active November 6, 2018 14:56

LR 과제

	# Define linear regression function
	# You may use sklearn.linear_model.LinearRegression
	# Your code here
	def LinReg(X, y):
	r = LinearRegression()
	return r.fit(X, y)
	# End your code

	# Basic settings. DO NOT MODIFY
	selected_feature = []

hanjae-jea / 1027.py

Created October 27, 2018 06:46

	import pygame
	import time
	clock = pygame.time.Clock()
	pygame.init()
	screen = pygame.display.set_mode((400,400))
	done = False
	x=0
	y=0
	g=200
	h=200

hanjae-jea / index.html

Last active April 29, 2019 15:11

	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8">
	<meta name="viewport" content="width=device-width, initial-scale=1.0">
	<meta http-equiv="X-UA-Compatible" content="ie-edge">
	<title>Document</title>
	<style>
	main .gnb{

hanjae-jea / 2014210110_1207.py

Last active December 6, 2018 15:45

	from tkinter import *
	from tkinter import messagebox

	class Person:
	def __init__(self, heightV, weightV, nameV):
	self.height = heightV
	self.weight = weightV
	self.name = weightV
	self.dist = 0

hanjae-jea / 줍줍.py

Created September 5, 2018 13:35

	import smtplib
	from email.mime.text import MIMEText
	from time import sleep
	from selenium import webdriver
	smtp = smtplib.SMTP('smtp.gmail.com', 587)
	smtp.ehlo()
	smtp.starttls()
	smtp.login('[email protected]', '')
	PLmsg = MIMEText('프언떴다')
	PLmsg['Subject'] = '프언떳다'

hanjae-jea / bound.cpp

Created August 27, 2018 10:48

	#include <stdio.h>

	int n, arr[1000000], k, str[100000][20], il, iu;

	void lower_bound(int left, int right, int number)
	{
	int mid = (left + right) / 2;
	if (left >= right) {
	il = left;
	return;

hanjae-jea / 1.cpp

Created August 20, 2018 08:51