cf Round #634 (Div. 3)A题

A. Candies and Two Sisters
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
The first line of the input contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

The only line of a test case contains one integer n (1≤n≤2⋅109) — the number of candies you have.

Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.

Example
input
6
7
1
2
3
2000000000
763243547
output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:

a=6, b=1;
a=5, b=2;
a=4, b=3.
题意：给你一个n颗糖，你需要分给Alice和Betty，需要满足以下条件，俩个人都得到了糖，糖只能整颗整颗分，Alice得到的比Betty多，所有糖都分完，请问有多少种方法。
思路：只需要找到1 - (n-1)/2之间有多少整数即可。

#include <iostream>
using namespace std;
int main()
{
    int T;
    scanf("%d", &T);
    while(T--){
        int n;
        scanf("%d", &n);
        printf("%d\n", (n-1)/2);
    }
    return 0;
}