3 solutions
- 1
Information
- ID
- 593
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 4
- Tags
- # Submissions
- 44
- Accepted
- 22
- Uploaded By
#include <iostream>
using namespace std;
int L,M,k1,k2,a[10001],s;
int main(){
cin>>L>>M;
for(int i=1;i<=M;i++){
cin>>k1>>k2;
for(int j=k1;j<=k2;j++) a[j] = 1;
}
for(int i=0;i<=L;i++) if(a[i]==0) s++;
cout<<s<<"\n";
return 0;
}
#include <iostream>
using namespace std;
int main(){
int L , M , k1 , k2 , a[10001] = {} , s = 0;
cin >> L >> M;
for(int i = 1;i <= M;i++){
cin >> k1 >> k2;
for(int j = k1;j <= k2;j++){
a[j] = 1;
}
}
for(int i = 0;i <= L;i++){
if(a[i] == 0){
s++;
}
}
cout << s;
return 0;
}
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.