Focus

/* Copyright: xjjppm Author: xjjppm Date: 08-08-17 11:36 Description: Number Theory*/#include <map>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>inline int

题目戳这里分析题目gcdgcd(x,a0)=a1\;\;\;\;gcd(x,a_0)=a_1 ⇒{x=k1∗a1a0=k2∗a1 \Rightarrow\left\{\begin{aligned}x=k_1*a_1\\a_0=k_2*a_1\\\end{aligned}\right.⇒gcd(k1,k2)=1\Rightarrow gcd(k_1,k_2)=1简单证明：假设 gcd(k1,k2)