코영방

#include <bits/stdc++.h>
using namespace std;
//STL vector
int main()
{
    vector<int> vec;
    vector<int> vec1(10);
    vector<int> vec2(40, 3); 


    vec.push_back(5);
    vec.push_back(3);
    vec.push_back(1);
    vec.insert(vec.begin(), 2);

    for(vector<int>::iterator itr=vec.begin(); itr!=vec.end(); itr++){
        if(*itr == 3){
            vec.insert(itr, 77);
            break;
        }
    }

    printf("\n");
    for(auto x : vec){
        printf("%d ", x);
    }


    vec.pop_back();
    vec.erase(vec.begin());
    printf("\n");
    for(auto x : vec){
        printf("%d ", x);
    }

    printf("\nsize :%d fron :%d rear: %d", vec.size(), vec.front(), vec.back());


    vec.assign(5, 4);
    printf("\n");
    for(auto x : vec){
        printf("%d ", x);
    }

    vec.clear();
    vec = vector<int>();
    printf("\n");
    for(auto x : vec){
        printf("%d ", x);
    }
    return 0;
}

https://www.acmicpc.net/problem/1759

#include "bits/stdc++.h"
using namespace std;
//암호 만들기
char arr[15];
int n, m;

void recursive(int start, int cnt1, int cnt2, string str) {
    //printf("==%s %d %d\n", str.c_str(), cnt1, cnt2);
    if (str.size() == n && cnt1 >= 1 && cnt2 >= 2) {
        printf("%s\n", str.c_str());
        return;
    }
   for (int i=start; i<m; i++) {
        //str += arr[i];
        if (arr[i] == 'a' || arr[i] == 'e' || arr[i] == 'i' || arr[i] == 'o' || arr[i] == 'u') {
            cnt1++;
        }
        else {
            cnt2++;
        }
        recursive(i+1, cnt1, cnt2, str+arr[i]);
        if (arr[i] == 'a' || arr[i] == 'e' || arr[i] == 'i' || arr[i] == 'o' || arr[i] == 'u') {
            cnt1--;
        }
        else {
            cnt2--;
        }
   }
}

int main() {
   cin >> n >> m;
   for (int i=0; i<m; i++) {
        cin >> arr[i];
   }
   sort(arr, arr + m);
   recursive(0, 0, 0, "");
}

https://www.acmicpc.net/problem/14501

#include "bits/stdc++.h"
using namespace std;
//퇴사
int n, maxi;
pair<int, int> arr[15];

void recursive(int start, int sum) {
    if (start >= n) {
        if (sum > maxi) maxi = sum;
        return;
    }
    for (int i=start; i<n; i++) {
        if (i+arr[i].first <= n) {
            recursive(i+arr[i].first, sum+arr[i].second);
        }
        else {
            recursive(i+arr[i].first, sum);
        }
    }
}

int main() {
    cin >> n;
    for (int i=0; i<n; i++) {
        cin >> arr[i].first >> arr[i].second;
    }
    recursive(0, 0);
    printf("%d", maxi);
}

https://www.acmicpc.net/problem/1182

JW

#include "bits/stdc++.h"
using namespace std;
//부분수열의 합
int arr[20], n, m, cnt;

void recursive(int start, int level, int sum) {
    if (start == level && sum == m) {
        cnt++;
    }
    for (int i=start; i<n; i++) {
        recursive(i+1, level, sum+arr[i]);
    }
}

int main() {
    cin >> n >> m;
    for (int i=0; i<n; i++) {
        cin >> arr[i];
    }
    for (int i=1; i<=n; i++) {
        recursive(0, i, 0);
    }
    printf("%d", cnt);
}

https://www.acmicpc.net/problem/6603

JW

#include "bits/stdc++.h"
using namespace std;
//로또
int arr[13], result[6], n = 1;

void recursive(int start, int index) {
    if (index == 6) {
        for (int i=0; i<6; i++) {
            printf("%d ", result[i]);
        }
        printf("\n");
        return;
    }
    for (int i=start; i<n; i++) {
        result[index] = arr[i];
        recursive(i+1, index+1);
    }
}

int main() {
    while (n != 0) {
        cin >> n;
        for (int i=0; i<n; i++) {
            cin >> arr[i];
        }
        recursive(0, 0);
        printf("\n");
    }
}

https://www.acmicpc.net/problem/10815

#include "bits/stdc++.h"
using namespace std;
// 숫자 카드
int main() {
    int n, m, arr[10000], finding[10000];
    cin >> n;
    for (int i=0; i<n; i++) {
        cin >> arr[i];
    }
    sort(arr, arr + n);
    cin >> m;
    for (int i=0; i<m; i++) {
        cin >> finding[i];
    }
    for (int i=0; i<m; i++) {
        int l = 0, r = n-1;
        bool found = false;
        while (l <= r) {
            int a = (l + r)/2;
            if (finding[i] == arr[a]) {
                printf("1 ");
                found = true;
                break;
            }
            if (finding[i] > arr[a]) {
                l = a+1;
            }
            if (finding[i] < arr[a]) {
                r = a-1;
            }
        }
        if (!found) printf("0 ");
    }
}

https://www.acmicpc.net/problem/9095

JW

#include "bits/stdc++.h"
using namespace std;
//1, 2, 3 더하기
int cnt, arr[10], n;

void recursive(int sum) {
    if (sum == n) {
        cnt++;
        return;
    }
    if (sum > n) return;
    for (int i=1; i<=3; i++) {
        recursive(sum+i);
    }
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        cnt = 0;
        cin >> n;
        for (int i=1; i<=3; i++) {
            recursive(i);
        }
        printf("%d\n", cnt);
    }
}

https://www.acmicpc.net/problem/13913

#include <bits/stdc++.h>
using namespace std;
//숨바꼭질 4
int main(void) {
    queue<int> q;
    int n, m, visited[10000] = {0,}, time[10000] = {0,};
    cin >> n >> m;

    q.push(n);
    visited[n] = 1;

    while (!q.empty()) {
        int now = q.front();
        q.pop();
        if (now == m) {
            printf("%d\n", time[m]);
            break;
        }
        if (time[now-1] >= 0 && visited[now-1] == 0) {
            q.push(now-1);
           visited[now-1] = 1;
           time[now-1] = time[now] + 1;
        }
        if (time[now+1] <= 10000 && visited[now+1] == 0) {
            q.push(now+1);
            visited[now+1] = 1;
            time[now+1] = time[now] + 1;
        }
        if (time[now*2] <= 10000 && visited[now*2] == 0) {
            q.push(now*2);
            visited[now*2] = 1;
            time[now*2] = time[now] + 1;
        }
    }
    int path[10000], index = 0;
    int now = m;
    path[index] = now;
    index++;
    while(now != n) {
        //printf("===%d \n", now);
        if (now-1 >= 0 && visited[now-1] == 1 && time[now-1] == time[now]-1) {
            now = now - 1;
        }
        else if (now+1 <= 10000 && visited[now+1] == 1 && time[now+1] == time[now]-1) {
            now = now+1;
        }
        else if (now % 2 == 0 && visited[now/2] == 1 && time[now/2] == time[now]-1) {
            now = now/2;
        }
        path[index] = now;
        index++;
    }
    //return 0;

    for (int i=index-1; i>=0; i--) {
        printf("%d ", path[i]);
    }

    return 0;
}

https://www.acmicpc.net/problem/2309

#include "bits/stdc++.h"
using namespace std;
// 일곱 난쟁이
int main() {
    int height[9], sum = 0;
    for (int i=0; i<9; i++) {
        cin >> height[i];
        sum += height[i];
    }
    sort(height, height+9);
    for (int i=0; i<8; i++) {
        for (int j=i+1; j<9; j++) {
            if (sum - height[i] - height[j] == 100) {
                for (int k=0; k<9; k++) {
                    if (k == i || k == j) continue;
                    printf("%d\n", height[k]);
                }
                return 0;
            }
        }
    }
}

https://www.acmicpc.net/problem/11727

JW 

#include "bits/stdc++.h"
using namespace std;
// 2*n 타일링 2
int dp[1001];
int recursive(int n) {
    if (n == 1) return 1;
    if (n == 2) return 3;
    if (dp[n] != 0) {
        return dp[n];
    }
    dp[n] = recursive(n-1)%10007 + 2*recursive(n-2)%10007;
    return dp[n];
}

int main() {
    int n;
    cin >> n;
    printf("%d", recursive(n)%10007);
}

JW 학생

https://www.acmicpc.net/problem/11726

#include "bits/stdc++.h"
using namespace std;
// 2*n 타일링
int dp[1001];
int recursive(int n) {
    if (n == 1 || n == 2) return n;
    if (dp[n] != 0) {
        return dp[n];
    }
    dp[n] = recursive(n-1)%10007 + recursive(n-2)%10007;
    return dp[n];
}

int main() {
    int n;
    cin >> n;
    printf("%d", recursive(n)%10007);
}

https://www.acmicpc.net/problem/21758

JW학생

#include "bits/stdc++.h"
using namespace std;
// 꿀 따기 (3중 for문)
int main() {
    int n, max = 0, arr[100000] = {0,};
    cin >> n;
    for (int i=0; i<n; i++) {
        cin >> arr[i];
    }
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            if (j == i) continue;
            for (int k=0; k<n; k++) {
                if (k == i || k == j) continue;
                int itemp = i, jtemp = j;
                int sum = 0;
                while (itemp != k) {
                    if (itemp < k) itemp++;
                    else itemp--;
                    if (itemp == j) continue;
                    sum += arr[itemp];
                }
                while (jtemp != k) {
                    if (jtemp < k) jtemp++;
                    else jtemp--;
                    if (jtemp == i) continue;
                    sum += arr[jtemp];
                }
                if (sum > max) max = sum;
            }
        }
    }
    printf("%d", max);
}

4949번: 균형잡힌 세상 (acmicpc.net)

#include <bits/stdc++.h>
using namespace std;
//균형잡힌 세상
int main() {
    string str;

    getline(cin, str);
    while (str != ".") {
        stack<char> bracket;
        int len = str.size();
        for (int i=0; i<len; i++) {
            if (str[i] == '(' || str[i] == '[') {
                bracket.push(str[i]);
            }
            else if (str[i] == ')' && !bracket.empty() && bracket.top() == '(') {
                bracket.pop();
            }
            else if (str[i] == ']' && !bracket.empty() && bracket.top() == '[') {
                bracket.pop();
            }
            else if (str[i] == ')' || str[i] == ']') {
                bracket.push('a');
                break;
            }
        }
        if (bracket.empty()) {
            printf("yes\n");
        }
        else {
            printf("no\n");
        }
        getline(cin, str);
    }
}

https://www.acmicpc.net/problem/1929

#include <bits/stdc++.h>
using namespace std;
//소수 구하기
int main() {
	int n, m;
	cin >> n >> m;
	for (int i=n; i<=m; i++) {
		bool prime = true;
		if (i == 1) prime = false;
		else {
			for (int j=2; j*j<=i; j++) {
				if (i % j == 0) {
					prime = false;
					break;
				}
			}
		}
		if (prime) printf("%d\n", i);
	}
}

https://www.acmicpc.net/problem/1978

#include <bits/stdc++.h>
using namespace std;
//소수 찾기
int main() {
	bool prime = true;
	int n, arr[100], cnt = 0;
	cin >> n;
	for (int i=0; i<n; i++) {
		cin >> arr[i];
	}
	for (int i=0; i<n; i++) {
		if (arr[i] == 1) {
			prime = false;
		}
		else {
			for (int j=2; j*j<=arr[i]; j++) {
				if (arr[i] % j == 0) {
					prime = false;
					break;
				}
			}	
		}
		if (prime) cnt++;
		else prime = true;
	}
	printf("%d", cnt);
}

https://www.acmicpc.net/problem/1934 

#include <bits/stdc++.h>
using namespace std;
//최소공배수
int gcd(int a, int b) {
	while (b != 0) {
		int last = a % b;
		a = b;
		b = last;
	}
	return a;
}

int main() {
	int t, a, b;
	cin >> t;
	while (t--) {
		cin >> a >> b;
		int g = gcd(a, b);
		printf("%d\n", (a*b)/g);
	}
}

JW

#include <bits/stdc++.h>
using namespace std;
//토마토

int main() {
	queue<pair<int, int>> q;
	int n, m;
	int arr[1002][1002] = {0,}, visited[1002][1002] = {0,};
	cin >> n >> m;
	for (int i=1; i<=m; i++) {
		for (int j=1; j<=n; j++) {
			cin >> arr[i][j];
		}
	}

	for (int i=1; i<=m; i++) {
		for (int j=1; j<=n; j++) {
			if (arr[i][j] == 1) {
				q.push({i, j});
				visited[i][j] = 1;
			}
			else if (arr[i][j] == -1) {
				visited[i][j] = 1;
			}
		}
	}
	while (!q.empty()) {
		int x = q.front().first;
		int y = q.front().second;
		q.pop();
		if (x-1 != 0 && arr[x-1][y] == 0 && visited[x-1][y] == 0) {
			q.push({x-1, y});
			arr[x-1][y] = arr[x][y] + 1;
			visited[x-1][y] = 1;
		}
		if (x+1 != m+1 && arr[x+1][y] == 0 && visited[x+1][y] == 0) {
			q.push({x+1, y});
			arr[x+1][y] = arr[x][y] + 1;
			visited[x+1][y] = 1;
		}
		if (y-1 != 0 && arr[x][y-1] == 0 && visited[x][y-1] == 0) {
			q.push({x, y-1});
			arr[x][y-1] = arr[x][y] + 1;
			visited[x][y-1] = 1;
		}
		if (y+1 != n+1 && arr[x][y+1] == 0 && visited[x][y+1] == 0) {
			q.push({x, y+1});
			arr[x][y+1] = arr[x][y] + 1;
			visited[x][y+1] = 1;
		}
	}
	for (int i=1; i<=m; i++) {
		for (int j=1; j<=n; j++) {
			if (visited[i][j] == 0) {
				printf("-1");
				return 0;
			}
		}
	}
	int maxi = 0;
	for (int i=1; i<=m; i++) {
		for (int j=1; j<=n; j++) {
			if (arr[i][j] > maxi) {
				maxi = arr[i][j];
			}
		}
	}
	printf("%d", maxi-1);
}

지금 당신은 유령이 되면 벽을 통과하고 남이 하는 것을 몰래 볼 수 있다는 것을 알고 있다

나도 인정한다. 유령에 단점은 외롭다는 것은 다 알고 있다 그런데 단점은 당신이 알고 있는 것보다

훨씬 더 많다 유령이 되면 아무리 "나 여기 있어!!!!"라고 해도 아무도 듣지 못한다 그리고 유령이 되려면

죽여야 한다 이 세상 죽고 싶은 사람은 없을 것이다 죽고 싶은 사람이 있으면 그 사람은 100% 정신 나갔거나 술 챘다. 이까 지온 사람은 유령이 되고 싶다는 생각은 없을 것이다.

                                        끝

여기도 보고 저기도 보고 도토리 찾으려고

여기저기 찾아다니네

여기도 물어보고 저기도 물어보고 도토리 찾으려고

여기저기 물어보네

다람쥐는 어쩌면 그렇게

도토리를 좋아할까?

chapter 1: hennry

hennry is a 16 year old boy who loves vr, so is obvious that he

has a vr goggle. he likes to play mincraft in vr (which is awsome)

but one day a virus had been put in the vr world...

                          to be continued

after a few years, cherry and zoldmore got married and

gave birth to a baby called hennry THE END.

                               guys thank you for reading my stories

                                next, I will make a story called trapped in VR 

                                so get your tea or coffee and sit tight!😍

the police arrived and sam told the police what happened. sam told that zoldmore was about to stab him

and zoldmore said "sam is wrong he tried to stab me!" and the police found a knife in sam's

hand and he got sent to jail.

                                          to be continued...

cherries ex-boyfriend got mad so he punched zoldmore in the face!

zoldmore got really angry so he called bigton1.

and bigton1flew in into the cafe and stood right in front of sam (who is cherries ex-boyfriend)

and sam got scared and ran away.

but cherry did NOT like sam so yeah. but one day sam got a knife and broke into zoldmores house...

                                     to be continued

like always zoldmore was playing with bigton1 when

a girl the same age as zoldmore walked past him.

zoldmore immediately fell in love with her and

the girl fell in love too. so after a few days, 

they became friends and went on a date

and the girl's name was called cherry.

but cherries ex-boyfriend came and saw

that cherry was dating with zoldmore

                                      to be continued...

zoldmore had finished bigton1. He was very happy so he pressed the button on

bigton1. and bigton1 was born!! but at first, it did not work out well. but after a few

days but bigton1 finally got to know zoldmore. bigton1 and zoldmore

went on adventures and lots of other stuff. but when bigton1 and zoldmore

went to the science lab the gas tank was on fire...

                                                   to be continued

It was a bright sunny day and there was a boy who
was walking down the street. that boy was zoldmore and it was his first day of going to the science lab. zoldmore loved science so he was really excited to go to the science lab. after a few minutes he arrived at the science lab so the first thing he did is make a robot named big ton1
so will he be able to make it or not...




to be continued........

꽃의 계절인 봄

꽃향기가 솔솔 나네

물놀이의 계절인 여름

물놀이를 하니 흠뻑 젖었네

빨간색, 노란색, 주황색이

썩여 있는 계절 가을

단풍 보러 갔다가 눈이 알록달록 변하네

눈이 펑펑 쏟아지는 계절인 겨울

눈싸움하다가 얼굴 맞았네

계절마다 재밌는 것을 하네

은하수처럼 대를 짓고 불빛을 내는

반딧불이

반딧불이를 초롱꽃에 넣어서

숲 속을 걷네

반딧불이... 너무 보고 싶다