1539A - Contest Start - CodeForces Solution


combinatorics geometry greedy math *1000

Please click on ads to support us..

Python Code:

for nt in range(int(input())):
	n, x, t = map(int,input().split())
	c = min(n-1, t//x)
	print ((c)*(n-c-1) + (c*(c+1))//2)

C++ Code:

#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<ll, ll> pl;

#define N 100010

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin >> t;
    while(t--) {
        ll n, x, t; cin >> n >> x >> t;
        ll d = t / x;
        if(d > n - 1) {
            cout << ((n - 1) * n) / 2 << "\n";
        } else {
            ll nn = max(0LL, n - d);
            cout << (nn * d + ((d - 1) * d) / 2) << "\n";
        }
    }
}


Comments

Submit
0 Comments
More Questions

39F - Pacifist frogs
1451C - String Equality
386A - Second-Price Auction
1690E - Price Maximization
282B - Painting Eggs
440A - Forgotten Episode
233B - Non-square Equation
628B - New Skateboard
262B - Roma and Changing Signs
755C - PolandBall and Forest
456B - Fedya and Maths
376B - IOU
1623B - Game on Ranges
1118A - Water Buying
1462C - Unique Number
301A - Yaroslav and Sequence
38A - Army
38C - Blinds
1197A - DIY Wooden Ladder
1717D - Madoka and The Corruption Scheme
1296D - Fight with Monsters
729D - Sea Battle
788A - Functions again
1245B - Restricted RPS
1490D - Permutation Transformation
1087B - Div Times Mod
1213B - Bad Prices
1726B - Mainak and Interesting Sequence
1726D - Edge Split
1726C - Jatayu's Balanced Bracket Sequence