Codeforces Round #419 (Div. 2), problem: (B) Karen and Coffee Solution In C/C++

By | 2017-08-07T21:54:09+00:00 August 7th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , |

#include <bits/stdc++.h> using namespace std; const int N=200007; int n,k,q,a,b,p[N],c[N],i; int main(){ cin>>n>>k>>q; for(i=0;i<n;i++)cin>>a>>b,p[a]++,p[b+1]--; for(i=1;i<N;i++)p[i]+=p[i-1],c[i]+=c[i-1]+(p[i]>=k); for(i=0;i<q;i++){cin>>a>>b;cout<<c[b]-c[a-1]<<'\n'; } }

Codeforces Round #419 (Div. 2), problem: (A) Karen and Morning Solution In C/C++

By | 2017-08-07T21:49:10+00:00 August 7th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , |

#include<bits/stdc++.h> int m,s,t; int main(){ t=0; scanf("%d:%d",&m,&s); while(m/10+m%10*10!=s){ s++,t++; if(s>59)m++,s=0; if(m>23)m=0; } printf("%d\n",t); }