| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 3041 | 朱宸赋 | 陶陶摘苹果 | C++ | Accepted | 100 | 0 MS | 252 KB | 427 | 2019-12-12 19:18:08 |
#include <iostream> int main() { int appleh[10], benchh, taoh, bentaoh, i; benchh = 30; for (i=0; i<10; i++) { scanf("%d", &appleh[i]); } scanf("%d", &taoh); bentaoh = benchh + taoh; int n = 0; for (i=0; i<10; i++) { if(appleh[i] <= bentaoh) { n++; } } printf("%d\n", n); return 0; }