Codeforces Round #735 (Div. 2)（A-D）没有B

Codeforces Round #735 (Div. 2)
A
一道小思维题

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1000100;
int a[N];
signed main()
{int t;cin>>t;while(t--){int n;cin>>n;int cou = 0;for (int i=1;i<=n;i++){cin>>a[i];if (a[i]*a[i-1]>cou) {cou = a[i]*a[i-1];}}cout<<cou<<endl;}
}

C
一个二进制问题

#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[101];
int b[101];
signed main()
{int t;cin >> t;while (t--){int n, m;cin >> n >> m;int cou = -1;for (int i = 0; i < 31; i++){a[i] = m >> i & 1;b[i] = n >> i & 1;if (a[i] == 0&&cou==-1)cou = i;}bool flag = false;int sum = 0;for (int i = 30; ~i; i--){if (flag){sum *= 2;}else{if (a[i] == 0){if (b[i] == 0){sum = sum * 2;}else{flag = true;sum = sum * 2;}}else{if (b[i] == 0){sum = sum * 2 + 1;}else{sum = sum * 2;}}}}if (flag==false) {sum+=pow(2,cou);for (int i=cou-1;~i;i--){if (a[i]!=b[i]) sum-=pow(2,i);}}cout << sum << endl;}
}

D
构造字符串，没啥意思

#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{int t;cin >> t;while (t--){int n;cin >> n;if (n <= 26){for (int i = 0; i < n; i++){printf("%c", 'a' + i);}}else{int cou = 0;if (n % 2==1) cou++;n /= 2;if (n %2 == 0){cou += 2;n--;}n /= 2;// cout<<cou<<" "<<n<<endl;if (cou < 4) n--;else cou-=4;for (int i = 1; i <= n; i++){cout << "a";}printf("%c", 'b' + 1);for (int i = 1; i <= n + 1; i++){cout << "b";}printf("%c", 'b' + 2);for (int i = 1; i <= n + 1; i++){cout << "a";}printf("%c", 'b' + 3);for (int i = 1; i <= n; i++){cout << "b";}printf("%c", 'b' + 4);for (int i = 5; i < cou + 5; i++){printf("%c", 'b' + i);}}cout << endl;}
}

Codeforces Round #735 (Div. 2)（A-D）没有B相关推荐

Codeforces Round #735 (Div. 2)
Codeforces Round #735 (Div. 2) 题海题目知识点 A Cherry B Cobb C Mikasa D Diane E You
20210729-Codeforces Round #735 (Div. 2)
Contest:Codeforces Round #735 (Div. 2) Time:2021/07/30 Rating:893 -> 1035. Thankful for my roomie ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...
Codeforces Round #563 (Div. 2)/CF1174
Codeforces Round #563 (Div. 2)/CF1174 CF1174A Ehab Fails to Be Thanos 其实就是要\(\sum\limits_{i=1}^n a_i ...
构造 Codeforces Round #302 (Div. 2) B Sea and Islands
题目传送门 1 /* 2 题意:在n^n的海洋里是否有k块陆地 3 构造算法:按奇偶性来判断,k小于等于所有点数的一半,交叉输出L/S 4 输出完k个L后,之后全部输出S:) 5 5 10 的例子可以 ...
Codeforces Round #696 (Div. 2) （A ~ E）超高质量题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Codeforces Round #696 (Div. 2) (A ~ E)超高质量题解比赛链接:h ...
Codeforces Round #712 Div.2（A ~ F）超高质量题解（每日训练 Day.15 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Codeforces Round #712 Div.2(A ~ F) 题解比赛链接:https:// ...
Codeforces Round #701 (Div. 2) A ~ F ，6题全，超高质量良心题解【每日亿题】2021/2/13
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 A - Add and Divide B - Replace and Keep Sorted C ...
Codeforces Round #700 (Div. 2) D2 Painting the Array II（最通俗易懂的贪心策略讲解）看不懂来打我 ~
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划整场比赛的A ~ E 6题全,全部题目超高质量题解链接: Codeforces Round #700 ...

Codeforces Round #735 (Div. 2)（A-D）没有B

Codeforces Round #735 (Div. 2)（A-D）没有B相关推荐

最新文章

热门文章