Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
38673 | chenyifei | 校门外的树 | C++ | Wrong Answer | 0 MS | 292 KB | 423 | 2024-01-27 21:12:40 |
#include <iostream> using namespace std; int main() { int tree[10000],l,m,a[100],s=0; int i,j; cin>>l>>m; for(i=0;i<2*m;i++){ cin>>a[i]; } for(i=0;i<=l;i++){ tree[i]=1; } for(i=0;i<m;i++){ for(j=a[2*i];j<=a[2*i+1];j++) { tree[j]=0; } } for(i=0;i<=l;i++){ s=s+tree[i]; } cout<<s; return 0; }