![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
CF
文章平均质量分 56
找不到我_
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #720 (Div. 2)
A. Nastia and Nearly Good Numbers#include<bits/stdc++.h>using namespace std;typedef long long ll;int main(){ int t; ll a,b; cin>>t; while(t--){ cin>>a>>b; if(b==1){ cout<<"NO"<<endl; }else{ cout<&l原创 2021-06-10 09:35:11 · 69 阅读 · 0 评论 -
Codeforces Beta Round #108 (Div2)
A - Marks#include<bits/stdc++.h>using namespace std;#define MAXN 110int mx[MAXN];int main(){ int n,m; cin>>n>>m; string s[MAXN]; for(int i=0;i<n;i++){ cin>>s[i]; for(int j=0;j<m;j++){ mx[j]=max(mx[j],s[i][j]-'0原创 2021-05-24 07:28:28 · 61 阅读 · 0 评论 -
Codeforces Round #709 (Div. 2)
A. Prison Break 题意:有axb间牢房。求Michael 最少打通多少面墙,无论他在哪个牢房都可以逃出去题解:一共需要打通axb面墙代码:#include<algorithm>#include<iostream>#include<cstring>#include<string>#include<cmath>#include<map>using namespace std;int main(){原创 2021-05-20 09:47:18 · 66 阅读 · 0 评论 -
Educational Codeforces Round 109 (Rated for Div. 2)
A. Potion-making题意:在每一步操作中中可以加一升水或者一升精华。如果加e升精华和w升水,精华百分含量为e/(e+w) .100%,水的百分含量为w/(e+w) .100%.给精华的百分含量,求最小的操作数题解:e/w=(100-k)/k, 记temp=gcd(100-k,k)最小操作数为(100-k)/temp+k/temp代码:#include<bits/stdc++.h>using namespace std;int gcd(int a,int b){ if(原创 2021-05-17 08:43:17 · 169 阅读 · 0 评论 -
Codeforces Beta Round #107(Div2)
A - Soft Drinking 题意:一共有n位朋友,k瓶l毫升的饮料,还有c个酸橙,每个酸橙会被切成d片,有p克盐。配一瓶酒需要nl毫升饮料,一片酸橙,np克盐,问每个朋友可以配几瓶代码:#include<algorithm>#include<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int main(){ in原创 2021-05-16 13:27:46 · 176 阅读 · 0 评论 -
Codeforces Round #719 (Div. 3)
A. Do Not Be Distracted!#include<bits/stdc++.h>using namespace std;int a[26];int main(){ int t; cin>>t; int n; string s; char c; while(t--){ memset(a,0,sizeof(a)); cin>>n; cin>>s;原创 2021-05-14 09:11:14 · 70 阅读 · 0 评论 -
Codeforces Round #697 (Div. 3)
C. Ball in Berland题意:一个班级有a个男生和b个女生,且有k种男女组合(同一个男生或者女生可以出现在多个组合当中)。每个班中必须有两对组合出席舞会,且这两个组合中男生女生各不相同。让你求出一共有多少种可能的组合方式。题解:代码:...原创 2021-02-10 17:06:45 · 77 阅读 · 0 评论 -
Codeforces Round #705 (Div. 2)
[题目链接]题意:题解:代码:原创 2021-03-13 17:39:46 · 78 阅读 · 0 评论