Codeforces Round #298 (Div. 2) C. Polycarpus' Dice(数学)
来源:互联网 发布:深夜前的五分钟知乎 编辑:程序博客网 时间:2024/06/06 15:03
题目:
http://codeforces.com/contest/534/problem/C
题意:
n个筛子,s为n个筛子的和.给出n个数为每个筛子的最大点数. 求出每个筛子有多少个数是一定不能取的.
思路:
取极限的方法.
每个筛子不能取的点数分别是: 1)当其他筛子取1,此筛子点数大于 s+1-n. 2)当其他筛子取最大值的时候,此筛子小于 s - (sum-a[i]).
AC.
#include <iostream>#include <cstdio>using namespace std;const int maxn = 2e5+5;int a[maxn];int main(){//freopen("in", "r", stdin); int n; long long s; while(~scanf("%d %I64d", &n, &s)) { long long res = 0; for(int i = 0; i < n; ++i) { scanf("%d", &a[i]); res += a[i]; } if(n == 1) { printf("%d\n", a[0]-1); } else { int ans = 0; long long y = 0; for(int i = 0; i < n; ++i) { ans = 0; y = s - n + 1; if(a[i] > y) { ans += (a[i] - y); } y = s - (res - a[i]); if(y > 0) { ans += (y-1); } if(i != n-1) printf("%d ", ans); else printf("%d\n", ans); } } } return 0;}
0 0
- Codeforces Round #298 (Div. 2) C. Polycarpus' Dice(数学)
- Codeforces Round #298 (Div. 2) -- Polycarpus' Dice (数学推理)
- Codeforces Round #298 (Div. 2) C Polycarpus' Dice
- Codeforces Round #298 (Div. 2) C. Polycarpus' Dice(思路)
- #298 (div.2) C. Polycarpus' Dice
- 534C. Polycarpus' Dice(Codeforces Round #298(div2))
- CodeForces 534C Polycarpus' Dice 【数学】
- Codeforces 534C Polycarpus' Dice(数学,公式推导)
- CodeForces 534C - Polycarpus' Dice
- CodeForces 534C Polycarpus' Dice
- Codeforces 534C Polycarpus' Dice(思路)
- Codeforces 534 C. Polycarpus' Dice【思维】
- Polycarpus' Dice CodeForces
- Code Forces 298 C Polycarpus' Dice
- CodeForce 534C Polycarpus' Dice (数学推理)
- CodeForce 534C Polycarpus' Dice (数学推理)
- Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] C 数学
- Codeforces Round #139 (Div. 2) A. Dice Tower
- 浅谈js中的this关键字
- 4.1 MaxProductOfThree
- fatal error C1010: 在查找预编译头时遇到意外的文件结尾。是否忘记了向源中添加“#include "stdafx.h
- Android ScrollView 上推至顶部使控件悬浮
- UITextView的那些坑
- Codeforces Round #298 (Div. 2) C. Polycarpus' Dice(数学)
- [算法第一轮复习] 拓扑排序
- UVA - 10891 Game of Sum
- 解决https证书问题
- GCC 生成的符号表调试信息剖析
- leetcode 25 Reverse Nodes in k-Group
- Oracle 生成批量删除现有表
- 海量数据、高并发优化方案
- Restore IP Addresses--LeetCode