C++ :

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n,a[110],g,s,b,q,i;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i]; 
	} 
	
	//求完美偶数
	for(i = 0;i < n;i++){
		q = a[i] / 1000;
		b = a[i] / 100 % 10;
		s = a[i] / 10 % 10;
		g = a[i] % 10;
		if(a[i] >= 10 && a[i] <= 99 || a[i] >= 1000 && a[i] <= 9999){
			if(a[i] % 2 == 0 && q % 2 == 0 && b % 2 == 0 && s % 2 == 0 && g % 2 == 0){
				cout<<a[i]<<endl;
			} 
		} 
	} 
}

Java :

import java.util.Scanner;



public class Main {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int[] a=new int[n];
		for(int i=0;i<n;i++){
			a[i]=sc.nextInt();
		}
		wanMei(a);
	}
	public static void wanMei(int[] a){
		for(int i=0;i<a.length;i++){
			int g=a[i]%10;
			int s=a[i]/10%10;
			int b=a[i]/100%10;
			int q=a[i]/1000;
			if((a[i]>=10&&a[i]<=99&&g%2==0&&s%2==0)||(a[i]>=1000&&a[i]<=9999&&g%2==0&&s%2==0&&b%2==0&&q%2==0)){
				System.out.println(a[i]);
			}
		}
	}
	
	
}

Python :

n = int(input())
m = input().split()
l = []

for v in m:
    l.append(int(v))
for i in range(0, n):
    c = 0
    p = []
    t = l[i]
    # 短除法拆位,并把每一位放入p列表中
    while t > 0:
        p.append(t % 10)
        t //= 10
    # 循环遍历p列表,求出p列表中偶数的个数
    for j in p:
        if j % 2 == 0:
            c += 1
    # l[i]%2是判断整个数是否是偶数,len(p)%2是判断位数是否是偶数,c==len(p)是判断每一位上的数是否是偶数
    if l[i] % 2 == 0 and len(p) % 2 == 0 and c == len(p):
        print(l[i])