Codeforces Round #577 (Div. 2)A.Fence

A. Fence
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Yura is tasked to build a closed fence in shape of an arbitrary non-degenerate simple quadrilateral. He’s already got three straight fence segments with known lengths a, b, and c. Now he needs to find out some possible integer length d of the fourth straight fence segment so that he can build the fence using these four segments. In other words, the fence should have a quadrilateral shape with side lengths equal to a, b, c, and d. Help Yura, find any possible length of the fourth side.

A non-degenerate simple quadrilateral is such a quadrilateral that no three of its corners lie on the same line, and it does not cross itself.

Input
The first line contains a single integer t — the number of test cases (1≤t≤1000). The next t lines describe the test cases.

Each line contains three integers a, b, and c — the lengths of the three fence segments (1≤a,b,c≤109).

Output
For each test case print a single integer d — the length of the fourth fence segment that is suitable for building the fence. If there are multiple answers, print any. We can show that an answer always exists.

Example
inputCopy
2
1 2 3
12 34 56
outputCopy
4
42
Note
We can build a quadrilateral with sides 1, 2, 3, 4.

We can build a quadrilateral with sides 12, 34, 56, 42.

题意

给你三条边，让你给出另外一条边使得这四条边能够构成四边形

思路

类比三角形，任意三边之和要大于第四边，所以输出三边和-1即可

注意

边长范围为10e9，使用long long 避免爆数据

#include <stdio.h>
int main(void) {
	int t;
	scanf("%d",&t);
	while(t--) {
		long long ans=0;
		for(int i=0;i<3;i++) {
			int temp;
			scanf("%d",&temp);
			ans+=temp;
		}
		printf("%lld\n",ans-1);
	}
}