比赛地址：牛客竞赛_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ

A.小红的对错判断

#include<bits/stdc++.h>
using namespace std;
#define ll long long  
#define ull unsigned long longvoid solve() {string ssr;cin>>ssr;int a=ssr.length();if(a==3){if(ssr[0]=='y'||ssr[0]=='Y'){if(ssr[1]=='e'||ssr[1]=='E'){if(ssr[2]=='s'||ssr[2]=='S'){cout<<"accept"<<endl;return;}}}}cout<<"wrong answer"<<endl;
} signed main() {ios::sync_with_stdio(0);cout.tie(0);cin.tie(0);ll t = 1; // std::cin >> t;while (t--) {solve();}
}

B.小红的幂表达

#include <bits/stdc++.h>
using namespace std;int main() {ios::sync_with_stdio(false);cin.tie(nullptr);int x;cin >> x;cout << x << endl;cout<<"="<<x<<"^1"<<endl;for(int i=sqrt(x);i>=2;i--){int sum=0;int j=x;while(1){if(j%i==0){j/=i;sum++;if(j==1){cout<<"="<<i<<"^"<<sum<<endl;break;}}else{break;}}}return 0;
}

C.小红的前缀询问

#include <bits/stdc++.h>
using namespace std;int main() {ios::sync_with_stdio(false);cin.tie(nullptr);int n;cin >> n;vector<long long int> a(n);for (int i = 0; i < n; ++i) {cin >> a[i];}unordered_map<long long int, int> ssr;long long int pairCount = 0;vector<long long int> result(n);for (int i = 0; i < n; ++i) {ssr[a[i]]++;int newPairs = ssr[a[i]] - 1;pairCount += newPairs;result[i] = pairCount;}for (int i = 0; i < n-1; ++i) {cout << result[i] <<" ";}cout << result[n-1];return 0;
}

D.红和小紫的博弈游戏

#include <bits/stdc++.h>
using namespace std;void solve() {long long int a, b, c, d;cin >> a >> b >> c >> d;long long int totalSum = a + b + c + d;if (totalSum == 0||totalSum==1) {cout << "yukari" << endl;return;}int x=a+d;int y=b+c;x=min(x,y);if(x%2){cout << "kou" << endl;}else{cout << "yukari" << endl;}}int main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t;cin >> t;while (t--) {solve();}return 0;
}