Submission #1607398
Source Code Expand
// need #include <iostream> #include <algorithm> // data structure #include <bitset> //#include <list> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <utility> #include <vector> #include <array> //#include <tuple> //#include <unordered_map> #include <unordered_set> #include <complex> //#include <deque> #include<valarray> // stream //#include <istream> //#include <sstream> //#include <ostream> //#include <fstream> // etc #include <cmath> #include <cassert> #include <functional> #include <iomanip> //#include <typeinfo> #include <chrono> #include <random> #include <numeric> // input #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; } template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } #define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);} template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } #define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i; // output #define OUT(d) std::cout<<d; #define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d; #define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d; #define SP std::cout<<" "; #define TAB std::cout<<"\t"; #define BR std::cout<<"\n"; #define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' '); #define ENDL std::cout<<std::endl; #define FLUSH std::cout<<std::flush; #define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";} #define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";} #define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}} #define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";} // utility #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i<int(n);++i) #define RREP(i, n) for(int i=int(n)-1;i>=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i) #define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i) #define REPLL(i, n) for(ll i=0;i<ll(n);++i) #define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i) #define IN(a, x, b) (a<=x && x<b) template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; } // test template<class T> std::vector<std::vector<T>> VV(int n) { return std::vector<std::vector<T>>(n); } template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) { return std::vector<std::vector<T>>(n, std::vector<T>(m, init)); } template<typename S, typename T> std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; } // type/const #define int ll using ll = long long; using ull = unsigned long long; using PAIR = std::pair<int, int>; using PAIRLL = std::pair<ll, ll>; constexpr int INFINT = 1 << 30; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18 constexpr double EPS = 1e-7; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238462643383279; std::vector<int> Eratosthenes(int n) { std::vector<bool> num(n, true); std::vector<int> prime; num[0] = false; for (int i = 0; i*i < n; ++i) { if (num[i]) { for (int j = 2; (i + 1)*j <= n; ++j) { num[(i + 1)*j - 1] = false; } } } for (int i = 0; i < n; ++i) { if (num[i]) { prime.push_back(i + 1); } } return prime; } signed main() { INIT; VAR(int, n); OUT(Eratosthenes(n-1).size())BR; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 与えられた数より小さい素数の個数について |
User | satanic0258 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 5351 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample1, 00_sample2, 00_sample3, 10_testcase00, 10_testcase01, 10_testcase02, 10_testcase03, 10_testcase04, 10_testcase05, 10_testcase06, 10_testcase07, 10_testcase08, 10_testcase09, 10_testcase10, 10_testcase11, 10_testcase12, 10_testcase13, 10_testcase14, 10_testcase15, 10_testcase16, 10_testcase17, 10_testcase18, 10_testcase19, 10_testcase20, 10_testcase21, 10_testcase22, 10_testcase23, 10_testcase24, 10_testcase25, 10_testcase26, 10_testcase27, 10_testcase28, 10_testcase29, 10_testcase30, 10_testcase31, 10_testcase32, 10_testcase33, 10_testcase34, 10_testcase35, 10_testcase36, 10_testcase37, 10_testcase38, 10_testcase39, 10_testcase40, 10_testcase41, 10_testcase42, 10_testcase43, 10_testcase44, 10_testcase45, 10_testcase46, 10_testcase47, 10_testcase48, 10_testcase49, 10_testcase50, 10_testcase51, 10_testcase52, 10_testcase53, 10_testcase54, 10_testcase55, 10_testcase56, 10_testcase57, 10_testcase58, 10_testcase59, 10_testcase60, 10_testcase61, 10_testcase62, 10_testcase63, 10_testcase64, 10_testcase65, 10_testcase66, 10_testcase67, 10_testcase68, 10_testcase69, 10_testcase70, 10_testcase71, 10_testcase72, 10_testcase73, 10_testcase74, 10_testcase75, 10_testcase76, 10_testcase77, 10_testcase78, 10_testcase79, 10_testcase80, 10_testcase81, 10_testcase82, 10_testcase83, 10_testcase84, 10_testcase85, 10_testcase86 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample1 | AC | 1 ms | 256 KB |
00_sample2 | AC | 1 ms | 256 KB |
00_sample3 | AC | 1 ms | 256 KB |
10_testcase00 | AC | 1 ms | 256 KB |
10_testcase01 | AC | 1 ms | 256 KB |
10_testcase02 | AC | 1 ms | 256 KB |
10_testcase03 | AC | 1 ms | 256 KB |
10_testcase04 | AC | 1 ms | 256 KB |
10_testcase05 | AC | 1 ms | 256 KB |
10_testcase06 | AC | 1 ms | 256 KB |
10_testcase07 | AC | 1 ms | 256 KB |
10_testcase08 | AC | 1 ms | 256 KB |
10_testcase09 | AC | 1 ms | 256 KB |
10_testcase10 | AC | 1 ms | 256 KB |
10_testcase11 | AC | 1 ms | 256 KB |
10_testcase12 | AC | 1 ms | 256 KB |
10_testcase13 | AC | 1 ms | 256 KB |
10_testcase14 | AC | 1 ms | 256 KB |
10_testcase15 | AC | 1 ms | 256 KB |
10_testcase16 | AC | 1 ms | 256 KB |
10_testcase17 | AC | 1 ms | 256 KB |
10_testcase18 | AC | 1 ms | 256 KB |
10_testcase19 | AC | 1 ms | 256 KB |
10_testcase20 | AC | 1 ms | 256 KB |
10_testcase21 | AC | 1 ms | 256 KB |
10_testcase22 | AC | 1 ms | 256 KB |
10_testcase23 | AC | 1 ms | 256 KB |
10_testcase24 | AC | 1 ms | 256 KB |
10_testcase25 | AC | 1 ms | 256 KB |
10_testcase26 | AC | 1 ms | 256 KB |
10_testcase27 | AC | 1 ms | 256 KB |
10_testcase28 | AC | 1 ms | 256 KB |
10_testcase29 | AC | 1 ms | 256 KB |
10_testcase30 | AC | 1 ms | 256 KB |
10_testcase31 | AC | 1 ms | 256 KB |
10_testcase32 | AC | 1 ms | 256 KB |
10_testcase33 | AC | 1 ms | 256 KB |
10_testcase34 | AC | 1 ms | 256 KB |
10_testcase35 | AC | 1 ms | 256 KB |
10_testcase36 | AC | 1 ms | 256 KB |
10_testcase37 | AC | 1 ms | 256 KB |
10_testcase38 | AC | 1 ms | 256 KB |
10_testcase39 | AC | 1 ms | 256 KB |
10_testcase40 | AC | 1 ms | 256 KB |
10_testcase41 | AC | 1 ms | 256 KB |
10_testcase42 | AC | 1 ms | 256 KB |
10_testcase43 | AC | 1 ms | 256 KB |
10_testcase44 | AC | 1 ms | 256 KB |
10_testcase45 | AC | 1 ms | 256 KB |
10_testcase46 | AC | 1 ms | 256 KB |
10_testcase47 | AC | 1 ms | 256 KB |
10_testcase48 | AC | 1 ms | 256 KB |
10_testcase49 | AC | 1 ms | 256 KB |
10_testcase50 | AC | 1 ms | 256 KB |
10_testcase51 | AC | 1 ms | 256 KB |
10_testcase52 | AC | 1 ms | 256 KB |
10_testcase53 | AC | 1 ms | 256 KB |
10_testcase54 | AC | 1 ms | 256 KB |
10_testcase55 | AC | 1 ms | 256 KB |
10_testcase56 | AC | 1 ms | 256 KB |
10_testcase57 | AC | 1 ms | 256 KB |
10_testcase58 | AC | 1 ms | 256 KB |
10_testcase59 | AC | 1 ms | 256 KB |
10_testcase60 | AC | 1 ms | 256 KB |
10_testcase61 | AC | 1 ms | 256 KB |
10_testcase62 | AC | 1 ms | 256 KB |
10_testcase63 | AC | 1 ms | 256 KB |
10_testcase64 | AC | 1 ms | 256 KB |
10_testcase65 | AC | 1 ms | 256 KB |
10_testcase66 | AC | 1 ms | 256 KB |
10_testcase67 | AC | 1 ms | 256 KB |
10_testcase68 | AC | 1 ms | 256 KB |
10_testcase69 | AC | 1 ms | 256 KB |
10_testcase70 | AC | 1 ms | 256 KB |
10_testcase71 | AC | 1 ms | 256 KB |
10_testcase72 | AC | 1 ms | 256 KB |
10_testcase73 | AC | 1 ms | 256 KB |
10_testcase74 | AC | 1 ms | 256 KB |
10_testcase75 | AC | 1 ms | 256 KB |
10_testcase76 | AC | 1 ms | 256 KB |
10_testcase77 | AC | 1 ms | 256 KB |
10_testcase78 | AC | 1 ms | 256 KB |
10_testcase79 | AC | 1 ms | 256 KB |
10_testcase80 | AC | 1 ms | 256 KB |
10_testcase81 | AC | 1 ms | 256 KB |
10_testcase82 | AC | 1 ms | 256 KB |
10_testcase83 | AC | 1 ms | 256 KB |
10_testcase84 | AC | 1 ms | 256 KB |
10_testcase85 | AC | 1 ms | 256 KB |
10_testcase86 | AC | 1 ms | 256 KB |