P5560[Celeste-B]Golden Feather
用最小生成树打表
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int t;
ll n;
int main(){
cin >> t;
while(t--){
cin >> n;
if(n==4||n==10) {
cout << n+1 << "\n";continue;
}
cout << n-1 << "\n";
}
return 0;
}
这简历密密麻麻字太多了，要突出重点，精简