?? 1109.cpp
字號(hào):
/* This Code is Submitted by wywcgs for Problem 1109 on 2005-03-05 at 08:35:07 */
#include <stdio.h>
#include <math.h>
#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
int main()
{
long step, mod, i, MAX, MIN;
double j;
int goodChoice;
while(scanf("%ld %ld", &step, &mod) == 2){
goodChoice = 1;
MAX = max(step,mod);
MIN = min(step,mod);
if((MAX % MIN == 0) && (MIN != 1)){
goodChoice = 0;
}
if(goodChoice){
if(MIN % 2 == 0){
if(MAX % 2 == 0){
goodChoice = 0;
}
if(MIN != 2){
if(MAX % (MIN/2) == 0){
goodChoice = 0;
}
}
}
}
if(goodChoice){
j = sqrt(MIN);
for(i = 3; i <= j; i += 2){
if(MIN % i == 0){
if((MAX % i == 0) || (MAX % (MIN/i) == 0)){
goodChoice = 0;
break;
}
}
}
}
printf("%10d%10d%", step, mod);
printf(" ");
if(goodChoice){
printf("Good Choice\n\n");
}else{
printf("Bad Choice\n\n");
}
}
return 0;
}
?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -