王小二的博客

吃糖果Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 39168    Accepted Submission(s): 11207Problem DescriptionHOHO，终于从Speakless手

Find a multiple Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8197 Accepted: 3559 Special Judge DescriptionThe input contains N natural (i.e. positive integer) numbers ( N

转载博客(1)容斥原理 ：求在区间[1,m]里有多少个数，与n互质。假设数据不超过int型。实现过程分为两步：1, 求出n的质因子 并保存在数组里面；2, 求出区间[1,m]里面有多少个数与n不互质。 代码：[cpp] view plain copyprint?#include   #include   int p[10]