c++求解 爱因斯坦迷题

#include<stdio.h>
#include<algorithm.>
enum Person{ENG,SWE,DEN,NOR,GER};
enum House{RED,GREEN,WHITE,YELLOW,BLUE};
enum Pet{DOG,BIRD,CAT,HORSE,FISH};
enum Drink{TEA,COFFEE,MILK,BEER,WATER};
enum Cigar{PALLMALL,DUNHILL,BLENDS,BLUEMASTER,PRINCE};
struct Scene
{
Person person[5];
House house[5];
Pet pet[5];
Drink drink[5];
Cigar cigar[5];
};
int PosByPerson(Person p)
{
for(int i=0;i<5;i++)
{
if(scene.person[i]==p)
return i;
}
}
int PosByHouse(House h)
{
for(int i=0;i<5;i++)
{
if(scene.house[i]==h)
return i;
}
}
int PosByCigar(Cigar c)
{
for(int i=0;i<5;i++)
{
if(scene.cigar[i]==c)
return i;
}
}
int PosByPet(Pet p)
{
for(int i=0;i<5;i++)
{
if(scene.pet[i]==p)
return i;
}
}
int PosByDrink(Drink d)