31-40oj

#include<iostream>
#include<cmath>
#include<iomanip>
#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,a,b;
    while(cin>>n) {
	for(int i = 0; i < n; i++) {
	b = 0;
	cin>>a;
    for (int i = 2;i<a;i ++)
    {
    if (a%i==0) {
      b = 1;
      break;
    }
    else continue;
    }
    if (b == 0)
    cout<<"yes"<<endl;
    else
    if (b == 1)
    cout<<"no"<<endl;
	}
	}
    	
    
	return 0;
}

#include<iostream>
#include<cmath>
#include<iomanip>
#include<bits/stdc++.h>
using namespace std;

int main()
{
    double t, sum = 1.0, temp = 1.0;
    int n = 1;
    cin>>t;
    while(fabs(temp) >= t) {
    	++n;
    	sum += temp;
    	temp *= 1.0/n;
	}
	if(fabs(t) > 1) 
	printf("%.6f %d",0.0,0);
	else
	printf("%.6f %d",sum,n);
	return 0;
}

#include<iostream>
using namespace std;

int main()
{
	int n,result ;
	while(cin>>n ) {
		result = 0;
		while (n!= 0) {
		result += (n % 10);
		n = n / 10;
		}
		cout<<result<<endl;
	}
	return 0;
   
}

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	int n,result ;
	int m[50] = {1,1,2,3,5,7,10};
	while(cin>>n ) {
		for(int i = 7; i < 50; i++) {
			m[i] = m[i - 2] + m[i - 3] + m[i - 4];
		}
		cout<<m[n - 1]<<endl;
	}
	
   
}

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
 
int main()
{
	int a[10] = {8899,9799,17899,18799,19699,26899,27799,28699,29599,35899};
	int n;
	while(cin>>n) {
		cout<<a[n-1]<<endl;
	}
	return 0;
}

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	int a, b;
	while (cin>>a>>b && (a || b)){
		int c[100]; int i;
		int t = 0;
		for (i = 0; i <= 99; i++) {
			if ((a * 100 + i) % b == 0) {
				c[t] = i;
				t++;
			}
		}
		for (i = 0; i < t - 1; i++) {
			printf("%02d ", c[i]);
		}
		printf("%02d\n", c[t - 1]);
	}
}

#include<bits/stdc++.h>
using namespace std;
 
int main(void) 
{
	int n, d[12] = {0,31,28,31,30,31,30,31,31,30,31,30};
	while(cin>>n) {
		int num[8] = {0}, sum = 13;
		for (int i = 1900; i < 1900 + n; ++i) {
			if ((i % 4 == 0 && i % 100 != 0) || (i % 400 == 0)) {
				d[2] = 29;
			} else {
				d[2] = 28;
			} for (int j = 0; j < 12; ++j) {
				sum += d[j]; num[sum%7]++;
			}
			sum = (sum + 18) % 7 + 13;
		}
		cout<<num[6]<<' '<<num[0]<<' ';
		for(int i = 1; i < 5; ++i) 
		cout<<num[i]<<' ';
		cout<<num[5]<<endl;
	}
}

#include<bits/stdc++.h>
using namespace std;
 
int main(void) 
{
	int l, n;
	while(cin>>l>>n) {
		int a[10000] = {0};
		while(n--) {
			int x,y;
			cin>>x>>y;
			for (int i = x; i <= y; i++) {
				a[i]++;
			}
		}
		int count = 0;
		for (int j = 0; j <= l; j++) {
			if(a[j] == 0) {
				count++;
			}
		}
		cout<<count<<endl;
	}
}

#include<bits/stdc++.h>
using namespace std;
 
int main(void) 
{
	int n, x;
	while(cin>>n>>x) {
		int a[100];
		int i, k = 1;
		for(i = 1; i <= n; i++)
			a[i] = i;
		for (i = n; i >= 1; i--) {
			k = (k + x - 1) % i; //难以想到
			if(k == 0) k =i;
			if (i > 1) cout<<a[k]<<" ";
			else cout<<a[k]<<endl;
			for (int j = k; j < i; j++)
			a[j] = a[j + 1];
			
		}
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
 
int main(void) 
{
	int n, x, t;
	int a[105], b[105];
	while(cin>>n>>x) {
		for(int i = 0; i < n; i++) {
			cin>>a[i];
			b[i] = 0;
		}
		for (int i = 0; i < n; i++) {
			for (int j = i; j < i + x; j++) {
				if(j >= n) {
					b[i] += a[j % n];
				} else b[i] += a[j];
			}
		}
			for(int i = 0; i < n; i++) {
				for (int j = 1; j < n - i; j++) {
					if (b[j] < b[j - 1]) {
						t = b[j];
						b[j] = b[j - 1];
						b[j - 1] = t;
					}
				}
			}
			cout<<"Max="<<b[n - 1]<<endl;
			cout<<"Min="<<b[0]<<endl<<endl;
		}
	return 0;
}