tip:点击题目即可跳转
A. Favorite Sequence
题意:给定n个数,按1,n,2,n-1…的顺序输出
思路:简单题。直接按题意输出即可。
int s[500];
int main()
{
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> s[i];
}
int l = 1;
int r = n;
int f = 0;
while(l<=r) {
if(f) cout << " ";
f = 1;
if(l==r) {
cout << s[l];
break;
}
cout << s[l] << " " << s[r];
l++;
r--;
}
cout << endl;
}
return 0;
}
B. Last Year’s Substring
题意:给定一个字符串,要求删除一个子串使剩下的字符组合为2020
思路:简单思维。满足的题目的要求的情况只有5种,分别为2020xxxx,202xxxx0,20xxxx20,2xxxx020,xxxx2020,特判即可。
int main()
{
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
string s;
cin >> s;
int flag = 0;
if(s[n-4]=='2'&&s[n-3]=='0'&&s[n-2]=='2'&&s[n-1]=='0') {
flag = 1;
}
if(s[0]=='2'&&s[n-3]=='0'&&s[n-2]=='2'&&s[n-1]=='0') {
flag = 1;
}
if(s[0]=='2'&&s[1]=='0'&&s[n-2]=='2'&&s[n-1]=='0') {
flag = 1;
}
if(s[0]=='2'&&s[1]=='0'&&s[2]=='2'&&s[n-1]=='0') {
flag = 1;
}
if(s[0]=='2'&&s[1]=='0'&&s[2]=='2'&&s[3]=='0') {
flag = 1;
}
if(flag) {
cout << "YES" << endl;