AtCoder Grand Contest #036
問題文
省略
省略
C++に変換後のコードはこちら
ll S;
ll X1, Y1, X2, Y2, X3, Y3;
ll y[1d5]; int ys;
{
rd(S);
X2 = 1d9;
X3 = 1;
Y3 = S /+ X2;
Y2 = X2*Y3 - S;
wt(X1,Y1,X2,Y2,X3,Y3);
}
C++に変換後のコードはこちら
ll S;
ll X1, Y1, X2, Y2, X3, Y3;
ll y[1d5]; int ys;
{
ll i, k;
rd(S);
k = sqrt(S);
while(k*k<S) k++;
X2 = Y3 = k;
for(;;){
i = X2 * Y3 - S;
if(i <= 1d9){
X3 = i;
Y2 = 1;
break;
}
ys = Divisor(i, y);
rep(k,ys) if(y[k] <= 1d9 && i/y[k] <= 1d9) break;
if(k < ys){
X3 = y[k];
Y2 = i / y[k];
break;
}
if[X2 <= Y3, X2, Y3]++;
}
wt(X1,Y1,X2,Y2,X3,Y3);
}
Current time: 2024年04月20日19時17分56秒
Last modified: 2019年07月22日01時34分26秒 (by laycrs)
Tags: Competitive_Programming_Incomplete AtCoder AtCoder_Grand_Contest AGC036 AGC_A
トップページに戻る
Logged in as: unknown user (not login)