信息学奥赛一本通——第四页

鉴于时间原因无法一一列举题目，代码以及解题思维，只能为各位提供第四页的所有源代码（但代码前有题号），详细题目可以前往信息学奥赛一本通网站查看

网页链接如下：信息学奥赛一本通（C++版）在线评测系统

如果您需要1-4页所有代码，请私信我（但4页以后的题目目前还没做，后续会持续更新）

以下是源代码文件：

/*
1102
#include<stdio.h>
int main(void)
{
	int n, i, m, count = 0;
	scanf("%d", &n);
	int num[n];
	for (i = 0; i < n; i++)
		scanf("%d", &num[i]);
	scanf("%d", &m);
	for (i = 0; i < n; i++)
	{
		if (num[i] == m)
			count++;
	}
	printf("%d", count);
	return 0;
}

1103
#include<stdio.h>
#include <stdbool.h>
int main()
{
	int h[10], i, H, count = 0;
	for (i = 0; i < 10; i++)
		scanf("%d", &h[i]);
	scanf("%d", &H);
	for (i = 0; i < 10; i++)
		count += !(h[i] <= (H+30));
	printf("%d", 10 - count);
	return 0;
}

1104
#include<stdio.h>
int main(void)
{
	int num[10], i;
	for (i = 0; i < 10; i++)
		scanf("%d", &num[i]);
	float p[10] = {28.9,32.7,45.6,78,35,86.2,27.8,43,56,65}, sum = 0;
	for (i = 0; i < 10; i++)
		sum += num[i] * p[i];
	printf("%.1f", sum);
	return 0;
}

1105
#include<stdio.h>
int main()
{
	int n, i;
	scanf("%d", &n);
	int num[n];
	for (i = 0; i < n; i++)
		scanf("%d", &num[i]);
	for (i = n - 1; i >= 0; i--)
		printf("%d ", num[i]);
	return 0;
}

1106
#include<stdio.h>
int main()
{
	int n, m,i, j;
	scanf("%d", &n);
	m = n + 4;
	int num[m];
	for (i = 0; i <= 3; i++)
		num[i] = 0;
	for (i = 4; i < m; i++)
		scanf("%d", &num[i]);
	for (i = 4; i < m; i++)
		{
			if (num[i] > 0 && num[i] <= 18)
				num[0]++;
			if (num[i] >18 && num[i] <=35)
				num[1]++;
			if (num[i] > 35 && num[i] <= 60)
				num[2]++;
			if (num[i] > 60)
				num[3]++;

		}
	for (i = 0; i <= 3; i++)
		printf("%.2lf%%\n", (double)(num[i] * 1.0/ n) * 100);
	return 0;
}

1107
#include <stdio.h>
int main()
{
    int L, M, i, j;
    scanf("%d %d", &L, &M);
    int tree[L + 1];
    for (i = 0; i <= L; i++) {
        tree[i] = 1;
    }

    for (i = 0; i < M; i++) {
        int start, end;
        scanf("%d %d", &start, &end);

        for (j = start; j <= end; j++) {
            tree[j] = 0;
        }
    }
    int count = 0;
    for (i = 0; i <= L; i++) {
        if (tree[i] == 1) {
            count++;
        }
    }
    printf("%d\n", count);
    return 0;
}

1108
#include <stdio.h>
int main()
{
    int n, i;
    scanf("%d", &n);
    int a[n];
    for (i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }
    int b[n];
    for (i = 0; i < n; i++) {
        scanf("%d", &b[i]);
    }
    int dot_product = 0;
    for (i = 0; i < n; i++) {
        dot_product += a[i] * b[i];
    }
    printf("%d\n", dot_product);
    return 0;
}

1109
#include<stdio.h>
void find_closed_lights(int n, int m) {
    int lights[n + 1], i, j;
    for (i = 1; i <= n; i++)
        lights[i] = 1;
    for (i = 1; i <= m; i++) {
        for (j = i; j <= n; j += i)
            lights[j] = !lights[j];
    }
    int first_output = 1;
    for (i = 1; i <= n; i++) {
        if (!lights[i]) {
            if (!first_output)
                printf(",");
            else
                first_output = 0;
            printf("%d", i);
        }
    }
}
int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    if (n >= 2 && n <= 5000) {
        find_closed_lights(n, m);
    }
    return 0;
}

1110
#include<stdio.h>
int main() {
    int n, i = 1;
    scanf("%d", &n);
    int num[n + 1];
    for (i = 1; i <= n; i++)
        scanf("%d", &num[i]);
    int x, flag = 0;
    scanf("%d", &x);
    i = 1;
    while (i < n) {
        i++;
        if (x == num[i]) {
            printf("%d", i);
            flag = 1;
            break;
        }
    }
    if (flag == 0)
        printf("-1");
}

1111
#include<stdio.h>
int main()
{
	int time_s[7],time_m[7],i,flag=1,time[7],count = 0;
	for (i=0;i<7;i++){
		scanf("%d %d",&time_s[i],&time_m[i]);
		time[i] = time_s[i]+time_m[i];
	}
 	int maxnum = time[0];
	int maxi = 0;
	for(i=1;i<7;i++){
		if (time[i] > maxnum){
			maxnum = time[i];
			maxi = i;
		}
	}
	if(maxnum <= 8)
		printf("0");
	else
		printf("%d",maxi+1);
	return 0;
}

1112
#include <stdio.h>
#include <stdlib.h>
int main() {
    int m, i;
    scanf("%d", &m);
    int* num = malloc(m * sizeof(int));
    int nummax = -10000, nummin = 10000;
    for (i = 0; i < m; i++) {
        scanf("%d", &num[i]);
        if (num[i] > nummax)
            nummax = num[i];
        if (num[i] < nummin)
            nummin = num[i];
    }
    printf("%d", nummax - nummin);
    free(num);
    return 0;
}

1113
#include<stdio.h>
int main()
{
	int n,i,sum=0;
	scanf("%d",&n);
	int num[n], max = 0;
	for (i = 0; i < n; i++){
		scanf("%d",&num[i]);
		if (max < num[i])
			max = num[i];
	}
	for (i = 0; i < n; i++){
		if (num[i] != max)
			sum += num[i];
	}
	printf("%d",sum);
	return 0;
}

1114
#include<stdio.h>
#include<math.h>
#include<time.h>
int main() {
    int a,b,c,n, i, imax = 0, imin = 0;
    scanf("%d", &n);
    float num[n], sum = 0.0;
    for (i = 0; i < n; i++) {
        scanf("%f", &num[i]);
    }
    srand(time(NULL));
    for(i=0;i<n;i++){
        sum=sum+num[i];
    }
    for (i = 1; i < n; i++){
        if (num[imax] < num[i]){
            imax = i;
        }
        if (num[imin] > num[i]){
            imin = i;
        }
    }
    for(i=0;i<3;i++){
        c=rand()%n;
        if(c!=imax&&c!=imin){
            a=b=c;
            break;
        }
    }
    for (i = 0; i < n; i++){
        if(i==imax||i==imin){
            continue;
        }
        if (num[a] < num[i]){
            a= i;
        }
        if (num[b] > num[i]){
            b= i;
        }
    }
    sum = sum - num[imax] - num[imin];
    if(fabs(num[a] - sum/(n-2))>fabs(num[b]-sum/(n-2))){
        printf("%.2f %.2f", sum/(n-2), fabs(num[a] - sum / (n - 2)));
    }
    else{
        printf("%.2f %.2f",sum/(n-2),fabs(num[b]-sum/(n-2)));
    }
    return 0;
}

1115
#include<stdio.h>
#include <stdlib.h>
int main()
{
	int n, i, j, max = -1;
	scanf("%d", &n);
	int *num = malloc((n+1)*sizeof(int));
	for(i=1;i<=n;i++){
		scanf("%d",&num[i]);
		if (max<num[i])
			max=num[i];
	}
	int *find = malloc((max+1)*sizeof(int));
	for(i=0;i<=max;i++){
		find[i]=0;
	}
	for (i=1;i<=n;i++){
		for(j=0;j<=max;j++){
			if(num[i] == j)
				find[j]++;
		}
	}
	for(i=0;i<=max;i++){
		printf("%d\n",find[i]);
	}
	return 0;
}

1116
#include <stdio.h>
#include <stdlib.h>
int main() {
    int n, i, len = 1, maxLen = 0;
    scanf("%d", &n);
    int* num = (int*) malloc(n * sizeof(int));
    for (i = 0; i < n; i++) {
        scanf("%d", &num[i]);
    }
    for (i = 1; i < n; i++) {
        if (num[i] == num[i - 1])
            len++;
        else {
            if (len > maxLen)
                maxLen = len;
            len = 1;
        }
    }
    if (len > maxLen)
        maxLen = len;
    printf("%d", maxLen);
    free(num);
    return 0;
}

1117
#include<stdio.h>
#include<stdlib.h>
int main()
{
	int n, i, j;
	scanf("%d",&n);
	int* num = malloc(n*sizeof(int));
	for (i = 0; i < n; i++){
		scanf("%d",&num[i]);
	}
	for (i = 0; i < n; i++){
		for (j = i+1; j < n; j++){
			if (num[i] == num[j])
				num[j] = 0;
		}
	}
	for (i = 0; i < n; i++){
		if (num[i] != 0)
			printf("%d ", num[i]);
	}
	free(num);
	return 0;
}

1118
#include<stdio.h>
#include<stdlib.h>
typedef struct {
    int a, b, g, k;
} Carpet;
int main() {
    int n, i;
    scanf("%d", &n);
    Carpet* carpets = (Carpet*)malloc(n * sizeof(Carpet));
    for (i = 0; i < n; i++) {
        scanf("%d %d %d %d", &carpets[i].a, &carpets[i].b, &carpets[i].g, &carpets[i].k);
    }
    int x, y;
    scanf("%d %d", &x, &y);
    int topCarpet = -1;
    for (i = n - 1; i >= 0; i--) {
        if (x >= carpets[i].a && x <= carpets[i].a + carpets[i].g &&
            y >= carpets[i].b && y <= carpets[i].b + carpets[i].k) {
            topCarpet = i + 1;
            break;
        }
    }
    printf("%d\n", topCarpet);
    free(carpets);
    return 0;
}

2041
#include<stdio.h>
int main(){
	int n, i, j;
	scanf("%d",&n);
	int num[n][n];
	for (i = 0; i < n; i++){
		for (j = 0; j < n; j++){
			scanf("%d",&num[i][j]);
		}
	}
	for (i=0;i<n;i++){
		for(j=0;j<n;j++){
			if(i==j||i+j==n-1){
				num[i][j]+=10;
			}
		}
	}
	for(i=0;i<n;i++){
		for(j=0;j<n;j++){
			printf("%d ",num[i][j]);
			if(j==n-1){
				printf("\n");
			}
		}
	}
	return 0;
}

2042
#include <stdio.h>
int main() {
    int n, m, i, j;
    scanf("%d%d", &n, &m);
    int num[n][m];
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            scanf("%d", &num[i][j]);
        }
    }
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            if (num[i][j] != 0) {
                printf("%d %d %d\n", i + 1, j + 1, num[i][j]);
            }
        }
    }
    return 0;
}

2043
#include<stdio.h>
int C(int m, int n){
	int i = m - 1, j = n - 1;
	if (j==0){
		return 1;
	}
	else{
		int k, result1 = 1;
		for (k = 1; k <= j; k++){
			result1 *= k;
		}

		int h, result2 = 1;
		for (h = i; h >= (i-j+1); h--){
			result2 *= h;
		}
		return result2/result1;
	}
}
int main(){
	int N, m, n;
	scanf("%d",&N);
	for(m=1;m<=N;m++){
		for(n=1;n<=m;n++){
				printf("%d ",C(m,n));
			}
			printf("\n");
		}
		
	return 0;
}

2043
#include<stdio.h>
int main() {
    int n, i, j;
    scanf("%d", &n);
    int triangle[n][n];
    for (i = 0; i < n; i++) {
        triangle[i][0] = 1;
        triangle[i][i] = 1;
    }
    for (i = 2; i < n; i++) {
        for (j = 1; j < i; j++) {
            triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j];
        }
    }
    for (i = 0; i < n; i++) {
        for (j = 0; j <= i; j++) {
            printf("%d ", triangle[i][j]);
        }
        printf("\n");
    }
    return 0;
}

2044
#include <stdio.h>
#include <string.h>
int main() {
    char ch, a[101];
    int i = 0, j = 1;
    scanf("%c", &ch);
    while (ch != '.') {
        i++;
        a[i] = ch;
        scanf("%c", &ch);
    }
    while (j < i && a[j] == a[i]) {
        i--;
        j++;
	}
    if (j >= i)
        printf("Yes\n");
    else
        printf("No\n");
    return 0;
}

2045
#include <stdio.h>
#include <math.h>
#define MAX_SIZE 25
int main()
{
    int a[MAX_SIZE][MAX_SIZE], n, cnum, x, y, k = 1, i, j;
    scanf("%d", &n);
    cnum = ceil((double)n/2);
    for(i = 1; i <= cnum; i++) 
    {
        for(x = i, y = n-i+1; x <= n-i+1; x++)
            a[x][y] = k++;
        for(x = n-i+1, y = n-i; y >= i; y--)
            a[x][y] = k++;
        for(x = n-i, y = i; x >= i; x--)
            a[x][y] = k++;
        for(x = i, y = i+1; y <= n-i; y++)
            a[x][y] = k++;
    }
    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= n; j++)
            printf("%d ", a[i][j]);
        printf("\n");
    }
    return 0;
}

1119
#include<stdio.h>
int main(){
	int i, j, m, n;
	int num[5][5];
	for (i = 0; i < 5; i++){
		for(j = 0; j < 5; j++){
			scanf("%d", &num[i][j]);
		}
	}
	scanf("%d %d", &m, &n);
	for(i = 0; i < 5; i++){
		for(j = 0; j < 5; j++){
			if (i == m - 1)
				printf("%d ", num[n-1][j]);
			else if(i == n - 1)
				printf("%d ", num[m-1][j]);
			else
				printf("%d ", num[i][j]);
		}
		printf("\n");
	}
	return 0;
}

1120
#include <stdio.h>
int main() {
    int n, m, j, i, k;
    scanf("%d %d %d", &n, &i, &j);
    for (m = 0; m < n; m++) {
        printf("(%d,%d) ", i, m + 1);
    }
    printf("\n");
    for (m = 0; m < n; m++) {
        printf("(%d,%d) ", m + 1, j);
    }
    printf("\n");
    for (m = 1; m <= n; m++) {
        for (k = 1; k <= n; k++) {
            if (i-m == j-k)
                printf("(%d,%d) ", m, k);
        }
    }
    printf("\n");
    for (m = n; m >= 1; m--) {
        for (k = 1; k <= n; k++) {
            if (i-m == -(j-k))
                printf("(%d,%d) ", m, k);
        }
    }
    return 0;
}

1121
#include<stdio.h>
int main(){
	int m, n, i, j, sum = 0;
	scanf("%d %d",&m, &n);
	int num[m][n];
	for (i = 0;i < m; i++){
		for (j = 0; j < n; j++){
			scanf("%d", &num[i][j]);
			if (i == 0|| i == m - 1 || j == 0||j == n - 1)
				sum += num[i][j];
		}
	}
	printf("%d", sum);
	return 0;
}

1122
#include<stdio.h>
int main(){
	int i, j, num[5][5];
	for (i = 0; i < 5; i++){
		for(j = 0; j < 5; j++){
			scanf("%d", &num[i][j]);
		}
	}
	int jmax[5],maxj = 0;
	for (i = 0; i < 5; i++){
  		int max = num[i][0];
		for(j = 0; j < 5; j++){
			if (num[i][j] >= max){
				max = num[i][j];
				maxj = j;
  			}
  		}
		jmax[i] = maxj;
	}
	int flag = 1;
	for (i = 0; i < 5; i++){
		int count = 0;
		for (j=0;j<5;j++){
			if (num[i][jmax[i]] < num[j][jmax[i]] && i != j){
				count++;
			}
		}
		if (count == 4){
			printf("%d %d %d", i+1,jmax[i]+1,num[i][jmax[i]]);
			flag = 0;
			break;
		}
	}
	if (flag == 1){
		printf("not found");
	}
	return 0;
}

1123
#include<stdio.h>
int main(){
	int m, n, i, j, count = 0;
	scanf("%d %d",&m,&n);
	int num1[m][n], num2[m][n];
	for (i=0;i<m;i++){
		for (j=0;j<n;j++){
			scanf("%d",&num1[i][j]);
		}
	}
	for (i=0;i<m;i++){
		for (j=0;j<n;j++){
			scanf("%d",&num2[i][j]);
			if(num2[i][j] == num1[i][j]){
				count++;
			}
		}
	}
	printf("%.2lf",count*1.0/(m*n)*100);
	return 0;
}

1124
#include<stdio.h>
int main(){
	int m, n, i, j;
	scanf("%d %d",&n,&m);
	int num1[n][m], num2[n][m], num3[n][m];
	for (i=0;i<n;i++){
		for (j=0;j<m;j++){
			scanf("%d",&num1[i][j]);
		}
	}
	for (i=0;i<n;i++){
		for (j=0;j<m;j++){
			scanf("%d",&num2[i][j]);
			num3[i][j] = num1[i][j] + num2[i][j];
		}
	}
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			printf("%d ",num3[i][j]);
		}
		printf("\n");
	}
	return 0;
}

1125
#include<stdio.h>
int main(){
	int n, m, k, i, j, h;
	scanf("%d %d %d",&n, &m, &k);
	int num1[n][m], num2[m][k], num3[n][k];
	for (i=0;i<n;i++){
		for(j=0;j<m;j++){
			scanf("%d",&num1[i][j]);
		}
	}
	for(i=0;i<m;i++){
		for(j=0;j<k;j++){
			scanf("%d",&num2[i][j]);
		}
	}
	for(i=0;i<n;i++){
		for(j=0;j<k;j++){
			num3[i][j]=0;
		}
	}
	for (i=0;i<n;i++){
		for(j=0;j<k;j++){
			for(h=0;h<m;h++){
				num3[i][j] += num1[i][h]*num2[h][j];
			}
		}
	}
	for (i=0;i<n;i++){
		for(j=0;j<k;j++){
			printf("%d ",num3[i][j]);
		}
		printf("\n");
	}
	return 0;
}

1126
#include<stdio.h>
int main(){
	int n, m, i, j;
	scanf("%d %d", &n, &m);
	int num[n][m];
	for(i = 0; i < n; i++){
		for(j = 0; j < m; j++){
			scanf("%d", &num[i][j]);
		}
	}
	for(j = 0; j < m; j++){
		for(i = 0; i < n; i++){
			printf("%d ", num[i][j]);
		}
		printf("\n");
	}
	return 0;
}

1127
#include <stdio.h>
void rotate_image(int n, int m, int image[n][m]) {
    int rotated[m][n];
    int i, j, k;
    for (i = 0; i < m; i++) {
        for (j = 0, k = n - 1; j < n; j++, k--) {
            rotated[i][j] = image[k][i];
        }
    }
    for (i = 0; i < m; i++) {
        for (j = 0; j < n; j++) {
            printf("%d ", rotated[i][j]);
        }
        printf("\n");
    }
}
int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    int image[n][m];
    int i, j;
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            scanf("%d", &image[i][j]);
        }
    }
    rotate_image(n, m, image);
    return 0;
}

1128
#include<stdio.h>
#include<math.h>
int main(){
	int n, m, i, j;
	scanf("%d %d", &n, &m);
	int num1[n][m], num2[n][m];
	for (i = 0; i < n; i++){
		for (j = 0; j < m; j++){
			scanf("%d", &num1[i][j]);
			num2[i][j] = 0;
		}
	}
	for (i = 0; i < n; i++){
		for (j = 0; j < m; j++){
			if (i == 0 || i == n-1 || j == 0 || j == m-1){
				num2[i][j] = num1[i][j];
			}else{
				float average = (num1[i][j] + num1[i-1][j] + num1[i+1][j] + num1[i][j-1] +num1[i][j+1])/5.0;
            	num2[i][j] = (int)(average+0.5);
			}
		}
	}
	for (i = 0; i < n; i++){
		for (j = 0; j < m; j++){
			printf("%d ", num2[i][j]);
		}
		printf("\n");
	}
	return 0;
}

2046
#include <stdio.h>
#include <string.h>
#define MAX_LENGTH 201
int main() {
    char original_text[MAX_LENGTH];
    char replace_rule[3];
    fgets(original_text, sizeof(original_text), stdin);
    scanf("%c %c", &replace_rule[0], &replace_rule[2]);
    int length = strlen(original_text);
    int i;
    for (i = 0; i < length; i++) {
        if (original_text[i] == replace_rule[0]) {
            printf("%c", replace_rule[2]);
        } else {
            printf("%c", original_text[i]);
        }
    }
    return 0;
}

2047
#include <stdio.h>
#include <string.h>
void filterSpaces(char* original_text) {
    int i, j;
    int length = strlen(original_text);
    int filter = 0;
    for (i = 0, j = 0; i < length; i++) {
        if (original_text[i] == ' ') {
            if (filter == 0) {
                original_text[j++] = original_text[i];
                filter = 1;
            }
        } else {
            original_text[j++] = original_text[i];
            filter = 0;
        }
    }
    original_text[j] = '\0';
}
int main() {
    char original_text[201];
    fgets(original_text, sizeof(original_text), stdin);
    filterSpaces(original_text);
    printf("%s", original_text);
    return 0;
}

2048
#include <stdio.h>
#include <string.h>
#define MAX_LENGTH 22
char str[MAX_LENGTH][MAX_LENGTH];
char t[MAX_LENGTH];
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%s", str[i]);
    }
    // 使用冒泡排序按字典序对字符串进行排序
    for (int i = 0; i < n - 1; i++) {
        for (int j = i + 1; j < n; j++) {
            if (strcmp(str[i], str[j]) > 0) {
                strcpy(t, str[i]);
                strcpy(str[i], str[j]);
                strcpy(str[j], t);
            }
        }
    }
    // 输出排序后的字符串
    for (int i = 0; i < n; i++) {
        printf("%s\n", str[i]);
    }
    return 0;
}

2049
#include<stdio.h>
#include<string.h>
#define N 256
char s1[N],s2[N],a[N],b[N];
int l1,l2;
char *strlwr(char *s)
{
	char *str;
	str = s;
	while(*str!='\0')
	{
		if(*str>='A' && *str<= 'Z')
		{
			*str+='a'-'A';
		}
		str++;
	}
	return s;
}
int main()
{
    int i;
    gets(s1);
    gets(s2);
    strlwr(s1);
    strlwr(s2);
	for(i=0;i<strlen(s1);i++)
	{
		if(s1[i]!=' ')
			a[l1++]=s1[i];
	}
	for(i=0;i<strlen(s2);i++)
	{
		if(s2[i]!=' ')
			b[l2++]=s2[i];
	}
	if(strcmp(a,b)==0)
		printf("YES\n");
	else
		printf("NO\n");
	return 0;
}

2050
#include<stdio.h>
#include<string.h>
#define N 65
char s1[N],s2[N],x[N],t[N];
int main()
{
    int i;
    scanf("%s %s",s1,s2);
    if(strlen(s1)<strlen(s2))  // 将短的字符串作为预判字符串
    {
    	strcpy(t,s1);
    	strcpy(s1,s2);
    	strcpy(s2,t);
	}
	strcpy(x,s1);
    if(strstr(strcat(s1,x),s2)==NULL)
		printf("false\n");
	else
		printf("true\n");
	return 0;
}

1129
#include<stdio.h>
#define N 265
char a[N];
int main()
{
	int i,cnt=0;
	gets(a);
	for(i=0;a[i]!='\0';i++)
	{
		if(a[i]>='0' && a[i]<='9')
			cnt++;
	}
	printf("%d\n",cnt);
    return 0;
}

1130
#include <stdio.h>
#define N 100010
char s[N];
int main()
{
	int letters[26]= {0};
	int i,flag=0;

	gets(s);
	for(i=0;s[i]!='\0';i++)
		letters[s[i]-'a']++;

	for(i=0;s[i]!='\0';i++)
	{
		if(letters[s[i]-'a']==1)
		{
			printf("%c\n",s[i]);
			flag=1;
			break;
		}
	}
	if(flag==0)
		printf("no\n");
	return 0;
}

1131
#include <stdio.h>
#include <string.h>
#define N 510
char s1[N],s2[N];
int main()
{
	int i,len;
	double x,sum=0;
	scanf("%lf",&x);
	getchar();
	gets(s1);
	gets(s2);

	len=strlen(s1);
	for(i=0;i<len;i++)
		if(s1[i]==s2[i])
			sum++;
	if(sum/len>=x)
		printf("yes\n");
	else
		printf("no\n");
	return 0;
}

1132
#include <stdio.h>
#include <string.h>
#define N 110
char player1[N],player2[N];
int main()
{
	int n;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%s %s",player1,player2);
		if(strcmp(player1,player2)==0)
			printf("Tie\n");
		else if((strcmp(player1,"Rock")==0 && strcmp(player2,"Scissors")==0) ||
				(strcmp(player1,"Scissors")==0 && strcmp(player2,"Paper")==0) ||
				(strcmp(player1,"Paper")==0 && strcmp(player2,"Rock")==0))
				printf("Player1\n");
		else
			printf("Player2\n");
	}
	return 0;
}

1133
#include <stdio.h>
#include <string.h>
#define N 65
char s[N];
int main()
{
	int i,len;
	gets(s);
	len=strlen(s);
	for(i=0;i<len;i++)
		printf("%c",s[i%len]+s[(i+1)%len]);
	printf("\n");
	return 0;
}

1134
#include <stdio.h>
#include <string.h>
#define N 25
char s[N];
int main()
{
	int i;
	gets(s);
	if(s[0]>='0' && s[0]<='9')
	{
		printf("no\n");
		return 0;
	}
	for(i=0;s[i]!='\0';i++)
	{
		if(!((s[i]>='0' && s[i]<='9') || (s[i]>='a' && s[i]<='z') || (s[i]>='A' && s[i]<='Z') || (s[i]=='_')))
		{
			printf("no\n");
			return 0;
		}
	}
	printf("yes\n");
	return 0;
}

1135
#include <stdio.h>
#include <string.h>
#define N 265
char s[N];
int main()
{
	int i;
	gets(s);
	for(i=0;s[i]!='\0';i++)
	{
		switch(s[i])
		{
			case 'A':
				printf("T");
				break;
			case 'T':
				printf("A");
				break;
			case 'C':
				printf("G");
				break;
			case 'G':
				printf("C");
				break;
		}
	}
	printf("\n");
	return 0;
}

1136
#include <stdio.h>
#include <string.h>
#define N 90
char s[N];
int main()
{
	int i;
	gets(s);
	for(i=0;s[i]!='\0';i++)
	{
		if(s[i]=='z' || s[i]=='Z')
			s[i]-=25;
		else if(s[i]>='a' && s[i]<'z' || s[i]>='A' && s[i]<'Z')
			s[i]++;
	}
	puts(s);
	return 0;
}

1137
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#define N 60
char s[N];
int main()
{
	int i,len;
	char t;
    gets(s);
    len=strlen(s);
    for(i=0;i<len;i++)
    {
        if(isupper(s[i]))
        {
        	s[i]+=3;
        	if(s[i]>'Z')
        		s[i]=s[i]-26;
        }
		else
		{
			s[i]+=3;
			if(s[i]>'z')
        		s[i]=s[i]-26;
		}
    }
    for(i=0;i<len/2;i++)
    {
    	t=s[i];
    	s[i]=s[len-1-i];
    	s[len-1-i]=t;
	}
    for(i=0;s[i];i++)
    {
        if(islower(s[i]))
            s[i]-=32;
        else
            s[i]+=32;
    }
    puts(s);
	return 0;
}

1138
#include <stdio.h>
#include <ctype.h>
#define N 110
char s[N];
int main()
{
	int i;
    gets(s);
    for(i=0;s[i]!='\0';i++)
    {
    	if(islower(s[i]))
    		s[i]=toupper(s[i]);
	}
	puts(s);
	return 0;
}

1139
#include <stdio.h>
#include <ctype.h>
#define N 110
char s[N];
int main()
{
    int i,n;
    scanf("%d",&n);
    while(n--)
    {
    	scanf("%s",s);
    	if(islower(s[0]))
    		s[0]=toupper(s[0]);
    	for(i=1;s[i]!='\0';i++)
    	{
    		if(isupper(s[i]))
    			s[i]=tolower(s[i]);
		}
		printf("%s\n",s);
	}
	return 0;
}

1140
#include <stdio.h>
#include <string.h>
#define N 210
char s1[N],s2[N];
int main()
{
	gets(s1);
	gets(s2);
	if(strstr(s1,s2)!=NULL)
	{
		printf("%s is substring of %s\n",s2,s1);
	}
    else if(strstr(s2,s1)!=NULL)
  	{
		printf("%s is substring of %s\n",s1,s2);
   	}
   	else
   	{
   		printf("No substring\n");
	}
	return 0;
}

1141
#include <stdio.h>
#include <string.h>
#define N 42
char s[N];
int main()
{
    int i,len;
    gets(s);
    len=strlen(s);
    if((s[len-2]=='e' && s[len-1]=='r') || (s[len-2]=='l' && s[len-1]=='y'))
    {
    	for(i=0;i<len-2;i++)
    		printf("%c",s[i]);
	}
	else if(s[len-3]=='i' && s[len-2]=='n' && s[len-1]=='g')
	{
		for(i=0;i<len-3;i++)
			printf("%c",s[i]);
	}
	else
		puts(s);
	return 0;
}
*/