Codeforces Round #697 (Div. 3)题解
A. Odd Divisor
题意:
给定一个整数N(2≤ N ≤ 10e14),判断它是否能被大于1的奇数整除
思路:
N为奇数直接输出YES。N为偶数,则判断是否为2的次幂,若是则NO,反之YES
代码:
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<string>
#include<queue>
#include<vector>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int main()
{
int t;
cin>>t;
while(t--) {
ll n;
cin>>n;
if(n == 2) {
cout<<"NO"<<endl;
continue;
}
if(n%2 == 1) {
cout<<"YES"<<endl;
}else {
while(n%2==0) {
n/=2;
}
if(n%2 == 1&&n!=1)
cout<<"YES"<<endl;
else {
cout<<"NO"<<endl;
}
}
}
return 0;
}
B. New Year’s Number
题意
给定一个整数N,求N是否由若干个2020与2021组成
思路
N = x*2020 + y*2021
= (x+y)*2020 + y
= a*2020 + b
上式可知a>=b 而a = N/2020,b = N%2020
所以只要a>=b及可
代码
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<string>
#include<queue>
#include<vector>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int main()
{
int t;
cin>>t;
while(t--) {
ll n;
cin>>n;
int sum = 0;
while(n-2020>=0) {
sum++;
n-=2020;
}
if(sum-n>=0) {
cout<<"YES"<<endl;
}else {
cout<<"NO"<<endl;
}
}
return 0;
}
C. Ball in Berland
题意
a个男生,b个女生,给定k个(a,b)组合,求两对互不干扰的组合,问最多有多少总方案
思路
对于组合(ai,bi) 男生ai共有x总组合,女生bi共有y总组合,求剩下k-1组内,有多少组合与(ai,bi)互不干扰,
图可知,求ai∪bi的补集 ∁U(ai∪bi) = k - ai - bi+ai∩bi
ai∩bi = 1,ai = x, bi = y
所以依次对k个组合(a,b)求和即可
代码
D
题意
思路
代码
E. Advertising Agency
题意
给定N个数,选取k个数,使结果尽可能大,求有多少种选择方式
思路
对N个数大道小排序
要使结果最大,所以一定选取的是前k个数
已选取m个数,剩下k-m个数均重复,则需要在重复的数种选出k-m个数出来,及组合数
代码
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1000000000+7;
struct node {
int x,y;
}pe[1005];
int a[1005];
bool cmp(int a, int b) {
return a>b;
}
int C[1005][1005];
void init()
{
for(int i = 0;i < 1005;++i)
{
for(int j = 0;j <= i;++j)
{
if(!j) C[i][j] = 1;
else C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
}
}
int main()
{
int t;
cin>>t;
init();
while(t--){
int n,k;
cin>>n>>k;
for(int i = 0; i < n; i++) {
cin>>a[i];
}
sort(a,a+n,cmp);
memset(pe,0,sizeof(pe));
int cnt = 0;
pe[cnt].x = a[0];
pe[cnt].y++;
cnt++;
for(int i = 1; i < n; i++) {
if(pe[cnt-1].x !=a[i]) {
pe[cnt].x = a[i];
pe[cnt++].y++;
}else {
pe[cnt-1].y++;
}
}
int flag = 0;
for(int i = 0; i < cnt; i++) {
if(pe[i].y<=k) {
k-=pe[i].y;
}else {
cout << C[pe[i].y][k]<<endl;
flag = 1;
break;
}
}
if(!flag)
cout<<"1"<<endl;
}
return 0;
}