Codeforces Round 860 (Div. 2) 题解

最新推荐文章于 2023-05-05 10:59:38 发布
最新推荐文章于 2023-05-05 10:59:38 发布
阅读量1k 收藏
点赞数 1
分类专栏： 比赛题解 数论 文章标签： c++ 图论 算法
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/nike0good/article/details/129839882
版权

A Showstopper

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
int a[111],b[111];
int main()
{
//	freopen("A.in","r",stdin);
//	freopen(".out","w",stdout);
	
	int t=read();
	while(t--) {
		int n=read();
		For(i,n) a[i]=read();
		For(i,n) b[i]=read();
		For(i,n) if(a[i]>b[i]) swap(a[i],b[i]);
		int p=*max_element(a+1,a+1+n);
		int q=*max_element(b+1,b+1+n);
		if(p==a[n]&&q==b[n]) puts("Yes");else puts("No");
	}
	
	return 0;
}

B Three Sevens

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
#define MAXN (50100)
vi a[MAXN];
bool b[MAXN];
int m;
bool ck() {
	vi ans;
	ForD(i,m) {
		bool fl=0;
		for(int p:a[i]) {
			if(!b[p]) {
				b[p]=1;
				if(!fl) ans.pb(p);
				fl=1;
			}				
		}
		if(!fl) return 0;
	}
	reverse(ALL(ans));
	for(int i:ans) cout<<i<<' ';
	cout<<endl;return 1;
}
int main()
{
//	freopen("B.in","r",stdin);
//	freopen(".out","w",stdout);
	int T=read();
	while(T--) {
		m=read();
		For(i,m) {
			int p=read();
			while(p--) {
				int c=read();
				a[i].pb(c);
				b[c]=0;
			}
		}
		if(!ck()) puts("-1");
		For(i,m) a[i].resize(0);
	}
	
	
	return 0;
}

C

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
#define MAXN (202020)
int n;
ll a[MAXN],b[MAXN];
ll __gcd(ll a,ll b){
	if(!b) return a;return __gcd(b,a%b);
}
ll __lcm(ll a,ll b){
	return a/__gcd(a,b)*b;
}
int main()
{
//	freopen("C.in","r",stdin);
//	freopen(".out","w",stdout);
	int T=read();
	while(T--) {
		n=read();
		For(i,n) a[i]=read(),b[i]=read();
		ll p=0,q=0,ans=0;
		For(i,n) {
			ll mi=b[i];
			ll ma=b[i]*a[i];
			if(!p && !q) {
				p=mi,q=ma;
			}
			else {
				p=__lcm(p,mi);
				q=__gcd(q,ma);
				if(q%p!=0) {
					++ans;
					p=mi,q=ma;
				}
			}
		}
		cout<<ans+1<<endl;
	}
	
	
	return 0;
}

D Shocking Arrangement

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
ll a[301000],ans[301000];
int main()
{
//	freopen("D.in","r",stdin);
//	freopen(".out","w",stdout);
	
	int T=read();
	while(T--) {
		int n=read();
		For(i,n) a[i]=read();
		int p=*max_element(a+1,a+1+n);
		int q=*min_element(a+1,a+1+n);
		if(p<=0||q>=0) puts("No");
		else {
			vi v[2];
			For(i,n) {
				if(a[i]>0) v[0].pb(a[i]);
				else v[1].pb(a[i]);
			}
			puts("Yes");
			ll s=0;
			int p0=0,p1=0;
			For(i,n) {
				int c;
				if(s<0 || (s==0 &&p0<SI(v[0])) ) {
					c=v[0][p0++];
				} else {
					c=v[1][p1++];
				}
				s+=c;
				ans[i]=c;
			}
			PRi(ans,n)
		}
	}
	
	return 0;
}

E Multitest Generator

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
#define MAXN (301000)
ll a[MAXN];
ll f[MAXN];
ll ans[MAXN];
ll ma[MAXN],sfa[MAXN];
ll la[MAXN];
int main()
{
	freopen("E.in","r",stdin);
//	freopen(".out","w",stdout);
	int T=read();
	while(T--) {
		int n=read();
		For(i,n) a[i]=read();
		For(i,n) f[i]=-1; f[n+1]=0;
		ForD(i,n) {
			if(i+a[i]+1<=n+1 && f[i+a[i]+1]!=-1)
			f[i]=f[i+a[i]+1]+1;
		}
		ma[n+1]=0;
		ForD(i,n) ma[i]=max(ma[i+1],f[i]);
//		PRi(f,n)
//		PRi(ma,n)
		int fma=1;
		ForD(i,n) if(f[i]==fma) la[fma]=i,++fma;
		ForD(i,n) {
			sfa[i]=ma[i+1]+1;
			if(i+a[i]+1<=n+1)
				gmax(sfa[i],1+sfa[i+a[i]+1])
		}
		
		For(i,n) ans[i]=2;
		ForD(i,n-1) {
			if(a[i]==f[i+1]) ans[i]=0;
		}
		ForD(i,n-1) if(ans[i]==2) {
			if(f[i+1]!=-1) ans[i]=1;
			else if(a[i]==1) ans[i]=1;
			else if(a[i]<=sfa[i+1] ) ans[i]=1;
		}
		PRi(ans,(n-1))
	}
	return 0;
}

F Gifts from Grandfather Ahmed

from any 2 n − 1 2n−1 2n−1 integers, you can choose n n n with a sum divisible by n n n (Erdős–Ginzburg–Ziv theorem)
所以直接暴力对最小的班级暴力背包，最后最大的那个加一个元素

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
#define MAXN (301)
ll a[MAXN];
ll p[MAXN],s[MAXN];
vi v;
vi ans[1000];
int main()
{
//	freopen("F.in","r",stdin);
//	freopen(".out","w",stdout);
	int T=1;
	while(T--) {
		int n=read(),k=read();
		For(i,n) a[i]=read(),v.pb(a[i]);
		ll pans=0;
		For(i,k) s[i]=read();
		iota(p+1,p+1+k,1);
		sort(p+1,p+1+k,[&](int a,int b) {return s[a]<s[b]; } );
		For(tt,k) {
			int i=p[tt];
			if(tt<k) {
				vector<vector<vector<int> > > f(SI(v)+1, vector<vector<int> >(s[i]+1, vector<int>(s[i],0)));
				vector<vector<vector<int> > > pr(SI(v)+1, vector<vector<int> >(s[i]+1, vector<int>(s[i],0)));
				f[0][0][0]=1;
				int sz=s[i];
				Rep(i,SI(v)) Rep(j,min(i,sz)+1 ) Rep(k,sz) {
					if(f[i][j][k]) {
						f[i+1][j][k]=1;
						if(j<sz)f[i+1][j+1][(k+v[i])%sz]=1;
					}
				}
				int x=SI(v),j=sz,k=0;
				vi id;
				assert(f[x][j][k]);
				while(j>0) {
					if(x>j&f[x-1][j][k]) --x;
					else {
						x--,j--,k=((k-v[x])%sz+sz)%sz;
						ans[i].pb(v[x]);
						v.erase(v.begin()+x);
					}
				}
				
			}
			else {
				ll t=0;
				for(auto p:v) t+=p,ans[i].pb(p);
				pans=s[i]-t%s[i];
				ans[i].pb(pans);
			}
		}

		cout<<pans<<endl;
		For(i,k) {
			for(auto j:ans[i]) cout<<j<<' ';
			cout<<endl;
		}
		For(i,k) ans[i].resize(0);
		
	}
	return 0;
}
nike0good
关注
  • 1
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Educational Codeforces Round 83 (Rated for Div. 2) D
01-20
今天CF被D恶心到了，写个题解重新整理下思路，（20开始想，25写完暴力代码，1.30才过，优化后的。。 核心思路就是在暴力的基础上进行组合数等差加速。 C(n-2,i-1)*C(j-1,n-2)*(i-1) __ j: n-1 -> m 我们发现内层...
Codeforces Round #723 (Div. 2).md
10-13
Codeforces Round #723 (Div. 2).md
Codeforces Round 860 (Div. 2)
WQhuanm的博客
03-28 354
【代码】Codeforces Round 860 (Div. 2)
Codeforces Round 860 (Div. 2) （A-D）
gfyy_bkj的博客
03-27 541
文章目录 A.Showstopper【贪心，模拟】 B.Three Sevens【STL（邻接表）、倒着贪心】 C.Candy Store【整除问题，贪心】 D.Shocking Arrangement【结论题、数学】
2023.03.26 CodeforcesRound 860 (Div2) A~E
Orangechengqi的博客
03-28 169
A~E题解
Educational Codeforces Round 157D. XOR Construction
最新发布
11-06
Educational Codeforces Round 157D. XOR Construction
Codeforces Round #628 (Div. 2)
01-03
给两两节点放一个数字（0~n-2 唯一） 给你一棵树，求所有任意两节点相连的路以外的路上的数字的最小值最小 思路 构造 若一个点连了三条边及以上，则这个点的边从最小值开始赋值。其他边从最大点开始赋值。 证明：一...
【Codeforces Round#620 (Div. 2)】B. Longest Palindrome 题解
01-06
题目链接：B. Longest Palindrome 题目 Returning back to problem solving, Gildong is now studying about palindromes. He learned that a palindrome is a string that is the same as its reverse....
Codeforces Round 860 (Div. 2)题解
qq_60653991的博客
03-27 516
比如我现在是提供三组数据：1 2 3 4。
Codeforces Round 860 Div. 2 题解
m0_53089164的博客
03-27 761
You are given two arrays a1,a2,…,anand b1,b2,…,bnIn one operation, you can choose any integer i from 11 to n and swap the numbers ai and bi.Determine whether, after using any (possibly zero) number of operations, the following two conditions can be satisfi
Codeforces Round 860 (Div. 2) A-E
过路人丶的博客
04-03 122
0的情况也很好判断，令vis[i]为i~n的连续次数，那么a[i] == vis[i+1]答案就为0。1的情况就有几种了，一种是该i的值，当vis[i+1]连续，一种是该a[i+1]的值，令a[i] <= ma[i+1]，这里令ma[i]令i~n连续的最大值。还有一种情况是改变i + a[i] + 1的值，因为vis[i+1]不连续，那么如果i+1+a[i+1]<=n，那么vis[i+1+a[i+1]+1]肯定也是不连续的，因此还可以不改变i+1的值，该i + a[i] +1的值。
Codeforces Round 860 (Div. 2) 题解集
larryyu_cs的博客
03-30 224
Codeforces Round 860 (Div. 2) 题解集 包含 CF1798B Three Sevens CF1798C Candy Store
Codeforces Round #800 (Div. 2)
JZK-Keven 的博客
06-25 377
Codeforces Round #800 (Div. 2)
【codeforces】【比赛题解】#861 CF Round #434 (Div.2)
weixin_30782331的博客
10-13 224
本来是rated，现在变成unrated，你说气不气。 链接。 【A】k-凑整 题意： 一个正整数\(n\)的\(k\)-凑整数是最小的正整数\(x\)使得\(x\)在十进制下末尾有\(k\)个或更多的\(0\)并且\(n\)整除\(x\)。 举个例子：\(375\)的\(4\)-凑整数是\(375\cdot80=30000\)。\(30000\)是最小的整数使得末尾有\(4\...
B. Three Sevens（贪心）
ck的博客
03-27 227
B. Three Sevens（贪心）
Codeforces Round 868 (Div. 2)A.B.C
m0_55682843的博客
05-05 493
一个数组如果有两个1，那么特点数为1；-1也是如此，那么我们可以枚举1的数量，如果1提供的特点数和-1的提供特点数之和为k，那么就是可以构造，同时我们也知道了1和-1的数量。有一个数组a，里面只存在1和-1，现在可以选择任意两个位置，但是不能重合，如果两个位置的数乘积为1，那么特点数累加，题目给定一个n和k，要求构造一个长度为n的数组，使特点数为k。如果一个数有两个相同的质因子，那么这个数就是强合性的，如4，9.如果一个数只有两个不同的质因子，那么就不是，如6，如果有3个质因子，那么就会是，如30.
E. Multitest Generator（dp）
ck的博客
03-28 82
E. Multitest Generator（dp）
Codeforces Round 892 (Div. 2)
08-14
抱歉，根据提供的引用内容，我无法理解你具体想要问什么问题。请提供更清晰明确的问题，我将竭诚为你解答。<span class="em">1</span><span class="em">2</span><span class="em">3</span> #### 引用[.reference_title] - *1* [Codeforces Round 860 (Div. 2)题解](https://blog.csdn.net/qq_60653991/article/details/129802687)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 33.333333333333336%"] - *2* [【Codeforces】 Codeforces Round 865 (Div. 2) （补赛）](https://blog.csdn.net/t_mod/article/details/130104033)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 33.333333333333336%"] - *3* [Codeforces Round 872 (Div. 2)（前三道](https://blog.csdn.net/qq_68286180/article/details/130570952)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 33.333333333333336%"] [ .reference_list ]

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值