常熟理工学院第三届ACM新生程序设计大赛题解

A_外宽中空的螺母

#include<stdio.h>

int main(){
	printf("20\n");
	return 0;
}

B_/ 8 ？ % 8

#include<stdio.h>

int main() {
	long long int n;
	scanf("%lld", &n);
	if (n == 1) {
		printf("%d\n", 1);
		printf("%d %d\n", 1, 1);
	} else if (n == 2) {
		printf("%d\n", 2);
		printf("%d %d\n", 1, 1);
		printf("%d %d\n", 4, 1);
	} else if (n == 3) {
		printf("%d\n", 2);
		printf("%d %d\n", 1, 2);
		printf("%d %d\n", 4, 1);
	} else if (n == 4) {
		printf("%d\n", 3);
		printf("%d %d\n", 0, 1);
		printf("%d %d\n", 1, 2);
		printf("%d %d\n", 4, 1);
	} else if (n % 4 == 1) {
		printf("%d\n", 3);
		printf("%d %lld\n", 0, (n / 4) * 1 );
		printf("%d %lld\n", 1, (n / 4) * 2 + 1);
		printf("%d %lld\n", 4, (n / 4) * 1);
	} else if (n % 4 == 2) {
		printf("%d\n", 3);
		printf("%d %lld\n", 0, (n / 4) * 1 );
		printf("%d %lld\n", 1, (n / 4) * 2 + 1);
		printf("%d %lld\n", 4, (n / 4) * 1 + 1);
	} else if (n % 4 == 3) {
		printf("%d\n", 3);
		printf("%d %lld\n", 0, (n / 4) * 1 );
		printf("%d %lld\n", 1, (n / 4) * 2 + 2);
		printf("%d %lld\n", 4, (n / 4) * 1 + 1);
	} else if (n % 4 == 0) {
		printf("%d\n", 3);
		printf("%d %lld\n", 0, ((n / 4) ) * 1 );
		printf("%d %lld\n", 1, ((n / 4)) * 2  );
		printf("%d %lld\n", 4, ((n / 4) ) * 1  );
	}
	return 0;
}

C_模拟经营大师

#include<stdio.h>

int main() {
	int n, a, b;
	scanf("%d %d %d",&n,&a,&b);
	printf("%d\n", n * a + (24 - n)*b);
	return 0;
}

D_切蛋糕的牛牛

#include<stdio.h>

int main() {
	int n;
	scanf("%d", &n);
	if (n == 0) printf("0\n");
	else {
		if (n % 2 == 1)
			printf("%d\n", (n + 1) / 2);
		else
			printf("%d\n", n + 1);
	}

	return 0;
}

E_睡过头的球球学姐

#include<bits/stdc++.h>

using namespace std;

stack<string> s;

int main() {
	int n;
	cin >> n;
	string t;
	int m, flag = 0, ff = 0;
	for (int i = 0; i < n; i++) {
		cin >> m;
		if (m == 1) {
			cin >> t;
			s.push(t);
			flag = 1;
		} else {
			if (!s.empty()) {
				string r = s.top();
				s.pop();
				cout << r << endl;
				ff = 1;
			}
		}
	}
	if (!s.empty() && ff == 0)
		cout << "biejuanlebiejuanle" << endl;
	if (s.empty() && flag == 0) cout << "weishenmedajiadoumeilai" << endl;
	return 0;
}

F_田爸和蒿妈

#include<stdio.h>
#define MAXN 1000

long long int a[MAXN];
long long int fib(int n) {
	for (int i = 0; i <= n; i++) {
		if (i == 0 || i == 1) a[i] = 1;
		else if (i == 13) a[i] = 0;
		else  a[i] = a[i - 1] + a[i - 2];
	}
	return a[n];
}


int main() {
	int n;
	scanf("%d", &n);
	printf("%lld\n", fib(n));
	return 0;
}

G_感电

#include<stdio.h>
#define MAXN 100000007
char s[MAXN];
int main() {
	int n, sum = 0;
	char c;
	scanf("%d", &n);
	scanf("%s", s);
	int i = 0;
	while (i < n) {
		c = s[i];
		if (c != s[i + 1]) sum += 1;
		i++;
	}
	printf("%d\n", sum - 1);
	return 0;
}

H_不详之刃

#include <stdio.h>
#define MAXN 10000000

int a[MAXN];

void swap(int* a, int* b)
{
    int temp = *a;
    *a = *b;
    *b = temp;
} //swap

void QuickSort(int array[], int low, int high)
{
    int i = low;
    int j = high;
    if (i >= j) {
        return;
    }
    int temp = array[low];
    while (i != j) {
        while (array[j] >= temp && i < j) {
            j--;
        }
        while (array[i] <= temp && i < j) {
            i++;
        }
        if (i < j) {
            swap(&array[i], &array[j]);
        }
    }
    swap(&array[low], &array[i]);
    QuickSort(array, low, i - 1);
    QuickSort(array, i + 1, high);
} //QuickSort

int main()
{
    int n, m;
    scanf("%d %d", &n, &m);
    for (int i = 0; i < m; i++) {
        scanf("%d", &a[i]);
    }
    QuickSort(a, 0, m - 1);
    int t = 6, i = 0;
    while (t && i < m) {
        if (a[i] / n >= t && a[i] % n != 0) {
            break;
        } else if (a[i] / n > t) {
            break;
        } else {
            if (a[i] % n)
                t = t - (a[i] / n + 1);
            else
                t = t - (a[i] / n);
            t += 2;
        }
        i++;
    }
    printf("%d\n", i);
    return 0;
}

I_派蒙的藏宝图

#include<stdio.h>

typedef long long ll;
const ll MAXN = 1e7;
ll sum;
int a[MAXN], pre[MAXN];

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	for (ll i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		a[i + n] = a[i];
		sum += a[i];
	}
	for (ll i = 1, j = n; i <= n * 2; i++, j--) {
		pre[i] = pre[i - 1] + a[i];
	}
	int d, p, k;
	while (m--) {
		scanf("%d %d %d", &d, &p, &k);
		int whole = k / n, yu = k % n;
		if (d == 1) {
			ll l = p, r = p + yu;
			printf("%lld\n", pre[r] - pre[l - 1] + sum * whole);
		} else {
			ll l = p + n - yu, r = p + n;
			printf("%lld\n", pre[r] - pre[l - 1] + sum * whole);
		}
	}
}

J_《人间油物》

臣妾做不到

K_爱玩游戏的kk

#include<stdio.h>

const int MAXN = 1e7;
int a[MAXN];

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
	}
	int flag = 1;
	for (int i = n - 2; i >= 0; i--) {
		if (a[i] != 1) flag = 1;
		else flag = (-1) * flag;
	}
	if (flag == 1) printf("kk\n");
	else printf("yy\n");
	return 0;
}

L_快艇骰子

#include<stdio.h>

int a[6];
int max(int a, int b) {
	return a > b ? a : b;
}

void swap(int* a, int* b) {
	int temp = *a;
	*a = *b;
	*b = temp;
}//swap

void QuickSort(int array[], int low, int high) {
	int i = low;
	int j = high;
	if (i >= j) {
		return;
	}
	int temp = array[low];
	while (i != j) {
		while (array[j] >= temp && i < j) {
			j--;
		}
		while (array[i] <= temp && i < j) {
			i++;
		}
		if (i < j) {
			swap(&array[i], &array[j]);
		}
	}
	swap(&array[low], &array[i]);
	QuickSort(array, low, i - 1);
	QuickSort(array, i + 1, high);
}//QuickSort

int main() {
	int n;
	scanf("%d", &n);
	while (n--) {
		int sum_all = 0;
		int sum_1 = 0, sum_2 = 0, sum_3 = 0, sum_4 = 0, sum_5 = 0, sum_6 = 0;
		//分别为数字 1,2,3,4,5,6的个数；
		int sum_3k = 0, sum_4k = 0, sum_5k = 0;
		//有三个点数相同；有四个点数相同；有五个点数相同；
		int sum_3_2 = 0;
		//有三个点数相同，且另外两个点数相同的情况；
		int sum_4_s = 0, sum_5_s = 0;
		//四个连续的情况；五个连续的情况；
		int num_1 = 0, num_2 = 0, num_3 = 0, num_4 = 0, num_5 = 0, num_6 = 0;

		for (int i = 0; i < 5; i++) {
			scanf("%d", &a[i]);
			sum_all += a[i];
		}
		for (int i = 0; i < 5; i++) {
			if (a[i] == 1) sum_1++;
			if (a[i] == 2) sum_2++;
			if (a[i] == 3) sum_3++;
			if (a[i] == 4) sum_4++;
			if (a[i] == 5) sum_5++;
			if (a[i] == 6) sum_6++;
		}
		num_1 = 1 * sum_1;
		num_2 = 2 * sum_2;
		num_3 = 3 * sum_3;
		num_4 = 4 * sum_4;
		num_5 = 5 * sum_5;
		num_6 = 6 * sum_6;
		if (sum_1 == 3 || sum_2 == 3 || sum_3 == 3 || sum_4 == 3 || sum_5 == 3 || sum_6 == 3) {
			if (sum_1 == 2 || sum_2 == 2 || sum_3 == 2 || sum_4 == 2 || sum_5 == 2 || sum_6 == 2)
				sum_3_2 = 25;
			else
				sum_3k = sum_all;
		}
		if (sum_1 == 4 || sum_2 == 4 || sum_3 == 4 || sum_4 == 4 || sum_5 == 4 || sum_6 == 4)
			sum_4k = sum_all;
		if (sum_1 == 5 || sum_2 == 5 || sum_3 == 5 || sum_4 == 5 || sum_5 == 5 || sum_6 == 5)
			sum_5k = 50;
		QuickSort(a, 0, 4);
		if (a[0] + 1 == a[1] && a[1] + 1 == a[2] && a[2] + 1 == a[3] && a[3] + 1 == a[4])
			sum_5_s = 40;
		else if (a[0] + 1 == a[1] && a[1] + 1 == a[2] && a[2] + 1 == a[3])
			sum_4_s = 30;
		else if (a[0] + 1 == a[1] && a[1] + 1 == a[2] && a[2] + 1 == a[4])
			sum_4_s = 30;
		else if (a[0] + 1 == a[2]  && a[2] + 1 == a[3] && a[3] + 1 == a[4])
			sum_4_s = 30;
		else if ( a[1] + 1 == a[2] && a[2] + 1 == a[3] && a[3] + 1 == a[4])
			sum_4_s = 30;
		int ans = max(num_1, max(num_2, max(num_3, max(num_4, max(num_5, max(num_6, max(sum_3k, max(sum_4k, max(sum_5k, max(sum_3_2, max(sum_4_s, max(sum_5_s, sum_all))))))))))));
		printf("%d\n", ans);
	}
	return 0;
}