随笔分类 - 容斥原理
摘要:Problem Description Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N.Two inte
阅读全文
摘要:1 #include 2 int num[6] = {2,3,5,7}; 3 int n; 4 int solve() 5 { 6 int ans = 0; //是那四个数的倍数的数的数量 7 for (int i = 1 ; i < (1<<4) ; i++) //选数 8 { 9 int ant = 0...
阅读全文

浙公网安备 33010602011771号