Skip to content

Instantly share code, notes, and snippets.

HYEONWOO KIM HyeonWooKim

Block or report user

Report or block HyeonWooKim

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
@HyeonWooKim
HyeonWooKim / 9426.cpp
Created Jan 8, 2017
BOJ 9426 중앙값 측정
View 9426.cpp
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
int w[250001];
int n, k, t, ans, tmp;
long long sum = 0;
multiset<int> low, high;
multiset<int>::iterator it;
@HyeonWooKim
HyeonWooKim / 11559.cpp
Created Dec 15, 2016
11559 Puyo Puyo
View 11559.cpp
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
@HyeonWooKim
HyeonWooKim / 1343.cpp
Created Dec 12, 2016
BOJ 1343 폴리오미노
View 1343.cpp
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
@HyeonWooKim
HyeonWooKim / 1761.cpp
Created Dec 12, 2016
BOJ 1761 정점들의 거리
View 1761.cpp
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
class Node
{
public:
View 1063.cpp
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
class Node
{
public:
int x, y;
View 2533.cpp
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
int dp[1000001][2];
bool visited[1000001];
vector<vector<int> >v;
int dfs(int cur, bool adp)
View 1780.cpp
#include <iostream>
#include <cstdio>
using namespace std;
int w[2222][2222],d[3];
void dfs(int x, int y, int k)
{
bool f = true;
int cmp = w[x][y];
for (int i = x; i < x + k && f; i++)
View 1629.cpp
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
long long b,e,m,o=1;
cin>>b>>e>>m;
b%=m;
View 2447.cpp
#include<cstdio>
char s[3000][3000] = { 0 };
void dfs(int depth, int w, int h)
{
if (depth == 1)
{
s[w][h] = '*';
return;
}
View 9946.cpp
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
for(int i=1;;i++)
{
string a, b;
You can’t perform that action at this time.