씅의 기록하는 개발노트

#include <iostream>

#include <string>

#include <algorithm>

using namespace std;

/*

* 회문 알고리즘

* 임의의 문자열s로 회문을 만든다.

* 문자열 s뒤에 0개 이상의 숫자를 추가해 회문을 생성하려고 한다.

* 가장 짧은 회문의 길이를 return

*/

int find(string s)

{

cout<<s.size()<<endl;

for(int i=s.size(); ; i++)

{

bool breakFlag=true;

for(int j=0; j<s.size(); j++)

{

if((i-j-1) < s.size() && s[j] != s[i-j-1])

{

breakFlag=false;

break;

}

}

if(breakFlag)

return i;

}

}

int main(void)

{

cout<<find("abab")<<endl;

return 0;

} 

#include <stdio.h>

#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;

long long encrypt(vector<int> numbers)

{

long long ret=1;

sort(numbers.begin(), numbers.end());

numbers[0]++;

for(int i=0; i<numbers.size(); i++)

{

ret*=numbers[i];

}

return ret;

}

int main(void)

{

vector<int> numbers;

for(int i=1;i<4;i++)

numbers.push_back(i);

cout<<encrypt(numbers)<<endl;

}

//

//  main.cpp

//  KiwiJuice

//

//  Created by sw on 19/12/2018.

//  Copyright © 2018 sw. All rights reserved.

//

#include <stdio.h>

#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;

vector<int> thePouring(vector<int> capacities, vector<int> bottles, vector<int> fromId, vector<int> toId)

{

    for(int i=0; i<fromId.size(); i++)

    {

        int sum=bottles[fromId[i]] + bottles[toId[i]];

        bottles[toId[i]]=min(sum, capacities[toId[i]]);

        bottles[fromId[i]]=sum-bottles[toId[i]];

    }

    return bottles;

}

int main(int argc, const char * argv[]) {

    vector<int> capacities = {30,20,10};

    vector<int> bottles = {10,5,5};

    vector<int> fromId = {0,1,2};

    vector<int> toId = {1,2,0};

    vector<int> rst=thePouring(capacities, bottles, fromId, toId);

    for(int value:rst){

        cout<<value<<endl;

    }

    return 0;

} 

#include <iostream>

#include <stdlib.h>

#define BIG_BAG 5

#define SMALL_BAG 3

using namespace std;

int sol(int& n)

{

int quotient = n/BIG_BAG;

while(quotient>=0)

{

int tmp = n - (BIG_BAG*quotient);

if(tmp % SMALL_BAG == 0)

return quotient + (tmp/SMALL_BAG);

quotient--;

}

return -1;

}

int main(void)

{

int n; //input value(sugar's kg)

cin>>n;

if(n<3 || n>5000)

exit(-1);

cout<<sol(n)<<endl;

return 0;

}

#include <stdio.h>

#include <iostream>

#include <algorithm>

#define MAX_COST 9999999

using namespace std;

int main(void)

{

int cost;

int minBurger=MAX_COST, minDrink=MAX_COST;

for(int i=0; i<5; i++)

{

cin>>cost;

if(i<3)

minBurger=min(minBurger, cost);

else

minDrink =min(minDrink, cost);

}

cout<<minBurger + minDrink - 50<<endl;

return 0;

} 

#include <string>

#include <vector>

#include <algorithm>

using namespace std;

vector<int> solution(vector<int> array, vector<vector<int>> commands) {

    vector<int> answer;

    int s, e, t, ret;    //시작, 끝, 타겟, 결과값

    for(int i=0; i<commands.size(); i++) {

        vector<int> tmp;

        // index값이므로 -1씩 해줌

        s=commands[i][0]-1;

        e=commands[i][1]-1;

        t=commands[i][2]-1;

        for(int j=s; j<=e; j++) {

            tmp.push_back(array[j]);

        }

        sort(tmp.begin(), tmp.end());

        ret=tmp[t];

        answer.push_back(ret);

    }

    return answer;

}

#define _CRT_SECURE_NO_WARNINGS

#include <cstdio>

#include <iostream>

#include <algorithm>

#include <queue>

#include <stack>

#include <vector>

#include <functional>

#define MAX_SIZE 100

#define INF 0x7fffffff

using namespace std;

int N, K;

int coin[MAX_SIZE];

int dp[10001];

void solve()

{

dp[0] = 1;

scanf("%d %d", &N, &K);

for (int i = 0; i < N; i++)

scanf("%d", &coin[i]);

for (int i = 0; i < N; i++) {

for (int j = coin[i]; j <= K; j++) {

if (j - coin[i] >= 0)

dp[j] += dp[j - coin[i]];

}

}

printf("%d\n", dp[K]);

}

int main(void)

{

solve();

return 0;

}