Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
64770 | fengxiaohang | 甲流病人初筛 | C++ | Accepted | 1 MS | 264 KB | 441 | 2025-04-25 17:09:44 |
#include<iostream> using namespace std; struct node{ string name; float tmpr; bool coug; bool y; }s[200]; int main() { int n; cin>>n; int cnt=0; for(int i=0;i<n;i++){ cin>>s[i].name>>s[i].tmpr>>s[i].coug; if(s[i].tmpr>=37.5&&s[i].coug==1){ s[i].y=1; cnt++; } else{ s[i].y=0; } } for(int i=0;i<n;i++){ if(s[i].y==1){ cout<<s[i].name<<endl; } } cout<<cnt; return 0; }