This documentation is automatically generated by competitive-verifier/competitive-verifier
#include "src/math/floor_intervals.hpp"#include "../template.hpp"
inline vector<array<long,3>> floor_intervals(long N){
vector<array<long,3>> ret;
for(long i=1;i<=N;){
long q=N/i;
long j=N/q;
ret.push_back({i,j+1,q});
i=j+1;
}
return ret;
}
#line 2 "src/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#define si(a) (long)a.size()
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(int)(n);++i)
template<typename S,typename F> bool chmin(S&a,F b){return b<a?(a=b,1):0;}
template<typename S,typename F> bool chmax(S&a,F b){return b>a?(a=b,1):0;}
bool _=(ios::sync_with_stdio(0),cin.tie(0),cout<<fixed<<setprecision(16),0);
#line 2 "src/math/floor_intervals.hpp"
inline vector<array<long,3>> floor_intervals(long N){
vector<array<long,3>> ret;
for(long i=1;i<=N;){
long q=N/i;
long j=N/q;
ret.push_back({i,j+1,q});
i=j+1;
}
return ret;
}