/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 532.0 KiB
#2 Wrong Answer 114ms 1.066 MiB
#3 Wrong Answer 112ms 1.188 MiB
#4 Wrong Answer 111ms 1.027 MiB
#5 Wrong Answer 109ms 1.047 MiB
#6 Wrong Answer 111ms 1.23 MiB
#7 Wrong Answer 110ms 1.23 MiB
#8 Wrong Answer 110ms 1.039 MiB
#9 Wrong Answer 271ms 1.785 MiB
#10 Wrong Answer 98ms 1016.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
#define nl "\n"
#define all(x) (x).begin(), (x).end()
#define Yes cout<<"Yes"<<"\n";
#define No  cout<<"No"<<"\n"; 
vector<int> generatePrimes(int N) {
    vector<int> primes;
    int num = 2;
    while (primes.size() < N) {
        bool isPrime = true;
        for (int i = 2; i * i <= num; ++i) {
            if (num % i == 0) {
                isPrime = false;
                break;
            }
        }
        if (isPrime) {
            primes.push_back(num);
        }
        ++num;
    }
    return primes;
}
void run(int t){
    int  n,k,m;
    cin >> n;
    vector<int> primes = generatePrimes(n);
    for (int i = 0; i < n; ++i) {
        cout << primes[i] << " ";
    }
        cout << nl;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin >> t;
    int c  = 1;
    while(t--){
        //cout << "Case " << c++ << ": ";
        run(t);
    }
    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:12:51
Judged At
2024-10-03 13:38:13
Judged By
Score
0
Total Time
271ms
Peak Memory
1.785 MiB