![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
补题
芜湖A飘
这个作者很懒,什么都没留下…
展开
-
C1 4th Round
A - The 3n + 1 problem 水题 #include<cstdio> #include<cstring> #include<iostream> #include<queue> #include<vector> #include<cmath> #include<algorithm> using namespace std; int main(){ int m,n; while(cin>&g原创 2021-08-11 19:23:56 · 58 阅读 · 0 评论 -
SDKD 2021 Summer Training Series B 2nd Round
A - Appeal to the Audience 题意: 判断:树,节点,父节点emmmm签到签到 B - Breaking Branches 题意:给定一长度为n的线段,Alice和Bob轮流切割线段使之成为两个整数段,最后进行切割的人获胜。若Alice 胜,输出“Alice”,和第一步操作数;否则输出“ Bob”。 所以就是切到最后两端都为1,看谁切最后一刀 判断:n的长度要切n-1刀 #include<iostream> #include<cstring> using na原创 2021-08-03 20:43:41 · 123 阅读 · 0 评论 -
SDKD 2021 Summer Training Series C3 2nd Round
A - Friendship of Frog 题意:两个相同字母的最小间隔 判断:水题 #include<bits/stdc++.h> using namespace std; int main(){ int n,minn,N,num=0,flag; cin>>N; while(N--){ num++; string str; cin>>str; n=str.length(); flag=0; for原创 2021-08-06 15:52:14 · 99 阅读 · 0 评论 -
SDKD 2021 Summer Training Series C2 1st Round
A - Park Lighting 题意:每个灯能亮两个格子,最少几个灯能全覆盖 判断:水题 #include<iostream> using namespace std; int main(){ int N,n,m; cin>>N; while(N--){ cin>>n>>m; int k=m*n; if(k%2==0) cout<<k/2<&l原创 2021-08-06 16:00:59 · 69 阅读 · 0 评论 -
SDKD 2021 Summer Training Series C1 1st Round
A - Johnny and Ancient Computer #include<iostream> using namespace std; int main() { int t; cin>>t; while (t--){ long long int a, b; cin>>a>>b; long long int ans; if ((a>b&&a%b!=0)||(b>a&&b%a!=0)){原创 2021-08-02 15:13:50 · 170 阅读 · 4 评论 -
H Repeating Goldbachs
1、输入4<=x<=1000000 2、得到p,q(q>=p) (1)p+q=x (2)p,q均为素数 (3)q-p代替x 3、求能代替几次使x<4 #include <iostream> #include <cstring> #include <math.h> using namespace std; const int MAX_N=1000005; int prime[MAX_N]; int main(){ int n; cin原创 2021-07-31 20:03:09 · 81 阅读 · 0 评论