摘要： 恢复内容开始 第一题思维题 #include<iostream>using namespace std;int main(){ int n,flag; long long x; cin>>n; flag=0; while(n--){ cin>>x; if(x%2==1&&flag==0){ cout 阅读全文

摘要： CodeForces - 651C Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There a 阅读全文

摘要： #include<iostream>using namespace std;int main(){ int n,i; long long sum,x; cin>>n; sum=0; for(i=1;i<=n;i++){ cin>>x; sum=sum+x-1; if(sum%2){ cout<<"1 阅读全文

摘要： #include<iostream>#include<stdio.h>#include<vector>using namespace std;const int maxn =10005;vector<int>reverse_post;vector<int>node[maxn];vector<int> 阅读全文