Add files via upload

Author: shiningflash

CATALAN_bionomial.cpp

@@ -0,0 +1,27 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef unsigned long long int ll;
+
+ll bionomialCOEFFICIENT(int n, int k) {
+    ll res = 1;
+    if (k > (n-k)) k = n-k;
+    for (int i = 0; i < k; i++) {
+        res *= (n-i);
+//        cout << res << endl;
+        res /= (i+1);
+//        cout << res << endl << endl;
+    }
+    return res;
+}
+
+ll catalan(int n) {
+    ll c = bionomialCOEFFICIENT(2*n, n);
+    return c/(n+1);
+}
+
+int main() {
+    for (int i = 0; i <= 51; i++)
+        cout << (ll) catalan(i) << endl;
+}

CATALAN_number.cpp

@@ -0,0 +1,63 @@
+// catalan number by DP
+
+#include <cstdio>
+#include <iomanip>
+#include <cstring>
+#include <cmath>
+#include <cstdlib>
+#include <cctype>
+#include <algorithm>
+#include <string>
+#include <vector>
+#include <queue>
+#include <map>
+#include <set>
+#include <sstream>
+#include <stack>
+#include <list>
+#include <iostream>
+#include <assert.h>
+
+/**Define memory set function**/
+#define mem(x,y) memset(x,y,sizeof(x))
+#define CLEAR(x) memset(x,0,sizeof(x))
+
+/**Define function and object**/
+#define pb push_back
+#define Sort(v) sort(v.begin(),v.end())
+#define _sort(s, n) sort(s, s+n)
+#define sqr(x) ((x)*(x))
+
+/**Define constant value**/
+#define le 5001
+#define ERR 1e-9
+#define pi (2*acos(0))
+#define PI 3.141592653589793
+
+/**Define input**/
+#define scanint(a) scanf("%d",&a)
+#define scanLLD(a) scanf("%lld",&a)
+
+typedef unsigned long long ll;
+
+using namespace std;
+
+/**********************End*******************/
+
+ll cnt = 0;
+
+ll catalanDP(int n) {
+    ll catalan[n+1];
+    catalan[0] = catalan[1] = 1;
+    for (int i = 2; i <= n; i++) {
+        catalan[i] = 0;
+        for (int j = 0; j < i; cnt++, j++)
+            catalan[i] += catalan[j] * catalan[i-j-1];
+    }
+    return catalan[n];
+}
+
+int main() {
+    for (int i = 0; i < 20; i++)
+        cout << catalanDP(i) << " " << cnt << endl;
+}

DequePractice.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+deque <int> dq;
+deque <int> d;
+
+inline void show(deque <int> g) {
+    deque <int> :: iterator it;
+    for (it = g.begin(); it != g.end(); it++)
+        cout << *it << " ";
+    cout << endl;
+}
+
+int main() {
+    dq.push_back(10); show(dq);
+    dq.push_front(0); show(dq);
+    dq.push_back(20); show(dq);
+    dq.push_front(5); show(dq);
+
+    cout << dq.size() << endl;
+    cout << dq.max_size() << endl;
+    cout << dq.at(2) << endl;
+    cout << dq.front() << endl;
+    cout << dq.back() << endl;
+
+    dq.pop_front(); show(dq);
+    dq.pop_back(); show(dq);
+
+    cout << endl;
+
+    d = {1, 2, 3, 4, 5}; show(d);
+    deque <int> :: iterator it = d.begin();
+    ++it;
+    d.insert(it, 10); show(d);
+    ++it; ++it;
+    d.insert(it, 50); show(d);
+}

LCS_.cpp

@@ -0,0 +1,102 @@
+/*************************************
+ * An Easy LCS LightOJ - 1110 >> DP
+ * @author Amirul Islam (shiningflash)
+ ************************************/
+
+#include <cstdio>
+#include <iomanip>
+#include <cstring>
+#include <cmath>
+#include <cstdlib>
+#include <cctype>
+#include <algorithm>
+#include <string>
+#include <vector>
+#include <queue>
+#include <map>
+#include <set>
+#include <sstream>
+#include <stack>
+#include <list>
+#include <iostream>
+#include <assert.h>
+
+#define mem(x,y) memset(x,y,sizeof(x))
+#define CLEAR(x) memset(x,0,sizeof(x))
+
+#define pb push_back
+#define Sort(v) sort(v.begin(),v.end())
+#define _sort(s, n) sort(s, s+n)
+#define sqr(x) ((x)*(x))
+
+#define le 50001
+#define ERR 1e-9
+#define pi (2*acos(0))
+#define PI 3.141592653589793
+
+#define scanint(a) scanf("%d",&a)
+#define scanLLD(a) scanf("%lld",&a)
+
+typedef unsigned long long ll;
+using namespace std;
+
+/**********************End*******************/
+
+string s1, s2;
+int cost[105][105], path[105][105], lcs[105];
+int t, l1, l2, lcs_len;
+
+inline void LCS_LENGTH() {
+    for (int i = 1; i <= l1; cost[i][0] = 0, i++);
+    for (int j = 1; j <= l2; cost[0][j] = 0, j++);
+
+    for (int i = 1; i <= l1; i++) {
+        for (int j = 1; j <= l2; j++) {
+            if (s1[i-1] == s2[j-1]) {
+                cost[i][j] = cost[i-1][j-1] + 1;
+                path[i][j] = 1;
+            }
+            else if (cost[i-1][j] >= cost[i][j-1]) {
+                cost[i][j] = cost[i-1][j];
+                path[i][j] = 2;
+            }
+            else {
+                cost[i][j] = cost[i][j-1];
+                path[i][j] = 3;
+            }
+        }
+    }
+    lcs_len = cost[l1][l2];
+}
+
+inline void LCS() {
+    int i = l1, j = l2, k = lcs_len-1;
+    while (k >= 0) {
+        if (path[i][j] == 1) {
+            lcs[k] = s1[i-1];
+            i--; j--; k--;
+        }
+        else if (path[i][j] == 2) i--;
+        else if (path[i][j] == 3) j--;
+    }
+}
+
+inline void LCS_PRINT() {
+    if (lcs_len <= 0) cout << ":(";
+    else
+        for (int i = 0; i < lcs_len; i++)
+            cout << (char) lcs[i];
+    cout << endl;
+}
+
+int main() {
+    scanint(t);
+    for (int i = 1; i <= t; i++) {
+        cin >> s1 >> s2;
+        l1 = s1.length(); l2 = s2.length();
+        LCS_LENGTH();
+        LCS();
+        cout << "Case " << i << ": ";
+        LCS_PRINT();
+    }
+}

UglyNumber.cpp

@@ -0,0 +1,75 @@
+/*************************************
+ * Ugly Numbers > UVa - 136
+ * solved by - (DP) Dynamic Programming
+ * @author Amirul Islam (shiningflash)
+ ************************************/
+
+#include <cstdio>
+#include <iomanip>
+#include <cstring>
+#include <cmath>
+#include <cstdlib>
+#include <cctype>
+#include <algorithm>
+#include <string>
+#include <vector>
+#include <queue>
+#include <map>
+#include <set>
+#include <sstream>
+#include <stack>
+#include <list>
+#include <iostream>
+#include <assert.h>
+
+/**Define memory set function**/
+#define mem(x,y) memset(x,y,sizeof(x))
+#define CLEAR(x) memset(x,0,sizeof(x))
+
+/**Define function and object**/
+#define pb push_back
+#define Sort(v) sort(v.begin(),v.end())
+#define _sort(s, n) sort(s, s+n)
+#define sqr(x) ((x)*(x))
+
+/**Define constant value**/
+#define le 5001
+#define ERR 1e-9
+#define pi (2*acos(0))
+#define PI 3.141592653589793
+
+/**Define input**/
+#define scanint(a) scanf("%d",&a)
+#define scanLLD(a) scanf("%lld",&a)
+
+typedef unsigned long ll;
+
+using namespace std;
+
+/**********************End*******************/
+
+ll min3(ll a, ll b, ll c) {
+    return min(min(a, b), c);
+}
+
+ll getUGLY(int n) {
+    ll ugly[n], nxtUGLY = 1;
+    ll i2 = 0, i3 = 0, i5 = 0;
+    ll mul2 = 2, mul3 = 3, mul5 = 5;
+    ugly[0] = 1;
+
+    for (ll i = 1; i < n; i++) {
+        nxtUGLY = min3(mul2, mul3, mul5);
+        ugly[i] = nxtUGLY;
+
+        if (nxtUGLY == mul2) i2++, mul2 = ugly[i2] * 2;
+        if (nxtUGLY == mul3) i3++, mul3 = ugly[i3] * 3;
+        if (nxtUGLY == mul5) i5++, mul5 = ugly[i5] * 5;
+    }
+    return nxtUGLY;
+}
+
+int main() {
+    cout << "The 1500'th ugly number is " << (ll) getUGLY(1500) << ".\n";
+    return 0;
+}

bionomialCOEFFICIENT.cpp

@@ -0,0 +1,67 @@
+/*************************************
+ * UVA - 369 >> bionomial co-efficient
+ * @author Amirul Islam (shiningflash)
+ ************************************/
+
+#include <cstdio>
+#include <iomanip>
+#include <cstring>
+#include <cmath>
+#include <cstdlib>
+#include <cctype>
+#include <algorithm>
+#include <string>
+#include <vector>
+#include <queue>
+#include <map>
+#include <set>
+#include <sstream>
+#include <stack>
+#include <list>
+#include <iostream>
+#include <assert.h>
+
+/**Define memory set function**/
+#define mem(x,y) memset(x,y,sizeof(x))
+#define CLEAR(x) memset(x,0,sizeof(x))
+
+/**Define function and object**/
+#define pb push_back
+#define Sort(v) sort(v.begin(),v.end())
+#define _sort(s, n) sort(s, s+n)
+#define sqr(x) ((x)*(x))
+
+/**Define constant value**/
+#define le 5001
+#define ERR 1e-9
+#define pi (2*acos(0))
+#define PI 3.141592653589793
+
+/**Define input**/
+#define scanint(a) scanf("%d",&a)
+#define scanLLD(a) scanf("%lld",&a)
+
+typedef unsigned long long ll;
+
+using namespace std;
+
+/**********************End*******************/
+
+ll bioCOEFF(int n, int k) {
+    ll res = 1;
+    if (k > n-k) k = n-k;
+    for (int i = 0; i < k; i++) {
+        res *= (n-i);
+        res /= (i+1);
+    }
+    return res;
+}
+
+int main() {
+    int n, k;
+    while (scanf("%d %d", &n, &k)) {
+        if (n == 0 && k == 0) break;
+        printf("%d things taken %d at a time is %llu exactly.\n", n, k, bioCOEFF(n, k));
+    }
+    return 0;
+}