2021.1.25寒假打卡Day18

CF #673(Div.3)

A - Odd Divisor

一直除以 2 ，如果最后不是 1 ，就含有Odd Divisor
顺便吐槽一下这奇妙的机翻，真就直译
(原文：Check if n has an odd divisor, )

#include<iostream>
using namespace std;
 
bool have(unsigned long long int n){
	if(n==1) return false;
	else if(n % 2 == 0) return have(n / 2);
	else return true;
}
 
int main(){
	int t;
	cin>>t;
	while(t--){
		unsigned long long n;
		cin>>n;
		if(have(n)) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
	return 0;
}

B - New Year’s Number

~

#include<iostream>
using namespace std;
 
int main(){
	int t;
	cin>>t;
	while(t--){
		long long n;
		cin>>n;
		int a,b;
		a=n/2020;
		b=n%2020;
		if(a>=b) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
	return 0; 
}

E - Advertising Agency

这道RE了 QAQ

#include<iostream>
#include<queue>
using namespace std;
 
priority_queue<int,vector<int>,less<int> > pq;
 
int main(){
	int t;
	cin>>t;
	while(t--){
		
		int n,k;
		cin>>n>>k;
		for(int i=0;i<n;i++){
			int x;cin>>x;
			pq.push(x);
		}
		
		unsigned long long ans=1;
		while(k--){
			int m,cnt=0;
			do{
				++cnt;
				m=pq.top();
				pq.pop();
			}while (pq.top()==m);
			ans*=cnt;
		}
		cout<<ans<<endl;
	}
	return 0; 
}

其他的不会做了