結果

問題 No.2558 中国剰余定理
ユーザー 👑 p-adic
提出日時 2023-12-02 14:38:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,176 bytes
コンパイル時間 623 ms
コンパイル使用メモリ 68,284 KB
最終ジャッジ日時 2025-02-18 03:42:16
ジャッジサーバーID
(参考情報)
judge2 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <string>
#include <stdio.h>
#include <stdint.h>
using namespace std;
using ll=long long;
#define CIN( LL , A ) LL A; cin >> A
#define QUIT return 0
#define RETURN( ANSWER ) cout << ( ANSWER ) << "\n"; QUIT
#include <cassert>
#define MAIN main
int MAIN()
{
CIN( ll , B_0 );
CIN( ll , B_1 );
CIN( ll , C_0 );
C_0 = ( C_0 >= 0 ? C_0 % B_0 : ( B_0 - ( - C_0 ) % B_0 ) % B_0 );
CIN( ll , C_1 );
C_1 = ( C_1 >= 0 ? C_1 % B_1 : ( B_1 - ( - C_1 ) % B_1 ) % B_1 );
ll A[2][2];
ll B[2] = { B_0 , B_1 };
ll i_0 = ( B_0 >= B_1 ? 0 : 1 );
ll i_1 = 1 - i_0;
A[i_0][i_0] = 1;
A[i_0][i_1] = 0;
A[i_1][i_0] = 0;
A[i_1][i_1] = 1;
ll q;
while( B[i_1] != 0 ){
q = B[i_0] / B[i_1];
A[i_0][i_0] -= q * A[i_1][i_0];
A[i_0][i_1] -= q * A[i_1][i_1];
B[i_0] %= B[i_1];
swap( i_0 , i_1 );
}
ll gcd = B[i_0];
ll c = C_0 % gcd;
if( C_1 % gcd != c ){
RETURN( "NaN" );
}
ll lcm = ( B_0 / gcd ) * B_1;
ll answer = c + A[i_0][0] * B_0 * ( ( C_1 - c ) / gcd ) + A[i_0][1] * B_1 * ( ( C_0 - c ) / gcd );
answer = ( answer >= 0 ? answer % lcm : ( lcm - ( -answer ) % lcm ) % lcm );
RETURN( answer );
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0