随笔分类 -  数论-欧拉函数

 
D. Same GCDs
摘要：题意：给定两个整数a和m，计算有多少个x(0 include include include using namespace std; using LL = long long; LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; } LL phi( 阅读全文
posted @ 2020-02-01 21:14 TT3E 阅读(391) 评论(0) 推荐(1)