@yjkim997

#include <stdio.h> #include <string.h> struct node { int x, y, flag; }; int DT[1010][1010], len1, len2; char s1[1010], s2[1010], output[1010]; node back[1010][1010]; int max(int a, int b) { return (a>b?a:b); }

#include <stdio.h> struct line { long long x1, x2; long long y1, y2; double incli; double xaxis, yaxis; }; void swap(line *A) {

#include <stdio.h> #include <stdlib.h> #include <string.h> int n, m; struct Data { int num; }; struct Tnode { Data d; Tnode *left, *right; };

//BAEKJOON 6870_네모네모로직 구현? //TLE... 포기할게요ㅠ #include <stdio.h> #include <stdlib.h> #include <vector> using namespace std; int n, m; vector<int> row[35], col[35]; vector<vector<char>> rowPatterns[35];

//6870 #include <stdio.h> #include <vector> using namespace std; int n, m; char nemonemologic[35][35]; vector<int> row[35], col[35]; void f(int r, int ptr) {

#include <stdio.h> #include <queue> using namespace std; queue <char> q1, q2; char cryptogram[500]; /* void HowToFindCryptogram() { char binary='30110001 51011111 11001101 71101111 20110100 41001100 60110111'; //M41L_7o char X[200]="why you as dev

//Segment TREE #include <stdio.h> #define ll long long ll arr[100010]; ll seg[4*100010]; ll init(int s, int e, int node) { if(s==e) return seg[node] = arr[s]; int m=(s+e)/2;

#include <stdio.h> #include <stack> using namespace std; struct node { int idx, h; }; int h[500010], sig[500010]; int main() { int n;

#include <stdio.h> #define ll long long struct count { char c; ll cnt; }; count Rabbithorse[10]={ {'R', 1}, {'a', 1}, {'B', 2}, {'I', 1}, {'t', 1}, {'h', 1}, {'O', 1}, {'R', 1}, {'S', 1}, {'e', 1} }; //B 개수 = cntC2 char s[11]="ChinoCocoa";

#include <stdio.h> #define ll long long #define MOD 998244353 ll DT[5010]={1, -1, 1, 1,}, C[1700]; void f() { for(int i=4; i<=5000; i++) { //printf("%d : ", i); for(int j=0; j<=i-2; j++) {

#include <stdio.h> #include <math.h> #define ll long long ll res[10]={}; ll cnt[10][2] = {}; //10^len ~ 10^(len+1)-1 까지의 숫자에서 0~9 사용 개수 void f() { int len=0; double POW=pow(10, len-1);

#include <iostream> #include <stack> using namespace std; struct node { int idx; long long h; }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; long long res=0;

// Atcoder Beginner Contest 441 - C #include <stdio.h> #include <algorithm> #define ll long long using namespace std; int main() { int n, k; ll liq[300010]={}, x;

//개미(S)(AC) #include <stdio.h> int w, h, p, q, t, dx=1, dy=1; int main() { scanf("%d %d %d %d %d", &w, &h, &p, &q, &t); while(t) {

/* 예제1 @$@@ A 4 5 A @ @ A 1 A $ $ B 1 B @ @ C -1 C $ @ C 1 C @ $ B 1

#include <iostream> #include <string> int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); while(1) { std::string s; std::cin >> s;

#include <stdio.h> #include <memory.h> #include <queue> struct node {int x, y;}; int w, h, cnt, v[1010][1010]={}, dx[]={1, -1, 0, 0}, dy[]={0, 0, 1, -1}; char G[1010][1010]={}; struct node S, fire[1000010];

/* //#1 #include <stdio.h> #define ll long long ll res=1, nCr[115][115]; void f() { for(int i=1; i<=110; i++) { for(int j=0; j<=i; j++) {

#include <stdio.h> #define ll long long #define MOD 1000000007 ll x, y, z, p, q, res; ll pow(ll a, ll b) { ll res=1; while(b>0) { if(b%2) res=(a*res)%MOD;

/* #include <stdio.h> int main() { int s[100]={0x49, 0x60, 0x67, 0x74, 0x63, 0x67, 0x42, 0x66, 0x80, 0x78, 0x69, 0x69, 0x7B, 0x99, 0x6D, 0x88, 0x68, 0x94, 0x9F, 0x8D, 0x4D, 0xA5, 0x9D, 0x45}; for(int i=0; i<0x18; ++i) { //if(s[i] !=