Codeforces Round #246 (Div. 2) A,B,C,D
来源:互联网 发布:php 加一个月 编辑:程序博客网 时间:2024/05/03 23:06
A.水题,输出图形
B.水题
C.概率题
/*m, n最大数为k的总数为 k^n - (k-1)^n所以最大数为k的期望为 (k^n - (k-1)^n) / (m^n)*/#include<bits/stdc++.h>using namespace std;int main(){ int n, m; int i, j; scanf("%d%d", &m, &n); double ans = m; for(i=1; i<=m-1; ++i) { double x = i*1.0/m; ans = ans - pow(x, n); } printf("%.12f\n", ans); return 0;}
D. 状态压缩DP
#include<bits/stdc++.h>using namespace std;int pri[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};int dp[105][1<<16];int p[105][1<<16];int mask[60]; //mask[i]已二进制形式表示是否含有pri[j]int a[105];int main(){ int n, i, j, k; for(i=1; i<60; ++i) for(j=0; j<16; ++j) if(i%pri[j]==0) mask[i] |= 1<<j; scanf("%d", &n); for(i=1; i<=n; ++i) scanf("%d", &a[i]); memset(dp, 0x3f, sizeof dp ); dp[0][0] = 0; for(i=1; i<=n; ++i) { for(j=0; j< (1<<16); ++j) for(k=1; k<60; ++k) if( (mask[k]&j)==0) { if(dp[i][j|mask[k]]>dp[i-1][j] + abs(a[i]-k)) { dp[i][j|mask[k]] = dp[i-1][j] + abs(a[i]-k); p[i][j|mask[k]] = k; } } } vector<int> ans; for(int i=n, m=min_element(dp[i], dp[i]+(1<<16)) - dp[i]; i>0; m ^= mask[p[i][m]], --i) ans.push_back(p[i][m]); for(i=1; i<=n; ++i) printf("%d ", ans[n-i]); return 0;}
1 0
- Codeforces Round #246 (Div. 2) A,B,C,D
- Codeforces Round #179 (Div. 2)A、B、C、D
- Codeforces Round #186 (Div. 2)A、B、C、D、E
- Codeforces Round #202 (Div. 2) (A、B、C、D)
- Codeforces Round #211 (Div. 2)(A,B,C,D)
- Codeforces Round #220 (Div. 2)(A,B,C,D)
- Codeforces Round #231 (Div. 2)A, B, C, D
- Codeforces Round #258 (Div. 2)-(A,B,C,D,E)
- Codeforces Round #261 (Div. 2) A,B,C,D,E
- Codeforces Round #259 (Div. 2) A/B/C/D
- Codeforces Round #257 (Div. 2) A/B/C/D
- Codeforces Round #256 (Div. 2) A/B/C/D
- Codeforces Round #262 (Div. 2)-A,B,C,D
- Codeforces Round #263 (Div. 2) A,B,C,D,E
- Codeforces Round #264 (Div. 2) A,B,C,D,E
- Codeforces Round #276 (Div. 2) A B C D
- Codeforces Round #277 (Div. 2) A,B,C,D,E
- Codeforces Round #277.5 (Div. 2) A B C D
- Android permission 访问权限大全
- cocos2d-x 3.1.1 学习笔记(二) 基本动作、动画详解
- python类库31[DOM+SAX解析XML和HTML]
- Eclipse中设置作者日期等信息
- 关于用户批量操作checkbox选项的若干实际问题解决
- Codeforces Round #246 (Div. 2) A,B,C,D
- 思科网络技术学院教程实验——拓扑布局和建立小型网络
- hdu 3068 最长回文
- JSP和Servlet面试题精选
- Tomcat目录及作用
- MyEclipse 中各种 libraries 的含义
- Dialog
- 优化MySQL数据库性能的八大巧方法
- android项目剖解之ViewPager+Fragment 实现tabhost效果