這題是跟竹子compare時(shí)發(fā)現(xiàn)的，一直不會(huì)打代碼，今天狠狠心學(xué)了學(xué)，打完了，可以加到模板里了。

/** hdu1796/win.cpp* Created on: 2012-8-20* Author : ben*/ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <ctime> #include <iostream> #include <algorithm> #include <queue> #include <set> #include <map> #include <stack> #include <string> #include <vector> #include <deque> #include <list> #include <functional> #include <numeric> #include <cctype> using namespace std; const int MAXM = 15; typedef long long LL; int N, M, data[MAXM]; LL gcd(LL a, LL b) {LL r;while(b) {r = a % b;a = b, b = r;}return a; } LL getlcm(LL a, LL b) {LL c = gcd(a, b);return a / c * b; } /*** now當(dāng)前點(diǎn)序號(hào)* count加入容斥的個(gè)數(shù)*/ void dfs(int now, int count, LL lcm, LL &ans) {lcm = getlcm(lcm, data[now]);if(count % 2 == 0) {ans -= (N - 1) / lcm;}else {ans += (N - 1) / lcm;}for(int i = now + 1; i < M; i++) {dfs(i, count + 1, lcm, ans);} } LL work(int N, int M) {LL ans = 0;for(int i = 0; i < M; i++) {dfs(i, 1, data[i], ans);}return ans; } int main() { #ifndef ONLINE_JUDGEfreopen("data.in", "r", stdin); #endifwhile(scanf("%d%d", &N, &M) == 2) {int m = 0;for(int i = 0; i < M; i++) {scanf("%d", &data[m]);if(data[m] > 0) {m++;}}M = m;printf("%I64d\n", work(N, M));}return 0; }

轉(zhuǎn)載于:https://www.cnblogs.com/moonbay/archive/2012/08/26/2657792.html

總結(jié)

以上是生活随笔為你收集整理的hdu1796容斥原理的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。