@yjkim997

#include <stdio.h> #include <string.h> #include <algorithm> using namespace std; struct Algo { char name[100]; int d; int idx; // 사전순 정렬 했을 때 순서

//BAEKJOON 18111 #include <stdio.h> int arr[502][502], b[2][502]; //b[0] max, b[1] min int main() { int n, m, B, h, max=-1, min=257; long long t=0; scanf("%d %d %d", &n, &m, &B);

#include <stdio.h> long long n, res, MOD=1000000007; long long pow(int a, long long b) { if(a==0) return 0; else if(a==1 || b==0) return 1; else { long long P = pow(a, b/2)%MOD;

#include <stdio.h> #include <vector> using namespace std; vector<int> v[20010]; int N, K, M=-1, idx[2]; int main() { scanf("%d", &N);

#include <stdio.h> int arr[2][100]; int main() { int n; scanf("%d", &n); for(int i=0; i<n; i++) scanf("%d %d", &arr[0][i], &arr[1][i]); }

#include <stdio.h> #include <algorithm> int N, S, task[10][40]; //task[쪽 수][문제 배점] int PAGE, NUM; //탐색해야하는 쪽 번호, 그 쪽의 문제 번호 int num; long long max=-1; void f(int page, int n, int sec, long long score) { //문제 쪽 수, 문제 번호, 남은 시간, 점수 총합 if(sec<0)

//BAEKJOON 15500 #include <stdio.h> #include <stack> using namespace std; int idx[125], order[2][20000], cnt; int main() {

/* //BAEKJOON 1697_숨바꼭질(완) #include <stdio.h> #include <queue> #include <vector> using namespace std; vector<int> G[100010]; int n, k, depth[100010], flag=0;

//BAEKJOON 2206 #include <stdio.h> #include <queue> using namespace std; struct node { int x; int y; };

/* #include <stdio.h> #include <string.h> char chess[52][52]; char chess1[8][8]={{'B','W','B','W','B','W','B','W'}, {'W','B','W','B','W','B','W','B'}, {'B','W','B','W','B','W','B','W'}, {'W','B','W','B','W','B','W','B'}, {'B','W','B','W','B','W',

#include <stdio.h> #include <string.h> int main() { int idx, flag[5]={}, S[3]={}, arr[16]={0, 0, 0, 3, 0, 5, 3, 0, 0, 3, 5, 0, 3, 0, 0, 15}; char s[4][10]; for(int i=0; i<3; i++) { scanf("%s", s[i]);

#include <stdio.h> int arr[201][201]; int main() { int n, m; long long cnt=0; scanf("%d %d", &n, &m); for(int i=0; i<m; i++) {

#include <stdio.h> #define ll long long ll arr[100010], s; int main() { int n, len=100001; scanf("%d %lld", &n, &s);

#include <stdio.h> #include <algorithm> #include <string.h> using namespace std; int arr[100001], DP[100001]; int abs(int a) { return (a>0? a:-a);

/* //(3+5^1/2)^n 주기 찾기 #include <stdio.h> #define MOD 1000 int arr[MOD]; int main() { int flag=0; //주기 존재 유무

#include <stdio.h> #define ll long long ll arr[200001]; ll min(ll a, ll b) { return (a>b ? b:a); } int main() {

#include <stdio.h> #define ll long long int arr[1002][1002]; ll sum=0, cnt=0; int main() { int n, m, flag=0; scanf("%d %d", &n, &m);

#include <stdio.h> #include <string.h> #include <queue> using namespace std; int main() { int n; scanf("%d", &n); queue<int> S;

#include <stdio.h> struct c{ char s[25]; }; int main() { struct c S[1000], S1[1000]; int n, sum=0;

#include <stdio.h> #include <algorithm> using namespace std; int arr[1000010]; int main() { int n, m; scanf("%d", &n); for(int i=0; i<n; i++) {