Jaehyun Koo koosaga

280 followers · 8 following

Cambridge, MA, USA
https://koosaga.com

View GitHub Profile

Recently created

Least recently created

Recently updated

Least recently updated

koosaga / koosaga.cpp

Created November 21, 2015 07:52

	#include <cstdio>
	#include <cstring>
	#include <cstdlib>
	#include <algorithm>
	using namespace std;

	int a[1000005],n;
	int b[1000005];

	int sol(){

koosaga / gallery.cpp

Created December 14, 2015 00:11

	#include <stdio.h>
	#include <stdlib.h>
	#include <string.h>
	#include <math.h>
	#include <limits.h>
	#include <stack>
	#include <queue>
	#include <map>
	#include <set>
	#include <algorithm>

koosaga / daejeon2014l.cpp

Created June 12, 2016 18:05

	#include <stdio.h>
	#include <stdlib.h>
	#include <string.h>
	#include <assert.h>
	#include <limits.h>
	#include <math.h>
	#include <time.h>
	#include <iostream>
	#include <functional>
	#include <numeric>

koosaga / hdu5306.cpp

Created June 30, 2016 07:05

	#include <bits/stdc++.h>
	using namespace std;
	typedef long long lint;
	typedef long double llf;
	typedef pair<lint, lint> pi;

	struct node{
	int max, snd, cnt;
	lint sum;
	}tree[2100000];

koosaga / sfxarray.cpp

Created August 30, 2016 00:59

	struct sfxarray{
	int ord[MAXN], nord[MAXN], cnt[MAXN], aux[MAXN];
	void solve(int n, char str, int sfx, int *rev){
	int p = 1;
	memset(ord, 0, sizeof(ord));
	for(int i=0; i<n; i++){
	sfx[i] = i;
	ord[i] = str[i];
	}
	int pnt = 1;

koosaga / xmax.cpp

Created October 9, 2016 13:23

	#include <bits/stdc++.h>
	using namespace std;
	typedef long long lint;
	typedef long double llf;
	typedef pair<int, int> pi;

	int n;
	lint basis[60];

	int main(){

koosaga / qtree.cpp

Created November 2, 2016 10:34

qtree.cpp

	#include <bits/stdc++.h>
	using namespace std;
	typedef long long lint;
	typedef pair<int, int> pi;
	struct seg{
	int tree[270000], lim;
	void init(int n){
	for(lim = 1; lim <= n; lim <<= 1);
	}
	void add(int x, int v){

koosaga / fft.cpp

Last active March 24, 2025 01:15

	typedef long long lint;

	namespace fft{
	typedef complex<double> base;
	void fft(vector<base> &v, bool inv){
	vector<base> w(v.size());
	for(int i=2; i<=v.size(); i<<=1){
	int bsz = v.size() / i;
	base ang(cos(2 * M_PI / i), sin(2 * M_PI / i));
	if(inv) ang = base(1, 0) / ang;

koosaga / fcm.cpp

Created December 6, 2016 13:38

	#include <bits/stdc++.h>
	using namespace std;
	typedef long long lint;
	typedef pair<int, int> pi;

	struct disj{
	int pa[2000005];
	void init(int n){
	for(int i=0; i<=n; i++) pa[i] = i;
	}

koosaga / b.cpp

Last active September 16, 2017 08:44

ACM-ICPC Daejeon Regional 2016

	#include <bits/stdc++.h>
	using namespace std;
	typedef long long lint;
	typedef pair<int, int> pi;

	int cnt[10005], n;

	int main(){
	cin >> n;
	int sum = 0;