题目链接:https://ac.nowcoder.com/acm/contest/3006#question
题解链接:https://ac.nowcoder.com/discuss/366644?type=101&order=0&pos=5&page=1
A - 模板
因为只能在末尾增加和删除,所以前面只能进行修改。
进行模拟就可以,匹配两个字符串,如果字符不同,就进行修改,最后再加上长度差即可
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string s, s2;
int main(void)
{
int n, m, ans = 0;
cin >> n >> m;
cin >> s >> s2;
int i = 0;
while (i < n && i < m){
if (s[i] == s2[i])
i++;
else if (s[i] != s2[i]){
i++;
ans++;
}
}
ans += abs(n - m);
cout << ans << endl;
return 0;
}
E - Enjoy the game
只要是2的幂次则后手必胜,否则先手必胜
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll a[200];
int main(void)
{
ll n, res = 2;
cin >> n;
int i;
for (i = 0; ; i++){
a[i] = res;
res *= 2;
if (res > n)
break;
}
if (binary_search(a, a + i + 1, n))
cout << "Alice" << endl;
else
cout << "Bob" << endl;
return 0;
}
I - I题是个签到题
一开始忘记了nth_element是从小到大了,错了
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int a[15];
int main(void)
{
int n, m, t;
bool flag = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
t = a[9];
if (t >= m * 0.8)
flag = 1;
else{
nth_element(a + 1, a + n - 2, a + n + 1);
if (t >= a[n - 2]){
flag = 1;
}
}
if (flag) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
J - 牛牛战队的秀场
注意两个人的位置,需要使位置左小右大,否则就交换两个位置的值
#include <cstdio>
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
const double pi = 3.1415926;
double n, r;
double i, j;
int main(void)
{
cin >> n >> r;
cin >> i >> j;
double a = pi / n;
double l = 2 * r * sin(a);
if (i > j) swap(i, j);
double b = min(fabs(i - j), fabs(i + n - j));
printf("%.6lf\n", b * l);
return 0;
}