Codeforces Round #511 (Div. 2) (CF 2018.9.21)

版权声明：低调地前行，越努力越幸运！ https://blog.csdn.net/SSYITwin/article/details/82816034

A. Little C Loves 3 I

#include<iostream>
int main()
{
	int n;
	scanf("%d",&n);
	//if(n==3)
	 // printf("1 1 1\n");
	//else
	//{
		int num=n/3;
		if(n%3==0)
		{	if(num%3!=0)
		      printf("%d %d %d\n",num,num,num);
		    else
			  printf("%d %d %d\n",num-2,num+1,num+1);
		}
		else if(n%3==1)
		{
			if(num%3==1)
			  printf("%d %d %d\n",num,num,num+1);
			else if(num%3==0)
			  printf("%d %d %d\n",num-1,num+1,num+1);
			else if(num%3==2)
			  printf("%d %d %d\n",num-1,num-1,num+3);
		}
		else if(n%3==2)
		{
			if(num%3==2)
			   printf("%d %d %d\n",num,num,num+2);
			else if(num%3==1)
			  printf("%d %d %d\n",num,num+1,num+1);
			else if(num%3==0)
			  printf("%d %d %d\n",num-1,num+1,num+2);
		}
	//}
	return 0;
}

B. Cover Points

#include<iostream>
using namespace std;
int main()
{
	int n;
	int num=0;
	int a,b;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d%d",&a,&b);
		num=max(num,a+b);
	}
	printf("%d\n",num);
	return 0;
}