first commit for Baekjoon PS

Author: kkoma2623

.gitignore

@@ -0,0 +1 @@
+*.out

Baekjoon/01012Baek.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main(){
+  int testCases;
+  cin >> testCases;
+
+  for(int cases=0; cases<testCases; cases++){
+    int M,N,K;
+    cin >> M >> N >> K;
+    vector<int> temp(M);
+    // vector<vector<int> > ground(temp, 0);
+  }
+
+  return 0;
+}

Baekjoon/01016Baek.cpp

@@ -0,0 +1,15 @@
+#include <iostream>
+#include <cmath>
+
+using namespace std;
+
+int main(){
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  long long ret = 0;
+  int min = 0;
+  int max = 0;
+
+  
+  return 0;
+}

Baekjoon/01021Baek.cpp

@@ -0,0 +1,56 @@
+#include <iostream>
+#include <deque>
+#include <queue>
+
+using namespace std;
+deque<int> dq;
+queue<int> q;
+
+int findIndex(int num) {
+  for(int i=0; i<dq.size(); ++i) {
+    if (num == dq[i]) return i;
+  }
+}
+
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  int m, n;
+  cin >> m >> n;
+  for(int i=1; i<=m; ++i){
+    dq.push_back(i);
+  }
+  
+  for(int i=0; i<n; ++i) {
+    int temp; cin >> temp;
+    q.push(temp);
+  }
+
+  int ret = 0;
+  while(!q.empty()) {
+    int index = findIndex(q.front());
+    if (index > dq.size()/2) {
+      // right
+      while(q.front() != dq.front()) {
+        int back = dq.back();
+        dq.pop_back();
+        dq.push_front(back);
+        ++ret;
+      }
+    } else {
+      // left
+      while(q.front() != dq.front()) {
+        int front = dq.front();
+        dq.pop_front();
+        dq.push_back(front);
+        ++ret;
+      }
+    }
+
+    q.pop();
+    dq.pop_front();
+  }
+
+  cout << ret;
+  return 0;
+}

Baekjoon/01027Baek.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main(){
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  int nums; cin >> nums;
+  vector<int> v(nums);
+  for(int i=0; i<nums; ++i){
+    cin >> v[i];
+  }
+  if(v.size() == 1){
+    cout << v[0]*v[0];
+    return 0;
+  }
+
+  sort(v.begin(), v.end());
+  cout << v[0]*v[v.size()-1];
+  return 0;
+}

Baekjoon/01124Baek.cpp

@@ -0,0 +1,51 @@
+#include <iostream>
+#include <vector>
+#include <cmath>
+
+using namespace std;
+
+bool nPrime[100001];
+
+vector<int> yaksoo(int n) {
+  vector<int> ret;
+  int localN = n;
+  for(int i=2; ;) {
+    if(i > n/2) break;
+    if(localN%i != 0 || nPrime[i]) {
+      ++i;
+      continue;
+    }
+
+    localN /= i;
+    ret.push_back(i);
+  }
+
+  return ret;
+}
+
+int main(){
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  nPrime[0] = true;
+  nPrime[1] = true;
+  for(int i=2; i<=316; ++i){
+    for(int j=2; i*j<=100000; ++j){
+      nPrime[i*j] = true;
+    }
+  }
+
+  int a, b; cin >> a >> b;
+  int ans = 0;
+  for(int i=a; i<=b; ++i){
+    vector<int> vec; // 약수 모음
+
+    vec = yaksoo(i);
+    if(nPrime[vec.size()]) continue;
+    ans += 1;
+  }
+
+  std::cout << ans;
+
+
+  return 0;
+}

Baekjoon/01158Baek.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main(){
+  ios::sync_with_stdio(false);
+  cin.tie(NULL);
+  int num, step;
+  cin >> num >> step;
+  vector<int> v;
+  
+  for(int i=1; i<=num; i++)
+    v.push_back(i);
+  
+  vector<int> res;
+  int pos = step-1;
+
+  while(!v.empty()){
+    if(pos >= v.size()){
+      pos -= v.size();
+      continue;
+    }
+    else{
+      res.push_back(v[pos]);
+      v.erase(v.begin() + pos);
+      pos += step-1;
+    }
+  }
+
+  cout << '<';
+  for(auto iter=res.begin(); iter!=res.end()-1; iter++){
+    cout << (*iter) << ", ";
+  }
+  cout << res[res.size()-1] << '>';
+  
+  return 0;
+}

Baekjoon/01339Baek.cpp

@@ -0,0 +1,55 @@
+#include <iostream>
+#include <string>
+#include <map>
+#include <cmath>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+map<char, int> mm;
+vector<string> savedNum;
+vector<int> ans;
+
+bool cmp(const pair<char, int>& a, const pair<char, int>& b) {
+  if(a.second < b.second) return a.first < b.first;
+  return a.second < b.second;
+}
+
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  int n; cin >> n;
+  for(int i=0; i<n; ++i){
+    string temp; cin >> temp;
+    savedNum.push_back(temp);
+    for(int j=temp.size()-1; j>=0; --j){
+      mm[temp[j]] += pow(10, temp.size() - j - 1);
+    }
+  }
+
+  vector<pair<int, char>> vec;
+
+
+  for(auto iter = mm.begin(); iter != mm.end(); ++iter){
+    vec.push_back({(*iter).second, (*iter).first});
+  }
+
+  sort(vec.begin(), vec.end(), greater<pair<int, char>>());
+  map<char, int> mmm;
+  for(int i=9, j=0; i>=0 && j<vec.size(); --i, ++j) {
+    mmm[vec[j].second] = i;
+  }
+
+  int ret = 0;
+  
+  for(int i=0; i<savedNum.size(); ++i){
+    int temp = 0;
+    for(int j=0; j<savedNum[i].size(); ++j){
+      temp = temp*10 + mmm[savedNum[i][j]];
+    }
+    ret += temp;
+  }
+  cout << ret;
+  return 0;
+}

Baekjoon/01541Baek.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+string sen;
+
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  cin >> sen;
+
+  bool found = false;
+  int pos = 0;
+  int num = 0;
+  int tempNum = 0;
+  for(; pos<sen.size(); ++pos){
+    if(sen[pos] == '-') {
+      found = true;
+      num += tempNum;
+      ++pos;
+      break;
+    }
+    if(sen[pos] == '+') {
+      num += tempNum;
+      tempNum = 0;
+      continue;
+    }
+
+    tempNum = tempNum*10 + sen[pos] - '0';
+  }
+  if(!found) num += tempNum;
+
+
+  if(found) {
+    tempNum = 0;
+    for(; pos<sen.size(); ++pos){
+      if(sen[pos] > '9' || sen[pos] < '0'){
+        num -= tempNum;
+        tempNum = 0;
+        continue;
+      }
+
+      tempNum = tempNum*10 + sen[pos] - '0';
+    }
+
+    num -= tempNum;
+  }
+
+  cout << num;
+  return 0;
+}

Baekjoon/01620Baek.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <map>
+#include <string>
+
+using namespace std;
+
+int main(){
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  int monsters, quiz;
+  cin >> monsters >> quiz;
+  map<string, int> book;
+  map<int, string> book2;
+
+  for(int mon=1; mon<=monsters; ){
+    string monster;
+    cin >> monster;
+    book2.insert({mon, monster});
+    book.insert({monster, mon++});
+  }
+
+  for(int q=0; q<quiz; q++){
+    string mon;
+    cin >> mon;
+    if('0' <= mon[0] && mon[0] <= '9'){
+      cout << book2[stoi(mon)] << "\n";
+    }
+    else{
+      cout << book[mon] << "\n";
+    }
+  }
+  return 0;
+}