CodeForces - 798C Mike and gcd problem

emm纸老虎的构造题吧，题还是不错的

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int maxn = 100010;
int a[maxn];
int gcd (int a,int b){
    return b==0? a: gcd (b,a%b);
}
int main (){
    int n;
    scanf ("%d",&n);
    int i,j;
    for (i=1;i<=n;i++){
        scanf ("%d",&a[i]);
    }
    int tmp = gcd (a[1],a[2]);
    int flag = 0;
    for (i=3;i<=n;i++){
        tmp = gcd (tmp,a[i]);
        if (tmp==1)
        {
            flag =1;
            break;
        }
    }
    if (tmp==1) flag = 1;
    if (!flag){
        printf("YES\n");
        printf("0\n");
        return 0;
    }
    int ans = 0;
    for (i=1;i<=n;i++){
        if (a[i]%2==1) a[i]=1;
        else a[i] = 0;
    }
    for (i=1;i<n;i++){
        if (a[i]==1&&a[i+1]==1){
            ans++;
            a[i] =a[i+1] =0;
        }
    }
    for (i=1;i<n;i++){
        if (a[i]%2 != a[i+1]%2){
            ans +=2;
            a[i] =a[i+1] = 0;
        }
    }
    printf("YES\n");
    printf("%d\n", ans);
}