Educational Codeforces Round 58 (Rated for Div. 2)

A. Minimum Integer

#include<bits/stdc++.h>
using namespace std;
int main(){
	int q,f;
	scanf("%d",&q);
	while(q--){
		f=0;
		int l,r,d;
		scanf("%d%d%d",&l,&r,&d);
			if(l>d)
				printf("%d\n",d);
			else printf("%d\n",(r/d)*d+d);
		}
}

B. Accordion

#include<bits/stdc++.h>
using namespace std;
char s[500005];
int f=0,r=0,j,i;
int main(){
	scanf("%s",s);
	int l=strlen(s);
	for(int i=0;i<l;i++)
		if(f==0&&s[i]=='[')
			f=1;
		else if(f==1&&s[i]==':')
			f=2,j=i;
	for(int i=l-1;i>j;i--)
		if(f==2&&s[i]==']')
			f=3;
		else if(f==3&&s[i]==':')
			f=4;
		else if(f==4&&s[i]=='|')
			r++;
	if(f==4)
		printf("%d\n",r+4);
	else printf("-1\n");
}

E. Polycarp's New Job

#include<bits/stdc++.h>
using namespace std;
struct node{
	int x,y;
}a[500005];
int main(){
	int n,max1=-1,max2=-1;
	char s[3];
	scanf("%d",&n);
	getchar();
	int j=0;
	while(n--){
		int c,d,f=0;
		scanf("%s %d %d",s,&c,&d);
		if(s[0]=='+'){
			if(c>d)
			swap(c,d);
			max1=max(max1,c);
			max2=max(max2,d);
		}
		else {
			if(c>d)
				swap(c,d);
			if(c<max1||d<max2)
			printf("NO\n");
			else printf("YES\n");
		}
	}
}