Codeforces Round #575 (Div. 3)

A Three Piles of Candies

3个数相加，除以2

#include
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f3f3f3f3f 
const int maxn=300010;


int n,m,k;
int a[maxn];
ll dp[maxn][12];

int main()
{
	int t;scanf("%d",&t);
	while(t--){
		ll a,b,c;
		scanf("%I64d%I64d%I64d",&a,&b,&c);
		a+=b;a+=c;
		printf("%I64d\n",a/2);
	}
	return 0;
}

B Odd Sum Segments

题意：q个查询，给定n和k，把n个数分成k段，让每一段的和都为奇数，无方案输出NO

#include
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f3f3f3f3f 
const int maxn=300010;


int n,q,k;
int a[maxn];

int main()
{
	int t;scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&k);
		vector ve;
		a[0]=0;
		for(int i=1;i