Add paste with solutions for spoj

Author: Augusto Calaca

spoj/adabehive.cpp

@@ -0,0 +1,65 @@
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+#include <vector>
+#include <map>
+
+#define MAX 100010
+#define MAX2 2010
+#define f first
+#define s second
+#define pb push_back
+#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
+using namespace std;
+
+typedef long long ll;
+typedef unsigned long long ull;
+
+int bit[MAX2][MAX2];
+int in[MAX2][MAX2];
+
+void update(int l, int r, int n, int m, int val) {
+  for(; l <= n; l += l & -l)
+    for(; r <= m; r += r & -r)
+      bit[l][r] += val;
+}
+
+ll query(int l, int r) {
+  ll sum = 0;
+    for(int j = r; j > 0; j -= j & -j)
+      sum += bit[l][j];
+
+  return sum;
+}
+
+int main() {
+  FAST;
+
+  int n, m, q;
+  cin >> n >> m >> q;
+  for(int i = 0; i < n; i++) {
+    int j = 0;
+    for(; j < m; j++) {
+      cin >> in[i][j];
+      update(i + 1, j + 1, n, m, in[i][j]);
+    }
+  }
+
+  int k, l, r, v, l1, l2, r1, r2;
+  while(q--) {
+    cin >> k;
+    if(k == 1) {
+      cin >> l >> r >> v;
+      update(l, r, n, m, v);
+    }
+    else {
+      cin >> l1 >> r1 >> l2 >> r2;
+      ll ans = 0;
+      for(; l1 <= l2; l1++)
+        ans += query(l1, r2) - query(l1, r1 - 1);
+      cout << ans << "\n";
+    }
+  }
+
+  return 0;
+}

spoj/bsearch1.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+#include <vector>
+#include <map>
+
+#define f first
+#define s second
+#define pb push_back
+#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
+using namespace std;
+
+typedef long long ll;
+typedef unsigned long long ull;
+
+int main() {
+  FAST;
+  int n, q, f, v[100010];
+  cin >> n >> q;
+  for(int i = 0; i < n; i++) cin >> v[i];
+  while(q--) {
+    cin >> f;
+    if(binary_search(v, v + n, f))
+      cout << lower_bound(v, v + n, f) - v << "\n";
+    else
+      cout << "-1\n";
+  }
+  return 0;
+}

spoj/comdiv.cpp

@@ -0,0 +1,69 @@
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+#include <vector>
+#include <set>
+
+#define f first
+#define s second
+#define pb push_back
+#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
+using namespace std;
+
+typedef long long ll;
+typedef unsigned long long ull;
+
+const int MAX = 1e6 + 10;
+vector<int> primes;
+vector<bool> marked(MAX, true);
+
+void sieve() {
+  for(int i = 2; i * i <= MAX; i++)
+    for(int j = i * i; j <= MAX; j += i)
+      if(marked[j])
+        marked[j] = false;
+
+  for(int i = 2; i <= MAX; i++)
+    if(marked[i])
+      primes.pb(i);
+}
+
+int gcd(int a, int b) {
+  while(b) {
+    a %= b;
+    a ^= b;
+    b ^= a;
+    a ^= b;
+  }
+
+  return a;
+}
+
+ll ndiv(int n) {
+  ll rep = 1;
+  for(int i = 0; primes[i] * primes[i] <= n; i++) {
+    int c = 0;
+    for(; n % primes[i] == 0; n /= primes[i])
+      c++;
+    rep *= (c + 1);
+  }
+
+  if(n > 1) rep *= 2;
+  return rep;
+}
+
+int main() {
+  FAST;
+
+  sieve();
+
+  int t, a, b, g;
+  cin >> t;
+  while(t--) {
+    cin >> a >> b;
+    g = gcd(a, b);
+    cout << ndiv(g) << "\n";
+  }
+
+  return 0;
+}

spoj/dcepc12g.cpp

@@ -0,0 +1,77 @@
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+#include <vector>
+#include <map>
+
+#define M 1000000007
+#define MAX 10000010
+#define pb push_back
+#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
+using namespace std;
+
+typedef long long ll;
+typedef unsigned long long ull;
+
+vector<int> phi(MAX, 0);
+
+void precomp() {
+  for(int i = 1; i < MAX; i++) phi[i] = i;
+  for(int i = 2; i < MAX; i++)
+    if(phi[i] == i) {
+      phi[i] = i - 1;
+      for(int j = (i << 1); j < MAX; j += i)
+        phi[j] = (phi[j] / i) * (i - 1);
+    }
+}
+
+vector<int> pqtd;
+vector<bool> marked(MAX, true);
+void sieve() {
+  for(int i = 2; i * i < MAX; i++)
+    for(int j = i * i; j < MAX; j += i)
+      if(marked[j])
+        marked[j] = false;
+
+  pqtd.pb(0);
+  pqtd.pb(0);
+  pqtd.pb(1);
+  for(int i = 3; i < MAX; i++) {
+    if(marked[i])
+      pqtd.pb(pqtd.back() + 1);
+    else
+      pqtd.pb(pqtd.back());
+  }
+}
+
+int fexp(int b, int e) {
+  int ans = 1;
+  for(; e; e >>= 1) {
+    if(e & 1) ans = (ans % M * b % M) % M;
+    b = (b % M * b % M) % M;
+  }
+
+  return ans;
+}
+
+int fat(int n) {
+  int f = 1;
+  for(int i = 1; i <= n; i++)
+    f = (f % M * i % M) % M;
+  return f;
+}
+
+int main() {
+  FAST;
+
+  precomp();
+  sieve();
+
+  int t, n;
+  cin >> t;
+  while(t--) {
+    cin >> n;
+    cout << fexp(phi[n], fat(pqtd[n] - phi[n])) << "\n";
+  }
+  return 0;
+}

spoj/dcepcao3.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+#include <vector>
+#include <map>
+
+#define MAX 10010
+#define sq(x) (x) * (x)
+#define f first
+#define s second
+#define pb push_back
+#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
+using namespace std;
+
+typedef long long ll;
+typedef unsigned long long ull;
+
+ll phi[MAX];
+void precomp() {
+  for(int i = 1; i < MAX; i++) phi[i] = i;
+  for(int i = 2; i < MAX; i++)
+    if(phi[i] == i) {
+      phi[i] = i - 1;
+      for(int j = (i << 1); j < MAX; j += i)
+        phi[j] = (phi[j] / i) * (i - 1);
+    }
+
+  for(int i = 2; i < MAX; i++)
+    phi[i] += phi[i - 1];
+}
+
+int main() {
+  FAST;
+
+  precomp();
+  int t, n;
+  cin >> t;
+  while(t--) {
+    cin >> n;
+    cout << sq(phi[n]) << "\n";
+  }
+  return 0;
+}