1117. Eddington Number(25)解题报告
2016-12-31 16:52
239 查看
简单题。
#include <stdio.h> #include <stdlib.h> #define N 100000 int main(int argc, const char * argv[]) { int n, e, *array, tmp, i; setvbuf(stdin, calloc(1 << 20, sizeof(char)), _IOFBF, 1 << 20); scanf("%d", &n); array = (int *)calloc(n + 2, sizeof(int)); for(i = 0; i < n; i++){ scanf("%d", &tmp); if(tmp > n){ array[n + 1]++; } else{ array[tmp]++; } } i = n; e = array[n + 1]; while(i >= 0 && e < i){ e += array[i--]; } printf("%d\n", i); free(array); return 0; }
相关文章推荐
- Solution of 1117. Eddington Number(25)
- 1117. Eddington Number(25)
- PAT_A 1117. Eddington Number(25)
- 1117. Eddington Number(25)-PAT甲级真题
- 1117. Eddington Number(25)[基础逻辑题]
- PAT甲题题解-1117. Eddington Number(25)-(大么个大水题~)
- pat 1117. Eddington Number(25)
- 1117. Eddington Number(25)
- PAT 甲级 1117. Eddington Number(25)
- 1117. Eddington Number(25)
- 1060. 爱丁顿数(25) PAT乙级&&1117. Eddington Number(25) PAT甲级
- 1117. Eddington Number(25)
- 1117. Eddington Number(25)
- 1117. Eddington Number(25)
- 1117. Eddington Number(25)
- 1117. Eddington Number(25)
- 【PAT】【Advanced Level】1117. Eddington Number(25)
- 1117. Eddington Number(25)
- 1117. Eddington Number(25) 模拟
- 1117. Eddington Number(25)