fork download
copy 
  1.  
  2.     #include <bits/stdc++.h>
  3.  
  4.     using namespace std;
  5.  
  6.     using ll = long long;
  7.     const int MOD = 1000000007; 
  8.     const int MOD2 =  998244353; 
  9.     const ll INF = 1e18;
  10.     const int MX = 1000001; //check the limits, dummy
  11.  
  12.  
  13.     ll modExp(ll base, ll power) {
  14.         if (power == 0) {
  15.             return 1;
  16.         } else {
  17.             ll cur = modExp(base, power / 2); cur = cur * cur; cur = cur % MOD;
  18.             if (power % 2 == 1) cur = cur * base;
  19.             cur = cur % MOD;
  20.             return cur;
  21.         }
  22.     }
  23.  
  24.     ll inv(ll base) {
  25.         return modExp(base, MOD-2);
  26.     }
  27.  
  28.  
  29.     ll mul(ll A, ll B) {
  30.         return (A*B)%MOD;
  31.     }
  32.  
  33.     ll add(ll A, ll B) {
  34.         return (A+B)%MOD;
  35.     }
  36.  
  37.     ll dvd(ll A, ll B) {
  38.         return mul(A, inv(B));
  39.     }
  40.  
  41.     ll sub(ll A, ll B) {
  42.         return (A-B+MOD)%MOD;
  43.     }
  44.  
  45.     ll* facs = new ll[MX];
  46.     ll* facInvs = new ll[MX];
  47.  
  48.     ll choose(ll a, ll b) {
  49.         if (b > a) return 0;
  50.         if (a < 0) return 0;
  51.         if (b < 0) return 0;
  52.         ll cur = facs[a];
  53.         cur = mul(cur, facInvs[b]);
  54.         cur = mul(cur, facInvs[a-b]);
  55.         return cur;
  56.     }
  57.  
  58.     void initFacs() {
  59.         facs[0] = 1; 
  60.         facInvs[0] = 1;
  61.         for (int i = 1 ; i < MX ; i ++ ) {
  62.             facs[i] = (facs[i-1] * i) % MOD;
  63.             facInvs[i] = inv(facs[i]);
  64.         }
  65.     }
  66.     int main()  {
  67.         ios_base::sync_with_stdio(0); cin.tie(0);  
  68.         int t ; cin >> t; 
  69.         while (t --) {
  70.             ll n,b,c; cin >> n >> b >> c; 
  71.  
  72.             if (b == 0) {
  73.                 if (c >= n) {
  74.                     cout << n << endl;
  75.                 } else if (c ==  (n - 1)  || c == (n - 2)) {
  76.                     cout << n - 1 << endl;
  77.                 } else {
  78.                     cout << -1 << endl;
  79.                 } 
  80.             } else {
  81.                 int maxi = (n - c - 1)/b; 
  82.                 if (c < n) {  
  83.                     maxi ++;
  84.                 }
  85.                 cout << n - maxi << endl ;
  86.             }
  87.             // how many elements             
  88.         }   
  89.  
  90.         return 0;
  91.     }
  92.  
  93.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
7
10 1 0
1 2 3
100 2 1
3 0 1
3 0 0
1000000000000000000 0 0
1000000000000000000 1000000000000000000 1000000000000000000
stdout
copy 
0
2
50
2
-1
-1
1000000000000000000
https://ideone.com/ht7Djg
language:
C++ (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!