| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 20667 | 陶俊宸 | 配方 | C++ | Wrong Answer | 0 | 0 MS | 256 KB | 316 | 2021-06-19 17:18:31 |
#include<bits/stdc++.h> short k,n,ans; char w[1000][16]; int main(){ scanf("%hd %hd",&k,&n); for(short i=0;i<k;i++) for(short j=0;j<n;j++) scanf("%hd",&w[i][j]); for(short i=0;i<k;i++){ for(short j=0;j<n;j++){ if(w[i][j]=='2') break; if(j==k-1) ans++; } } printf("%hd",ans); return 0; }