Solve alot of problems :3

Author: AliOsm

Diff for: CodeForces/110C. Lucky Sum of Digits.cpp

@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, dp[int(1e6 + 1)][2];
+
+int rec(int sum, bool f) {
+  if(sum > n)
+    return 1e9;
+  
+  if(sum == n)
+    return 0;
+  
+  int &ret = dp[sum][f];
+  if(ret != -1)
+    return ret;
+  ret = 0;
+  
+  ret = min(rec(sum + (!f ? 4 : 7), 0) + 1, rec(sum + (!f ? 4 : 7), 1) + 1);
+  
+  return ret;
+}
+
+void print(int sum, bool f) {
+  if(sum > n)
+    return;
+  
+  if(sum == n)
+    return;
+  
+  if(!f)
+    putchar('4');
+  else
+    putchar('7');
+  
+  int opt = min(rec(sum + (!f ? 4 : 7), 0) + 1, rec(sum + (!f ? 4 : 7), 1) + 1);
+  
+  if(opt == rec(sum + (!f ? 4 : 7), 0) + 1)
+    print(sum + (!f ? 4 : 7), 0);
+  else
+    print(sum + (!f ? 4 : 7), 1);
+}
+
+int main() {
+  scanf("%d", &n);
+  memset(dp, -1, sizeof dp);
+  int mn = min(rec(0, 0), rec(0, 1));
+  if(mn >= 1e9) {
+    puts("-1");
+    return 0;
+  } else if(mn == rec(0, 0))
+    print(0, 0);
+  else
+    print(0, 1);
+  puts("");
+  
+  return 0;
+}

Diff for: CodeForces/152C. Pocket Book.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, m, freq[101][26], all[101];
+char s[101];
+
+int main() {
+  scanf("%d %d", &n, &m);
+  for(int i = 0; i < n; ++i) {
+    scanf("%s", s);
+    for(int j = 0; j < m; ++j)
+      ++freq[j][s[j] - 'A'];
+  }
+  
+  for(int i = 0; i < m; ++i)
+    for(int j = 0; j < 26; ++j)
+      all[i] += (freq[i][j] != 0);
+  
+  long long res = 1;
+  for(int i = 0; i < m; ++i)
+    res = (res * (all[i] == 0 ? 1 : all[i])) % int(1e9 + 7);
+  printf("%lld\n", res);
+  
+  return 0;
+}
+

Diff for: CodeForces/186C. Plant.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const MOD = 1000000007;
+long long n;
+
+long long power(int b, long long p) {
+  if(p == 0)
+    return 1;
+  
+  long long res = power(b, p >> 1);
+  res = res * res % MOD;
+  if(p & 1)
+    res = res * b % MOD;
+  return res;
+}
+
+int main() {
+  scanf("%lld", &n);
+  long long r = power(2, n);
+  printf("%lld\n", (r * (r + 1) / 2) % MOD);
+  
+  return 0;
+}

Diff for: CodeForces/382C. Arithmetic Progression.cpp

@@ -0,0 +1,61 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, a[int(1e5 + 1)];
+set<int> st, all;
+
+int main() {
+  scanf("%d", &n);
+  for(int i = 0; i < n; ++i) {
+    scanf("%d", a + i);
+    all.insert(a[i]);
+  }
+  
+  if(n == 1) {
+    puts("-1");
+    return 0;
+  }
+  
+  sort(a, a + n);
+  
+  if(n == 2) {
+    if(a[0] == a[1])
+      printf("1\n%d\n", a[0]);
+    else if((a[1] - a[0] - 1) & 1)
+      printf("3\n%d %d %d\n", a[0] - (a[1] - a[0]), (a[0] + a[1]) / 2, a[1] + (a[1] - a[0]));
+    else
+      printf("2\n%d %d\n", a[0] - (a[1] - a[0]), a[1] + (a[1] - a[0]));
+    return 0;
+  }
+  
+  for(int i = 1; i < n; ++i)
+    st.insert(a[i] - a[i - 1]);
+  
+  if(st.size() == 1) {
+    if(all.size() == 1)
+      printf("1\n%d\n", a[0]);
+    else
+      printf("2\n%d %d\n", a[0] - *st.begin(), a[n - 1] + *st.begin());
+  } else if(st.size() == 2) {
+    int mn = *st.begin();
+    int mx = *(++st.begin());
+    
+    if(mn + mn == mx) {
+      int tmp = 0, idx;
+      for(int i = 1; i < n; ++i)
+        if(a[i] - a[i - 1] == mx)
+          ++tmp, idx = i;
+      if(tmp == 1)
+        printf("1\n%d\n", (a[idx] + a[idx - 1]) / 2);
+      else
+        puts("0");
+    } else {
+      puts("0");
+    }
+  } else {
+    puts("0");
+  }
+  
+  return 0;
+}

Diff for: CodeForces/389C. Fox and Box Accumulation.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, a[101];
+
+bool can(int mid) {
+  for(int i = 0; i < n; ++i)
+    if(i / mid > a[i])
+      return false;
+  return true;
+}
+
+int main() {
+  scanf("%d", &n);
+  for(int i = 0; i < n; ++i)
+    scanf("%d", a + i);
+  sort(a, a + n);
+  
+  for(int i = 1; i < 101; ++i)
+    if(can(i)) {
+      printf("%d\n", i);
+      return 0;
+    }
+  
+  return 0;
+}

Diff for: CodeForces/463C. Gargari and Bishops.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 3001;
+int n, g[N][N], x, y, xx, yy;
+long long dp1[2 * N], dp2[2 * N], sol1 = -1, sol2 = -1;
+
+int main() {
+  scanf("%d", &n);
+  for(int i = 1; i <= n; ++i)
+    for(int j = 1; j <= n; ++j) {
+      scanf("%d", &g[i][j]);
+      dp1[i + j] += g[i][j];
+      dp2[i - j + n] += g[i][j];
+    }
+  
+  for(int i = 1; i <= n; ++i)
+    for(int j = 1; j <= n; ++j) {
+      long long v = dp1[i + j] + dp2[i - j + n] - g[i][j];
+      if((i + j) & 1) {
+        if(v > sol2) {
+          sol2 = v;
+          xx = i;
+          yy = j;
+        }
+      } else {
+        if(v > sol1) {
+          sol1 = v;
+          x = i;
+          y = j;
+        }
+      }
+    }
+  
+  printf("%lld\n", sol1 + sol2);
+  printf("%d %d %d %d\n", x, y, xx, yy);
+  
+  return 0;
+}

Diff for: CodeForces/9C. Hexadecimal's Numbers.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+vector<long long> all;
+void rec(long long sum, int idx) {
+  if(idx == 10) {
+    all.push_back(sum);
+    return;
+  }
+  
+  rec(sum, idx + 1);
+  rec(sum * 10, idx + 1);
+  rec(sum * 10 + 1, idx + 1);
+}
+
+int main() {
+  rec(1, 0);
+  sort(all.begin(), all.end());
+  all.resize(unique(all.begin(), all.end()) - all.begin());
+  
+  int n, res = 0;
+  scanf("%d", &n);
+  for(int i = 0; i < (int)all.size(); ++i) {
+    if(all[i] > n)
+      break;
+    ++res;
+  }
+  printf("%d\n", res);
+  
+  return 0;
+}

Diff for: CodeForces/README.md

@@ -2,6 +2,7 @@
 
 - [1A. Theatre Square](http://codeforces.com/problemset/problem/1/A)
 - [4A. Watermelon](http://codeforces.com/contest/4/problem/A)
+- [9C. Hexadecimal's Numbers](http://codeforces.com/contest/9/problem/C)
 - [12A. Super Agent](http://codeforces.com/contest/12/problem/A)
 - [12B. Correct Solution?](http://codeforces.com/contest/12/problem/B)
 - [14C. Four Segments](http://codeforces.com/contest/14/problem/C)
@@ -38,6 +39,7 @@
 - [96A. Football](http://codeforces.com/problemset/problem/96/A)
 - [96B. Lucky Numbers (easy)](http://codeforces.com/problemset/problem/96/B)
 - [110A. Nearly Lucky Number](http://codeforces.com/problemset/problem/110/A)
+- [110C. Lucky Sum of Digits](http://codeforces.com/contest/110/problem/C)
 - [112A. Petya and Strings](http://codeforces.com/contest/112/problem/A)
 - [115A. Party](http://codeforces.com/problemset/problem/115/A)
 - [116A. Tram](http://codeforces.com/problemset/problem/116/A)
@@ -52,10 +54,12 @@
 - [141A. Amusing Joke](http://codeforces.com/problemset/problem/141/A)
 - [144A. Arrival of the General](http://codeforces.com/contest/144/problem/A)
 - [151A. Soft Drinking](http://codeforces.com/problemset/problem/151/A)
+- [152C. Pocket Book](http://codeforces.com/contest/152/problem/C)
 - [158A. Next Round](http://codeforces.com/problemset/problem/158/A)
 - [158B. Taxi](http://codeforces.com/contest/158/problem/B)
 - [160A. Twins](http://codeforces.com/problemset/problem/160/A)
 - [182D. Common Divisors](http://codeforces.com/contest/182/problem/D)
+- [186C. Plant](http://codeforces.com/contest/186/problem/C)
 - [192A. Funky Numbers](http://codeforces.com/problemset/problem/192/A)
 - [192B. Walking in the Rain](http://codeforces.com/problemset/problem/192/B)
 - [200B. Drinks](http://codeforces.com/problemset/problem/200/B)
@@ -101,7 +105,9 @@
 - [368A. Sereja and Coat Rack](http://codeforces.com/problemset/problem/368/A)
 - [368B. Sereja and Suffixes](http://codeforces.com/problemset/problem/368/B)
 - [378A. Playing with Dice](http://codeforces.com/problemset/problem/378/A)
+- [382C. Arithmetic Progression](http://codeforces.com/contest/382/problem/C)
 - [385A. Bear and Raspberry](http://codeforces.com/problemset/problem/385/A)
+- [389C. Fox and Box Accumulation](http://codeforces.com/contest/389/problem/C)
 - [393A. Nineteen](http://codeforces.com/problemset/problem/393/A)
 - [394A. Counting Sticks](http://codeforces.com/problemset/problem/394/A)
 - [401C. Team](http://codeforces.com/contest/401/problem/C)
@@ -125,6 +131,7 @@
 - [456C. Boredom](http://codeforces.com/contest/456/problem/C)
 - [459A. Pashmak and Garden](http://codeforces.com/problemset/problem/459/A)
 - [462A. Appleman and Easy Task](http://codeforces.com/problemset/problem/462/A)
+- [463C. Gargari and Bishops](http://codeforces.com/contest/463/problem/C)
 - [466A. Cheap Travel](http://codeforces.com/contest/466/problem/A)
 - [466C. Number of Ways](http://codeforces.com/contest/466/problem/C)
 - [467B. Fedor and New Game](http://codeforces.com/problemset/problem/467/B)

Diff for: SPOJ/ATOMS - Atoms in the Lab.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+ 
+using namespace std;
+ 
+int t, res;
+long long n, k, m, tmp;
+ 
+int main() {
+  scanf("%d", &t);
+  while(t-- != 0) {
+    scanf("%lld %lld %lld", &n, &k, &m);
+    
+    if(n > m) {
+      puts("0");
+      continue;
+    }
+    
+    res = 0;
+    while(m >= n) {
+      m /= k;
+      ++res;
+    }
+    printf("%d\n", res - 1);
+  }
+  
+  return 0;
+} 

Diff for: SPOJ/COMDIV - Number of common divisors.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1000001;
+int t, a, b, gcd;
+vector<int> all;
+
+void divisors(int n) {
+  int sqrtn = sqrt(n);
+  for(int i = 1; i <= sqrtn; ++i) {
+    if(n % i == 0) {
+      ++all[n];
+      if(n / i != i)
+        ++all[n];
+    }
+  }
+}
+
+int main() {
+  all.resize(N);
+  scanf("%d", &t);
+  while(t-- != 0) {
+    scanf("%d %d", &a, &b);
+    gcd = __gcd(a, b);
+    if(all[gcd] == 0)
+      divisors(gcd);
+    printf("%d\n", all[gcd]);
+  }
+  
+  return 0;
+}