Submission #1246811
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <cmath> #include <cstdio> #include <functional> #include <numeric> #include <stack> #include <queue> #include <map> #include <set> #include <utility> #include <sstream> #include <complex> #include <fstream> #include <bitset> #include <time.h> using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef vector<ll> V; typedef complex<double> Point; #define PI acos(-1.0) #define EPS 1e-10 const ll INF = 1e9 + 7; const ll MOD = 1e9 + 7; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,N) for(int i=0;i<(N);i++) #define ALL(s) (s).begin(),(s).end() #define EQ(a,b) (abs((a)-(b))<EPS) #define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) ) #define fi first #define se second int n; int prime[1000000000]; //i番目の素数 bool is_prime[1000000000 + 1];//is_prime[i]==1ならiは素数 int sieve(int n) {//n以下の素数の数を返す int p = 0; for (int i = 0; i <= n; i++)is_prime[i] = 1; is_prime[0] = is_prime[1] = 0; for (int i = 2; i <= n; i++) { if (is_prime[i]) { prime[p++] = i; for (int j = 2 * i; j <= n; j += i)is_prime[j] = 0; } } return p; } int main() { cin >> n; sieve(n); if (is_prime[n]) { cout << "Prime" << endl; return 0; } if (n % 10 % 2 != 0 && n % 10 != 5 && n % 3 != 0 && n != 1) { cout << "Prime" << endl; return 0; } cout << "Not Prime" << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 素数判定 |
User | jimmy |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1522 Byte |
Status | CE |
Compile Error
/tmp/ccXLACJG.o: In function `main': Main.cpp:(.text.startup+0x5): relocation truncated to fit: R_X86_64_32 against symbol `n' defined in .bss section in /tmp/ccXLACJG.o Main.cpp:(.text.startup+0x15): relocation truncated to fit: R_X86_64_PC32 against symbol `n' defined in .bss section in /tmp/ccXLACJG.o Main.cpp:(.text.startup+0x21): relocation truncated to fit: R_X86_64_PC32 against symbol `n' defined in .bss section in /tmp/ccXLACJG.o /tmp/ccXLACJG.o: In function `_GLOBAL__sub_I_n': Main.cpp:(.text.startup+0xc5): relocation truncated to fit: R_X86_64_32 against `.bss' Main.cpp:(.text.startup+0xd4): relocation truncated to fit: R_X86_64_32 against `.bss' collect2: error: ld returned 1 exit status