結果

問題 No.2392 二平方和
ユーザー Qingrui DongQingrui Dong
提出日時 2023-07-28 21:31:41
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 62 ms / 2,000 ms
コード長 6,612 bytes
コンパイル時間 1,699 ms
コンパイル使用メモリ 168,172 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-06 17:46:15
合計ジャッジ時間 2,861 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

#include<bits/stdc++.h>
#define ll long long
#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)>(b)?(a):(b))
#define inf 0x3f3f3f3f
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define i128 __int128
#define x first
#define y second
using namespace std;
class fastIO {
private:
char ibuf[50007], *p1 = ibuf, *p2 = ibuf, obuf[50007], *p3 = obuf, sta[50];
bool file_end = false;
char get() {
return p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 50007, stdin), p1 == p2) ? (file_end = true), char(EOF)
: *p1++;
}
void put(const char x) {
p3 - obuf < 50007 ? *p3++ = x : (fwrite(obuf, p3 - obuf, 1, stdout), p3 = obuf, *p3++ = x);
}
public:
explicit operator bool() { return !file_end; }
size_t flush() {
size_t f = fwrite(obuf, p3 - obuf, 1, stdout);
p3 = obuf;
*p3 = 0;
return f;
}
fastIO &operator>>(char &t) {
for (t = get(); !isgraph(t); t = get());
return *this;
}
template<typename any>
typename enable_if<is_same<any, char>::value, any>::type tpval() {
char t;
for (t = get(); !isgraph(t); t = get());
return t;
}
fastIO &operator>>(char *t) {
char c;
for (c = get(); !isgraph(c); c = get());
for (; isgraph(c); c = get())*t = c, t++;
*t = 0;
return *this;
}
fastIO &operator>>(string &t) {
t.clear();
char c;
for (c = get(); !isgraph(c); c = get());
for (; isgraph(c); c = get())t += c;
return *this;
}
template<typename any>
typename enable_if<is_same<any, string>::value, any>::type tpval() {
string t;
char c;
for (c = get(); !isgraph(c); c = get());
for (; isgraph(c); c = get())t += c;
return t;
}
template<typename any>
typename enable_if<
(is_signed<any>::value && is_integral<any>::value && !is_same<any, char>::value) ||
is_same<any, __int128_t>::value, fastIO>::type &operator>>(any &t) {
t = 0;
bool y = 0;
char c = get();
for (; !isdigit(c); c = get())if (c == 45)y = true;
for (; isdigit(c); c = get())t = t * 10 + c - 48;
if (y == 1)t = -t;
return *this;
}
template<typename any>
typename enable_if<
(is_signed<any>::value && is_integral<any>::value && !is_same<any, char>::value) ||
is_same<any, __int128_t>::value, any>::type tpval() {
any t = 0;
bool y = 0;
char c = get();
for (; !isdigit(c); c = get())if (c == 45)y = true;
for (; isdigit(c); c = get())t = t * 10 + c - 48;
if (y == 1)t = -t;
return t;
}
template<typename any>
typename enable_if<
(is_unsigned<any>::value && is_integral<any>::value && !is_same<any, char>::value) ||
is_same<any, __uint128_t>::value, fastIO>::type &operator>>(any &t) {
t = 0;
char c = get();
for (; !isdigit(c); c = get());
for (; isdigit(c); c = get())t = t * 10 + c - 48;
return *this;
}
template<typename any>
typename enable_if<
(is_unsigned<any>::value && is_integral<any>::value && !is_same<any, char>::value) ||
is_same<any, __uint128_t>::value, any>::type tpval() {
any t = 0;
char c = get();
for (; !isdigit(c); c = get());
for (; isdigit(c); c = get())t = t * 10 + c - 48;
return t;
}
template<typename any1, typename any2>
fastIO &operator>>(pair<any1, any2> &t) { return *this >> t.first >> t.second; }
template<typename any1, typename any2>
pair<any1, any2> tpval() { return pair<any1, any2>(tpval<any1>(), tpval<any2>()); }
template<typename any>
fastIO &read(any &t) { return *this >> t; }
fastIO &read(char *t) {
char c;
for (c = get(); !isgraph(c); c = get());
for (; isgraph(c); c = get())*t = c, t++;
*t = 0;
return *this;
}
template<typename any, typename...args>
fastIO &read(any &t1, args &...t2) { return (*this >> t1).read(t2...); }
fastIO &operator<<(const char t) {
put(t);
return *this;
}
fastIO &operator<<(const char *t) {
for (; *t; t++)put(*t);
return *this;
}
fastIO &operator<<(const string &t) {
for (const char it: t)put(it);
return *this;
}
template<typename any>
typename enable_if<
(is_signed<any>::value && is_integral<any>::value && !is_same<any, char>::value) ||
is_same<any, __int128_t>::value, fastIO>::type &operator<<(any t) {
if (!t) {
put(48);
return *this;
}
int len = 0;
if (t < 0)t = -t, put(45);
while (t)sta[len++] = char(t % 10 + 48), t /= 10;
while (len--)put(sta[len]);
return *this;
}
template<typename any>
typename enable_if<
(is_unsigned<any>::value && is_integral<any>::value && !is_same<any, char>::value) ||
is_same<any, __uint128_t>::value, fastIO>::type &operator<<(any t) {
if (!t) {
put(48);
return *this;
}
int len = 0;
while (t)sta[len++] = char(t % 10 + 48), t /= 10;
while (len--)put(sta[len]);
return *this;
}
template<typename any1, typename any2>
fastIO &operator<<(const pair<any1, any2> &t) { return *this << t.first << ' ' << t.second; }
template<typename any>
fastIO &write(const any &t) { return *this << t; }
template<typename any, typename...args>
fastIO &write(const any &t1, const args &...t2) { return (*this << t1).write(t2...); }
~fastIO() { fwrite(obuf, p3 - obuf, 1, stdout); }
} FastIO;
#ifdef ONLINE_JUDGE
#define cin FastIO
#define cout FastIO
#endif
typedef pair<ll,ll> PII;
typedef pair<ll,string> PIS;
const int N = 2e5+10;
const ll mod = 998244353;
const double PI = acos(-1);
ll n,m,k;
void solve() {
cin >> n;
for(int i = 1;i <= 10000;i++){
for(int j = i;j <= 10000;j++){
if(i * i + j * j == n){
cout << "Yes\n";
return;
}
else if(i * i + j * j >= n){
break;
}
}
}
cout << "No\n";
return;
}
int main(){
//IOS
//freopen("D:\\Rykun\\ATC\\1.txt","r",stdin);
int tt = 1;
//cin >> tt;
while(tt--)
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0