1765E - Exchange - CodeForces Solution


math *1000

Please click on ads to support us..

Python Code:

for i in range(int(input())):
    n, a, b = map(int, input().split())

    if b >= a:
        print(str((n+a-1)//a))
        continue
    print('1')

C++ Code:

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

int main ()
{
    int t;
    cin >> t;
    while(t--){

        long long n , a , b;
        cin >> n >> a >> b;
        long long ans = 0;

        if(n <= a || a>b){
            ans = 1;
        }
        else{
           ans = ceil( double(n)/double(a) );
        }

        cout << ans << endl;

    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling