Solve alot of problems :3

Author: AliOsm

AtCoder/055A - Restaurant.cpp

@@ -0,0 +1,12 @@
+#include <iostream>
+     
+using namespace std;
+     
+int main() {
+    int n;
+    cin >> n;
+        
+    cout << (n * 800) - (n / 15 * 200) << endl;
+        
+    return 0;
+}

AtCoder/055B - Training Camp.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+ 
+using namespace std;
+ 
+int main() {
+    long long n;
+    cin >> n;
+    
+    long long res = 1;
+    for(int i = 1; i <= n; i++) {
+        res *= i;
+        res %= ((long long)1e9 + 7);
+    }
+    
+    cout << res << endl;
+        
+    return 0;
+}

AtCoder/055C - Scc Puzzle.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+ 
+using namespace std;
+ 
+long long n, m;
+ 
+long long can(long long mid) {
+    long long S = mid, cc = mid * 2;
+    
+    if(S <= n && cc <= m)
+        return true;
+    else {
+        if(cc > m) return false;
+        
+        long long needS = S - n;
+        
+        if(cc <= (m - (needS * 2)))
+            return true;
+        else
+            return false;
+    }
+}
+
+int main() {
+    cin >> n >> m;
+    
+    long long l = 0, r = 1e18, res;
+    while(l <= r) {
+        long long mid = (l + r) / 2;
+        
+        if(can(mid)) {
+            res = mid;
+            l = mid + 1;
+        } else
+            r = mid - 1;
+    }
+    
+    cout << res << endl;
+    
+    return 0;
+}

AtCoder/057A - Remaining Time.cpp

@@ -0,0 +1,12 @@
+#include <iostream>
+     
+using namespace std;
+ 
+int main() {
+  int a, b;
+  cin >> a >> b;
+  
+  cout << (a + b) % 24 << endl;
+  
+  return 0;
+}

AtCoder/057B - Checkpoints.cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <vector>
+#include <cmath>
+ 
+using namespace std;
+ 
+vector<pair<long long, long long> > stu, pnt;
+ 
+int main() {
+  int n, m;
+  cin >> n >> m;
+  
+  int a, b;
+  
+  while(n--) {
+    cin >> a >> b;
+    stu.push_back({a, b});
+  }
+  n = stu.size();
+  
+  while(m--) {
+    cin >> a >> b;
+    pnt.push_back({a, b});
+  }
+  m = pnt.size();
+  
+  long long res;
+  int indx;
+  
+  for(int i = 0; i < n; i++) {
+    res = 1e18;
+    
+    for(int j = 0; j < m; j++) {
+      if(abs(stu[i].first - pnt[j].first) + abs(stu[i].second - pnt[j].second) < res) {
+        res = abs(stu[i].first - pnt[j].first) + abs(stu[i].second - pnt[j].second);
+        indx = j;
+      }
+    }
+    
+    cout << indx + 1 << endl;
+  }
+  
+  return 0;
+}

AtCoder/057C - Digits in Multiplication.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <vector>
+#include <cmath>
+#include <algorithm>
+ 
+using namespace std;
+ 
+vector<long long> d;
+ 
+int calc(long long i, long long j) {
+  return (int)max(floor(log10(i)) + 1, floor(log10(j)) + 1);
+}
+ 
+int main() {
+  long long n, tmp;
+  cin >> n;
+  
+  tmp = sqrt(n);
+  for(int i = 1; i <= tmp; i++)
+    if(n % i == 0) {
+      d.push_back(i);
+      d.push_back(n / i);
+    }
+  
+  sort(d.begin(), d.end());
+  
+  int res = 1e9;
+  
+  for(int i = 0, j = d.size() - 1; i <= j; i++, j--)
+    res = min(res, calc(d[i], d[j]));
+  
+  cout << res << endl;
+  
+  return 0;
+}

AtCoder/059A - Three-letter acronym.cpp

@@ -0,0 +1,16 @@
+#include <iostream>
+#include <string>
+#include <cctype>
+ 
+using namespace std;
+ 
+int main() {
+  string s;
+  for(int i = 0; i < 3; i++) {
+    cin >> s;
+    cout << char(toupper(s[0]));
+  }
+  cout << endl;
+ 
+  return 0;
+}

AtCoder/059B - Comparison.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <string>
+#include <cctype>
+ 
+using namespace std;
+ 
+int main() {
+  string n1, n2;
+  cin >> n1 >> n2;
+  
+  if(n1.length() < n2.length()) {
+    cout << "LESS" << endl;
+    return 0;
+  } else if(n1.length() > n2.length()) {
+    cout << "GREATER" << endl;
+    return 0;
+  } else {
+    for(int i = 0; i < n1.length(); i++)
+      if((n1[i] - '0') > (n2[i] - '0')) {
+        cout << "GREATER" << endl;
+        return 0;
+      } else if((n1[i] - '0') < (n2[i] - '0')) {
+        cout << "LESS" << endl;
+        return 0;
+      }
+  }
+  
+  cout << "EQUAL" << endl;
+ 
+  return 0;
+}

AtCoder/060A - Shiritori.cpp

@@ -0,0 +1,16 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+     
+int main() {
+    string s1, s2, s3;
+    cin >> s1 >> s2 >> s3;
+    	
+    if(s1[s1.length() - 1] == s2[0] && s2[s2.length() - 1] == s3[0])
+      cout << "YES" << endl;
+    else
+      cout << "NO" << endl;
+     
+    return 0;
+}

AtCoder/060B - Choose Integers.cpp

@@ -0,0 +1,21 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int a, b, c;
+    cin >> a >> b >> c;
+    	
+    int tmp;
+    for(int i = 2; i < 10000; i++) {
+        tmp = a * i;
+        if((a + tmp) % b == c % b) {
+            cout << "YES" << endl;
+            return 0;
+	}
+    }
+    	
+    cout << "NO" << endl;
+     
+    return 0;
+}

AtCoder/060C - Sentou.cpp

@@ -0,0 +1,26 @@
+#include <stdio.h>
+#include <vector>
+
+using namespace std;
+
+vector<long long> a;
+     
+int main() {
+    long long n, t;
+    scanf("%llu%llu", &n, &t);
+    a.resize(n);
+    for(int i = 0; i < n; ++i)
+        scanf("%llu", &a[i]);
+    	
+    long long res = t;
+    for(int i = 1; i < n; ++i) {
+        if(a[i] - a[i-1] <= t)
+            res += (a[i] - a[i-1]);
+        else
+	    res += t;
+    }
+    	
+    printf("%lld\n", res);
+     
+    return 0;
+}

AtCoder/060D - Simple Knapsack.cpp

@@ -0,0 +1,33 @@
+#include <stdio.h>
+#include <vector>
+#include <algorithm>
+#include <memory.h>
+
+using namespace std;
+
+int const N = 101;
+long long n, w;
+long long dp[N][10000];
+vector<pair<long long, long long> > a;
+     
+long long calc(int index, long long sum) {
+    if(index == n) return 0;
+    if(dp[index][int(sum % 10000)] != -1) return dp[index][int(sum % 10000)];
+      
+    long long res1 = 0, res2 = 0;
+    if(sum >= a[index].first) res1 = calc(index + 1, sum - a[index].first) + a[index].second;
+    res2 = calc(index + 1, sum);
+    return dp[index][int(sum % 10000)] = max(res1, res2);
+}
+     
+int main() {
+    scanf("%d%d", &n, &w);
+    a.resize(n);
+    for(int i = 0; i < n; ++i)
+        scanf("%d%d", &a[i].first, &a[i].second);
+    	
+    memset(dp, -1, sizeof dp);
+    printf("%lld\n", calc(0, w));
+     
+    return 0;
+}

AtCoder/README.md

@@ -0,0 +1,14 @@
+# Problems links
+
+- [055A - Restaurant](http://abc055.contest.atcoder.jp/tasks/abc055_a)
+- [055B - Training Camp](http://abc055.contest.atcoder.jp/tasks/abc055_b)
+- [055C - Scc Puzzle](http://abc055.contest.atcoder.jp/tasks/arc069_a)
+- [057A - Remaining Time](http://abc057.contest.atcoder.jp/tasks/abc057_a)
+- [057B - Checkpoints](http://abc057.contest.atcoder.jp/tasks/abc057_b)
+- [057C - Digits in Multiplication](http://abc057.contest.atcoder.jp/tasks/abc057_c)
+- [059A - Three-letter acronym](http://abc059.contest.atcoder.jp/tasks/abc059_a)
+- [059B - Comparison](http://abc059.contest.atcoder.jp/tasks/abc059_b)
+- [060A - Shiritori](http://abc060.contest.atcoder.jp/tasks/abc060_a)
+- [060B - Choose Integers](http://abc060.contest.atcoder.jp/tasks/abc060_b)
+- [060C - Sentou](http://abc060.contest.atcoder.jp/tasks/arc073_a)
+- [060D - Simple Knapsack](http://abc060.contest.atcoder.jp/tasks/arc073_b)

CS Academy/24. Kth Special Number.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+#include <bitset>
+
+using namespace std;
+
+bitset<64> bs;
+
+int main() {
+  int k;
+    cin >> k;
+    
+    int n = 0, ones;
+    
+    while(k) {
+        n++;
+        ones = 0;
+        bs = n;
+        
+        for(int i = bs.size() - 1; i >= 0; i--)
+          if(bs[i] && bs[i+1]) {
+            ones = 2;
+            break;
+          }
+        
+        if(ones != 2) k--;
+    }
+    
+    cout << n << endl;
+  
+  return 0;
+}
+

CS Academy/24. Vector Size.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+  int n, size = 0, res = 0;;
+  cin >> n;
+  
+  int tmp;
+  while(n--) {
+    cin >> tmp;
+    if(tmp) {
+      size++;
+    } else {
+      if(size)
+	size--;
+    }
+    
+    res = max(res, size);
+  }
+  
+  cout << res << endl;
+  
+  return 0;
+}
+