听灌多
  • 板块灌水区
  • 楼主Elysium_Guiwow
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/8/4 22:10
  • 上次更新2024/8/5 08:39:32
查看原帖
听灌多
1153156
Elysium_Guiwow楼主2024/8/4 22:10
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ri register int
#define Lf long double
#define lf double
#define ii inline int
#define iv inline void
#define ib inline bool
#define il inline ll
#define is inline string
#define ci const int
#define vi vector<int>
#define pq priority_queue
#define di deque<int>
#define pr pair<int, int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define mod 1000000007
#define N 1005
#define endl '\n'
#define int ll
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int k, n, e, d;
  long double p, q;
  cin >> k;
  while (k--) {
    cin >> n >> e >> d;
    p = (n - e * d + 2 + sqrt(pow((n - e * d + 2), 2) - 4 * n)) / 2;
    q = n / p;
    if (static_cast<int>(q) == q && static_cast<int>(p) == p)
      cout << min(static_cast<int>(q), static_cast<int>(p)) << ' '
           << max(static_cast<int>(q), static_cast<int>(p)) << endl;
    else
      cout << "NO\n";
  }
  return 0;
}

P8814

60pts求调

记录https://www.luogu.com.cn/record/170603355

2024/8/4 22:10
加载中...