move folders of people who success the challenge to hall of fame foler

Author: ellynhan

hall_of_fame/Ernstjunger-1914/[BOJ]0 = not cute 1 = cute.cpp

@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+#define ioboost ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+
+using namespace std;
+
+int main() {
+  ioboost;
+
+  int n;
+  int result[2]={ 0 };
+  cin>>n;
+
+  for(int i=0; i<n; i++) {
+    int tmp;
+    cin>>tmp;
+    result[tmp]+=1;
+  }
+  cout<<(result[0]>result[1]?"Junhee is not cute!":"Junhee is cute!")<<"\n";
+
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]1, 2, 3 더하기.cpp

@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+
+using namespace std;
+
+int main() {
+  fastio;
+
+  int t, n;
+  int plus[10]={ 0, 1, 2, 4 };
+  cin>>t;
+
+  for(int i=4; i<11; i++) {
+    plus[i]=plus[i-1]+plus[i-2]+plus[i-3];
+  }
+
+  for(int i=0; i<t; i++) {
+    cin>>n;
+    cout<<plus[n]<<"\n";
+  }
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]1로 만들기 2.cpp

@@ -0,0 +1,45 @@
+#include <bits/stdc++.h>
+#define ioboost ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+
+using namespace std;
+using ll=long long;
+
+int n;
+int dp[1000001]={};
+
+int main() {
+  ioboost;
+
+  cin>>n;
+
+  for(int i=1; i<=n; i++) {
+    dp[i]=i;
+  }
+
+  for(int i=2; i<=n; i++) {
+    if(i%2==0) {
+      dp[i]=min(dp[i], dp[i/2]);
+    }
+    if(i%3==0) {
+      dp[i]=min(dp[i], dp[i/3]);
+    }
+    dp[i]=min(dp[i], dp[i-1])+1;
+  }
+
+  cout<<dp[n]-1<<"\n";
+
+  while(n!=0) {
+    cout<<n<<" ";
+
+    if(dp[n]==dp[n-1]+1) {
+      n-=1;
+    } else if(n%2==0&&dp[n]==dp[n/2]+1) {
+      n/=2;
+    } else if(n%3==0&&dp[n]==dp[n/3]+1) {
+      n/=3;
+    }
+  }
+  cout<<"\n";
+  
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]1로 만들기.cpp

@@ -0,0 +1,27 @@
+#include<bits/stdc++.h>
+#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+
+using namespace std;
+
+int main() {
+  fastio;
+
+  int i, n;
+  int one[1000001]={ 0 };
+  cin>>n;
+
+  for(int i=2; i<=n; i++) {
+    one[i]=one[i-1]+1;
+
+    if(i%2==0) {
+      one[i]=min(one[i], one[i/2]+1);
+    }
+
+    if(i%3==0) {
+      one[i]=min(one[i], one[i/3]+1);
+    }
+  }
+  cout<<one[n]<<"\n";
+
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]1의 개수 세기.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+#define ioboost ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
+
+using namespace std;
+using ll=long long;
+
+ll func(ll x) {
+  ll a=x, b=1, cnt=0;
+
+  while(a) {
+    cnt+=(x+1)/(b<<1)*b;
+
+    if(a&1) cnt+=(x+1)%b;
+    a>>=1; b<<=1;
+  }
+  return cnt;
+}
+
+int main() {
+  ioboost;
+
+  ll a, b;
+  cin>>a>>b;
+  cout<<func(b)-func(a-1)<<"\n";
+  
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]2×n 타일링 2.cpp

@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+#define ioboost ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+
+using namespace std;
+using ll=long long;
+
+int dp[1001]={ 0, 1, 3 };
+
+int func(int n) {
+  if(dp[n]) {
+    return dp[n];
+  }
+  return dp[n]=(func(n-1)%10007+2*func(n-2)%10007)%10007;
+}
+
+int main() {
+  ioboost;
+
+  int n;
+  cin>>n;
+  cout<<func(n)<<"\n";
+  
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]A → B.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+#define ioboost ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
+
+using namespace std;
+
+typedef long l;
+typedef long long ll;
+typedef size_t st;
+
+int main() {
+  ioboost;
+
+  l a, b, ans=1;
+  cin>>a>>b;
+
+  while(b>=a) {
+    if(a==b) {
+      cout<<ans<<"\n";
+
+      return 0;
+    }
+
+    ans++;
+
+    if(b%2==0) {
+      b/=2;
+    } else if(b%10==1) {
+      b-=1;
+      b/=10;
+    } else {
+      break;
+    }
+  }
+  cout<<-1<<"\n";
+  
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]AC.cpp

@@ -0,0 +1,88 @@
+#include <bits/stdc++.h>
+#define ioboost ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
+
+using namespace std;
+
+typedef long long ll;
+typedef size_t st;
+typedef vector<int> vi;
+typedef pair<int, int> pi;
+typedef vector<ll> vll;
+typedef pair<ll, ll> pll;
+
+int main() {
+  ioboost;
+
+  int t, n;
+  cin>>t;
+
+  while(t--) {
+    deque<int> d;
+    bool err=0, res=0;
+    string str, order, s="";
+    cin>>order;
+    cin>>n;
+    cin>>str;
+
+    for(int i=0; i<str.length(); i++) {
+      if(isdigit(str[i])) {
+        s+=str[i];
+      } else {
+        if(!s.empty()) {
+          d.push_back(stoi(s));
+          s="";
+        }
+      }
+    }
+
+    for(auto t: order) {
+      if(t=='R') {
+        if(!res) {
+          res=1;
+        } else {
+          res=0;
+        }
+      } else {
+        if(d.empty()) {
+          cout<<"error"<<"\n";
+          err=1;
+
+          break;
+        }
+
+        if(!res) {
+          d.pop_front();
+        } else {
+          d.pop_back();
+        }
+      }
+    }
+
+    if(!err) {
+      cout<<"[";
+    }
+
+    if(res&&!d.empty()) {
+      for(auto t=d.rbegin(); t!=d.rend(); t++) {
+        if(t!=d.rend()-1) {
+          cout<<*t<<",";
+        } else {
+          cout<<*t;
+        }
+      }
+    } else if(!res&&!d.empty()) {
+      for(auto t=d.begin(); t!=d.end(); t++) {
+        if(t!=d.end()-1) {
+          cout<<*t<<",";
+        } else {
+          cout<<*t;
+        }
+      }
+    }
+
+    if(!err) {
+      cout<<"]\n";
+    }
+  }
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]ACM Craft.cpp

@@ -0,0 +1,56 @@
+#include <bits/stdc++.h>
+#define ioboost ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
+
+using namespace std;
+using ll = long long;
+
+int main() {
+  ioboost;
+
+  int t;
+  cin>>t;
+
+  while(t--) {
+    int n, k;
+    int time[1002];
+    cin>>n>>k;
+
+    for(int i=1; i<=n; i++) {
+      cin>>time[i];
+    }
+
+    vector<int> vi[1002];
+    int res[1002], ind[1002]={};
+    queue<int> qi;
+
+    while(k--) {
+      int a, b;
+      cin>>a>>b;
+      vi[a].push_back(b);
+      ind[b]++;
+    }
+
+    int w;
+    cin>>w;
+
+    for(int i=1; i<=n;  i++) {
+      if(ind[i]==0) qi.push(i);
+      res[i]=time[i];
+    }
+
+    while(!qi.empty()) {
+      int tmp=qi.front();
+      qi.pop();
+
+      for(int i=0; i<vi[tmp].size(); i++) {
+        int nxt=vi[tmp][i];
+        ind[nxt]--;
+        res[nxt]=max(res[nxt], res[tmp]+time[nxt]);
+
+        if(ind[nxt]==0) qi.push(nxt);
+      }
+    }
+    cout<<res[w]<<"\n";
+  }
+  return 0;
+}

hall_of_fame/Ernstjunger-1914/[BOJ]ATM.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+
+using namespace std;
+
+int main() {
+  fastio;
+
+  int n, time=0, result=0;
+  cin>>n;
+  int line[n];
+
+  for(int i=0; i<n; i++) {
+    cin>>line[i];
+  }
+
+  sort(line, line+n);
+
+  for(int i=0; i<n; i++) {
+    time+=line[i];
+    result+=time;
+  }
+  cout<<result<<"\n";
+
+  return 0;
+}