[卿学姐带我飞]Codeforces Round #410 (Div. 2)_C - Mike and gcd problem

一开始gcd里面gcd(b,a%b)的gcd都没写，还过来39组数据，找了半天错，蠢死了。

#include<bits/stdc++.h>
using namespace std;
const int maxn=100005;
int arr[maxn];
int gcd(int a,int b){
    if(b==0)
        return a;
    else return gcd(b,a%b);
}
int main()
{
    int n; 
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&arr[i]);
    }
    int tem=0;
    for(int i=0;i<n;i++){
        tem=gcd(tem,arr[i]);
    }
    if(tem>1){
        printf("YES\n");
        printf("0\n");
        return 0;
    }
    int ans=0;
    for(int i=0;i<n;i++){
        if(arr[i]%2==1){
            if(arr[i+1]%2==1){
                ans+=1;
            }
            else ans += 2;
            arr[i]=0;arr[i+1]=0;
        }
    }
    printf("YES\n"); 
    printf("%d\n",ans);
    return 0;
}