Dog_dream的博客

A. Benches题意：公园上有n个凳子现上面已经有人坐在上面然后又来m个人将会坐在上面，求这m个人坐下后凳子上可能最多的数目最大值和最小分配的最大值。题解：看是否能把所有数填到与最大值是否一样，剩下的均分然后取最大值，这就是minnum  maxnum就直接为最大值加m#include<cstring>#include<cstdio>#includ...

A:水题不解释不过我是对自己的菜有新的认识了#include<cstring>#include<cstdio>#include<iostream>#include<string>#include<queue>#include<vector>#include<algorithm>#include&

A题解：简单题直接（l+k）/m判断是否小于n#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,b,sizeof(a))#define reg register#define il inlinetypedef long long ll;const int maxn=1...

a:简单的字符串判断前一个字符是否等于后一个字符#include<bits/stdc++.h>using namespace std;int main(){ int n; string s; cin>>n>>s; for(int i=1;i<n;i++){ if(s[i]!=s[i-1]){...

1-题解：简单题#include<bits/stdc++.h>#define clr(a,b) memset(a,b,sizeof(a))#define pb(a) push_back(a);using namespace std;typedef long long ll;const int maxn=100+2;const int minn=100+2;...

B：链接：https://ac.nowcoder.com/acm/contest/903/B来源：牛客网题目描述Icebound hates math. But Imp loves math. One day, Imp gave icebound a problem.The problem is as follows.S=(∑ni=1qi）modpS=(∑i=1nqi）...

B：判断奇数堆的数量为奇数输出n否则0#include<bits/stdc++.h>using namespace std;#define clr(a,b) memset(a,b,sizeof(a))const int maxn=100000+5;int n,s[maxn];int main(){ cin>>n; int ever=0,od...