/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 5ms 1.527 MiB
#2 Wrong Answer 35ms 2.102 MiB
#3 Wrong Answer 34ms 2.02 MiB
#4 Wrong Answer 54ms 2.043 MiB
#5 Wrong Answer 35ms 2.012 MiB
#6 Wrong Answer 34ms 2.02 MiB
#7 Wrong Answer 54ms 2.102 MiB
#8 Wrong Answer 36ms 2.027 MiB
#9 Wrong Answer 43ms 2.52 MiB
#10 Wrong Answer 34ms 2.148 MiB

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;
        set<int>v;
        v.insert(6);v.insert(10);v.insert(15);
        for(int i=18;i<=100000;i+=6)
        {
            v.insert(i);
        }
        for(int i=20;i<=100000;i+=10)
        {
            v.insert(i);
        }
        int cnt=0;
        for(auto i:v)
        {
            cout<<i<<" ";
            cnt++;
            if(cnt==n)break;
           }
        cout<<endl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1070 Strange Sequences
Language
C++17 (G++ 13.2.0)
Submit At
2024-07-17 11:06:53
Judged At
2024-07-17 11:06:53
Judged By
Score
10
Total Time
54ms
Peak Memory
2.52 MiB