Codeforces Round #634 (Div. 3)A. Candies and Two Sisters

amu_yu

于 2020-04-17 16:55:10 发布

阅读量466

点赞数

分类专栏： code forcess 文章标签： c++

本文链接：https://blog.csdn.net/amu_yu/article/details/105583410

版权

编程竞赛题目，要求计算在给定糖果数n下，如何使得Alice获得的糖果数大于Betty，并且两人的糖果数都是正整数，总和等于n。需要找出满足条件的分配方案数。当n为奇数时，无解；为偶数时，解为(n-2)/2。

摘要由CSDN通过智能技术生成

题目：

A. Candies and Two Sisters time limit per test : 1 second memory limit
per test : 256 megabytes input : standard input output : standard
output There are two sisters Alice and Betty. You have n candies. You
want to distribute these n candies between two sisters in such a way
that: Alice will get a (a>0) candies; Betty will get b (b>0) candies;
each sister will get some integer number of candies; Alice will get a
greater amount of candies than Betty (i.e. a>b); all the candies will
be given to one of two sisters (i.e. a+b=n). Your task is to calculate
the number of ways to distribute exactly n candies between sisters in
a way described above. Candies are indistinguishable. Formally, find
the number of ways to represent n as the sum of n=a+b, where a and b
are positive integers and a>b. You have to answer t independent test
cases. Input