結果

問題 No.2070 Icosahedron
ユーザー namakoiscatnamakoiscat
提出日時 2022-09-16 21:25:33
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 4 ms / 2,000 ms
コード長 7,459 bytes
コンパイル時間 2,021 ms
コンパイル使用メモリ 211,244 KB
最終ジャッジ日時 2025-02-07 06:04:30
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 9
権限があれば一括ダウンロードができます

ソースコード

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

// __builtin_popcount() ;
// multiset ;
// unordered_set ;
// reverse ;
/*
#include <atcoder/all>
using namespace atcoder ;
*/
#include <bits/stdc++.h>
using namespace std;
/*
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
typedef cpp_int cp ;
*/
typedef long long ll;
typedef string st ;
typedef long double ld ;
typedef unsigned long long ull ;
const ll mod0 = 1000000007;
const ll mod1 = 998244353 ;
const ll LINF = 1000000000000000000 ; //(10^18)
const int INF = 1000000000 ; // (10^9)
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) x.begin(), x.end()
#define rep(i,a,n) for (ll i = a; i <= (n); ++i)
#define re return 0;
#define fore(i,a) for(auto &i:a)
#define V vector
const ld pai = acos(-1) ;
using P = pair<ll,ll> ;
using Edge = tuple<ll,ll,ll> ;
using AAA = tuple<ll,ll,ll,ll> ;
#define C cout
#define E "\n";
//
st zz = "abcdefghijklmnopqrstuvwxyz" ;
st ZZ = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ;
st tintin = "%" ;
st Y = "Yes" ;
st YY = "No" ;
st at = "atcoder" ;
st KU = " " ;
void chmin(ll& x ,ll y){x = min(x,y) ;}
void chmax(ll& x ,ll y){x = max(x,y) ;}
vector<ll> Y4 = {0,1,0,-1} ;
vector<ll> X4 = {1,0,-1,0} ;
vector<ll> Y8 = {0,1,1,1,0,-1,-1,-1} ;
vector<ll> X8 = {1,1,0,-1,-1,-1,0,1} ;
ll gcd(ll a, ll b){
if(b == 0){
return a;
}
return gcd(b,a%b) ;
}
ll lcm(ll a, ll b){
ll ans = a*b /gcd(a,b) ;
return ans ;
}
// true --→  false --→ 
bool nis(ll a){
bool flag = true ;
rep(i,2,sqrt(a)+1){
if(a%i == 0){
flag = false ;
break ;
}
}
return flag ;
}
ll jun(ll a,ll b, ll c,ll rank ){
vector<ll> ANS ;
ANS.pb(-LINF) ;
ANS.pb(a) ;
ANS.pb(b) ;
ANS.pb(c) ;
sort(all(ANS)) ;
return ANS[rank] ;
}
// UF.initrep
vector<ll> par;
class UnionFind {
public:
//
void init(ll sz) {
par.resize(sz,-1);
}
//
ll root(ll x) {
if (par[x] < 0) return x;
return par[x] = root(par[x]);
}
//
bool unite(ll x, ll y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x,y);
par[x] += par[y];
par[y] = x;
return true;
}
//
bool same(ll x, ll y) { return root(x) == root(y);}
//
ll size(ll x) { return -par[root(x)];}
};
UnionFind UF ;
vector<ll> enumdiv(ll n) {
vector<ll> S;
for (ll i = 1; i*i <= n; i++) if (n%i == 0) { S.pb(i); if (i*i != n) S.pb(n / i); }
sort(S.begin(), S.end());
return S;
}
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_priority_queue = priority_queue<T, vector<T>, less<T>> ;
// 使 min_priority_queue<ll ()> Q ;
vector<pair<long long, long long>> prime_factorize(long long N){
vector<pair<long long, long long>> res;
for(long long a = 2; a * a <= N; ++a){
if(N % a != 0) continue;
long long ex = 0;
while(N % a == 0) ++ex, N /= a;
res.push_back({a,ex});
}
if(N != 1) res.push_back({N,1});
return res;
}
ll dist[1 << 18] ;
vector<ll> GG[1 << 18] ;
void bfs(ll N ,ll a){
queue<ll> Q ;
Q.push(a) ;
rep(i,0,N){
dist[i] = -1 ;
}
dist[a] = 0 ;
while(!Q.empty()){
ll pos = Q.front() ;
Q.pop() ;
fore(u,GG[pos]){
if(dist[u] == -1){
dist[u] = dist[pos] + 1 ;
Q.push(u) ;
}
}
}
}
ll binpower(ll a, ll b,ll c) {
ll ans = 1;
while (b != 0) {
if (b % 2 == 1) {
ans = (ans)*a % c;
}
a = a*a % c;
b /= 2;
}
return ans;
}
// [a,b] [1,b] - [1,a]
ll countMultiple(ll R, ll div, ll mod) { // [1,R] and x % div == mod
if (R == 0) return 0;
ll res = R / div;
if (mod <= R % div and 0 < mod) res++;
return res;
}
template<typename T>
V<T> sr(V<T> A){
sort(all(A)) ;
reverse(all(A)) ;
return A ;
}
const ll mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint operator-() const {return mint(-x);}
mint(ll x=0):x((x%mod+mod)%mod){}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint a) const {
mint res(*this);
return res*=a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime mod
mint inv() const {
return pow(mod-2);
}
mint& operator/=(const mint a) {
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res/=a;
}
};
struct sqrt_machine{
V<ll> A ;
const ll M = 1000000 ;
void init(){
A.pb(-1) ;
rep(i,1,M){
A.pb(i*i) ;
}
A.pb(LINF) ;
}
bool scan(ll a){
ll pos = lower_bound(all(A),a) - A.begin() ;
if(A[pos] == -1 || A[pos] == LINF || A[pos] != a)return false ;
return true ;
}
};
struct SpakringBlackCocoa_Tree{
};
sqrt_machine SM ;
int main(void){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// SM.init() ;
// nis(ll a) true
// jun(ll a,ll b,ll c, ll d) d
// gcd(ll a , ll b) gcd
// lcm(ll a ,ll b ) lcd
// UF UF.init(ll N) ; UF.root(i) ; UF.unite(a,b) ; UF.same(a,b) ; UF.size(i) ;
// enumdiv(ll a )
// prime_factorize(ll p) ab
// bfs(ll N , ll a ) N = , a =  
// binpower(a,b,c) ab O(logb)
// countMultiple(ll R, ll div, ll mod) Rdiv mod  0
// sr(V<ll> A) sort --→ reverse   auto
// mod0 --→ 1000000007 mod1 --→ 998244353
// struct mint mod mod 1000000007
// SM.scan(ll a)  true  √10^6 SM.init()
ld N ;
cin>>N ;
ld a = N*N*N ;
ld p = ( 5.0*(3 + sqrt(5)) * a ) / 12.0 ;
C << fixed << setprecision(10) << p << E
// if(dx < 0 || dy < 0 || dx >= W || dy >= H) continue ;
// ld p = sqrt(abs((A[i] - A[j])*(A[i] - A[j])) + abs((B[i] - B[j])*(B[i] - B[j]))) ;
// C << fixed << setprecision(10) <<
re
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0