hdu 1495 非常可乐(规律&BFS)

#include<iostream>
#include<cstdio>
#include<cstring>
 using namespace std;
 int gcd(int a,int b){
 	return !b?a:gcd(b,a%b);
 }
 int main(){
 	int a,b,c;
 	while(scanf("%d%d%d",&a,&b,&c),a){
 		if(a%2==1) printf("NO\n");
 		else{
 			a/=gcd(a,gcd(b,c));
 			if(a%2==1) printf("NO\n");
 			else {
				printf("%d\n",a-1);
 			}
 		}
 	}
 	return 0;
 }