/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Wrong Answer 2ms 332.0 KiB
#2 Time Exceeded ≥1046ms ≥332.0 KiB
#3 Time Exceeded ≥1049ms ≥492.0 KiB
#4 Time Exceeded ≥1084ms ≥512.0 KiB
#5 Time Exceeded ≥1051ms ≥328.0 KiB
#6 Time Exceeded ≥1047ms ≥328.0 KiB
#7 Time Exceeded ≥1011ms ≥328.0 KiB
#8 Time Exceeded ≥1013ms ≥540.0 KiB
#9 Time Exceeded ≥1015ms ≥516.0 KiB
#10 Time Exceeded ≥1047ms ≥588.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define mpp map<long long,long long>
#define ss set<long long>
#define vp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define all_n for(int i=0;i<n;i++)
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
    ll t;
    cin>>t;
    while (t--){
        ll n;
        cin>>n;
        vv v(n);
        v[0]=6;
        v[1]=10;
        for (int i = 2; i < n; ++i) {
            ll x= gcd(v[i-1],v[i-2]);
            ll j=v[i-1]+1;
            while (j%x==0 or gcd(j,v[i-1])==1){
                j++;
            }
            v[i]=j;
        }
        for(auto it:v){
            cout<<it<<" ";
        }
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1070 Strange Sequences
Contest
Brain Booster #4
Language
C++17 (G++ 13.2.0)
Submit At
2024-07-14 17:22:32
Judged At
2024-10-03 13:36:14
Judged By
Score
0
Total Time
≥1084ms
Peak Memory
≥588.0 KiB