~飞呀，飞~

求不大于n（1#include #include const int maxn = 10010; int n, cnt; int c[maxn], ys[maxn]; bool p[maxn]; int prime[maxn]; void f() { // get primes memset(p, true, sizeof(p)); for (int i = 2;

问题：求n位数中平方数以“987654321”结束的数的个数。 #include int main() { int n; while (scanf("%d", &n) != EOF) { if (n < 9) printf("0\n"); else if (n == 9) printf("

105. Div 3 time limit per test: 0.5 sec.  memory limit per test: 4096 KB There is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Given first N elements of that sequence. You must determine

126. Boxes time limit per test: 0.5 sec.  memory limit per test: 4096 KB There are two boxes. There are A balls in the first box, and B balls in the second box (0 < A + B < 2147483648). It is p