hdoj2008/hdoj2009/hdoj2010/hdoj2011/hdoj2012

//hdoj2008
#include<stdio.h>
int main() {
	int n, f, l, z; 
	double m;
	while(scanf("%d", &n) && n) {
		f = l = z = 0;
		for(int i = 0; i < n; i++) {
			scanf("%lf", &m);
			if(m > 0) z++;
			else if(m < 0) f++;
			else l++;
		}
		printf("%d %d %d\n", f, l, z); 
	}
	return 0; 
}

//hdoj2009
#include<stdio.h>
#include<math.h>
int main() {
	double n, m;
	while(scanf("%lf%lf", &n, &m)!=EOF) {
		double ans = n;
		double tmp = n;
		for(int i = 1; i <= m-1; i++) {
			tmp = sqrt(tmp);
			ans += tmp;
		}
		printf("%.2lf\n", ans);
	}
	return 0; 
}

//hdoj2010
#include<stdio.h>
int main() {
	int m, n, a, b, c;
	while(scanf("%d%d", &m, &n)!=EOF) {
		int cnt = 0;
		for(int num = m; num <= n; num++) {
			a = num/100;
			b = num/10%10;
			c = num%10;  //刚开始这里居然写成了num%100;  真是有够脑残的 取余的时候1后面多少个0就是取0的个数的位数的余数 
			if(a*a*a + b*b*b + c*c*c == num) {
				printf(cnt > 0 ? " %d" : "%d", num);
				cnt++;
			}
		}
		if(cnt == 0) printf("no");
		printf("\n");
	}
	return 0; 
}

//hdoj2011前缀和 //笨办法
#include<stdio.h>
double x[1005];
void pre() {
	x[0] = 0;
	for(int i = 1; i <= 1000; i++) {
		if(i&1) x[i] = x[i-1] + 1.0/i;
		else x[i] = x[i-1] - 1.0/i;
	}
}

int main() {
	int n, t;
	pre();
	while(scanf("%d", &n)!=EOF) {
		for(int i = 0; i < n; i++) {
			scanf("%d", &t);
			printf("%.2lf\n", x[t]); 
		}
	} 
	return 0;
} 

//hdoj2012
#include<iostream>
#include<math.h>
int main() {
	int x, y;
	while(scanf("%d%d", &x,&y)!=EOF && (x || y)) {
		int flag = 1;
		for(int i = x; i <= y; i++) {
			int num = i*i+i+41; 
			int m = (int)sqrt(num+0.5);
			for(int j = 2; j <= m; j++) if(num%j==0) {
				flag = 0; break;
			}
			if(!flag) break;
		}
		if(flag) printf("OK\n");
		else printf("Sorry\n");
	}
	return 0;
}