競プロ C++

(＃ｉｎｃｌｕｄｅ　＜ｉｏｓｔｒｅａｍ＞) #include <iostream> (ｒｅｐ（ｉ，０，ｎ）｛｝) rep(i,0,N){} (＃ｉｎｃｌｕｄｅ　＜ｂｉｔｓ／ｓｔｄｃ＋＋．ｈ＞) #include <bits/stdc++.h> (ｌｌ　ｎ，ｍ，ｋ；　ｃｉｎ　＞＞　ｎ　＞＞　ｍ　＞＞　ｋ；) ll N,M,K; cin >> N >> M >> K; (ｕｓｉｎｇ　ｎａｍｅｓｐａｃｅ　ｓｔｄ；) using namespace std; (ｐｒｉｎｔ（ａｎｓ）；) print(ans); (ｃｏｕｔ　＜＜　ａ　＜＜　”　”　＜＜　ｂ　＜＜　ｅｎｄｌ；) cout << a << " " << b << endl; (ｆｏｒ（ａｕｔｏ　＆ｅ：　ｔｒｅｅ［ｃｕｒ］）｛｝) for(auto &e: tree[cur]){} (ｄｐ［ｉ＋１］［ｊ］　＝　ｄｐ［ｉ］［ｊ］　＋　１；) dp[i+1][j] = dp[i][j] + 1; (ｉｎｔ　ａｎｓ　＝　ｎ　＊　ｍ　％　ｍｏｄ；) int ans = N * M % MOD; (ｖｏｉｄ　ｄｆｓ（ｌｌ　ｃｕｒ，　ｌｌ　ｐａｒ）｛｝) void dfs(ll cur, ll par){} (ｖｅｃｔｏｒ＜ｌｐａｉｒ＞　ｌｐ；) vector<lpair> lp; (ｌｐ．ｐｕｓｈ＿ｂａｃｋ（｛ｖ１，　ｖ２｝）；) lp.push_back({v1, v2}); (ｓｏｒｔ（ｖ．ｂｅｇｉｎ（），　ｖ．ｅｎｄ（））；) sort(v.begin(), v.end()); (ｒｅｐ（ｂｉｔ，０，（１ｌｌ＜＜ｎ））｛｝) rep(bit,0,(1LL<<N)){} (ｌｌ　ｔ；　ｃｉｎ　＞＞　ｔ；　ｗｈｉｌｅ（ｔ－－）｛｝) ll T; cin >> T; while(T--){} (ｐｒｉｎｔａ（ａｎｓ，　ａｎｓ．ｓｉｚｅ（））；) printa(ans, ans.size()); (ｍｅｍｓｅｔ（ｄｐ，　－１，　ｓｉｚｅｏｆ（ｄｐ））；) memset(dp, -1, sizeof(dp)); (ｐｒｉｏｒｉｔｙ＿ｑｕｅｕｅ＜ｌｌ，　ｖｅｃｔｏｒ＜ｌｌ＞　＞　ｐｑ；) priority_queue<ll, vector<ll> > pq; (ｗｈｉｌｅ（ｎｏｔ　ｐｑ．ｅｍｐｔｙ（））｛｝) while(not pq.empty()){}