【CS Round #39 (Div. 2 only) A】Removed Pages
2017-10-04 18:44
218 查看
【Link】:
【Description】
【Solution】
每读入一个x;
把a[(x-1)/2]置为1即可;
统计1的个数
【NumberOf WA】
【Reviw】
【Code】
/* */ #include <bits/stdc++.h> #define int long long using namespace std; int n; int a[100000+100]; main(){ scanf("%lld",&n); for (int i = 1;i <= n;i++){ int x; scanf("%lld",&x); a[(x-1)/2]++; } int cnt = 0; for (int i = 0;i <= (int) 1e5;i++) if (a[i]) cnt++; printf("%lld\n",cnt); return 0; }
相关文章推荐
- 【CS Round #39 (Div. 2 only) D】Seven-segment Display
- 【CS Round #39 (Div. 2 only) C】Reconstruct Sum
- 【CS Round #39 (Div. 2 only) B】Circle Elimination
- Codeforces Beta Round #75 (Div. 1 Only) B. Queue 线段树。单点更新
- Codeforces Beta Round #85 (Div. 1 Only) A. Petya and Inequiations 贪心
- codeforces水题100道 第十七题 Codeforces Beta Round #25 (Div. 2 Only) A. IQ test (brute force)
- Codeforces Beta Round #74 (Div. 2 Only)——C
- Codeforces Round #437 (Div. 2 C. Ordering Pizza 贪心 only two types of pizza
- 【CS Round #44 (Div. 2 only) D】Count Squares
- Codeforces Beta Round #22 (Div. 2 Only)-C. System Administrator
- Codeforces Beta Round #6 (Div. 2 Only) C. Alice, Bob and Chocolate 水题
- 03Codeforces Beta Round #92 (Div. 2 Only) _B题
- Codeforces Round #249 (Div. 2 Only)(A-E)
- Codeforces Beta Round #25 (Div. 2 Only) C. Roads in Berland
- Codeforces Beta Round #83 (Div. 1 Only)
- Codeforces Beta Round #6 (Div. 2 Only) E. Exposition
- Codeforces Beta Round #91 (Div. 1 Only) E. Lucky Array
- codeforces水题100道 第二题 Codeforces Beta Round #4 (Div. 2 Only) A. Watermelon (math)
- Codeforces Beta Round #4 (Div. 2 Only)
- Codeforces Beta Round #9 (Div. 2 Only):B