当前位置：首页 > news >正文

牛客小白月赛117

news 2025/8/18 18:26:10

牛客小白月赛117_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ

好字符串

#include <iostream>
using namespace std;
int n;
char a[110];
int s[26];
int S[26];
int main()
{cin >> n;for (int i = 0; i < n; i++){cin >> a[i];if (a[i] >= 'a' && a[i] <= 'z'){s[a[i] - 'a']++;}else{S[a[i] - 'A']++;}}for (int i = 0; i < 26; i++){if (s[i]){if (!S[i]){cout << "NO";return 0;}}}for (int i = 0; i < 26; i++){if (S[i]){if (!s[i]){cout << "NO";return 0;}}}cout << "YES";return 0;
}

平均数

#include <iostream>
#include <algorithm>
using namespace std;
int a[1010];
int n;
int zhong[1010000];
void solve()
{sort(a, a + n);int t = 0;int num = a[0];int sum = 0;for (int i = 1; i <= n; i++){if (a[i] != a[i - 1]){if (sum >= t){t = sum;sum = 0;num = a[i - 1];}else{sum = 0;}}}zhong[num]++;
}
int main()
{cin >> n;for (int i = 1; i <= n; i++){cin >> a[i];}for (int i = 1; i <= n; i++){for (int j = 1; j <= n; j++){if (i == j){continue;}a[i]++;a[j]--;solve();a[i]--;a[j]++;}}for (int i = 1; i <= 1010000; i++){if (zhong[i]){cout << i << " ";}}return 0;
}

质数

#include <iostream>
using namespace std;
#define int long long
void solve()
{int l, r;cin >> l >> r;if (l == 1 && r == 2){cout << 0 << endl;return;}if (r - l <= 1){cout << -1 << endl;return;}int t = r - l + 1;cout << t % 2 << endl;return;
}
signed main()
{int q;cin >> q;while (q--){solve();}return 0;
}