結果

問題 No.2392 二平方和
ユーザー nononnonon
提出日時 2023-07-28 21:21:31
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,061 bytes
コンパイル時間 1,599 ms
コンパイル使用メモリ 196,548 KB
最終ジャッジ日時 2025-02-15 19:53:25
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
using ch = char;
using bl = bool;
using st = string;
using pll = pair<ll,ll>;
using psl = pair<st,ll>;
using vst = vector<st>;
using vch = vector<ch>;
using vvch = vector<vch>;
using vbl = vector<bl>;
using vvbl = vector<vbl>;
using vdb = vector<db>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using vpsl = vector<psl>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++)
const ll mod = 998244353;
const ll INF = 3e18;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (a==0)return b;
if (b==0)return a;
ll c=a;
while(a%b!=0){
c=a%b;
a=b;
b=c;
}
return b;
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
ll Pow(ll a, ll n){
ll res=1;
while(n>0){
if(n%2==1)res*=a;
a*=a;
n/=2;
}
return res;
}
ll Pow(ll a, ll n, ll p){
ll res=1;
while(n>0){
a%=p;
if(n%2==1)res*=a;
a*=a;
res%=p;
n/=2;
}
return res;
}
void yn(bl ok){
if(ok==true){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
vpll pf(ll n){
vpll res;
for (ll i=2; i*i<=n; i++){
if (n%i!=0) continue;
ll ex=0;
while(n%i==0){
ex++;
n/=i;
}
res.push_back({i,ex});
}
if (n!=1)res.push_back({n,1});
return res;
}
ll P;
int main(){
cin>>P;
yn(P%4!=3);
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0