随机选取[0,m]的数字分配到长度为n的数组中,问:数组平均值等于数组元素值得数组元素的个数,进行累加和后的答案。
#include <iostream>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <assert.h>
#define lowbit(x) (x&(-x))
#define ll long long
#define ull unsigned long long
#define max(a,b) (a>b?a:b)
#define min(a,b) (a>b?b:a)
#define PI acos(-1.0)
#define fir first
#define sec second
#define SZ(x) (x.size())
#define inf 0x3f3f3f3f
#define PB push_back
#define MP make_pair
#define all(x) (x).begin(),(x).end()
#define PII pair<int,int>
#define E 2.7182818284590452353602874713527
using namespace std;
/**********************************************Head-----Template****************************************/
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const ll mod=1000000007;
//const ll phi_mod_prime=mod-1;
ll ksm(ll a,ll b,ll mod){ll ans=1;a%=mod;assert(b>=0);for(;b;b>>=1){if(b&1) ans=ans*a%mod;a=a*a%mod;}return ans;}
ll phi(ll n){ ll rea=n;for(ll i=2;i*i<=n;i++){if(n%i==0){ rea=rea-rea/i;while(n%i==0) n/=i;}}if(n>1) rea=rea-rea/n;return rea;}
//a^(b%phi(mod)+phi(mod))%mod;
void exgcd(int a,int b,int &x,int &y,int &d){if(!b){x=1;y=0;d=a;}else exgcd(b,a%b,y,x,d),y-=a/b*x;}
inline int inv(int a,int p){int x,y,d;exgcd(a,p,x,y,d);x=(x%p+p)%p;return x;}
/********************************Head----Template**********************************************/
const int maxn=1e5+7;
ll d[61][maxn];
ll sum[maxn];
int main(){
int T;read(T);
while(T--){
int n,m;read(n),read(m);
memset(d,0,sizeof d);
d[0][0]=1;
for(int j=0;j<=m;j++) sum[j]=1;
for(int i=1;i<n;i++){
for(int j=0;j<=i*m;j++){
if(j>m)d[i][j]+=((sum[j]-sum[j-m-1])%mod+mod)%mod;
else d[i][j]+=sum[j];
d[i][j]%=mod;
}
for(int j=0;j<=(i+1)*m;j++) sum[j]=(j==0?d[i][j]:sum[j-1]+d[i][j])%mod;
}
ll ans=0;
for(int i=0;i<=m;i++) ans=(ans+d[n-1][i*(n-1)])%mod;
printf("%d\n",ans*n%mod);
}
return 0;
}
/**
链接:https://code.mi.com/problem/list/view?id=148
题意:输入n,m;
表示的是 有n个人,每个人都会获得一个[0,m]的数值,
将这些数求平均值后,累加n个人的数值等于平均值的个数
3 1
0 0 0
1 1 1
所以方案数为6
*/
求一个数因子的个数,因子个数多的排在前面,个数相同小的数放在前面;
#include <iostream>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <assert.h>
#include <functional>
#define lowbit(x) (x&(-x))
#define ll long long
#define ull unsigned long long
#define max(a,b) (a>b?a:b)
#define min(a,b) (a>b?b:a)
#define PI acos(-1.0)
#define fir first
#define sec second
#define SZ(x) (x.size())
#define inf 0x3f3f3f3f
#define PB push_back
#define MP make_pair
#define all(x) (x).begin(),(x).end()
#define PII pair<int,int>
#define E 2.7182818284590452353602874713527
using namespace std;
/**********************************************Head-----Template****************************************/
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
//const ll mod = 10000019;
//const ll phi_mod_prime=mod-1;
ll ksm(ll a,ll b,ll mod){ll ans=1;a%=mod;assert(b>=0);for(;b;b>>=1){if(b&1) ans=ans*a%mod;a=a*a%mod;}return ans;}
ll phi(ll n){ ll rea=n;for(ll i=2;i*i<=n;i++){if(n%i==0){ rea=rea-rea/i;while(n%i==0) n/=i;}}if(n>1) rea=rea-rea/n;return rea;}
//a^(b%phi(mod)+phi(mod))%mod;
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b){x=1;y=0;d=a;}else exgcd(b,a%b,y,x,d),y-=a/b*x;}
inline ll inv(ll a,ll p){ll x,y,d;exgcd(a,p,x,y,d);x=(x%p+p)%p;return x;}
/********************************Head----Template**********************************************/
const int maxn=1e6+7;
int prime[maxn],cnt=0;
void getprime(){
memset(prime,0,sizeof(prime));
for(int i=2;i<maxn;i++){
if(!prime[i]) prime[++cnt]=i;
for(int j=1;j<=cnt;j++){
if(i*prime[j]>=maxn) break;
prime[i*prime[j]]=prime[j];
if(i%prime[j]==0) break;
}
}
}
int zx[maxn],a[maxn];
bool cmp(int a,int b){
if(zx[a]<zx[b]) return zx[a]<zx[b];
return a<b;
}
int main (){
getprime();
for(int i=1;i<maxn;i++) {
int tmp=i;
int ans=1;
for(int j=1;j<=cnt&&prime[j]*prime[j]<=tmp;j++){
if(tmp%prime[j]==0){
int kk=0;
while(tmp%prime[j]==0) kk++,tmp/=prime[j];
ans*=(kk+1);
}
}
if(tmp>1) ans=ans*2;
zx[i]=ans;
}
int k,n;read(k);
read(n);
for(int i=1;i<=n;i++) read(a[i]);
sort(a+1,a+1+n,cmp);
cout<<a[k]<<endl;
return 0;
}
或者这样
#include <iostream>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <assert.h>
#include <functional>
#define lowbit(x) (x&(-x))
#define ll long long
#define ull unsigned long long
#define max(a,b) (a>b?a:b)
#define min(a,b) (a>b?b:a)
#define PI acos(-1.0)
#define fir first
#define sec second
#define SZ(x) (x.size())
#define inf 0x3f3f3f3f
#define PB push_back
#define MP make_pair
#define all(x) (x).begin(),(x).end()
#define PII pair<int,int>
#define E 2.7182818284590452353602874713527
using namespace std;
/**********************************************Head-----Template****************************************/
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
//const ll mod = 10000019;
//const ll phi_mod_prime=mod-1;
ll ksm(ll a,ll b,ll mod){ll ans=1;a%=mod;assert(b>=0);for(;b;b>>=1){if(b&1) ans=ans*a%mod;a=a*a%mod;}return ans;}
ll phi(ll n){ ll rea=n;for(ll i=2;i*i<=n;i++){if(n%i==0){ rea=rea-rea/i;while(n%i==0) n/=i;}}if(n>1) rea=rea-rea/n;return rea;}
//a^(b%phi(mod)+phi(mod))%mod;
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b){x=1;y=0;d=a;}else exgcd(b,a%b,y,x,d),y-=a/b*x;}
inline ll inv(ll a,ll p){ll x,y,d;exgcd(a,p,x,y,d);x=(x%p+p)%p;return x;}
/********************************Head----Template**********************************************/
const int maxn=1e6+7;
int prime[maxn],cnt=0;
void getprime(){
memset(prime,0,sizeof(prime));
for(int i=2;i<maxn;i++){
if(!prime[i]) prime[++cnt]=i;
for(int j=1;j<=cnt;j++){
if(i*prime[j]>=maxn) break;
prime[i*prime[j]]=prime[j];
if(i%prime[j]==0) break;
}
}
}
int zx[maxn],a[maxn];
bool cmp(int a,int b){
if(zx[a]==zx[b]) return a<b;;
return zx[a]<zx[b];
}
int main (){
int n,k;read(k),read(n);
memset(zx,0,sizeof(zx));
for(int i=1;i<maxn;i++) for(int j=i;j<maxn;j+=i) zx[j]++;
for(int i=1;i<=n;i++) read(a[i]);
sort(a+1,a+1+n,cmp);
cout<<a[k]<<endl;
return 0;
}
: