1282A - Temporarily unavailable - CodeForces Solution


implementation math *900

Please click on ads to support us..

Python Code:

import math
import sys
import itertools
import fractions

if __name__ == '__main__':
    wtf = sys.stdin.read()
    wtf = wtf.strip().split('\n')
    T = int(wtf[0])
    for t in wtf[1:]:
        a,b,c,r = map(int,t.split())
        d = c-r
        e = c+r
        A = min(a,b)
        B = max(a,b)
        a = A
        b = B
        ans = 0
        if d >= a and d <= b:
            ans += abs(d-a)
        if e >= a and e <= b:
            ans += abs(e-b)
        if ans == 0:
            if d <= a and e >= b:
                ans = 0
            else:
                ans = abs(a-b)
        print(ans)

C++ Code:

#include<iostream>
using namespace std;
int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int a, b, c, r;
        cin >> a >> b >> c >> r;
        int L = max(min(a, b), c - r);
        int R = min(max(a, b), c + r);
        cout << max(a, b) - min(a, b) - max(0, R - L) << endl;
    }
}


Comments

Submit
0 Comments
More Questions

1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols
1213A - Chips Moving
490A - Team Olympiad
233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness