結果

問題 No.1218 Something Like a Theorem
ユーザー renjyaku_int
提出日時 2020-09-05 15:53:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 9 ms / 2,000 ms
コード長 4,153 bytes
コンパイル時間 2,196 ms
コンパイル使用メモリ 203,000 KB
最終ジャッジ日時 2025-01-14 07:12:22
ジャッジサーバーID
(参考情報)
judge3 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

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

//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const ll INF = 1e9;
const ll LINF = ll(1e18);
const ll MOD = 1000000007;
const ll dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const ll Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
//cout<<fixed<<setprecision(15);15
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const ll M = pow(10, 9) + 7;
vector<ll> fac(1000001); //n!(mod M)
vector<ll> ifac(1000001); //k!^{M-2} (mod M)
ll mpow(ll x, ll n)
{ //x^n(mod M)
ll ans = 1;
while (n != 0)
{
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
//conbination
ll comb(ll a, ll b)
{ //aCb(mod M)
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
//o√n
map<int, int> prime_factor(int n)
{
map<int, int> res;
for (int i = 2; i * i <= n; i++)
{
while (n % i == 0)
{
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
// for (int i = 2; i <= n; i++)
//cout << res[i] << "\n";
return res;
}
//n!
ll fact_mod(ll n)
{
ll ret = 1;
for (ll i = 2; i <= n; i++)
ret = ret * (i % MOD) % MOD;
return ret;
}
vector<ll> fact_mod_v(ll n)
{
ll ret = 1;
vector<ll> res(n + 1, 1);
for (ll i = 2; i <= n; i++)
{
ret = ret * (i % MOD) % MOD;
res[i] = ret;
}
return res;
}
//
ll pow_mod(ll x, ll n)
{
if (n == 0)
return 1;
ll ret = pow_mod((x * x) % MOD, n / 2);
if (n & 1)
ret = (ret * x) % MOD;
return ret;
}
//nCr O(r) n
ll combination_mod(ll n, ll r)
{
if (r > n - r)
r = n - r;
if (r == 0)
return 1;
ll a = 1;
//a=n!/(n-r)!=n~n-r+1->O(r)
for (ll i = 0; i < r; i++)
a = a * ((n - i) % MOD) % MOD;
//b=inv(r!)
ll b = pow_mod(fact_mod(r), MOD - 2);
return (a % MOD) * (b % MOD) % MOD;
}
ll inv_mod(ll n)
{
//
return pow_mod(n, MOD - 2);
}
const int N_MAX = 1001;
double pascal[N_MAX][N_MAX] = {};
//
// Ver
// n 2^n ( = 1)
void calc_pascal()
{
FOR(i, 0, N_MAX)
{
pascal[i][0] = 1.0 / pow(2.0f, i);
}
pascal[1][1] = 1.0 / 2.0;
FOR(i, 2, N_MAX)
{
for (int j = 1; j <= i; j++)
{
pascal[i][j] = pascal[i - 1][j] + pascal[i - 1][j - 1];
pascal[i][j] /= 2.0;
}
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n, z;
cin >> n >> z;
if (n >= 3)
return no, 0;
if (n == 1)
{
if (z >= 2)
{
yes;
}
else
no;
}
else
{
for (int i = 1; i < z; i++)
{
int temp = (z - i) * (z + i);
if (temp > 0)
{
for (int j = 1; j < z; j++)
{
if (temp == pow(j, 2))
{
return yes, 0;
}
}
}
}
no;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0