标签：href 分组 .net ref problem alc ble == 计算
https://vjudge.net/problem/HDU-3501
不会做啊。。。记一下做法
做法是计算小于n且与n互质的数的和；根据如果gcd(i,n)==1，那么gcd(n-i,n)==1，对这些数两两一组分组，使得每组的和为n
标签：href 分组 .net ref problem alc ble == 计算
原文地址：https://www.cnblogs.com/hehe54321/p/9320485.html
