第一道题:切蛋糕 AC
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5 + 7;
int f[N];
int main() {
int n;
scanf("%d", &n);
f[1] = 2; f[2] = 3;
for (int i = 2; i <= n; i++)
f[i] = f[i-1] + i;
printf("%d", f[n]);
return 0;
}
第二道题:单词替换 AC
#include <iostream>
#include <algorithm>
using namespace std;
string s;
int main() {
getline(cin, s);
for (int i = 0; i < s.size(); i++) {
if (s[i]=='a' && s[i-1]=='l' && s[i-2]=='b'
&& s[i+1]=='c' && s[i+2]=='k') s[i] = 'o';
printf("%c", s[i]);
}
return 0;
}
第三道题:打印K型 AC
#include <iostream>
#include <algorithm>
using namespace std;
int n;
int main() {
scanf("%d", &n);
for (int i = -n; i <= n; i++) {
cout << "**";
int x = abs(i);
if (x == 0) cout << "*";
for (int j = 1; j <= x; j++)
cout << " ";
for (int j = 1; j <= x; j++)
cout << "*";
puts("");
}
return 0;
}
第四道题ÿ