Add few spoj problem solutions

Author: shahidul2k9

spoj/1. Life, the Universe, and Everything.cpp

@@ -0,0 +1,21 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <map>
+#include <algorithm>
+#include <vector>
+#include <climits>
+#include <utility>
+#include <cmath>
+using namespace std;
+int main(){
+    int x;
+    bool ok = true;
+    while(scanf("%d", &x) == 1){
+        if(ok){
+            if(x == 42) ok = false;
+            else printf("%d\n", x);
+        }
+    }
+return 0;
+}

spoj/16487. Update the array !.cpp

@@ -0,0 +1,62 @@
+#include <cstdio>
+#include <cstring>
+#include <iostream>
+using namespace std;
+typedef long long int  Type;
+#define MAX_ELEMENTS 100000
+#define step(x) ((x)& (-x))
+
+//Range Update Point Query BIT
+struct Bit{
+    int N;
+    Type ft[MAX_ELEMENTS+1];
+    Bit(int n):N(n){memset(ft, 0, sizeof(Type)*(N+1));}
+    void add(int idx, Type v){
+        while(idx <= N){
+            ft[idx] += v;
+            idx += step(idx);
+        }
+    }
+    void init(int n){
+        N = n;
+        memset(ft, 0, sizeof(Type)*(N+1));
+    }
+    //Returns value at index[idx]
+    Type query(int idx){
+        Type s = 0;
+        while(idx > 0){
+            s += ft[idx];
+            idx -= step(idx);
+        }
+        return s;
+    }
+    //Add value v in range [a...b]
+    void update(int a, int b, Type v){
+        add(a, v);
+        add(b+1, -v);
+    }
+
+};
+int main(){
+    //freopen("input.txt", "r", stdin);
+    Bit bit = Bit(MAX_ELEMENTS);
+    int test, u, n, q, a, b, v;
+    scanf("%d", &test);
+    while( test-- ){
+        scanf("%d %d", &n, &u);
+        bit.init(n);
+        while(u--){
+            scanf("%d %d %d", &a, &b, &v);
+            a++;b++;
+            if( b < a) swap(a, b);
+            bit.update(a, b, v);
+        }
+        scanf("%d", &q);
+        while( q-- ){
+            scanf("%d", &a);
+            a++;
+            printf("%lld\n", bit.query(a));
+        }
+    }
+    return 0;
+}

spoj/1684. Frequent values.cpp

@@ -0,0 +1,89 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <map>
+#include <algorithm>
+#include <vector>
+#include <climits>
+#include <utility>
+#include <cmath>
+using namespace std;
+
+
+#define MAX  100000
+const int  MAX_SEG  = 262144+1;
+int A[MAX + 1], S[MAX + 2], lo[MAX + 1 ], hi[MAX + 1];
+int  M[MAX_SEG];
+
+int N, Q;
+
+int built(int node, int b, int e){
+    if(b == e) return M[node] = A[b];
+    int mid = (b+e)/2;
+    int left = node << 1;
+    int right = left + 1;
+
+    M[left] = built( left,  b,  mid );
+    M[right] = built( right , mid + 1, e );
+
+    return M[node] = max(M[left], M[right]);
+
+
+}
+int query(int node, int b, int e, int i, int j){
+    if(b >= i && e <= j) return M[node];
+    if(b > j || e < i) return -1;
+
+    int left = query(2*node, b, (b + e)/2, i, j);
+    int right = query(2*node+1, (b + e)/2 + 1, e, i, j);
+    if(left == -1) return right;
+    if(right == -1 )return left;
+    return max(left, right);
+
+}
+int main(){
+    //freopen("input.txt", "r", stdin);
+    int st, en;
+    while(scanf("%d", &N) == 1&& N){
+        scanf("%d", &Q);
+        for(int i = 1; i <= N; i++)
+            scanf("%d", &S[i]);
+
+        {
+            st = 1;
+            S[N+1] = INT_MIN;
+        }
+        for(int i = 1; i <= N + 1; i++){
+
+            if(S[i] != S[i+1]){
+                int width = i - st + 1;
+                for(int j = st; j <= i; j++){
+                    A[j] = width;
+                    lo[j] = st;
+                    hi[j] = i;
+                }
+                st = i + 1;
+            }
+        }
+
+
+        int i, j, ans;
+        built(1, 1, N);
+        while(Q--){
+            scanf("%d %d", &st, &en);
+            ans = 0;
+            i = hi[st] + 1;
+            j = lo[en] - 1;
+
+            if(hi[st] <= en) ans = max(hi[st] - st +1, ans);
+            else ans = max(ans, en - st + 1);
+
+            if(lo[en] >= st) ans = max(en - lo[en] + 1, ans);
+            else ans = max(ans, en - st + 1);
+
+            if(i < j) ans = max(query(1, 1, N, i, j), ans);
+            printf("%d\n", ans);
+        }
+    }
+    return 0;
+}

spoj/2. Prime Generator.cpp

@@ -0,0 +1,63 @@
+#include <algorithm>
+#include <bitset>
+#include <climits>
+#include <cstdio>
+#include <cstdlib>
+#include <cmath>
+#include <iostream>
+#include <list>
+#include <map>
+#include <numeric>
+#include <queue>
+#include <set>
+#include <sstream>
+#include <stack>
+#include <string>
+#include <string.h>
+#include <vector>
+
+using namespace std;
+const long long int SZ = 31630;
+bitset<SZ + 1> sieve;
+bitset<100000+10> ans;
+vector < int > pl;
+void sieveGen(){
+    pl.push_back(2);
+    for(int  i = 3; i <= SZ; i +=2 ){
+        if( !sieve.test(i) ){
+            pl.push_back(i);
+            for(int  k = i + i; k <= SZ; k += i )
+                sieve.set(k);
+        }
+    //printf("%lld\n", i);
+    }
+}
+int main(){
+    #ifndef ONLINE_JUDGE
+    //freopen("input.txt", "r", stdin);
+    #endif
+    sieveGen();
+    int test, up;
+    long long int m, n, x;
+    scanf("%d", &test);
+    while( test-- ){
+        scanf("%lld %lld", &m, &n);
+        up = upper_bound(pl.begin(), pl.end(), sqrt(n)) - pl.begin();
+        if(up == pl.size() ) up--;
+        ans.set();
+        for(int k = 0; k <= up; k++ ){
+            x = (m / pl[k])*pl[k];
+            if(x <= pl[k]) x = pl[k] + pl[k];
+            for(x; x <=n ; x += pl[k] ){
+                if(x - m < 0)continue;
+                ans.reset(x - m);
+            }
+        }
+        if( m == 1)ans.reset(0);
+        for(int k = 0; k <= n - m; k++ ){
+            if(ans.test(k))printf("%lld\n", k+m);
+        }
+        if(test)puts("");
+    }
+	return 0;
+}

spoj/24. Small factorials.java

@@ -0,0 +1,22 @@
+import java.util.Scanner;
+import java.math.BigInteger;
+public class Main{
+ public static void main(String[] args) {
+     Scanner sc = new Scanner(System.in);
+     int n,test,cs=1;
+     test = sc.nextInt();
+	 while(test>=cs){
+		 n = sc.nextInt();
+
+     BigInteger factorial = BigInteger.ONE;
+
+     for (int i=1; i<=n; i++) {
+         factorial = factorial.multiply(BigInteger.valueOf(i));
+     }
+     System.out.println(factorial);
+     cs=cs+1;
+	 }
+
+
+ }
+}

spoj/243. Stable Marriage Problem.cpp

@@ -0,0 +1,77 @@
+#include <cstdio>
+#include <string.h>
+#include <cmath>
+#include <queue>
+#include <iostream>
+#include <algorithm>
+#include <climits>
+using namespace std;
+#define N 503
+int bp[N][N];
+int gp[N][N];
+int b_s[N];
+int g_s[N];
+bool engaged[N];
+int n;
+int getRank(int boy, int girl){
+    for(int i=0;i<n;i++)if(gp[girl][i]==boy)return i;
+}
+inline void engage(int boy, int girl){
+    engaged[boy] = true;
+    g_s[girl] = getRank(boy,girl);
+}
+
+int main(){
+
+   //freopen("input.txt","r",stdin);
+    int test,cs=1;
+    int x;
+    scanf("%d",&test);
+    while(test--){
+        scanf("%d",&n);
+
+        for(int i=0;i<n;i++){
+            scanf("%d",&x);
+            x--;
+            for(int j=0;j<n;j++)
+                {scanf("%d",&gp[x][j]);gp[x][j]--;}
+        }
+
+        for(int i=0;i<n;i++){
+            scanf("%d",&x);
+            x--;
+            for(int j=0;j<n;j++)
+                {scanf("%d",&bp[x][j]);bp[x][j]--;}
+        }
+
+
+
+        memset(engaged,0,sizeof(engaged));
+        memset(b_s,-1,sizeof(b_s));
+        memset(g_s,-1,sizeof(g_s));
+
+        for(int boy = 0;boy<n;boy++){
+            if(engaged[boy])continue;
+            int girl = bp[boy][++b_s[boy]];
+            if(g_s[girl]==-1)
+                engage(boy,girl);
+            else{
+                int curr_boy_rank = getRank(boy,girl);
+                int prev_boy_rank = getRank(gp[girl][g_s[girl]],girl);
+                if(curr_boy_rank<prev_boy_rank){
+                    int dumped_boy = gp[girl][g_s[girl]];
+                    engaged[dumped_boy] = false;
+                    engage(boy,girl);
+                    boy = dumped_boy;
+                    boy--;
+                    continue;
+
+                }
+                else {boy--;continue;}
+            }
+
+        }
+        //printf("Case %d: ",cs++);
+        for(int i=0;i<n;i++)printf("%d %d\n",i+1,bp[i][b_s[i]]+1);
+    }
+}

spoj/32. A Needle in the Haystack.cpp

@@ -0,0 +1,54 @@
+#include <cstdio>
+#include <string>
+#include <string.h>
+using namespace std;
+int M, N;
+char pat[1000000+10],txt[10000000+10];
+int lps[1000000+10];
+void builtFA(){
+    int i = 1;
+    int len = 0;
+    lps[0]  = len = 0;
+    while( i < M){
+        if( pat[i] == pat[len]){
+            len++;
+            lps[i] = len;
+            i++;
+        }
+        else if(len == 0){
+            lps[i] = 0;
+            i++;
+        }
+        else{
+            len = lps[len-1];
+        }
+    }
+}
+void KMP(){
+    int k,i;
+    for( k = 0, i = 0; i < N; i++ ){
+        while( k && txt[i] != pat[k] )
+            k = lps[k-1];
+        if(txt[i] == pat[k]) k++;
+        if(k == M){
+            printf("%d\n", i - M + 1);
+            k = lps[M-1];
+        }
+    }
+}
+int main(){
+    bool old = false;
+    #ifndef ONLINE_JUDGE
+    freopen("input.txt", "r", stdin);
+    #endif
+    while(scanf("%d", &M) == 1){
+        if(old)puts("");
+        scanf("%s %s", pat, txt);
+        N = strlen(txt);
+        builtFA();
+        KMP();
+        old = true;
+    }
+
+	return 0;
+}