东华考研复试41-50oj

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

int f(int i);
int main(){
	int n;
	while(cin>>n){
		getchar();
		while(n--){
			int i; 
			int number[9];
			for(i=0;i<9;i++)
			cin>>number[i];
			int j;
			int sum=0;
			for(j=0;j<9;j++){
			int other1=0;
			int other2=0;
				int s[9];
				for(int temp=0;temp<9;temp++){
					s[temp]=number[(temp+j)%9];
				}
				for(i=0;i<9;i++)
					other1+=s[i]*f(8-i);
				for(i=8;i>=0;i--)
					other2+=s[i]*f(i);
				int juz=abs(other1-other2);
				if(juz%396==0)
					sum++;
			}
		cout<<sum<<endl;
		}	
	}
	return 0;
}
int f(int i){
	int s=1;
	int j;
	for(j=1;j<=i;j++)
		s*=10;
	return s;
}

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

int f(int i);
int main(){
	int n, t;
	while (cin>>n) {
		if (n == 1) {
			cout<<"1"<<endl;
		} else if (n == 2) {
			cout<<"5"<<endl;
		} else if (n == 3) {
			cout<<"12"<<endl;
		} else {
			t = 12;
			for (int i = 4; i <= n; i++) {
				t += (i - 3) * 3 + 7 ;
			}
			cout<<t<<endl;
		}
		
	}
	return 0;
}

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

int main() {
	int n, i, a[201], b[109],index, max;
	while(cin>>n) {
		for (int i = 1;i <= 109; i++) {
			b[i] = 0;
		}
		for (i = 1; i <= n; i++) {
			cin>>a[i];
			b[a[i]]++;
		}
		index = 0, max = 0;
		for (i = 1; i < 110; i++) {
			if(b[i] > max) {
				max = b[i];
				index = i;
			}
		}cout<<index<<endl;
	}
}

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

int a, b, c, d, e, f;
int lista[101], listb[101], listc[101];
int fun();


int main() {
    
    while(cin >> a >> b >> c) {
        cin >> d >> e >> f;
        fun();
        
        int n = 0;
        
        for (int i = 0; i < 101; i++) {
            for (int j = i; j < 101; j++) {
                if (listc[i] == listb[j]) {
                    for (int l = j; l < 101; l++) {
                        if (listb[j] == lista[l]) {
                            cout << lista[l] << endl;
                            n = lista[l];
                            break;
                        }
                    }
                }
                if (n != 0) {
                    break;
                }
            }
            if (n != 0) {
                break;
            }
        }
    }
    return 0;

}

int fun() {
	
	for (int i = 0; i < 101; i++) {
            lista[i] = (i * 24 + a) * d;
            listb[i] = (i * 24 + b) * e;
            listc[i] = (i * 24 + c) * f;
        }
}

#include<bits/stdc++.h>
using namespace std;
int fun();
int main(){
	fun();
    return 0;
}
int fun() {
	int a,b=0,c,d=0,a1,alist[50],an;
    while(cin>>a) {
        if(a==0){
            break;
        }
        
        int n1 = 0;
        while(true) {
            
            for (a1 = a,an = 0,b = 0;a1 > 0;an++) {
            	alist[an] = a1 % 10;
                a1 /= 10;
			}
            int j = 0;
            c = 0;
            an--;
            for (; an >= 0; an--) {
                c = alist[an];
                for (int i = 0; i < j; i++) {
                    c *= 10;
                }
                b += c;
                j++;
            }
            n1++;
            if (a==b&&n1>1){
                break;
            }
            d = a + b;
            cout << a << "+" << b << "=" << d<<endl;
            a = d;
        }

    }
}

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


int main() {
	int n;
	int a[3] = {1156,3136,7921};
	while(cin>>n) {
		cout<<a[n-1]<<endl;
	}	
	return 0;
} 

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


int main() {
	int n, x, y, i, j;
	while(cin>>n>>x>>y) {
		int a[20] = {0};
		for (i = 0; i < n; i++) {
			cin>>a[i];
		}
		int max = -999;
		for (i = 0; i < n - x + 1; i++) {
			int sum = 0;
			for (int j = 0; j < x; j++) {
				sum += a[i + j];
			}
			int t = sum;
			for (j = x; j < y; j++) {
				sum += a[i+j];
				if (sum > t) {
					t = sum;
				}
			}
			if (t > max) {
				max = t;
			}
		} cout << max << endl;
	}	
	return 0;
} 

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

int sum = 0;
int main() {
	int n, a[50];
	while (cin>>n) {
		for (int i = 0; i < n; i++) {
			cin>>a[i];
		}
		sum = 0;
		int temp ;
		for (int len = 1; len <= n; len++) {
			for (int i = 0;i + len <= n; i++) {
			temp = 0;
			for (int j = 0; j < len; j++) {
				temp += a[j + i];
			}
			if (temp % 11 == 0) {
				++sum;
			}
		}
		}		
		cout<<sum<<endl;
	}	
} 

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

int a[1300],b[1300];
int main()
{
    int m,c, a[100],b[100];
    int s = 0;
    while (cin>>m>>c) {
    	for (int i = 1; i <= c; i++) {
    		cin>>a[i];
		}
		sort(a + 1, a + c + 1);
		for (int i = 1; i < c; i++) {
			b[i] = a[i + 1] - a[i];
		}
		sort (b + 1, b + c);
		for (int i = 1; i <= c - m; i++) {
			s += b[i];
		}
		if (m > c) {
			m = c;
		}
		cout<< s + m <<endl;
	}
    return 0;
}

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

int sum = 0;
int main() {
	int n, m, a[200];
	while (cin>>n) {
		for (int i = 0; i < 110; i++) {
			a[i] = 0;
		}
		for (int i = 0; i < n; i++) {
			cin>>m;
			a[m]++;
		}
		int f = 0;
		for (int i = 0; i < 110; i++) {
			if (a[i] != 0) {
				if (f==0) {
					cout<<i;
					f = 1;
				} else {
					cout<<" "<<i;
				}
			}
		}
		cout<<endl;
	}	
	return 0;
}