PAT B1096

1096 Great beauty number (15 branch )

If it's a positive integer N It can be divided by 4 The sum of two different positive factors , Such a positive integer is called “ Great beauty number ”. This question requires you to judge whether any given positive integer is “ Great beauty number ”.

Input format ：

Enter a positive integer in the first line K（≤10）, The next line shows K One to be tested 、 No more than 104 The positive integer .

Output format ：

For each number that needs to be tested , If it is a large beautiful number, output it on one line Yes, Otherwise output No.

sample input ：

3
18 29 40

sample output ：

Yes
No
Yes

#include <iostream>
#include <cstdio>
using namespace std;
struct factor
{
    int fac[100];
};
int main()
{
    int k;
    scanf("%d",&k);
    int n;
    while(k--)
    {
        factor a;
        scanf("%d",&n);
        int j=0;
        for(int i=1;i<=n/2;++i)
        {
            if(n%i==0)
                a.fac[j++]=i;
        }
        a.fac[j++]=n;
        int flag=0;
        if(j<3)                // The special judgment here is a little superfluous , Don't do this if Statement can also 
        {
            printf("No\n");
            continue;
        }
        for(int i=0;i<j&&!flag;++i)
            for(int k=i+1;k<j&&!flag;++k)
                for(int h=k+1;h<j&&!flag;++h)
                    for(int x=h+1;x<j&&!flag;++x)
                    {
                        int sum=a.fac[i]+a.fac[k]+a.fac[h]+a.fac[x];
                        if(sum%n==0&&flag==0)
                        {
                            printf("Yes\n");
                            flag=1;
                        }
                    }
                    if(flag==0)
                        printf("No\n");
    }

    return 0;
}