Codeforces ラウンド #267 (ディビジョン 2)_html/css_WEB-ITnose

#include <cstdio>int main() {	int n, p, q;	int ans = 0;	scanf("%d", &n);	while (n--) {		scanf("%d%d", &p, &q);		if (q - p >= 2) ans++;	}	printf("%d\n", ans);	return 0;}

#include <cstdio>#include <cstring>int n, m, k;int bitcount(int x) {	int ans = 0;	while (x) {		ans += (x&1);		x >>= 1;	}	return ans;}const int N = 1005;int x[N];int main() {	scanf("%d%d%d", &n, &m, &k);	for (int i = 0; i <= m; i++)		scanf("%d", &x[i]);	int ans = 0;	for (int i = 0; i < m; i++) {		if (bitcount(x[i]^x[m]) <= k) ans++;	}	printf("%d\n", ans);	return 0;}

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N = 5005;const long long INF = 0x3f3f3f3f3f3f3f;long long dp[N][N];int n, m, k;long long num[N], pre[N];int main() {	scanf("%d%d%d", &n, &m, &k);	for (int i = 1; i <= n; i++) {		scanf("%lld", &num[i]);		pre[i] = pre[i - 1] + num[i];	}	for (int i = 0; i <= n; i++)		for (int j = 0; j <= k; j++)			dp[i][j] = -INF;	dp[0][0] = 0;	for (int i = 1; i <= n; i++) {		for (int j = 0; j <= k; j++) {			if (j && i >= m)				dp[i][j] = max(dp[i][j], dp[i - m][j - 1] + pre[i] - pre[i - m]);			dp[i][j] = max(dp[i][j], dp[i - 1][j]);		}	}	printf("%lld\n", dp[n][k]);	return 0;}