笔者:YY同学
文章目录
因时间有限,这里仅放出 C++ 版本的题解,但请注意:所有题解仅是提供一种可行的思路,并不一定是最优解!!
A - 寻找素数【签到题】
#include<stdio.h>
#include<iostream>
#include<cmath>
using namespace std;
signed main() {
int n;
cin >> n;
long long int num;
int count = 0;
int one = 0;
for (int j = 0; j < n; ++j) {
cin >> num;
if (num == 1) { one++; continue; }
int end = (int)sqrt(num);
for (int i = 2; i <= end; ++i) {
if (num % i == 0) { count++; break; }
}
}
cout << n - count - one << endl;
return 0;
}
B - 究竟能得几分?【String】
#include<stdio.h>
#include<iostream>
using namespace std;
signed main() {
int num;
cin >> num;
string str = "";
for (int k = 0; k < num; ++k) {
cin >> str;
int sum = 0;
int score = 0;
for (int i = 0; i < str.length(); ++i) {
score++;
if (str[i] == 'X') { score = 0; }
sum += score;
}
cout << sum << endl;
}
return 0;
}
C - Super Stairs【迭代递归 / 简单DP】
#include<stdio.h>
#include<iostream>
using namespace std;
long long int dp[15000];
signed main() {
memset(dp, 0, sizeof(dp));
dp[1] = 0;
dp[2] = 1;
dp[3] = 2;
for (int i = 4; i < 15000; ++i) {
dp[i] = dp[i - 1] + dp[i - 2];
}
int n, a;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a);
cout << dp[a] << endl;
}
return 0;
}
D - 谁,亮着?【快速平方】
#include<stdio.h>
#include<iostream>
#include<cmath>
using namespace std;
void print_square(long long int num) {
long long int current = 4;
long long int step = 5;
while (current <= num) {
cout << " " << current;
current += step;
step += 2;
}
}
signed main() {
long long int n;
cin >> n;
cout << 1;
print_square(n);
return 0;
}
E - Decimal to Binary【数组】
#include<stdio.h>
#include<iostream>
#include<vector>
using namespace std;
signed main() {
int a;
while (scanf("%d", &a) != EOF)
{
vector<int> v;
while (a > 1) {
int b = a % 2;
v.push_back(b);
a = a / 2;
}
v.push_back(1);
for (unsigned i = v.size(); i > 0; --i) {
cout << v[i - 1];
}
cout << endl;
}
return 0;
}
F - 天生一对难自弃 【Stack】
#include<stdio.h>
#include<iostream>
#include <sstream>
#include<stack>
using namespace std;
signed main() {
bool flag;
string str;
int n;
cin >> n;
cin.get();
for (int i = 0; i < n; ++i) {
stack<char> s;
flag = true;
getline(cin, str);
for (int j = 0; j < str.length(); ++j) {
if (str[j] == '(') { s.push(str[j]); }
else if (str[j] == ')') {
if (s.empty()) { flag = false; break; }
else if (s.top() == '(') { s.pop(); }
else { flag = false; break; }
}
else if (str[j] == '[') { s.push(str[j]); }
else if (str[j] == ']') {
if (s.empty()) { flag = false; break; }
else if (s.top() == '[') { s.pop(); }
else { flag = false; break; }
}
else { ; }
}
if (!s.empty()) { flag = false; }
if (flag) { cout << "Yes" << endl; }
else { cout << "No" << endl; }
}
return 0;
}
G - All in All【字符串 / 数组】
#include <stdio.h>
#include <string.h>
int main()
{
char s[100005];
char t[100005];
int i, j, sLen, tLen;
while (scanf("%s %s", s, t) != EOF)
{
i = 0;
j = 0;
sLen = strlen(s);
tLen = strlen(t);
for (i = 0, j = 0; i < sLen && j < tLen;)
{
if (s[i] == t[j])
{
i++;
j++;
}
else {
j++;
}
}
if (i == sLen)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
}
return 0;
}
H - 加密专家【替换水题】
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int main()
{
char s1[105];
char s2[105];
int cnt1[26];
int cnt2[26];
int len;
bool isOk;
while(cin >> s1 >> s2)
{
isOk = true;
len = strlen(s1);
for(int i = 0 ; i < 26;++i)
{
cnt1[i] = 0;
cnt2[i] = 0;
}
for(int i = 0; i < len;++i)
{
int curC1 = s1[i] - 'A';
int curC2 = s2[i] - 'A';
cnt1[curC1]++;
cnt2[curC2]++;
}
sort(cnt1, cnt1 + 26);
sort(cnt2, cnt2 + 26);
for(int i = 0 ; i < 26;++i)
{
if(cnt1[i] != cnt2[i])
{
isOk = false;
break;
}
}
if(isOk)
{
cout << "YES" <<endl;
}
else
{
cout << "NO" << endl;
}
}
return 0;
}
I - 方块染色【枚举】
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
string input;
string cube[2];
bool used[3];
while( getline( cin, input ) ){
cube[0] = input.substr( 0, 6 );
cube[1] = input.substr( 6, 6 );
fill( used, used+3, false );
for( int i = 0 ; i < 3 ; i++ ){
for( int j = 0 ; j < 3 ; j++ ){
if( !used[j] &&
((cube[1][j] == cube[0][i] && cube[1][5-j] == cube[0][5-i]) ||
cube[1][5-j] == cube[0][i] && cube[1][j] == cube[0][5-i]) ){
used[j] = true;
break;
}
}
}
if( used[0] && used[1] && used[2] ) printf( "TRUE\n" );
else printf( "FALSE\n" );
}
return 0;
}
J - 最后谁赢了?【威佐夫博弈论】
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
const double k = (sqrt(5.0) + 1.0) / 2.0;
signed main()
{
int n, m;
while (scanf("%d%d", &n, &m) != EOF)
{
if (n > m)
swap(n, m);
if (n == (int)(k * (m - n)))
cout << 0 << endl;
else
cout << 1 << endl;
}
return 0;
}
K - 等式求解【模拟 / DP】
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<cmath>
using namespace std;
int main()
{
int m;
cin >> m;
char exp[260];
double num[300];
double xnum[300];
int p, q;
while (m--)
{
cin >> exp;
char s[10];
int k = 0;
p = 0;
q = 0;
int sig = 1;
int side = 1;
for (int i = 0; i <= strlen(exp); i++)
{
if (exp[i] == '+')
{
s[k] = '\0';
num[p] = atoi(s) * sig * side;
p++;
k = 0;
memset(s, 0, sizeof(s));
sig = 1;
}
else if (exp[i] == '-')
{
s[k] = '\0';
num[p] = atoi(s) * sig * side;
p++;
k = 0;
memset(s, 0, sizeof(s));
sig = -1;
}
else if (exp[i] == 'x')
{
s[k] = '\0';
int c = atoi(s);
if (strlen(s) == 0)
c = 1;
xnum[q] = c * sig * side;
q++;
memset(s, 0, sizeof(s));
k = 0;
}
else if (exp[i] == '=')
{
s[k] = '\0';
num[p] = atoi(s) * sig * side;
p++;
k = 0;
memset(s, 0, sizeof(s));
sig = 1;
side = -1;
}
else if (exp[i] == '\0')
{
s[k] = '\0';
num[p] = atoi(s) * sig * side;
p++;
k = 0;
memset(s, 0, sizeof(s));
}
else
{
s[k] = exp[i];
k++;
}
}
double a1 = 0, a2 = 0;
for (int i = 0; i < p; i++)
{
//cout<<num[i]<<endl;
a1 += num[i];
}
for (int i = 0; i < q; i++)
{
//cout<<xnum[i]<<"x"<<endl;
a2 += xnum[i];
}
//cout<<"a1 = "<<a1<<endl;
//cout<<"a2 = "<<a2<<endl;
if (a2 == 0)
{
if (a1 == 0)
cout << "IDENTITY" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
else
cout << floor(-a1 / a2) << endl;
}
return 0;
}
L - 请勿“插队”【大模拟 + Priority Queue】
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <cstdio>
using namespace std;
queue<int> teams[1005];
queue<int> big_team;
map<int, int> player_to_team;
int main()
{
int t;
int n;
int no;
char cmd[10];
int cases = 1;
while (scanf("%d", &t) != EOF && t)
{
printf("Scenario #%d\n", cases++);
player_to_team.clear();
big_team = queue<int>();
for (int i = 0; i < t; ++i)
{
teams[i] = queue<int>();
scanf("%d", &n);
for (int j = 0; j < n; ++j)
{
scanf("%d", &no);
player_to_team[no] = i;
}
}
while (scanf("%s", cmd))
{
if (cmd[0] == 'S')
{
printf("\n");
break;
}
if (cmd[0] == 'E')
{
scanf("%d", &no);
if (teams[player_to_team[no]].size() == 0)
{
big_team.push(player_to_team[no]);
}
teams[player_to_team[no]].push(no);
}
else if (cmd[0] == 'D')
{
int front_team = big_team.front();
printf("%d\n", teams[front_team].front());
teams[front_team].pop();
if (teams[front_team].size() == 0)
{
big_team.pop();
}
}
}
}
return 0;
}
M - Perfect Server【树状DP】
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
const int N = 10009;
vector<int> g[N];
int dp[N][3];
void dfs(int u, int fa)
{
dp[u][0] = 1;
dp[u][1] = 0;
dp[u][2] = N;
for(int i=0; i<g[u].size(); i++)
{
if(g[u][i] != fa)
{
dfs(g[u][i], u);
dp[u][0] += min(dp[g[u][i]][0], dp[g[u][i]][1]);
dp[u][1] += dp[g[u][i]][2];
}
}
for(int i=0; i<g[u].size(); i++)
{
if(g[u][i] != fa)
dp[u][2] = min(dp[u][2], dp[u][1]+dp[g[u][i]][0]-dp[g[u][i]][2]);
}
}
int main()
{
int n;
while(cin>>n)
{
int a, b;
for(int i=1; i<n; i++)
{
cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
dfs(1, -1);
cout<<min(dp[1][0], dp[1][2])<<endl;
cin>>a;
if(a == -1)
break;
for(int i=1; i<=n; i++)
g[i].clear();
}
return 0;
}
N - 是谁在复读?【字符串数组排序综合】
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define F(x) ((x) / 3 + ((x) % 3 == 1 ? 0 : tb))
#define G(x) ((x) < tb ? (x) * 3 + 1 : ((x) - tb) * 3 + 2)
using namespace std;
const int maxn = 100005;
int wa[maxn], wb[maxn], wc[maxn], wv[maxn], sa[3 * maxn];
int r[maxn], h[maxn], s[3 * maxn];
int n;
char ch[maxn];
int d[maxn][30];
vector<int> res;
int c0(int *s, int a, int b) {
return s[a] == s[b] && s[a + 1] == s[b + 1] && s[a + 2] == s[b + 2];
}
int c12(int k, int *s, int a, int b) {
if (k == 2)
return s[a] < s[b] || s[a] == s[b] && c12(1, s, a + 1, b + 1);
return s[a] < s[b] || s[a] == s[b] && wv[a + 1] < wv[b + 1];
}
void sort(int *s, int *a, int *b, int n, int m) {
for (int i = 0; i < n; i++) wv[i] = s[a[i]];
for (int i = 0; i < m; i++) wc[i] = 0;
for (int i = 0; i < n; i++) wc[wv[i]]++;
for (int i = 1; i < m; i++) wc[i] += wc[i - 1];
for (int i = n - 1; i >= 0; i--) b[--wc[wv[i]]] = a[i];
}
void dc3(int *s, int *sa, int n, int m) {
int i, j, *sn = s + n, *san = sa + n, ta = 0, tb = (n + 1) / 3, tbc = 0, p;
s[n] = s[n + 1] = 0;
for (i = 0; i < n; i++) if (i % 3 != 0) wa[tbc++] = i;
sort(s + 2, wa, wb, tbc, m);
sort(s + 1, wb, wa, tbc, m);
sort(s, wa, wb, tbc, m);
for (p = 1, sn[F(wb[0])] = 0, i = 1; i < tbc; i++)
sn[F(wb[i])] = c0(s, wb[i - 1], wb[i]) ? p - 1 : p++;
if (p < tbc) dc3(sn, san, tbc, p);
else for (i = 0; i < tbc; i++) san[sn[i]] = i;
for (i = 0; i < tbc; i++) if (san[i] < tb) wb[ta++] = san[i] * 3;
if (n % 3 == 1) wb[ta++] = n - 1;
sort(s, wb, wa, ta, m);
for (i = 0; i < tbc; i++) wv[wb[i] = G(san[i])] = i;
for (i = 0, j = 0, p = 0; i < ta && j < tbc; p++)
sa[p] = c12(wb[j] % 3, s, wa[i], wb[j]) ? wa[i++] : wb[j++];
for (; i < ta; p++) sa[p] = wa[i++];
for (; j < tbc; p++) sa[p] = wb[j++];
}
void getheight() {
int i, j, k = 0;
for (i = 1; i <= n; i++) r[sa[i]] = i;
for (i = 0; i < n; h[r[i++]] = k)
for (k ? k-- : 0, j = sa[r[i] - 1]; s[i + k] == s[j + k]; k++);
}
void RMQ_init(){
for(int i = 1; i <= n; i++)d[i][0] = h[i];
for(int j = 1; (1 << j) <= n; j++){
for(int i = 1; i + (1 << j) - 1 <= n; i++){
d[i][j] = min(d[i][j - 1], d[i + (1 << (j - 1))][j - 1]);
}
}
}
int RMQ(int l, int r){
if(l > r) swap(l, r);
int k = 0;
while((1 << (k + 1)) <= r - l + 1)k++;
return min(d[l][k], d[r - (1 << k) + 1][k]);
}
int query(int L, int R){
int x = r[L], y = r[R];
if(x > y) swap(x, y);
x++;
return RMQ(x, y);
}
int main(){
int kase = 0;
while(~scanf("%s", ch) && ch[0] != '#'){
n = strlen(ch);
for(int i = 0; i < n; i++)s[i] = ch[i] - 'a' + 1;
s[n] = 0;
dc3(s, sa, n + 1, 40);
getheight();
RMQ_init();
int ans = 1;
for(int len = 1; len <= n; len++){
for(int j = 0; j + len < n; j += len){
int lcp = query(j, j + len);
int t = lcp / len + 1;
int k = j - (len - lcp % len);
if(k >= 0 && query(k, k + len) >= len)t++;
if(ans < t){
ans = t;
res.clear();
res.push_back(len);
}
else if(ans == t){
res.push_back(len);
}
}
}
printf("Case %d: ", ++kase);
for(int i = 1; i <= n; i++){
bool flag = false;
for(int j = 0; j < res.size(); j++){
//printf("%d\n", res[j]);
if(query(sa[i], sa[i] + res[j]) >= (ans - 1) * res[j]){
flag = true;
for(int k = sa[i]; k < sa[i] + res[j] * ans; k++){
putchar(ch[k]);
}
puts("");
break;
}
}
if(flag)break;
}
}
return 0;
}