Get Even More Visitors To Your Blog, Upgrade To A Business Listing >>

codeforces Fence Problem solution div 2 | codeforces problem for beginner

 codeforces Fence Problem solution div 2-

This Problem is totally based on a property of Quadrilateral before going to solution it is recommended that try this problem yourself first.

Problem Statement-

A. Fence
time limit per test
1 second
memory limit per test
256 megabytes
standard input
standard 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 ab, 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 abc, 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.


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

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


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.


This post first appeared on Technical Keeda, please read the originial post: here

Share the post

codeforces Fence Problem solution div 2 | codeforces problem for beginner


Subscribe to Technical Keeda

Get updates delivered right to your inbox!

Thank you for your subscription