結果
問題 | No.1700 floor X |
ユーザー |
![]() |
提出日時 | 2021-10-08 21:52:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 3,241 bytes |
コンパイル時間 | 2,807 ms |
コンパイル使用メモリ | 211,468 KB |
最終ジャッジ日時 | 2025-01-24 21:49:26 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 44 |
ソースコード
#ifdef LOCAL//#define _GLIBCXX_DEBUG#endif//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;typedef pair<ll, ll> P;typedef pair<int, int> Pi;typedef vector<ll> Vec;typedef vector<int> Vi;typedef vector<string> Vs;typedef vector<char> Vc;typedef vector<P> VP;typedef vector<vector<ll>> VV;typedef vector<vector<int>> VVi;typedef vector<vector<char>> VVc;typedef vector<vector<vector<ll>>> VVV;typedef vector<vector<vector<vector<ll>>>> VVVV;#define endl '\n'#define REP(i, a, b) for(ll i=(a); i<(b); i++)#define PER(i, a, b) for(ll i=(a); i>=(b); i--)#define rep(i, n) REP(i, 0, n)#define per(i, n) PER(i, n, 0)const ll INF=1e18+18;const ll MOD=1000000007;#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;#define YES(n) cout << ((n) ? "YES" : "NO") << endl;#define ALL(v) v.begin(), v.end()#define rALL(v) v.rbegin(), v.rend()#define pb(x) push_back(x)#define mp(a, b) make_pair(a,b)#define Each(a,b) for(auto &a :b)#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)#ifdef LOCAL#define dbg(x_) cerr << #x_ << ":" << x_ << endl;#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;#else#define dbg(...)#define dbgmap(...)#define dbgset(...)#define dbgarr(...)#define dbgdp(...)#endif#define out(a) cout<<a<<endl#define out2(a,b) cout<<a<<" "<<b<<endl#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())#define fi first#define se secondtemplate<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 (b<a) { a=b; return true; } return false; }template<typename T1, typename T2>ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}// vectortemplate<typename T>ostream &operator<<(ostream &s, const vector<T> &v) {int len=v.size();for(int i=0; i<len; ++i) {s<<v[i];if(i<len-1) s<<" ";}return s;}// 2 dimentional vectortemplate<typename T>ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {s<<endl;int len=vv.size();for(int i=0; i<len; ++i) {s<<vv[i]<<endl;}return s;}int solve(){ll n;cin>>n;ll L = 0;ll R = 2e9;while(L+1 < R){ll mid = (L+R)/2;if(mid*mid <= n){L = mid;}else{R = mid;}}out(L);return 0;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout<<std::setprecision(10);ll T;cin>>T;while(T--)solve();}