text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int LOGNMAX = 35;
ll pow3[LOGNMAX];
// 1 = right, 0 = both, -1 = left
vector<ll> closestLanders(ll xc, ll yc, ll sqSize, int goalSide, ll offset) {
// printf("CL %lld %lld %lld %lld\n", xc, yc, sqSize, (ll)goalSide);
if (sqSize == 1) return {offset, offset};
ll subRange = sqSize / 3;
int subX = xc / subRange, subY = yc / subRange;
// printf("subBlock %d %d\n", subX, subY);
if (subX == 1) {
if ((subY == 0 && goalSide != -1) || (subY == 2 && goalSide != 1)) {
return {subRange - 1 + offset, 2 * subRange + offset};
} else {
// printf("ADD OFFSET %lld\n", subRange);
return closestLanders(xc % subRange, yc % subRange, subRange, goalSide, offset + subRange);
}
} else {
// printf("ADD OFFSET %lld\n", xc / subRange * subRange);
return closestLanders(xc % subRange, yc % subRange, subRange, (goalSide + 1 == subY ? goalSide : 0),
offset + (xc / subRange * subRange));
}
}
ll solve(ll xa, ll ya, ll xb, ll yb, ll sqSize) {
// printf("solving %lld %lld %lld %lld %lld\n", xa, ya, xb, yb, sqSize);
if (sqSize == 1) return 0;
ll subRange = sqSize / 3;
ll abx = xa / subRange, aby = ya / subRange;
ll bbx = xb / subRange, bby = yb / subRange;
// printf("subblocks %lld %lld %lld %lld\n", abx, aby, bbx, bby);
if (abx == bbx && aby == bby) {
return solve(xa % subRange, ya % subRange, xb % subRange, yb % subRange, subRange);
}
// are they locked in the y=1|y=1 case?
if (aby == 1 && bby == 1) {
swap(xa, ya); swap(xb, yb); swap(abx, aby); swap(bbx, bby);
}
if (abx == 1 && bbx == 1) {
// printf("run around hole case %lld %lld %lld %lld\n", xa, ya, xb, yb);
return abs(yb - ya) + min(xa + xb - 2 * (subRange - 1), 4 * subRange - xa - xb);
}
// do they need closestLanders treatment?
if (abx == bbx || aby == bby) {
if (aby == bby) {
swap(xa, ya); swap(xb, yb); swap(abx, aby); swap(bbx, bby);
}
if (ya > yb) {
swap(xa, xb); swap(ya, yb); swap(abx, bbx); swap(aby, bby);
}
// printf("solving bridge case %lld %lld %lld %lld %lld\n", xa, ya, xb, yb, sqSize);
ll ans = 1e18;
// printf("using for first side: %d\n", (bby - aby == 2 ? 0 : 1));
vector<ll> clList1 = closestLanders(xa % subRange, ya % subRange, subRange, (bby - aby == 2 ? 0 : 1), 0);
vector<ll> clList2 = closestLanders(xb % subRange, yb % subRange, subRange, -1, 0);
for (ll px1 : clList1) {
for (ll px2 : clList2) {
// printf("checking CL pair %lld %lld\n", px1, px2);
ans = min(ans, abs(yb - ya) + abs(px1 - px2) + abs(xa % subRange - px1) + abs(xb % subRange - px2));
}
}
return ans;
}
// default case
return abs(xb - xa) + abs(yb - ya);
}
int main() {
pow3[0] = 1;
for (int i = 1; i < LOGNMAX; ++i) pow3[i] = pow3[i-1] * 3;
int q; scanf("%d", &q);
for (int qta = 0; qta < q; ++qta) {
ll xa, ya, xb, yb; scanf("%lld %lld %lld %lld", &xa, &ya, &xb, &yb);
printf("%lld\n", solve(xa - 1, ya - 1, xb - 1, yb - 1, pow3[30]));
}
return 0;
}
|
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
cout << a;
return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back()) {
cout << " ";
}
}
return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
for (auto &v : vv) {
for (auto &a : v) {
cout << a;
if (&a != &v.back()) {
cout << " ";
}
}
if (&v != &vv.back()) {
cout << "\n";
}
}
return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
bool f = print_(head);
if (sizeof...(tail) != 0) {
cout << (f ? " " : "\n");
}
print(forward<Tail>(tail)...);
}
#pragma endregion
struct Tri {
ll n;
vi digit;
Tri() : n(0), digit(vi(30, 0)) {}
Tri(ll n_): n(n_), digit(vi(30, 0)) {
reset();
}
void reset() {
ll n_ = n;
rep(i, 30){
digit[i] = n_ % 3;
n_ /= 3;
}
}
void reset_inv() {
ll c = 1;
n = 0;
rep(i, 30){
n += c * digit[i];
c *= 3;
}
}
Tri &operator+=(const Tri &p) {
n += p.n;
reset();
return *this;
}
Tri &operator-=(const Tri &p) {
n -= p.n;
reset();
return *this;
}
Tri &operator*=(const Tri &p) {
n *= p.n;
reset();
return *this;
}
Tri &operator/=(const Tri &p) {
n /= p.n;
reset();
return *this;
}
Tri operator-() { return Tri(-n); }
Tri operator+(const Tri &p) { return Tri(*this) += p; }
Tri operator-(const Tri &p) { return Tri(*this) -= p; }
Tri operator*(const Tri &p) { return Tri(*this) *= p; }
Tri operator/(const Tri &p) { return Tri(*this) /= p; }
bool operator>(const Tri &p) { return n > p.n; }
bool operator<(const Tri &p) { return n < p.n; }
bool operator>=(const Tri &p) { return n >= p.n; }
bool operator<=(const Tri &p) { return n <= p.n; }
bool operator==(const Tri &p) { return n == p.n; }
bool operator!=(const Tri &p) { return n != p.n; }
int& operator[](size_t s) { return digit[s]; }
friend ostream &operator<<(ostream &os, const Tri &p) {
return os << p.n;
}
};
Tri abs(Tri a) {
return Tri(abs(a.n));
}
// a ** b O(b)
Tri pow(Tri a, ll b) {
Tri ret(1);
while(b--) ret *= a;
return ret;
}
Tri min(Tri a, Tri b) {
return a < b ? a : b;
}
Tri max(Tri a, Tri b) {
return a < b ? b : a;
}
// 最大の黒クラスターが短辺を塞がなければ迂回なしで良い？
Tri solve(Tri a, Tri b, Tri c, Tri d){
if(abs(c-a) > abs(d-b)){
return solve(b, a, d, c);
}
dump(a.digit);
dump(b.digit);
dump(c.digit);
dump(d.digit);
repb(i, 30){
if(a[i] == 1 && c[i] == 1){
dump(i, b[i], d[i], abs(d-b), pow(Tri(3), i));
if((b[i] == d[i] && abs(d-b) >= pow(Tri(3), i))
|| (min(b, d)[i] == 0 && max(b, d)[i] == 2)
|| (min(b, d)[i] == 2 && max(b, d)[i] == 0 && abs(d-b) >= Tri(2)*pow(Tri(3), i))){
dump(i);
Tri mi = a, ma = a;
ll j = i;
mi[j] = 0;
ma[j] = 2;
while(j){
--j;
mi[j] = 2;
ma[j] = 0;
}
mi.reset_inv();
ma.reset_inv();
return abs(d-b) + min(a+c-mi*Tri(2), ma*Tri(2)-a-c);
}
}
if(a[i] != c[i]) break;
}
return abs(d-b) + abs(c-a);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll q;
cin >> q;
while(q--){
ll a, b, c, d;
cin >> a >> b >> c >> d;
a--; b--; c--; d--;
print(solve(Tri(a), Tri(b), Tri(c), Tri(d)));
}
}
|
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#include<chrono>
#include<random>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#define SZ(x) ((int)x.size())
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline LL read()
{
LL f=1,x=0;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int stack[20];
template<typename T>inline void write(T x)
{
if(x<0){putchar('-');x=-x;}
if(!x){putchar('0');return;}
int top=0;
while(x)stack[++top]=x%10,x/=10;
while(top)putchar(stack[top--]+'0');
}
template<typename T>inline void pr1(T x){write(x);putchar(' ');}
template<typename T>inline void pr2(T x){write(x);putchar('\n');}
template<typename T>inline void chkmin(T &x,T y){x=x<y?x:y;}
template<typename T>inline void chkmax(T &x,T y){x=x>y?x:y;}
LL Rmax;
LL x,y,a,b;
bool in(LL x,LL y,LL z){return x<=z&&z<=y;}
LL getval(LL upx,LL upy,LL downx,LL downy,int opt)
{
LL L=(opt?(downy-upy+1):(downx-upx+1));
if(L==1)
{
LL ad=0;
if(opt&&downy%3==2)ad=(abs(y-b)<=1)?0:2;
if(!opt&&downx%3==2)ad=(abs(x-a)<=1)?0:2;
return abs(x-a)+abs(y-b)+ad;
}
LL xp1=upx+L/3-1,xp2=upx+L/3*2-1,xp3=downx;
LL yp1=upy+L/3-1,yp2=upy+L/3*2-1,up3=downy;
if(!opt)
{
LL p1=!in(upx,xp1,x)?!in(xp1+1,xp2,x)?2:1:0,p2=!in(upx,xp1,a)?!in(xp1+1,xp2,a)?2:1:0;
if(p1!=p2)return abs(x-a)+abs(y-b);
else if(p1==1)
{
LL q1=(y-1)/(L/3),q2=(b-1)/(L/3);
if(abs(q2-q1)-1>=1)return min(x-xp1+a-xp1,xp2+1-x+xp2+1-a)+abs(y-b);
else return getval(upx+p1*(L/3),upy,downx-(2-p1)*(L/3),downy,0);
}
else return getval(upx+p1*(L/3),upy,downx-(2-p1)*(L/3),downy,0);
}
else
{
LL p1=!in(upy,yp1,y)?!in(yp1+1,yp2,y)?2:1:0,p2=!in(upy,yp1,b)?!in(yp1+1,yp2,b)?2:1:0;
if(p1!=p2)return abs(x-a)+abs(y-b);
else if(p1==1)
{
LL q1=(x-1)/(L/3),q2=(a-1)/(L/3);
if(abs(q2-q1)-1>=1)return min(y-yp1+b-yp1,yp2+1-y+yp2+1-b)+abs(x-a);
else return getval(upx,upy+p1*(L/3),downx,downy-(2-p1)*(L/3),1);
}
else return getval(upx,upy+p1*(L/3),downx,downy-(2-p1)*(L/3),1);
}
}
LL solve(LL upx,LL upy,LL downx,LL downy)
{
LL L=(downx-upx+1);
LL xp1=upx+L/3-1,xp2=upx+L/3*2-1,xp3=downx;
LL yp1=upy+L/3-1,yp2=upy+L/3*2-1,yp3=downy;
LL p1=!in(upx,xp1,x)?!in(xp1+1,xp2,x)?2:1:0,p2=!in(upy,yp1,y)?!in(yp1+1,yp2,y)?2:1:0;
LL q1=!in(upx,xp1,a)?!in(xp1+1,xp2,a)?2:1:0,q2=!in(upy,yp1,b)?!in(yp1+1,yp2,b)?2:1:0;
if(p1==q1&&p2==q2)return solve(upx+p1*(L/3),upy+p2*(L/3),downx-(2-p1)*(L/3),downy-(2-p2)*(L/3));
else
{
if(p1!=q1&&p2!=q2)return abs(x-a)+abs(y-b);
if(p1==q1)
{
if(p1==1)return min(x-xp1+a-xp1,xp2+1-x+xp2+1-a)+abs(y-b);
return getval(upx+p1*(L/3),upy,downx-(2-p1)*(L/3),downy,0);
}
else
{
if(p2==1)return min(y-yp1+b-yp1,yp2+1-y+yp2+1-b)+abs(x-a);
return getval(upx,upy+p2*(L/3),downx,downy-(2-p2)*(L/3),1);
}
}
}
int main()
{
// freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);
Rmax=1;for(int i=1;i<=30;i++)Rmax=Rmax*3;
// Rmax=27;
int T=read();while(T--)
{
x=read(),y=read(),a=read(),b=read();
pr2(solve(1,1,Rmax,Rmax));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int h1[31], w1[31], h2[31], w2[31];
long long A, B, C, D;
long long pow3[31];
int calch(int n) {
if (n == -1) return n;
if (h1[n] != h2[n]) return -1;
if (h1[n] != 1) return calch(n - 1);
bool c = false;
if (w1[n] != w2[n] && w1[n + 1] == w2[n + 1]) c = true;
if (abs(B - D) > 2 * pow3[n]) c = true;
if (c) return n;
else return calch(n - 1);
}
int calcw(int n) {
if (n == -1) return n;
if (w1[n] != w2[n]) return -1;
if (w1[n] != 1) return calcw(n - 1);
bool c = false;
if (h1[n] != h2[n] && h1[n + 1] == h2[n + 1]) c = true;
if (abs(A - C) > 2 * pow3[n]) c = true;
if (c)
return n;
else
return calcw(n - 1);
}
int main(){
pow3[0] = 1; rep(i, 30) pow3[i + 1] = pow3[i] * 3;
int Q; cin >> Q;
rep(q, Q){
cin >> A >> B >> C >> D;
A--; B--; C--; D--;
long long H1 = A, W1 = B, H2 = C, W2 = D;
rep(i, 30) {
h1[i] = H1 % 3; H1 /= 3;
w1[i] = W1 % 3; W1 /= 3;
h2[i] = H2 % 3; H2 /= 3;
w2[i] = W2 % 3; W2 /= 3;
}
long long ans = abs(A - C) + abs(B - D);
int ch = calch(30), cw = calcw(30);
int n = max(ch, cw);
if (n >= 0) {
long long S, T;
if(ch > cw) {
S = A; T = C;
} else {
S = B; T = D;
}
S %= pow3[n]; T %= pow3[n];
long long los = min(min(S, T) + 1, pow3[n] - max(S, T));
ans += los * 2;
}
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<int(n); i++)
typedef long long ll;
using namespace std;
ll solve(ll x1, ll y1, ll x2, ll y2) {
ll d=1;
rep(i, 30) d*=3; // pow(3, 30)
if( y1>y2 ) swap(x1, x2), swap(y1, y2);
ll ans=abs(x1-x2)+abs(y1-y2);
while(d>1) {
d/=3;
ll nx1=x1/d, nx2=x2/d;
ll ny1=y1/d, ny2=y2/d;
if( nx1!=nx2 ) break;
if( nx1%3==1 && abs(ny1-ny2)>1 ) {
ll top=nx1*d-1;
ll bot=nx1*d+d;
ll loss=min(x1,x2)-top;
loss=min(loss, bot-max(x1,x2));
ans+=loss*2;
break;
}
}
return ans;
}
int main () {
int Q;
cin >> Q;
while(Q--) {
ll x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
x1--; y1--; x2--; y2--;
ll ans1 = solve(x1, y1, x2, y2);
ll ans2 = solve(y1, x1, y2, x2);
cout << max(ans1, ans2) << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return (a > b && (a = b, true)); }
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return (a < b && (a = b, true)); }
template<typename T>
ostream& operator <<(ostream &os, vector<T> &v) {
os << v[0];
for (int i = 1; i < v.size(); i++) os << " " << v[i];
return (os);
}
template<typename T>
istream& operator >>(istream &is, vector<T> &v) {
for (auto &u : v) is >> u; return (is);
}
template<typename T1, typename T2>
istream& operator >>(istream &is, pair<T1, T2> &p) {
return (is >> p.first >> p.second);
}
ll pow3[33];
ll calc(ll a, ll b, ll c, ll d, ll size = 30) {
ll div = pow3[size-1];
ll parta = a / div, partb = b / div;
ll partc = c / div, partd = d / div;
ll spath = abs(d-b) + abs(c-a);
if (parta == partc && partb == partd) {
return (calc(a - parta*div, b - partb*div, c - partc*div, d - partd*div, size-1));
}
//やばいやつら
if (parta == partc || partb == partd) {
if (partb == partd) { swap(a, b); swap(c, d); swap(parta, partb); swap(partc, partd); }
if (parta == 1) {
return (abs(d-b) + min(a-div+1+c-div+1, 2*div-a+2*div-c));
}
a -= parta*div, c -= partc*div;
for (ll sz = size-2; sz >= 0; sz--) {
ll dv = pow3[sz];
ll pta = a/dv, ptc = c/dv;
if (pta != ptc) return (spath);
if (pta == ptc && pta == 1 && abs(d-b) / dv > 1) return (abs(d-b) + min(a-dv+1+c-dv+1, 2*dv-a+2*dv-c));
a -= pta*dv, c -= ptc*dv;
}
}
return (spath);
}
void solve() {
ll a, b, c, d; cin >> a >> b >> c >> d; --a, --b, --c, --d;
cout << calc(a, b, c, d) << el;
}
void Main() {
//init
pow3[0] = 1;
for (int i = 1; i <= 30; i++) pow3[i] = pow3[i-1] * 3;
int Q; cin >> Q;
while (Q--) solve();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
Main();
return (0);
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll solve(ll ai, ll aj, ll bi, ll bj) {
if (aj > bj) {
swap(ai,bi);
swap(aj,bj);
}
ll s = 1;
rep(i,30) s *= 3;
ll dist = abs(ai-bi) + abs(aj-bj);
ll res = dist;
while (1) {
s /= 3;
if (s <= 0) break;
ll nai = ai/s, nbi = bi/s;
if (nai != nbi) break;
ll naj = aj/s, nbj = bj/s;
if (nai%3 == 1 && abs(naj-nbj) > 1) {
ll up = s*nai-1;
ll bot = nai*s + s;
ll loss = min(ai,bi) - up;
loss = min(loss, bot - max(ai,bi));
res += loss*2;
break;
}
}
return res;
}
int main() {
int q;
cin >> q;
rep(qi,q) {
ll ai,aj,bi,bj;
cin >> ai >> aj >> bi >> bj;
ai--; aj--;
bi--; bj--;
ll ans = 0;
ans = max(ans, solve(ai,aj,bi,bj));
ans = max(ans, solve(aj,ai,bj,bi));
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM(f:power debug)
// --> f:power f:<< debug
// ---- inserted function power from util.cc
/* *** WARNING ***
ll x = power(10, 12)
does not work since it is interpreted as
ll x = power<int>((int)10, 12)
Use power<ll>(10, 12) or power(10LL, 12).
*/
template<typename T>
T power(T a, ll b) {
T twoPow = a;
T rv(1);
while (b > 0) {
if (b & 1LL) rv *= twoPow;
twoPow *= twoPow;
b >>= 1;
}
return rv;
}
// ---- end power
// ---- inserted function << from util.cc
template <typename T1, typename T2>
ostream& operator<< (ostream& os, const pair<T1,T2>& p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2, typename T3>
ostream& operator<< (ostream& os, const tuple<T1,T2,T3>& t) {
os << "(" << get<0>(t) << ", " << get<1>(t)
<< ", " << get<2>(t) << ")";
return os;
}
template <typename T1, typename T2, typename T3, typename T4>
ostream& operator<< (ostream& os, const tuple<T1,T2,T3,T4>& t) {
os << "(" << get<0>(t) << ", " << get<1>(t)
<< ", " << get<2>(t) << ", " << get<3>(t) << ")";
return os;
}
template <typename T>
ostream& operator<< (ostream& os, const vector<T>& v) {
os << '[';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
os << ']';
return os;
}
template <typename T>
ostream& operator<< (ostream& os, const set<T>& v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
os << '}';
return os;
}
template <typename T>
ostream& operator<< (ostream& os, const multiset<T>& v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
os << '}';
return os;
}
template <typename T1, typename T2>
ostream& operator<< (ostream& os, const map<T1, T2>& mp) {
os << '[';
for (auto it = mp.begin(); it != mp.end(); it++) {
if (it != mp.begin()) os << ", ";
os << it->first << ": " << it->second;
}
os << ']';
return os;
}
template <typename T, typename T2, typename T3>
ostream& operator<< (ostream& os, const priority_queue<T, T2, T3>& orig) {
priority_queue<T, T2, T3> pq(orig);
bool first = true;
os << '[';
while (!pq.empty()) {
T x = pq.top(); pq.pop();
if (!first) os << ", ";
os << x;
first = false;
}
return os << ']';
}
// ---- end <<
// ---- inserted library file debug.cc
template <class... Args>
string dbgFormat(const char* fmt, Args... args) {
size_t len = snprintf(nullptr, 0, fmt, args...);
char buf[len + 1];
snprintf(buf, len + 1, fmt, args...);
return string(buf);
}
template <class Head>
void dbgLog(Head&& head) {
cerr << head << endl;
}
template <class Head, class... Tail>
void dbgLog(Head&& head, Tail&&... tail)
{
cerr << head << " ";
dbgLog(forward<Tail>(tail)...);
}
#if DEBUG
#define DLOG(...) dbgLog(__VA_ARGS__)
#define DFMT(...) cerr << dbgFormat(__VA_ARGS__) << endl
#define DCALL(func, ...) func(__VA_ARGS__)
#else
#define DLOG(...)
#define DFMT(...)
#define DCALL(func, ...)
#endif
// ---- end debug.cc
// @@ !! LIM -- end mark --
ll g (ll p, ll a, ll c, ll b, ll d) {
DLOG("g", "p", p, "a", a, "c", c, "b", b, "d", d);
if (p == 0) return 0;
ll ta = a / p;
ll tc = c / p;
if (ta != tc) return abs(c - a);
ll xa = a - ta*p;
ll xc = c - tc*p;
if (ta == 1 && abs(d / p - b / p) > 1) {
return min(xa + xc + 2, 2 * p - (xa + xc));
}
return g(p / 3, xa, xc, b, d);
}
ll f (ll p, ll a, ll b, ll c, ll d) {
DLOG("f", "p", p, "a", a, "b", b, "c", c, "d", d);
ll ta = a / p;
ll tb = b / p;
ll tc = c / p;
ll td = d / p;
if (ta != tc && tb != td) return abs(c - a) + abs(d - b);
if (ta == tc && tb == td) {
return f(p / 3, a - ta * p, b - tb * p, c - tc * p, d - td * p);
}
if (tb == td) return f(p, b, a, d, c);
// ta == tc && tb != td
ll xa = a - ta*p;
ll xc = c - tc*p;
if (ta == 1) return min(xa + xc + 2, 2 * p - (xa + xc)) + abs(d - b);
return g(p / 3, xa, xc, b, d) + abs(d - b);
}
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll Q; cin >> Q;
ll top = power<ll>(3LL, 29);
for (ll q = 0; q < Q; q++) {
ll a, b, c, d; cin >> a >> b >> c >> d; a--; b--; c--; d--;
cout << f(top, a, b, c, d) << "\n";
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
using ll = long long;
bool between(ll x, ll y1, ll y2){
if(y1 > y2) swap(y1, y2);
// y1++; y2--;
// if(!(y1 <= y2)) return false;
if(x % 3 == 1){
if(y2 - y1 > 3) return true;
for(ll y=y1;y<=y2;y++) if(y % 3 == 1) return true;
}
return false;
}
ll get_extra(ll x1, ll y1, ll x2, ll y2) {
ll ans = 0;
ll three = 1;
for (int i = 0; i < 35; ++i) {
if(x1 / three == x2 / three && between(x1 / three, y1 / three, y2 / three)) {
ll tmp = min(min(x1 % three, x2 % three) + 1, three - max(x1 % three, x2 % three));
ans = max(ans, tmp);
}
three *= 3;
}
return ans;
}
ll get_dist(ll x1, ll y1, ll x2, ll y2){
return abs(x1 - x2) + abs(y1 - y2) + 2 * max(get_extra(x1, y1, x2, y2), get_extra(y1, x1, y2, x2));
}
int main() {
int Q;
cin >> Q;
while (Q--) {
long long a;
long long b;
long long c;
long long d;
cin >> a >> b >> c >> d;
cout << get_dist(a-1, b-1, c-1, d-1) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
typedef pair<int, int> pii;
template< typename T > inline void read(T &x)
{
static char _c;
static bool _f;
x = 0;
_f = 0;
_c = getchar();
while(_c < '0' || '9' < _c) {if(_c == '-') _f = true; _c = getchar();}
while('0' <= _c && _c <= '9') {x = (x << 1) + (x << 3) + (_c & 15); _c = getchar();}
if(_f) x = -x;
}
template < typename T > inline void Min(T &x, T y) {if(y < x) x = y;}
template < typename T > inline void Max(T &x, T y) {if(x < y) x = y;}
#define lowbit(x) ((x) & -(x))
#define lson l,mid,id<<1
#define rson mid+1,r,id<<1|1
#define ls id<<1
#define rs id<<1|1
#define MID(l,r) ((l)+(((r)-(l))>>1))
#define fi first
#define se second
#define mk make_pair
#define pb push_back
const int INF = 0x3f3f3f3f;
const double pi = (double) acos(-1.0);
const double eps = (double) 1e-8;
const int MOD = (int) 1e9 + 7;
//const int MOD = (int) 998244353;
const int maxn = (int) 1e5 + 20;
const int maxm = (int) 1e6 + 20;
inline int sig(double x) {return x < -eps ? -1 : eps < x;}
LL fp(LL a, LL n, LL MOD)
{
if(n < 0) a = fp(a, MOD - 2, MOD), n = -n;
LL res = 1; for(; n; n >>= 1, a = a * a % MOD) if(n & 1) res = res * a % MOD; return res;
}
LL po[33];
void pre()
{
po[0] = 1;
for(int i = 1; i <= 30; i++) po[i] = po[i - 1] * 3;
}
LL func(int dep, LL a, LL b, LL c, LL d)
{
if(dep == -1) return abs(b - d);
LL w = po[dep];
if(a / w != c / w) return abs(a - c) + abs(b - d);
if(a / w == 1 && abs(b / w - d / w) >= 2)
{
return abs(b - d) + min(a % w + c % w + 2, w * 2 - a % w - c % w);
}
return func(dep - 1, a % w, b, c % w, d);
}
void work()
{
LL a, b, c, d;
cin >>a >>b >>c >>d;
a--; b--; c--; d--;
if(abs(a - c) > abs(b - d))
{
swap(a, b);
swap(c, d);
}
cout <<func(29, a, b, c, d) <<endl;
}
int main(int argc, char **argv)
{
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif // yukihana0416
// get_prime();
pre();
int tc = 1;
read(tc);
for(int ca = 1; ca <= tc; ca++)
{
// printf("Case #%d: ", ca);
work();
}
return 0;
}
|
# include <bits/stdc++.h>
using namespace std;
int main(){
long long n , res = 1e15;
cin >> n;
for(long long i = 1; i * i <= n; i ++)
if(n % i == 0)
res = min(res , i + n / i - 2);
cout << res << "\n";
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long n; cin >> n;
int x = sqrtl(n);
while(1){
if(n%x == 0) break;
x--;
}
cout << (x-1)+(n/x-1) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long n,m=1;
cin>>n;
for(long long i=2;i*i<=n;i++){
if(n%i==0){
m=i;
}
}
cout<<(m+(n/m)-2);
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N; cin>>N;
long S;
for(int i=1;i<=sqrt(N);i++){
if(N%i==0) S=i;
}
long T=N/S;
cout<<S+T-2<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int a = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)a = i;
}
cout << a - 1 + (n/a) - 1 << endl;
}
|
#include <iostream>
using namespace std;
int main(){
long long n;
cin>>n;
long long i,m=n-1,tmp=0;
for(i=1;i*i<=n;i++){
if(n%i==0){
tmp=i+n/i-2;
if(tmp<m) m=tmp;
}
}
cout<<m<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin>>n;
int q = sqrt(n);
for(long long i=q; i>0; i--) {
if(n%i == 0) {
cout<<(i-1+(n/i-1));
break;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
scanf("%lld",&n);
for(int i=sqrt(n+1);i>=1;i--){
if(n%i==0){
printf("%lld",(i+n/i)-2);
break;
}
}
} |
#include <iostream>
using namespace std;
typedef long long ll;
int main(){
ll n;cin>> n;ll b=n+1;
for(ll i=2;i*i<=n;i++){
if(n%i==0){
b=min(i+n/i,b);
}
}
cout << b-2<<endl;
} |
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
long long a;
for(long long i=1;i*i<=n;i++){
if(n%i==0)a=i;
}
long long ans=a+n/a-2;
printf("%lld\n",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
long long a;
int main()
{
scanf("%lld",&a);
for(int i=int(sqrt(a));i>=1;--i) {
if(a%i==0) {
printf("%lld",(a/i+i-2));
return 0;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
long long n,b,c,a;
int main()
{
cin>>n;
for(a=sqrt(n)+1;a>0;a--)
{
if(n%a==0)
{
b=a;
break;
}
}
c=n/b;
cout<<b+c-2;
} |
#include<bits/stdc++.h>
using namespace std;
long long n,ans;
int main()
{
cin>>n;
for(int i=1;1ll*i*i<=n;i++)
if(n%i==0)
ans=i+n/i;
cout<<ans-2;
return 0;
} |
#include<bits/stdc++.h>
using ll=long long;
using namespace std;
int main(){
ll n;cin>>n;
ll a=0;
for(ll i=2;i*i<=n;i++)
if(!(n%i))a=i;
cout<<(a?(a+(n/a)-2):n-1);
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n, i, sq;
cin>>n;
for(i=sqrt(n); i>0; i--)
{
if(n%i==0){cout<<i-1+(n/i)-1<<endl; break;}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
ll ans = 0;
for(ll i = 1;i*i<=n;i++)
{
if(n%i==0)
{
ans = i;
}
}
cout<<n/ans+ans-2<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
long long n;
int main(){
scanf("%lld",&n);
int i;
for(i=sqrt(n);i>=2;i--) if(n%i==0) break;
printf("%lld",n/i+i-2);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long n;
cin >> n;
for(int i = (int)sqrt(n); i > 0; i--){
if(n % i == 0){
cout << i + n / i - 2 << endl;
return 0;
}
}
} |
//P2C
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x;
bool ok = 0;
cin >> x;
ll tmp = sqrt(x);
while(x%tmp)tmp--;
cout << (tmp-1)+(x/tmp - 1);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n;
for (long long i=1;i*i<=n;i++)
{
if (n%i==0)
{
a=i;
b=n/i;
}
}
cout<<a+b-2<<endl;
return 0;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
long long int N,i;
cin >> N;
i = (long long int)sqrt(N);
while (N % i != 0) {
i--;
}
cout << i + (N / i) - 2 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,i,j,ans;
cin>>n;
ans=n-1;
for(i=2; i*i<=n; i++){
if(n%i==0){
ans=i+n/i-2;
}
}
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main() {
ll N;
ll A;
cin >> N;
for (int i=1;i <= sqrt(N); i++) {
if (N%i == 0) A = i;
}
cout << A + N/A - 2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long n;
cin>>n;
long start = sqrt(n)/1;
for(int i=start ;i>0;i--){
if(n%i==0){
cout<<(n/i-1)+(i-1)<<endl;
return 0;
}
}
}
|
#include<cstdio>
#include<cmath>
using namespace std;
long long n;
int main(){
scanf("%lld",&n);
for(register long long i=sqrt(n);i;i--){
if(!(n%i)){
printf("%lld",i+(n/i)-2);
return 0;
}
}
} |
#include<bits/stdc++.h>
using namespace std;
int main() {
int64_t n,i,k;
cin>>n;
for(i=1;i*i<=n;i++) if(n%i==0) k=i;
cout<<k+n/k-2<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,maxi=INT_MIN;
cin>>n;
for(ll i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
maxi=max(maxi,i);
}
}
cout<<(maxi+n/maxi)-2;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
long long m;
cin >> m;
for (long long i = sqrt(m + 1); i >= 1; i--) {
if (m % i == 0) {
cout << m / i + i - 2;
return 0;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n,p;
cin >> n;
for(int i = sqrt(n);i > 0;i--){
if(n % i == 0){
p = i;
break;
}
}
cout << p + n/p - 2;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
LL n,ans;scanf("%lld",&n);
int n1=sqrt(n);
for(int i=1;i<=n1;i++){
if(n%i==0)ans=i+n/i;
}
printf("%lld\n",ans-2);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,x;
cin>>n;
for(int i=1;i<=sqrt(n);i++)
if(n%i==0)
x=i;
cout<<x-1+n/x-1;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n,ans=1e18;
cin>>n;
ll num=sqrt(n);
for(int i=1;i<=num;i++){
if(n%i==0)ans=min(ans,i+n/i-2);
}
cout<<ans;
return 0;
} |
#include<iostream>
using namespace std;
long long n,ans=9223372036854775807;
int main()
{
scanf("%lld",&n);
for(long long i=1;i*i<=n;i++)
if(n%i==0) ans=min(i+n/i-2,ans);
printf("%lld",ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
long long n;
int main()
{
cin>>n;
for(int i=sqrt(n);i>=1;i--)
if(n%i==0)
{
cout<<n/i+i-2<<endl;
break;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
for(long long i=sqrt(n);i>=1;i--){
if(n%i==0){
printf("%lld\n",i+n/i-2);
return 0;
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,ans=1e12+7;
cin>>n;
for(ll i=1;i*i<=n;i++)
{
if(n%i==0)
ans=min(ans,i+n/i -2);
}
cout<<ans;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
long n;
cin >> n;
int x;
for(int i=1; i <= sqrt(n); i++) {
if(n%i==0) x = i;
}
cout << x+(n/x)-2 << endl;
} |
#include <iostream>
using namespace std;
long long n, i, mi;
int main() {
cin >> n;
for(i=1; i*i<=n; i++) if(n%i==0) mi = i;
cout << mi + n/mi - 2;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin >> n;
long long int max=1;
for(long long int i=1; i*i<=n; i++){
if(n%i==0) max=i;
}
cout << max + n/max - 2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main()
{
ll N;
cin >> N;
ll i = sqrt(N);
while (N % i != 0) i--;
cout << i + N/i - 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin >> n;
for(int i = (int)sqrt(n); i >= 1; --i)
{
if(!(n % i)) {
cout << (i+n/i-2) << endl;
return 0;
}
}
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long g,q,re=1e18;
cin>>q;
for(g=1;g*g<=q;g++)if(q%g==0){
re=min(re,(g+(q/g))-2);
}
cout<<re<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long int a,i,j,yaku,suu;
cin>>a;
for(i=1;i<=sqrt(a);i++){
if(a%i==0){
yaku=i;
}
}
suu=a/yaku;
cout<<yaku+suu-2;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,i;cin>>n;
i=sqrt(n);
while(n%i!=0)i--;
cout<<n/i+i-2<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int main(){
cin>>n;
ll m=sqrt(n);
for(ll i=m;i>=1;i--){
if(n%i==0){
cout<<i+n/i-2<<endl;
return 0;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
unsigned long N, i, ans; cin >> N;
for(i=sqrt(N); i>0; i--){ if(N%i==0){ ans=i+N/i-2; break; } }
cout << ans << "\n";
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+7;
int main()
{
ll n;cin>>n;ll i=0;
for(i=1;i*i<=n;i++);
while(n%i!=0) i--;
cout<<i+(n/i)-2<<endl;
return 0;
} |
#include <stdio.h>
typedef long long ll;
int main(void) {
ll i, n, ans;
scanf("%lld", &n);
for(i = 1; i * i <= n; ++i) if(!(n % i)) ans = i;
printf("%lld", ans + n / ans - 2);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;cin >> n;
ll good = 1;
for(ll i=1; i*i<=n; i++){
if(n%i==0)good = i;
}
cout << good + n/good -2 << endl;
} |
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
long long a,b;
for(long long i=1;i*i<=n;i++)if(n%i==0)a=i;
b=n/a;
cout<<a+b-2<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin>>n;
ll ans=1;
for(ll i=1;i*i<=n;i++){
if(n%i==0)ans=i;
}
cout<<ans+n/ans-2<<endl;
}
|
#include<stdio.h>
#include<math.h>
int main(){
long long N;
scanf("%lld",&N);
long long x=(int)sqrt(N);
while(N%x)
x--;
printf("%lld\n",x-1+N/x-1);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
cin>>n;
long long int i=sqrt(n);
while(1)
{
if(n%i==0)
break;
i--;
}
cout<<i+n/i-2;
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main()
{
long long int N,m;
cin >>N;
m=sqrt(N);
while((N%m)!=0){
m--;
}
m=m+(N/m)-2;
cout << m;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
long n,a,k;
cin >> n;
for (a=1;a*a<=n;a++) if (n%a==0) k=a;
cout << k+n/k-2 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a,b;
cin >> a;
for(int j=1;j<sqrt(a)+1;j++){
if(a%j==0){
b=j;
}
}
cout << ((a/b)-1)+(b-1) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
long n; cin>>n; long x;
for(long k=1;k*k<=n;k++){
if(n%k==0) { x=k; }
}
cout<< x+(n/x)-2 <<endl;
} |
#include <stdio.h>
long long n;
int main() {
scanf("%lld", &n);
long long i = 0;
while (i * i <= n)i++;
i--;
while (n % i)i--;
printf("%lld\n", n / i + i - 2);
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin>>N;
int x=sqrt(N);
while(N%x!=0){
x-=1;
}
cout<<x-1+N/x-1<<endl;
}
|
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main() {
long long N, a;
cin >> N;
a = (long long)sqrt((double) N);
while (N%a != 0) {
a--;
}
cout << a + N/a - 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin >> n;
long long i;
for(i = sqrt(n); i >= 2; i--){
if(n % i == 0){
break;
}
}
cout << i + n / i - 2 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,b,c,a;
cin>>n;
for(a=sqrt(n)+1;a>0;a--)
{
if(n%a==0)
{
b=a;
break;
}
}
c=n/b;
cout<<b+c-2;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
for(ll i = sqrt(n); ; i--) if(n % i == 0){
cout << i + n / i - 2 << endl;
return 0;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;cin >> n;
ll ans = 1;
for(ll i = 2;i*i<=n;i++)
{
if(n%i==0)ans = i;
}
cout<<n/ans+ans-2<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){long long n,j,i,p,r=0;
cin>>n;
for(i=sqrt(n);i>=1;i--){
if(n%i==0){
p=i;break;
}
}j=n/p;
cout<<p+j-2;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main(){
long long N;
cin>>N;
long long x=sqrt(N)+1;
while(N%x!=0){
x--;
}
cout<<x+N/x-2;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long n;
cin >> n;
long a=0;
for(long i=1;i<round(sqrt(n))+1;i++){
if(n%i==0) a=i;
}
long b=n/a;
cout << a+b-2;
} |
#include<iostream>
using namespace std;
long long int n;
int main(){
cin>>n;
long long int t=1;
for(long long int i=1;i*i<=n;++i){
if(n%i==0)t=i;
}
cout <<t+n/t-2<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,x;cin>>n;
int a=sqrt(n);
for(int i=a;i>0;i--){
if(n%i==0){x=i+n/i-2;cout<<x<<endl;break;}
}
} |
#include <bits/stdc++.h>
using namespace std;
long long a,b,n;
int main()
{
cin>>n;
for(int i=sqrt(n);i>0;i--)
{
if(n%i==0)
{
cout<<(n/i)+i-2<<'\n';
return 0;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,i,ans=1e17;
cin>>n;
for(i=1;i*i<=n;i++)
{
if(n%i==0)
{
ans=min(ans,i+n/i-2);
}
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n,ans;
cin>> n;
for (int i=sqrt(n); i>0; i--){
if (n%i==0){
ans=i+n/i-2;
break;
}
}
cout<< ans <<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a;
cin>>a;
for(long long i=sqrt(a);i>=1;i--)
{
if(a%i==0)
{
long long b=a/i;
cout<<b+i-2<<endl;
return 0;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
for(int i = sqrt(n); i>=0; i--) {
if(!(n % i)) {
cout << i-1+(n/i-1);
break;
}
}
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,j,a,b;
cin>>n;
for(i=1;i<=sqrt(n);i++)
{
if (n%i==0)
{
a=i;
b=n/a;
}
}
cout<<a-1+b-1<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long N;
cin>>N;
int x=pow(N,0.5);
for(int i=x;i>0;i--){
if(N%i==0){
cout<<i+(N/i)-2<<endl;
break;
}
}
} |
#include<cstdio>
long n;
int main() {
scanf("%ld", &n);
long a = 0;
for (long i = 1; i * i <= n; i++) {
if (n % i == 0) a = i;
}
printf("%ld\n", a + n / a - 2);
return 0;
}
|
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
long long N;
cin>>N;
int M;
M=sqrt(N);
for(int i=M;i>=1;i--)
if(N%i==0){cout<<i-2+(N/i)<<endl;break;}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a;
cin >> a;
for(long long i=sqrt(a);i>=1;i--){
if(a%i==0){
cout << i+(a/i)-2 << endl;
break;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n,ans;cin>>n;
double root = sqrt(n);
ans = root;
while(1){
if(n%ans==0)break;
ans--;
}
cout<<ans + n/ans -2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, H=1;
cin >> N;
for(int i=1; i<pow(N,0.5)+1; i++) {
if(N%i==0) {
H=i;
}
}
cout << H+N/H-2 << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long ans,i,n;
cin >> n;
ans=n+1;
for(i=1;i<=sqrt(n);i++){
if(n%i==0 && i+n/i-2 < ans ) ans = i+n/i-2;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n;
scanf("%lld",&n);
ll sum;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
sum=n/i+i-2;
}
}
cout<<sum<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll s=sqrt(n);
for(ll i=s;i>0;--i) if(n%i==0){cout<<i+n/i-2;return 0;}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
int main(){
long long int n;
cin >>n;
int t=1;
rep(i,sqrt(n+1))
if (n%(i+1)==0)
t=i+1;
cout << (n/t)+(t)-2<<endl;
} |
#include <iostream>
using namespace std;
int main(void){
long long N,i,a;
cin>>N;
for(i=1;i*i<N+1;i++){
if(N%i==0){
a=i;
}
}
a=a+N/a-2;
cout<<a<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n; cin>>n;
int s=int(sqrt(n));
for(int i=s;i>0;i--){
if(n%i==0){
cout<<(i-1)+(n/i-1)<<endl;
return 0;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, d = 1;
cin >> n;
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0) d = i;
}
cout << d + n / d - 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
long long t;
for(int i = 1;i <= sqrt(a);i++){
if(a%i==0){t = a/i+i;}}
cout << t-2 << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,i,a,b,ans=0;
cin>>n;
for(i=sqrt(n);i>0;i--)
{
if(n%i==0)
{ a=i;
b=n/i;
break;
}
}
ans=a-1+b-1;
cout<<ans;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.