UVA 408－Uniform Generator

UVA 408－Uniform Generator

题目大意：给出Step和Mod，求是否能讲将［0，Mod－1］的序列全部生成

解题思路：俩个数最大公约数等于1就能满足

#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
    long long int a, b;
    while(scanf("%lld%lld", &a, &b) != EOF) {
        long long int m = a;
        long long int n = b;
        if(m > n) {
            long long int t = m;
            m = n;
            n = t;
        }
        long long int x;
        while((x = n % m) != 0) {
            n = m;
            m = x;
        }
        if(m == 1) 
            printf("%10lld%10lld    Good Choice\n", a, b);
        else
            printf("%10lld%10lld    Bad Choice\n", a, b);
        printf("\n");
    }
    return 0;
}