Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
44212 | tangjunze | 校门外的树 | C++ | Accepted | 0 MS | 260 KB | 416 | 2024-03-29 15:31:49 |
#include<iostream> using namespace std; int main() { int i,j,n,a[2],b[10001],m,count=0; scanf("%d%d",&n,&m); for(i=0;i<=n;i++) b[i]=0; for(i=1;i<=m;i++){ for(j=0;j<2;j++) scanf("%d",&a[j]); for(j=0;j<=n;j++) if(j>=a[0]&&j<=a[1]) b[j]=1; } for(i=0;i<=n;i++) if(b[i]==0) count++; printf("%d",count); return 0; }