非负整数序列 是否是可图化代码实现

非负整数序列 是否是可图化的。

#include<stdio.h>
#define N 3002
int main()
{
int n,i,sum=0,odd=0;
int a[N];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
if(a[i]%2!=0)
odd=odd+1;
}
if(sum%2!=0||odd%2!=0)
{
printf("no\n");
return 0;
}
else
printf("yes\n");
}

#include<stdio.h>
#define N 3002
int main()
{
int n,i,sum=0,odd=0;
int a[N];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
if(a[i]%2!=0)
odd=odd+1;
}
if(sum%2!=0||odd%2!=0)
{
printf("no\n");
return 0;
}
else
printf("yes\n");
}

#include<stdio.h>
#define N 3002
int main()
{
int n,i,sum=0,odd=0;
int a[N];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
if(a[i]%2!=0)
odd=odd+1;
}
if(sum%2!=0||odd%2!=0)
{
printf("no\n");
return 0;
}
else
printf("yes\n");
}

#include<stdio.h>
#define N 3002
int main()
{
int n,i,sum=0,odd=0;
int a[N];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
if(a[i]%2!=0)
odd=odd+1;
}
if(sum%2!=0||odd%2!=0)
{
printf("no\n");
return 0;
}
else
printf("yes\n");
}

#include<stdio.h>
#define N 3002
int main()
{
int n,i,sum=0,odd=0;
int a[N];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
if(a[i]%2!=0)
odd=odd+1;
}
if(sum%2!=0||odd%2!=0)
{
printf("no\n");
return 0;
}
else
printf("yes\n");
}

#include<stdio.h>
#define N 3002
int main()
{
int n,i,sum=0,odd=0;
int a[N];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
if(a[i]%2!=0)
odd=odd+1;
}
if(sum%2!=0||odd%2!=0)
{
printf("no\n");
return 0;
}
else
printf("yes\n");
}

#include<stdio.h>
#define N 3002
int main()
{
int n,i,sum=0,odd=0;
int a[N];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
if(a[i]%2!=0)
odd=odd+1;
}
if(sum%2!=0||odd%2!=0)
{
printf("no\n");
return 0;
}
else
printf("yes\n");
}

第一行输入非负整数的个数，
第二行输入各个非负整数