結果
問題 | No.1700 floor X |
ユーザー |
![]() |
提出日時 | 2021-10-08 21:55:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 7 ms / 2,000 ms |
コード長 | 1,748 bytes |
コンパイル時間 | 2,152 ms |
コンパイル使用メモリ | 191,872 KB |
最終ジャッジ日時 | 2025-01-24 21:56:21 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 44 |
コンパイルメッセージ
main.cpp: In function ‘void solve()’: main.cpp:80:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 80 | scanf("%lld", &n); | ~~~~~^~~~~~~~~~~~ main.cpp: In function ‘int main()’: main.cpp:92:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 92 | scanf("%d", &t); | ~~~~~^~~~~~~~~~
ソースコード
#include <bits/stdc++.h>#include <algorithm>#include <cassert>#include <vector>template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return true;}return false;}template <class T>T div_floor(T a, T b) {if (b < 0) a *= -1, b *= -1;return a >= 0 ? a / b : (a + 1) / b - 1;}template <class T>T div_ceil(T a, T b) {if (b < 0) a *= -1, b *= -1;return a > 0 ? (a - 1) / b + 1 : a / b;}template <typename T>struct CoordComp {std::vector<T> v;bool sorted;CoordComp() : sorted(false) {}int size() { return v.size(); }void add(T x) { v.push_back(x); }void build() {std::sort(v.begin(), v.end());v.erase(std::unique(v.begin(), v.end()), v.end());sorted = true;}int get_idx(T x) {assert(sorted);return lower_bound(v.begin(), v.end(), x) - v.begin();}T &operator[](int i) { return v[i]; }};#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))#define rep(i, n) For(i, 0, n)#define rrep(i, n) rFor(i, n, 0)#define fi first#define se secondusing namespace std;using lint = long long;using pii = pair<int, int>;using pll = pair<lint, lint>;void solve() {lint n;scanf("%lld", &n);lint low = 0, high = 1'000'000'001;while (high - low > 1) {lint mid = (high + low) / 2;(mid * mid > n ? high : low) = mid;}printf("%lld\n", low);}int main() {int t;scanf("%d", &t);rep(tt, t) solve();}