/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 524.0 KiB
#2 Wrong Answer 16ms 1.102 MiB
#3 Wrong Answer 16ms 1.094 MiB
#4 Wrong Answer 20ms 1.137 MiB
#5 Wrong Answer 15ms 1.117 MiB
#6 Wrong Answer 16ms 1.129 MiB
#7 Wrong Answer 17ms 1.113 MiB
#8 Wrong Answer 16ms 924.0 KiB
#9 Wrong Answer 35ms 1.629 MiB
#10 Wrong Answer 16ms 1.141 MiB

Code

// I AM A MUSLIM

#include "bits/stdc++.h"

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define fastIO std::ios::sync_with_stdio(0);std::cin.tie(0)
#define ll long long int
#define flush fflush(stdout)
#define bl printf("\n")
#define yn(a, b) printf("%s\n", a >= b ? "Yes":"No")
// #define int ll

using pii = std::pair<int,int>;

const int MOD = 1000000007;
// const int MOD = 998244353;
const int mxN = 500005, inf = INT_MAX;

signed main() {
    // fastIO;
    int testCases=1;
    scanf("%d",&testCases);
    // std::cin>>testCases;
    
    int a[20000];
    a[0] = 6;
    a[1] = 10;
    a[2] = 15;
    a[3] = 18;
    a[4] = 20;
    a[5] = 24;
    ll six, ten, fif;
    six = 36, ten = 30, fif = 45;
    for (int i = 6; i < 20000; i++) {
        a[i] = std::min({six, ten, fif});
        int dv = a[i]/6;
        six = (dv+1)*6;
        dv = a[i]/10;
        ten = (dv+1)*10;
        dv = a[i]/15;
        fif = (dv+1)*15;
    }
    
    for (int TC = 1; TC <= testCases; TC++) {
        int N;
        scanf("%d",&N);
        for (int i = 0; i < N; i++) printf("%d ",a[i]); bl;
    }
    
    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 16:20:17
Judged At
2024-10-03 13:37:55
Judged By
Score
10
Total Time
35ms
Peak Memory
1.629 MiB