【真题】暑假备战CSP-J/S：NOIP2013提高组初赛(第一轮)试题及参考答案(PDF版、无水印可直接打印)

int F(int n) 
{ 
 if (n <= 2) 
  return 1; 
 else 
  return F(n - 1) + F(n - 2); 
}

#include <stdio.h>
#include <string.h>
const int SIZE = 100;
int main() {
    int n, i, isPlalindrome;
    char str[SIZE];
    scanf("%s", str);
    n = strlen(str);
    isPlalindrome = 1;
    for (i = 0; i < n/2; i++) {
        if (str[i] != str[n-i-1]) isPlalindrome = 0;
    }
    if (isPlalindrome)
        printf("Yes\n");
    else
        printf("No\n");
    return 0;
} 

#include <stdio.h>
int main()
{
    int a, b, u, v, i, num;
    scanf("%d%d%d%d", &a, &b, &u, &v);
    num = 0;
    for (i = a; i <= b; i++)
        if (((i % u) == 0) || ((i % v) == 0))
            num++;
    printf("%d\n", num);
    return 0;
} 

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

#include <stdio.h>
#include <string.h>
#define SIZE 100
int n, m, p, count;
int a[SIZE][SIZE];
void colour(int x, int y)
{
    count++;
    a[x][y] = 1;
    if ((x > 1) && (a[x - 1][y] == 0))
        colour(x - 1, y);
    if ((y > 1) && (a[x][y - 1] == 0))
        colour(x, y - 1);
    if ((x < n) && (a[x + 1][y] == 0))
        colour(x + 1, y);
    if ((y < m) && (a[x][y + 1] == 0))
        colour(x, y + 1);
}
int main()
{
    int i, j, x, y, ans;
    memset(a, 0, sizeof(a));
    scanf("%d%d%d", &n, &m, &p);
    for (i = 1; i <= p; i++) {
        scanf("%d%d", &x, &y);
        a[x][y] = 1;
    }
    ans = 0;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= m; j++)
            if (a[i][j] == 0) {
                count = 0;
                colour(i, j);
                if (ans < count)
                    ans = count;
            }
    printf("%d\n", ans);
    return 0;
} 

#define SIZE 100 
int a[SIZE], n; 

void swap1(int p) {
	int i, j, b[SIZE]; 
	for (i = 1; i <= p; i++)b[(1)] = a[i]; //（2 分） 
	for (i = p + 1; i <= n; i++)
		b[i - p] = a[i]; 
	for (i = 1; i <= n; i++)
		a[i] = b[i]; 
}

void swap2(int p) {
	int i, j, temp; 
	for (i = p + 1; i <= n; i++) {
		temp = a[i]; 
		for (j = i; j >= (2); j--)//（2 分） 
			a[j] = a[j - 1]; (3) = temp; //（2 分） 
	}
}

void swap3(int p) {
    int start1, end1, start2, end2, i, j, temp;
    start1 = 1;
    end1 = p;
    start2 = p + 1;
    end2 = n;
    while (true) {
        i = start1;
        j = start2;
        while ((i <= end1) && (j <= end2)) {
            temp = a[i];
            a[i] = a[j];
            a[j] = temp;
            i++;
            j++;
        }
        if (i <= end1)
            start1 = i;
        else if ((4)) {//（3 分）    
            start1 = (5); //（3 分）    
            end1 = (6); //（3 分） 
            start2 = j;
        }
        else
            break;
    }
}

#include <stdio.h>

int main() {
    const int SIZE = 100;
    int n, i, j, a[SIZE], cur1, cur2, count1, count2,
            ans_length, ans_start, ans_end;  //cur1, cur2 分别表示当前子序列中的两个不同整数  //count1, count2 分别表示 cur1, cur2 在当前子序列中出现的次数 
    scanf("%d", &n);
    for (i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    i = 1;
    j = 1;  //i, j 分别表示当前子序列的首尾，并保证其中至多有两个不同整数 
    while ((j <= n) && (a[j] == a[i]))
        j++;
    cur1 = a[i];
    cur2 = a[j];
    count1 = (1); //（3 分） 
    count2 = 1;
    ans_length = j - i + 1;
    while (j < n) {
        j++;
        if (a[j] == cur1)
            count1++;
        else if (a[j] == cur2)
            count2++;
        else {
            if (a[j - 1] == (2)) { //（3 分） 
                while (count2 > 0) {
                    if (a[i] == cur1)
                        count1--;
                    else
                        count2--;
                    i++;
                }
                cur2 = a[j];
                count2 = 1;
            } else {
                while (count1 > 0) {
                    if (a[i] == cur1) (3); //（2 分） 
                    else (4); //（2 分） 
                    i++;
                }
                (5);   //（3 分） 
                count1 = 1;
            }
        }
        if (ans_length < j - i + 1) {
            ans_length = j - i + 1;
            ans_start = i;
            ans_end = j;
        }
    }
    for (i = ans_start; i <= ans_end; i++)
        printf("%d ", a[i]);
    return 0;
}