#944951 (C++14) No.2609 Decreasing GCDs

• 問題: No.2609 Decreasing GCDs
• ユーザー: gucci0512
• 提出日時: 2024-01-19 21:52:02
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 5 ms / 1,000 ms
• コード長: 4,113 bytes
• コンパイル時間: 4,046 ms
• コンパイル使用メモリ: 236,860 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-01-19 21:52:07
• 合計ジャッジ時間: 5,105 ms
• ジャッジサーバーID （参考情報）: judge14 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 6,676 KB
testcase_01	AC	4 ms; 6,676 KB
testcase_02	AC	4 ms; 6,676 KB
testcase_03	AC	4 ms; 6,676 KB
testcase_04	AC	4 ms; 6,676 KB
testcase_05	AC	4 ms; 6,676 KB
testcase_06	AC	4 ms; 6,676 KB
testcase_07	AC	4 ms; 6,676 KB
testcase_08	AC	4 ms; 6,676 KB
testcase_09	AC	4 ms; 6,676 KB
testcase_10	AC	4 ms; 6,676 KB
testcase_11	AC	4 ms; 6,676 KB
testcase_12	AC	4 ms; 6,676 KB
testcase_13	AC	3 ms; 6,676 KB
testcase_14	AC	3 ms; 6,676 KB
testcase_15	AC	4 ms; 6,676 KB
testcase_16	AC	4 ms; 6,676 KB
testcase_17	AC	5 ms; 6,676 KB
testcase_18	AC	4 ms; 6,676 KB
testcase_19	AC	4 ms; 6,676 KB
testcase_20	AC	5 ms; 6,676 KB
testcase_21	AC	4 ms; 6,676 KB
testcase_22	AC	4 ms; 6,676 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
// url 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
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; }
typedef long long ll;
typedef long double lld;
using namespace std;
using namespace atcoder;
using mint = static_modint<998244353>;
const ll mod=998244353;
// using mint = static_modint<1000000007>;
//const ll mod=1e9+7;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const string zton="0123456789";
const string atoz="abcdefghijklmnopqrstuvwxyz";
const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ll inf=(1ll<<60);
// const int inf=(1<<30);
lld dist(lld x1,lld x2,lld y1,lld y2){
    lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    res=sqrt(abs(res));
    return res;
}
lld arg(lld x,lld y){
    const lld eps=1e-8;
    lld res=0;
    if(abs(x)+abs(y)<=eps)return 0.0;
    else if(abs(x)<=eps){
        if(y>=0.0)return (M_PI/2);
        else return (M_PI/2+M_PI);
    }
    else if(abs(y)<=eps){
        if(x>=0.0)return 0.0;
        else return M_PI;
    }
    res=atan2(abs(y),abs(x));
    if(x<=0&&y>=0)res=(M_PI-res);
    else if(x<=0&&y<=0)res+=(M_PI);
    else if(x>=0&&y<=0)res=(M_PI*2-res);
    return res;
}
ll gcd(ll a,ll b){
    if(a==0||b==0)return a+b;
    ll r;
    r=a%b;
    if(r==0){
        return b;
    }
    else{
        return gcd(b,r);
    }
}
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}
__int128 parse128(string &s) {
    __int128 ret = 0;
    for (int i = 0; i < s.length(); i++){
        if ('0' <= s[i] && s[i] <= '9'){
            ret = 10 * ret + s[i] - '0';
        }
    }
    return ret;
}
using l3 = __int128;

bool comp_arg(pair<ll,ll> a,pair<ll,ll> b){
    if(a.second>=0&&b.second<0)return true;
    else if(a.second<0&&b.second>=0)return false;
    if(a.second>=0&&b.second>=0){
        if(a.first>=0&&b.first<0)return true;
    }
    else{
        if(a.first>=0&&b.first<0)return false;
    }
    ll det=a.first*b.second-a.second*b.first;
    if(det>0)return true;
    return false;
}

typedef pair<ll,int> P;
const int eratosSize=201010;
int eratos[eratosSize];
void Init(){
    rep(i,0,eratosSize)eratos[i]=-1;
    eratos[0]=1;
    eratos[1]=1;
    rep(i,2,eratosSize){
        if(eratos[i]!=-1)continue;
        eratos[i]=i;
        int x=i*2;
        while(x<eratosSize){
            if(eratos[x]==-1){
                eratos[x]=i;
            }
            x+=i;
        }
    }
}
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    Init();
    vector<int> g;
    queue<int> que;
    rep(i,2,eratosSize){
        if(eratos[i]==i){
            if(g.size()==24)que.push(i);
            else g.pb(i);
        }

    }
    reverse(all(g));
    int N=25;
    int A[N];fill(A,A+N,1);
    rep(i,0,N-1){
        A[i]*=g[i];
        A[i+1]*=g[i];
    }
    rep(i,2,N){
        int b=A[i-1]/A[i]+1;
        while(true){
            if(A[i]*b<A[i-1]){
                b++;
            }
            else{
                int g1=gcd(A[i-2],A[i-1]);
                int g2=gcd(A[i-1],A[i]*b);
                if(g1<=g2)b++;
                else break;
            }
        }
        A[i]*=b;
    }
    cin >> N;
    rep(i,0,N){
        cout << A[i] << " ";
    }
    cout << endl;

}