Submission #1201609

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

using namespace std;

#define REP(i,N) for(int i = 0; i < N; i++)
vector<int> sosuu;

void printvec(void){
    for(int i = 0; i < 100; i++){
        cout << sosuu[i] << endl;
    }
}

void makeSosuu(){
    for(int i = 0; i < 100;){
        //素数を探す
        static int num = 1;
        num++;
        bool flag = true;
        for(int j = 2; j * j <= num; j++){
            if(num % j == 0) flag = false;
        }
        if(flag){
            // cout << num << " " ;
            sosuu.push_back(num);
            i++;
        }
    }
}

int main(){
    makeSosuu();
    printvec();
    return 0;
}

Submission Info

Judge Result