1,cf 3-palindrome;2,cf
1,cf 3-palindrome
题意:题意 给定n,求长度为n的以'a','b'或'c'构成的字符串,使得其中不存在长为3的回文子串(如"abc","abca"均符合,但"aba"不符),并使'c'的个数尽可能少
很明显发现用aaba做循环即可,不会出现长度为3的回文子串,也用不到c;
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rep1(i,a,n) for( int i=(a);i<(n);++i)
#define rep2(i,a,n) for( int i=(a);i<=(n);++i)
#define per1(i,n,a) for( int i=(n);i>(a);i--)
#define per2(i,n,a) for( int i=(n);i>=(a);i--)
#define quick_cin() cin.tie(0),cout.tie(0),ios::sync_with_stdio(false)
#define memset(a,i,b) memset((a),(i),sizeof (b))
#define memcpy(a,i,b) memcpy((a),(i),sizeof (b))
#define pro_q priority_queue
#define eb emplace_back
#define endl "\n"
#define lowbit(m) ((-m)&(m))
#define dbug(y) cout<<(y)<<"\n"
#define dbug2(a,b) cout<<(a)<<" "<<(b)<<"\n"
#define dbug3(a,b,c) cout<<(a)<<" "<<(b)<<" "<<(c)<<"\n"
#define dbug4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<"\n"
#define yi first
#define er second
#define tulun int e[N],ne[N],h[N],w[N],idx;
#define add2(a,b) e[idx]=b,ne[idx]=h[a],h[a]=idx++;
#define add3(a,b,c) w[idx]=c,e[idx]=b,ne[idx]=h[a],h[a]=idx++;
#define T_solve() int T;cin>>T;while(T--)solve();
#define pi 3.14159265358979323846
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<long long,long long> PLL;
typedef double dob;
const int N=1010;
signed main()
{
quick_cin();
int n;
cin>>n;
int cs=n/4;
int yu=n%4;
rep2(i,1,cs)
{
cout<<"aabb";
}
string s="aabb";
rep2(i,1,yu)
{
cout<<s[i-1];
}
return 0;
}
2,cf Di-visible Confusion;
题意:给一个长度为 n的序列 a1,a2,…,an,对于每个位置 i,如果 ai%(i+1)!=0,就可以将 ai删掉。删掉之后,后面的数都会往前面移动一位。问能否将序列删成空。
思路:对于 位置i,只要该数存在一个a[i]%j!=0 j属于2~i+1,那么该数就可以删去;否则一定无解;
对于每个ai,按此枚举即可,看似暴力其实枚举时会很快退出第二重循环;
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rep1(i,a,n) for( int i=(a);i<(n);++i)
#define rep2(i,a,n) for( int i=(a);i<=(n);++i)
#define per1(i,n,a) for( int i=(n);i>(a);i--)
#define per2(i,n,a) for( int i=(n);i>=(a);i--)
#define quick_cin() cin.tie(0),cout.tie(0),ios::sync_with_stdio(false)
#define memset(a,i,b) memset((a),(i),sizeof (b))
#define memcpy(a,i,b) memcpy((a),(i),sizeof (b))
#define pro_q priority_queue
#define eb emplace_back
#define endl "\n"
#define lowbit(m) ((-m)&(m))
#define dbug(y) cout<<(y)<<"\n"
#define dbug2(a,b) cout<<(a)<<" "<<(b)<<"\n"
#define dbug3(a,b,c) cout<<(a)<<" "<<(b)<<" "<<(c)<<"\n"
#define dbug4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<"\n"
#define yi first
#define er second
#define tulun int e[N],ne[N],h[N],w[N],idx;
#define add2(a,b) e[idx]=b,ne[idx]=h[a],h[a]=idx++;
#define add3(a,b,c) w[idx]=c,e[idx]=b,ne[idx]=h[a],h[a]=idx++;
#define T_solve() int T;cin>>T;while(T--)solve();
#define pi 3.14159265358979323846
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<long long,long long> PLL;
typedef double dob;
const int N=1e5+10;
int a[N];
void solve()
{
int n;
cin>>n;
rep2(i,1,n)cin>>a[i];
rep2(i,1,n)
{
bool fg=0;
rep2(j,1,i)
{
if(a[i]%(j+1))
{
fg=1;
break;
}
}
if(!fg)
{
dbug("NO");
return;
}
}
dbug("YES");
}
signed main()
{
quick_cin();
T_solve();
return 0;
}