PhoenixWright

#include <iostream>
using namespace std;
#define TOLEFT(T) ((T) == 'A' || (T) == 'C' || (T) == 'F' || (T) == 'G' || (T) == 'H' || (T) == 'I' || (T) == 'K')
#define TORIGHT(T) ((T) == 'B' || (T) == 'D' || (T) == 'F' || (T) == 'G' || (T) == 'I' || (T) == 'J' || (T) == 'K')
#define TOUP(T) ((T) == 'A' || (T) == 'B' || (T) == 'E' || (T) == 'G' || (T) == 'H' || (T) == 'J' || (T) == 'K')
#define TODOWN(T) ((T) == 'C' || (T) == 'D' || (T) == 'E' || (T) == 'H' || (T) == 'I' || (T) == 'J' || (T) == 'K')
int h, w;
char mp[60][60];
int v[60][60];
const int dh[] = {-1, 0, 1, 0};
const int dw[] = {0, 1, 0, -1};
const int ZONG = 0;
const int HENG = 1;
bool isConnect(int h1, int w1, int h2, int w2, int dir) {
    if(dir == HENG) {
        if(w1 > w2) {
            swap(h1, h2);
            swap(w1, w2);
        }
        return TORIGHT(mp[h1][w1]) && TOLEFT(mp[h2][w2]);
    } else {
        if(h1 > h2) {
            swap(h1, h2);
            swap(w1, w2);
        }
        return TODOWN(mp[h1][w1]) && TOUP(mp[h2][w2]);
    }
}
void dfs(int i, int j) {
    v[i][j] = 1;
    int th, tw;
    for(int k = 0; k < 4; ++k) {
        th = i + dh[k];
        tw = j + dw[k];
        if(th < 0 || th >= h || tw < 0 || tw >= w || v[th][tw] == 1 || !isConnect(i, j, th, tw, ((k&1)?HENG:ZONG))) continue;
        dfs(th, tw);
    }
}
int main() {
    int ans;
    while(scanf("%d%d", &h, &w)) {
        if(h < 0 || w < 0) break;
        ans = 0;
        for(int i = 0; i < h; ++i) scanf("%s", mp[i]);
        memset(v, 0, sizeof(v));
        for(int i = 0; i < h; ++i)
            for(int j = 0; j < w; ++j) if(v[i][j] == 0) {
                ++ans;
                dfs(i, j);
            }
        printf("%d\n", ans);
    }
}

#include <iostream>
using namespace std;
int a[1001][1001], h, w;
const int dh[] = {-1, 0, 1, 0};
const int dw[] = {0, 1, 0, -1};
struct Point {
    int h, w;
    int dir[4];
} st, en;
void cal(Point v, int *p) {
    Point tmp;
    for(int i = 0; i < 4; ++i) {
        tmp = v;
        do {
            tmp.h += dh[i];
            tmp.w += dw[i];
        } while(tmp.h >= 0 && tmp.h < h && tmp.w >= 0 && tmp.w < w && a[tmp.h][tmp.w] == 0);
        tmp.h -= dh[i];
        tmp.w -= dw[i];
        p[i] = ((i&1) ? tmp.w : tmp.h);
    }
}
void cal1(Point v, int *p, int i) {
    Point tmp;
    tmp = v;
    do {
        tmp.h += dh[i];
        tmp.w += dw[i];
    } while(tmp.h >= 0 && tmp.h < h && tmp.w >= 0 && tmp.w < w && a[tmp.h][tmp.w] == 0);
    tmp.h -= dh[i];
    tmp.w -= dw[i];
    p[i] = ((i&1) ? tmp.w : tmp.h);
}
bool solve() {
    if(a[st.h][st.w] == 0 || a[st.h][st.w] != a[en.h][en.w]) return false;
    int mmin, mmax;
    cal(st, st.dir);
    cal(en, en.dir);
    Point a1 = st, a2 = en;
    if(a1.w > a2.w) swap(a1, a2);
    mmin = max(a1.dir[0], a2.dir[0]);
    mmax = min(a1.dir[2], a2.dir[2]);
    Point tmp;
    tmp.w = a1.w;
    for(int i = mmin; i <= mmax; ++i) {
        tmp.h = i;
        cal1(tmp, tmp.dir, 1);
        //这里必须加1,理由看开头注释
        if(tmp.dir[1] + 1 >= a2.w) return true;
    }
    if(a1.h > a2.h) swap(a1, a2);
    mmin = max(a1.dir[3], a2.dir[3]);
    mmax = min(a1.dir[1], a2.dir[1]);
    tmp.h = a1.h;
    for(int i = mmin; i <= mmax; ++i) {
        tmp.w = i;
        cal1(tmp, tmp.dir, 2);
        //这里必须加1,理由看开头注释
        if(tmp.dir[2] + 1 >= a2.h) return true;
    }
    return false;
}
int main() {
    int p;
    while(scanf("%d%d", &h, &w)) {
        if(h == 0 && w == 0) break;
        for(int i = 0; i < h; ++i)
            for(int j = 0; j < w; ++j)
                scanf("%d", &a[i][j]);
        scanf("%d", &p);
        while(p--) {
            scanf("%d%d%d%d", &st.h, &st.w, &en.h, &en.w);
            st.h -= 1, st.w -= 1, en.h -= 1, en.w -= 1;
            solve() ? puts("YES") : puts("NO");
        }
    }
    return 0;
}

import java.io.*;
import java.util.*;
import java.math.*;
 
public class Main {
 
    private int[] a;
    private int top;
 
    private void init() {
        a = new int[1000001];
        a[0] = 2;
        top = 1;
        for (int i = 3; i <= 1000000; i += 2) {
            if (a[i] == 0) {
                a[top++] = i;
                for (int j = i + i; j <= 1000000; j += i) {
                    a[j] = 1;
                }
            }
        }
    }
 
    private void creat() {
        init();
        Scanner cin = new Scanner(new BufferedInputStream(System.in));
        next:
        while (true) {
            String b1 = cin.next();
            int b2 = cin.nextInt();
            if (b1.compareTo("0") == 0 && b2 == 0) {
                break;
            }
            BigInteger a1 = new BigInteger(b1);
            BigInteger a2 = new BigInteger("0");
            for (int i = 0; i < top && a[i] < b2; i++) {
                if (a1.mod(a2.valueOf(a[i])).compareTo(BigInteger.ZERO) == 0) {
                    System.out.println("BAD " + new Integer(a[i]).toString());
                    continue next;
                }
            }
            System.out.println("GOOD");
        }
    }
 
    public static void main(String[] args) {
        Main e = new Main();
        e.creat();
 
    }
}

#include <iostream>
using namespace std;
int C(int n, int r) {
	int i, j, s = 1;
	if(n - r > r) r = n - r;
	for(i = 0, j = 1; i < r; i++)
		for(s *= n - i; j <= r && !(s % j); j++) s /= j;
	return s;
}
int main() {
	char s[6];
	int l, i, j, res;
	while(scanf("%s", s) != EOF) {
		l = strlen(s);
		res = 0;
		for(i = 0; i < l - 1; i++)
			for(j = i + 1; j < l; j++)
				if(s[i] >= s[j]) {
					puts("0");
					goto next;
				}
		for(i = 1; i <= l; i++) res += C(26, i);
		for(i = 0; i < l; i++) res -= C(122-s[i], l-i);
		printf("%d\n", res);
next:;
	}
	return 0;
}

#include <iostream>
using namespace std;
const int M = 9901;
const int N = 7073;
typedef long long ll;
int p[908] = {2}, l = 1, fac[35][2], top, ans;
bool prime[N+1] = {1, 1};
void init() {
	int i, j;
	for(i = 3; i <= N; i += 2) {
		if(!prime[i]) p[l++] = i;
		for(j = 1; j <= l && i * p[j] <= N; j++) {
			prime[i*p[j]] = 1 ;
			if(!(i%p[j])) break;
		}
	}
}
void split(int n) {
	int i;
	top = 0;
	for(i = 0; i < l; i++)
		if(!(n%p[i])) {
			fac[top][0] = 0, fac[top][1] = p[i];
			while(!(n%p[i])) fac[top][0]++, n /= p[i];
			top++;
			if(n == 1 || n < N && !prime[n]) break;
		}
	if(n != 1) fac[top][0] = 1, fac[top++][1] = n;
}
int Pow(int a, ll b) {
	int t = 1;
	while(b) {
		if(b & 1) t = t * a % M;
		a = a * a % M;
		b >>= 1;
	}
	return t;
}
int ex_gcd(int a, int b, int &x, int &y) {
	if(!b) {x = 1; y = 0; return a;}
	int ans = ex_gcd(b, a%b, x, y), t = x;
	x = y;
	y = t - (a / b) * y;
	return ans;
}
int main() {
	int a, b, res, i, res1, x, y, tmp;
	init();
	while(~scanf("%d%d", &a, &b)) {
		split(a);
		res = res1 = 1;
		for(i = 0; i < top; i++) {
			tmp = Pow(fac[i][1] % M, (ll)fac[i][0] * b + 1);
			if(tmp == 1) res = (res * ((ll)fac[i][0] * b + 1)) % M;
			else {
				res *= (tmp - 1 + M) % M;
				if(res >= M) res %= M;
				res1 = res1 * (fac[i][1] - 1);
				if(res1 >= M) res1 %= M;
			}
		}
		ex_gcd(res1, M, x, y);
		printf("%d\n", (res * ((x + M) % M)) % M);
	}
	return 0;
}

#include <iostream>
using namespace std;
typedef long long ll;
ll ex_gcd(ll a, ll b, ll &x, ll &y) {
	if(!b) {x = 1; y = 0; return a;}
	ll ans = ex_gcd(b, a%b, x, y), t = x;
	x = y;
	y = t - (a / b) * y;
	return ans;
}
int main() {
	ll a, b, c, x, y, t, s;
	int k, i;
	while(scanf("%lld%lld%lld%d", &a, &b, &c, &k), a || b || c || k) {
		s = (ll)1 << k;
		t = ex_gcd(c, s, x, y);
		b -= a;
		if(b % t) {
			puts("FOREVER");
			continue;
		}
		printf("%lld\n", (x * b / t % (s/t) + (s / t)) % (s / t));
	}
	return 0;
}

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const int M = 99;
char a[500002];
int Pow(int a, int b, int c) {
	int t = 1;
	while(b) {
		if(b & 1) t = t * a % c;
		a = a * a % c;
		b >>= 1;
	}
	return t;
}
int main() {
	int t, i, l, r, m, len, res, len1;
	scanf("%d", &t);
	while(t--) {
		scanf("%s", a);
		for(i = len = res = 0; a[i]; i++, len++) res = (res * 10 + a[i] - '0') % M;
		if(len == 1) {
			printf("%d\n", res == 1 ? 1 : (res == 4 ? 2 : -1));
			continue;
		}
		l = 3, r = 100000;
		while(l <= r) {
			m = (l + r) >> 1;
			len1 = (int)(m * log10((double)m)) + 1;
			if(len1 == len) break;
			if(len1 < len) l = m + 1;
			else r = m - 1;
		}
		if(Pow(m%M, m, M) == res) printf("%d\n", m);
		else puts("-1");
	}
	return 0;
}