Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,011 | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
void makePri... | 343 |
Project_CodeNet | 2,015 | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool F[50005];
int main(){
for(int i=3;i<=50002;i+=2){F[i]=true;
for(int j=3;j*j<=i;j+=2)
if(i%j==0)F[i]=false;
}
F[2]=true;
int n;
while(1){
cin>>n;if(n==0)break;
int c=0;int P=n/2;
for(int i=2;i<=P;i++)
... | 151 |
Project_CodeNet | 2,020 | #include <iostream>
#include <numeric>
#define SIZE 50001
using namespace std;
int main(){
bool is_prime[50001];
is_prime[0] = is_prime[1] = false;
for(int i=2;i<50001;i++)
is_prime[i] = true;
for(int i=2;i*i<50001;i++){
if(is_prime[i]){
for(int j=i*i;j<50001;j+=i){
... | 191 |
Project_CodeNet | 2,012 | #include <iostream>
#include <list>
#include <bitset>
#include <cmath>
int main()
{
const int max = 50021;
std::bitset<max + 1> bitTable;
bitTable.set(0);
bitTable.set(1);
int loop = sqrt(max);
for (int i = 2; i <= loop; ++i) {
if (bitTable.test(i) == false) {
for (int j = i * i; j <= max; j += i) {
... | 283 |
Project_CodeNet | 2,016 | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n;
bool is_composite[1000001];
vector<int> primes;
int main() {
for (int i=2; i<=1000000; i++) {
if (!is_composite[i]) {
primes.push_back(i);
for (int j=i+i; j<=1000000; j+=i) is_composite[j] = true;
}
}
whil... | 226 |
Project_CodeNet | 2,014 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void sieve(int n,vector<char>& v){
v.resize(n+1);
fill(v.begin(),v.end(),true);
v[0]=v[1]=false;
for(int i=2;i*i<=n;i++){
if(v[i]){
for(int j=i+i;j<=n;j+=i){
v[j]=false;
}
... | 240 |
Project_CodeNet | 2,010 | #include <iostream>
using namespace std;
int main(){
int prime[10000],p = 3,n;
bool isprime[50001];
prime[1] = 2,prime[2] = 3;
isprime[1] = isprime[4] = false;
isprime[2] = isprime[3] = true;
for(int i=5;i < 50001;i++){
int f = 0;
for(int j=1;prime[j]*prime[j] <= i;j++) if(i % prime[j] == 0) {f = 1;break;}
... | 222 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <map>
#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(int x=from;x<to;x++)
using namespace std;
//素数num以下のふるい
void sosuu(int num,vector<bool>& Find){
// bool Find[num] ; // 探索リスト
for(int i... | 362 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | 1,202 |
Project_CodeNet | 2,014 | #include <iostream>
#include <cmath>
using namespace std;
int Prime[50000];
int isPrime(int n){
int sq = sqrt((double)n);
if(n==1)return 0;
if(n==2)return 1;
for(int i=2;i<=sq;++i)
if(n%i==0)return 0;
return 1;
}
int main() {
int n,cnt;
for(int i=0;i<50000;++i){
Prime[i] = isPrime(i+1);
}
while(cin>... | 182 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | 333 |
Project_CodeNet | 2,014 | #include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<complex>
#include<stack>
#include<cmath>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
const int PS = 50001;
int prime[PS];
... | 313 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
bool is_prime[1000000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 1000000; i++) {
is_prime[i] = true;
}
for (int i = 2; i*i < 1000000; i++) {
if (is_prime[i]) {
for (int j = i*i; j < 1000000; j += i) {
is_prime[j] = false;
}
}
}... | 218 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include <numeric>
#include<map>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for... | 454 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
vector <int> p(0);
void Prime(int n){
bool flg[50000];
int indx=2;
flg[0]=flg[1]=0;
for(int i=0; i<n; i++)flg[i]=0;
while(indx<n){
flg[indx]=1;
p.push_back(indx);
for(int i=2; i*indx<n; i++){
flg[indx*i]=1;
}
while(flg[indx]==1 &&... | 227 |
Project_CodeNet | 2,016 | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int n, prime[10000], flag[50005] = {}, cnt = 1;
prime[0] = 2;
flag[2] = 1;
for (int i = 3; i < 50000; i += 2){
int k = 0;
for (int j = 3; j <= sqrt(i); j++) {
if (i % j == 0){
k = 1;
break;
}
}
if (!k) {
flag[i] = 1;
... | 216 |
Project_CodeNet | 2,010 | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
int main() {
vector<int> table(50000,1);
t... | 237 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#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<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define pb push_back
#define PII pair<int,int>
... | 400 |
Project_CodeNet | 2,013 | #include <iostream>
using namespace std;
int main(){
bool p[50000];
p[1]=false;
for(int i=2;i<50000;i++){
p[i]=true;
}
for(int j=2;j<50000;j++){
if(p[j]){
for(int k=j*2;k<50000;k+=j){
p[k]=false;
}
}
}
int n;
while(cin>>n){
if(n==0) break;
int count=0;
if(p[n-2]) count++;
for(int l=3;l<=... | 163 |
Project_CodeNet | 2,015 | //Goldbach's Conjecture
#include<bits/stdc++.h>
using namespace std;
vector<int> p;
int ans[50001];
void solve(){
int ret=0;
for(int i=0; i<p.size(); i++)
for(int j=i; j<p.size(); j++){
if(p[i]+p[j]>50000)break;
ans[p[i]+p[j]]++;
}
}
int main(){
p.push_back(2);
for(int i=3; i<50000; i+=2)... | 196 |
Project_CodeNet | 2,016 | #include <iostream>
using namespace std;
#define Max 50000
bool IsPrime[Max];
int main()
{
for (int i = 2; i < Max; i++) IsPrime[i] = true;
for (int i = 2; i < Max; i++)
{
if (!IsPrime[i]) continue;
for (int j = i + i; j < Max; j += i)
{
IsPrime[j] = false;
}
}
int n;
while (cin >> n, n)
{
int co... | 179 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<bool> prime(50100, true);
prime[0] = prime[1] = false;
for(int i = 2; i * i < 50100; ++i) {
if(prime[i]) {
for(int j = i * i; j < 50100; j += i) {
prime[j] = false;
}
}
}
... | 217 |
Project_CodeNet | 2,015 | #include <cstdio>
#include <vector>
using namespace std;
#define SIZE 50000
int main(){
int n, res;
bool prime[SIZE + 1];
fill(prime, prime + SIZE + 1, true);
prime[1] = false;
for(int i = 2; i <= SIZE; i++){
if(prime[i]){
for(int j = i * 2; j <= SIZE; j += i){
prime[j] = false;
}
}
}
while(t... | 188 |
Project_CodeNet | 2,014 | #include <iostream>
#include <string.h>
#include <algorithm>
#define MAX 50000
using namespace std;
int dp[MAX + 1];
int prm[MAX + 1];
int main()
{
for (int i = 2; i <= MAX; i++) prm[i] = 1;
for (int i = 2; i <= MAX; i++)
for (int j = 2; j * i <= MAX; j++)
prm[i * j] = 0;
int n;
fo... | 192 |
Project_CodeNet | 2,015 | #include<cstdio>
int main(){
int f[50000] = {1,1};
for(int i = 2; i < 25000; i++){
f[i * 2] = 1;
}
for(int i = 3; i <= 224; i += 2){
for(int j = 3; j * i < 50000; j += 2){
f[i*j] = 1;
}
}
int n;
scanf("%d", &n);
while(n){
int count = 0;
for(int i = n; i * 2 >= n; i--){
if(!f[i] && !f[n-i]){
... | 175 |
Project_CodeNet | 2,012 | #include<iostream>
#include<vector>
using namespace std;
const int SIZE = 50000;
bool isprime[SIZE + 1];
vector<int> prime;
void make_prime(){
for(int i = 2; i <= SIZE; i++){
isprime[i] = true;
}
isprime[0] = false;
isprime[1] = false;
for(int i = 2; i <= SIZE; i++){
if(isprime[i] ==... | 235 |
Project_CodeNet | 2,012 | #include <iostream>
using namespace std;
bool is_prime[50001];
void sieve() {
for(int i=0;i<50001;i++) {
is_prime[i] = true;
}
is_prime[0] = is_prime[1] = false;
for(int i=2;i<50001;i++) {
if(is_prime[i]) {
for(int j=2*i;j<50001;j+=i) {
is_prime[j] = false;
}
}
}
}
int mai... | 189 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
using namespace std;
bool IsPrime[50010];
vector<int> Prime;
void PrimeCalc()
{
for(int i = 0; i < 50010; ++i)
{
IsPrime[i] = true;
}
IsPrime[0] = IsPrime[1] = false;
for(int i = 2; i < 50010; ++i)
{
if(IsPrime[i])
{
Prime.push_back(i);
for(int j = 2 * i; j < 5... | 277 |
Project_CodeNet | 2,011 | #include <iostream>
using namespace std;
int main(){
bool list[50001];
list[0] = list[1] = true;
for(int i = 2; i <= 50000; i++){
list[i] = false;
}
for(int i = 2; i <= 50000; i++){
if(!list[i]){
for(int j = 2; i*j <= 5... | 194 |
Project_CodeNet | 2,020 | #include <iostream>
#include <stdlib.h>
using namespace std;
#define limit 50010
int main(void){
int* table=(int*)malloc(sizeof(int)*limit);
for(int i=0;i<limit;i++){
table[i]=1;
}
table[0]=0;
table[1]=0;
int k;
for(int i=0;i<limit;i++){
if(table[i]==0)continue;
k=2;
while(k*i<=limit)... | 195 |
Project_CodeNet | 2,015 | #include <iostream>
#define X 50000
using namespace std;
int gold(int n,bool p[X+1]){
if(n%2==1){
if(p[n-2]) return 1;
else return 0;
}
else{
int c = 0;
for(int i=2;i<=X;i++){
if(n-i<i) break;
if(p[i] and p[n-i]) c++;
}
return c;
}
}
int main(){
int n;
bool p[X+1];
for(int i=0;i<=X;i++) p[i] ... | 197 |
Project_CodeNet | 2,014 | #include <iostream>
using namespace std;
#define MAX_N 50000
bool isPrime[MAX_N + 1];
int n, cnt;
void seive(){
for(int i = 0; i <= MAX_N; i++) isPrime[i] = true;
isPrime[0] = isPrime[1] = false;
for(int i = 2; i * i <= MAX_N; i++){
if(isPrime[i]){
for(int j = i * i; j <= MAX_N; j += i) isPrime[j] = f... | 203 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const int MOD = 1e9 + 7;
const int MAX_N = ... | 298 |
Project_CodeNet | 2,010 | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>
#include<map>
#define f first
#define s second
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c... | 404 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> make()
{
bool b[50001] = {};
for(int i = 2; i*i < 50001; ++i){
if(!b[i]){
for(int j = i*i; j < 50001; j += i){
b[j] = true;
}
}
}
vector<int> prime;
prime.reserve(50000);
for(int i = 2; i < 50001; ++i){
if... | 233 |
Project_CodeNet | 2,013 | /* AOJ 0056 Goldbach's Conjecture */
#include <iostream>
using namespace std;
void sieve_of_eratosthenes();
const int MAX_N = 50000;
bool is_prime[MAX_N + 1];
int
main()
{
sieve_of_eratosthenes();
for (;;) {
int n, max;
int n_combinations = 0;
int i;
cin >> n;
if ... | 285 |
Project_CodeNet | 2,013 | #include <iostream>
#define MAX 50000
using namespace std;
bool is_prime[MAX];
void tenes(void){
for( int i = 0 ; i < MAX ; i++ ){
is_prime[i] = true;
}
is_prime[0] = is_prime[1] = false;
for( int i = 2 ; i*i < MAX ; i++ ){
if( is_prime[i] ){
for( int j = i + i ; j < MAX ; j += i ){
is_prim... | 216 |
Project_CodeNet | 2,012 | #include<iostream>
using namespace std;
int main(){
long long int a[1000000] = {0};
a[0] = 1;
a[1] = 1;
for(long long int i=2;i*i<1000000;i++){
if(a[i] == 0){
for(long long int j=i+i;j<1000000;j+=i) a[j] = 1;
}
}
int n,z = 0;
while(cin >> n, n){
z = 0;
for(int i=2;i<=n/2;i++){... | 161 |
Project_CodeNet | 2,015 | #include<iostream>
#include<cmath>
using namespace std;
int x[100000], y[100000], n, sum;
int main() {
for (int i = 2; i < 100000; i++) {
for (int j = 2; j <= sqrt(i); j++) {
if (i%j == 0) {
goto E;
}
}
x[i] = 1;
E:;
}
while (true) {
cin >> n; sum = 0; if (!n) { break; }
for (int i = 2; i <= n /... | 178 |
Project_CodeNet | 2,014 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define MAX 1000000
#define pb push_back
using namespace std;
int prime[MAX];
int main()
{
prime[0] = prime[1] = 0;
REP(i,2,MAX)
{
prime[i] = 1;
}
REP(i... | 234 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <utility>
#include <numeric>
us... | 458 |
Project_CodeNet | 2,012 | #include <iostream>
using namespace std;
#define MAX 500000
bool prime_table[MAX];
int main(){
int n, i, j, ans;
// make table
for (i = 0; i < MAX; i++) {
if(i==0||i==1){
prime_table[i] = false;
}else{
prime_table[i] = true;
}
}
// find prime
for (i = 2; i < MAX; i++) {
if(prime_table[i]){
fo... | 234 |
Project_CodeNet | 2,011 | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <iostream>
#include <climits>
#include <cfloat>
using namespace std;
bool* isPrime;
vector<int> CreatePrimes(int n)
{
bool* work = new bool[n+1];
... | 320 |
Project_CodeNet | 2,011 | #include<stdio.h>
int table[500001];
int main(){
table[1]=-1;
table[0]=-1;
for(int i=2;i<500001;i++){
if(table[i]==0){
table[i]=1;
for(int j=i*2;j<500001;j+=i)table[j]=-1;
}
}
int a;
while(scanf("%d",&a),a){
int ret=0;
for(int i=1;i<=a/2;i++){
if(table[i]==1&&table[a-i]==1)ret++;
}
printf("%d... | 135 |
Project_CodeNet | 2,011 | #include<cstdio>
#include<bitset>
using namespace std;
bitset<50001> pt;
void MakeTable(int n){
pt.reset();
pt.set(2);
int i;
for(i=3;i<=n;i+=2)pt.set(i);
i = 3;
while(i*i<=n){
for(int j=3*i;j<=n;j+=i)pt.reset(j);
while(!pt[++i]);
}
}
int main(){
int n,ans;
MakeTable(50000);
while(... | 194 |
Project_CodeNet | 2,012 | #include<iostream>
#include<cstring>
using namespace std;
bool prime[50001];
void seive(int s){
memset(prime,true,sizeof(prime));
prime[0]=prime[1]=false;
for(int i=2;i<=s;i++){
if(prime[i]==true){
for(int j=i*2;j<=s;j+=i)prime[j]=false;
}
}
}
int main(void){
seive(50000);
while(1){
int n,ans=0;
sca... | 187 |
Project_CodeNet | 2,010 | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
using namespace std;
int prime[1000000],n;
bool isprime[1000001];
int sieve(int n){
int p=0;
for(int i=0;i<=n;i++)isprime[i]=true;
isprime[0]=isprime[1... | 214 |
Project_CodeNet | 2,016 | #include <cstdio>
int main()
{
int n;
char prime[50001];
for(int i = 0; i <= 50000; i++)
prime[i] = 1;
prime[0] = 0; prime[1] = 0;
for(int i = 2; i <= 50000; i++){
if(!prime[i]) continue;
for(int j = i + i; j <= 50000; j += i)
prime[j] = 0;
}
while(scanf("%d\n", &n), n){
int cnt = 0;
for(int i = 2; ... | 177 |
Project_CodeNet | 2,015 | #include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
typedef long long int ll;
using namespace std;
vector<int>p(50010,1);
int n;
void calc(){
for(int i=0; i<50010; i++){
if(i<2)p[i]=0;
else{
for(int j=2; j<=sqrt(i); j++){
if... | 195 |
Project_CodeNet | 2,011 | #include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
#define MAX 50000
int main(void)
{
bool p[MAX + 5];
int i, j;
for (i = 0; i <= MAX; i++){
p[i] = true;
}
p[0] = p[1] = false;
for (i = 2; i <= MAX; i++){
if (p[i]){
for (j = (i * 2); j <= MAX; j += i){
p[j] = false;
}
... | 208 |
Project_CodeNet | 2,015 | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
void sieve(bool* pn){
for(int i=2;i<sqrt(50100.);++i){
if(pn[i]){
for(int j=i*2;j<=50100;j+=i){
pn[j]=false;
}
}
}
}
... | 305 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <utility>
#include <vector>
#include <cmath>
using namespace std;
#define gcu getchar_unlocked
int in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;} //&&c<='9'
int in() {return in(gcu());}
bool scan(int &n){int c=gcu();return c... | 677 |
Project_CodeNet | 2,011 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//vector<int> prime;
int prime[50001];
int psize;
bool isPrime[50001];
void erats(){
fill(isPrime,isPrime+50001,true);
isPrime[0]=false;
isPrime[1]=false;
for(int i = 2; i < 50001; i++){
if(isPrime[i]){
// prime.push_back(i);
... | 325 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
bool check[50001];
check[0]=false;
check[1]=false;
for(int i=2;i<=50000;i++){
check[i]=true;
}
for(int i=2;i*i<=50000;i++){
if(check[i]){
for(int j=i*2;j<=50000;j+=i){
check[j]=false;... | 187 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
#define range(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
using namespace std;
bool prime[50010];
void init(){
range(i,2,50010){
prime[i]=true;
for(int j=2;j*j<=i;++j){
if(i%j==0) prime[i]=false;
}
}
return ;
}
int main(void){
int n;
init();
while(cin >> n,n){
int res=0;
range(i... | 160 |
Project_CodeNet | 2,010 | #include <cstdio>
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) REP(i, 0, n)
bool p[50001];
int main()
{
rep(i, 50001) p[i] = true;
for (int i = 2; i * i <= 50000; ++i) {
if (p[i]) for (int j = 2 * i; j <= 50000; j += i)
if (p[j]) p[j] = false;
}
p[0] = p[1] = false;
int n;
while (s... | 200 |
Project_CodeNet | 2,015 | #include<bits/stdc++.h>
using namespace std;
bool prime[100010];
int ans[100010];
void countPrime();
int main(){
int n;
countPrime();
while(cin >> n , n){
cout << ans[n] << endl;
}
}
void countPrime(){
memset(prime,true,100001);
memset(ans,0,100001);
for(int i=2;i*i<=50000;i++){
if(prime[i]){
... | 174 |
Project_CodeNet | 2,010 | #include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
#include <set>
#include <iostream>
#include <map>
#include <functional>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define re... | 288 |
Project_CodeNet | 2,014 | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>... | 689 |
Project_CodeNet | 2,010 | #include <iostream>
using namespace std;
int main(){
const int NUM = 50000;
bool prime[NUM];
prime[0] = false;
prime[1] = false;
for(int i=2;i<NUM;i++)
prime[i] = true;
for(int i=2;i*i<NUM;i++)
for(int k=2;i*k<NUM;k++)
prime[i*k]=false;
int n,c;
while(true){
cin>>n;
if(!n)break;
... | 158 |
Project_CodeNet | 2,011 | #include<iostream>
#include<vector>
#include<cstdio>
#include<algorithm>
#define MAX 50010
using namespace std;
int main(){
int sum,k=0;
vector<int> pri(MAX);
vector<int> pre(MAX);
for(int i=0;i<MAX;i++)
pri[i]=1;
pri[0]=0;
pri[1]=0;
for(int i=0;i*i<MAX;i++){
if(pri[i]){
for(int j=i*2;j<MAX;j+=i){
pri[... | 199 |
Project_CodeNet | 2,015 | #include <iostream>
#include <cstdio>
using namespace std;
#define rep2(x,from,to) for(int x = (from); x < (to); ++(x))
#define rep(x,to) rep2(x,0,to)
int main() {
bool p[50001];
p[0] = p[1] = 0;
rep2(i,2,50001) {
p[i] = 1;
}
rep(i,50001) {
if(p[i]) {
for(int j = 2; i * j <= 50000; j++) {
p[i * j] = 0;... | 202 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main()
{
bool is_prime[50001];
is_prime[0]=is_prime[1]=false;
for(int i=2;i<50001;i++){
is_prime[i]=true;
}
for(int i=2;i*i<50001;i++){
if(is_prime[i]){
for(int j=i*i;j<50001;j+=i){
is_prime[j]=false;
}
}
}
while(true){
int n;
cin>>n;
... | 178 |
Project_CodeNet | 2,015 | #include<cstdio>
#include<vector>
using namespace std;
bool isprime[50010];
int ans[50010];
int main()
{
for(int i=2; i<=50000; i++){
isprime[i] = true;
}
for(int i=2; i<300; i++){
if(isprime[i]){
for(int j=i*i; j<=50000; j+=i){
isprime[j]=false;
}
... | 217 |
Project_CodeNet | 2,015 | #include <cstdio>
using namespace std;
const int SIEVE_SIZE = 100000;
bool sieve[SIEVE_SIZE + 1];
int prime[SIEVE_SIZE + 1];
int main()
{
int n;
int i,j,cnt = 0;
sieve[0] = sieve[1] = true;
for (i = 2; i * i <= SIEVE_SIZE; i++){
if (sieve[i]) continue;
for (j = i*i; j <= SIEVE_SIZE; j += i){
sie... | 248 |
Project_CodeNet | 2,013 | #include <iostream>
using namespace std;
#define MAX 50100
int prime[MAX-4];
void is_prime(){
for(int i = 0 ; i < MAX ; i++) prime[i] = 0;
prime[0] = prime[1] = 1;
for(int i = 4 ; i < MAX ; i += 2) prime[i] = 1;
for(int i = 3 ; i*i < MAX ; i++){
if(prime[i]) continue;
for(int j... | 223 |
Project_CodeNet | 2,013 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
using namespace std;
int p[50001];
int prime()
{
for(int i=0;i<=50000;++i) p[i] = 1;
for(int j=4;j<=50000;j+=2) p[j] = 0;
for(int i=3;i<=50000;++i)
{
if(!p[i]) continue;
for(int j... | 230 |
Project_CodeNet | 2,013 | #include <iostream>
#include <cstring>
using namespace std;
int main() {
bool p[50001];
int n, c;
memset(p, 0, sizeof(bool)*50001);
for (int i=2; i*i<=50000; i++) {
if (!p[i]) {
for (int j=i*i; j<=50000; j+=i) {
p[j] = true;
}
}
}
while ((cin >> n) && n) {
c = 0;
if (!... | 187 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
bool is_prime[50001];
is_prime[0]=is_prime[1]=false;
for(int i=2;i<50001;i++){
is_prime[i] = true;
}
for(int i=2;i*i<50001;i++){
if(is_prime[i]){
for(int j=i*i;j<50001;j=j+i){
is_prime[j] = false;
}
}
}
while(true){
... | 176 |
Project_CodeNet | 2,012 | #include <iostream>
#include <algorithm>
#include <cstring>
#define rep2(i, s, n) for(int i=s; i < n; ++i)
#define rep(i, n) rep2(i, 0, n)
#define MEMZERO(x) memset(x, 0, sizeof(x))
#define MEMSET(x, y) memset(x, y, sizeof(x))
using namespace std;
bool isPrime[50000];
int prime[5150];
int count[50001];
void setPrim... | 337 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
using namespace std;
vector<int> prime;
bool isPrime[51000];
void PrimeCalc()
{
isPrime[0] = isPrime[1] = false;
for(int i = 2; i < 51000; ++i)
{
isPrime[i] = true;
}
for(int i = 2; i < 51000; ++i)
{
if(isPrime[i])
{
prime.push_back(i);
for(int j = 2 * i; j < 51... | 257 |
Project_CodeNet | 2,013 | #include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 50005;
bool isP[MAXN];
int main() {
fill(isP, isP+MAXN, true);
isP[0] = isP[1] = false;
for(int i = 0; i < MAXN; ++i) {
if(!isP[i]) continue;
for(int j = i*2; j < MAXN; j += i) isP[j] = false;
}
int n;
while(cin >> n &&... | 184 |
Project_CodeNet | 2,014 | #include <cstdio>
#include<iostream>
#define NMAX 50000
using namespace std;
int main(void){
int hurui[NMAX]={0};
int prime[NMAX]={0};
int dp[NMAX*3]={0};
int cnt=0;
hurui[0]=1,hurui[1]=1;
for(int i=2;i<NMAX;i++){
if(hurui[i]==0){
prime[cnt]=i;
cnt++;
for(int j=i*2;j<NMAX;j+... | 200 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | 515 |
Project_CodeNet | 2,010 | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, c, p=1;
bool f, a[50001];
fill(a, a+50001, false);
for(int i = 3; i < 50000; i+=2){
f = true;
a[2] = true;
for(int j = 3; j*j <= i; j+=2){
if(i%j == 0){
f = false;
break;
}
}
a[i] = f;
}
while(1){
cin ... | 201 |
Project_CodeNet | 2,013 | #include<iostream>
#include<cmath>
using namespace std;
void pp(char* f, long x){
long i,p,k;
for(i=1;i<=x;i++)f[i]=0;
f[2]=f[3]=1;
for(i=7;i<=x;i+=6)f[i]=1;
for(i=5;i<=x;i+=6)f[i]=1;
for(i=0;i<=ceil(sqrt(x)/6);i++){
p=6*i+1;
if(f[p]){
for(k=p*p;k<=x;k+=p*6)f[k]=0;
for(k=p*(p+4);k<=x;k+=p*6)f[k]=0;
}
p=6*i+5;
if(f[p]){... | 294 |
Project_CodeNet | 2,010 | #include <iostream>
using namespace std;
int main(){
int i,j,n,a[50000];
a[0] = 0;
a[1] = 0;
for(i=2;i<50000;i++) a[i] = 1;
for(i=2;i<=25000;i++){
if(a[i] == 1){
for(j=i*2;j<50000;j+=i) a[j] = 0;
}
}
while(1){
int ans;
cin >> n;
if(n == 0) break;
ans = 0;
for(i=2;i*2<=n... | 179 |
Project_CodeNet | 2,018 | #include<iostream>
#include<math.h>
using namespace std;
int main(){
bool is_prime[50001];
is_prime[0]=false;is_prime[1]=false;
for(int i=2;i<50001;i++)is_prime[i]=true;
for(int i=2;i<=sqrt(50001);i++){
if(is_prime[i]){
for(int j=2;i*j<=50001;j++)is_prime[i*j]=false;
}
}
int n;
while(1){
... | 171 |
Project_CodeNet | 2,014 | #include <iostream>
#include <cstdio>
using namespace std;
#define N 50000
int main(){
bool prime[N+1];
for(long i=2; i<=N; ++i) prime[i]=true;
for(long i=2; i<=N; ++i){
if(prime[i]){
for(long j=2; i*j<=N; ++j) prime[i*j]=false;
}
}
while(1){
long n, ans=0;
scanf(" %ld", &n);
if(n==0) break;... | 176 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<bool> is_prime(50000, true);
vector<int> prime;
is_prime[0] = is_prime[1] = false;
for(int i=2; i<is_prime.size(); ++i) {
if(is_prime[i]) {
prime.push_back(i);
for(int j=i+i; j<is_prime.size(); j+=i) {
... | 214 |
Project_CodeNet | 2,014 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RA... | 707 |
Project_CodeNet | 2,017 | #include <cstdio>
int main()
{
int n;
char prime[50001];
for(int i = 0; i <= 50000; i++)
prime[i] = 1;
prime[0] = 0; prime[1] = 0;
for(int i = 2; i <= 50000; i++){
if(!prime[i]) continue;
for(int j = i + i; j <= 50000; j += i)
prime[j] = 0;
}
while(scanf("%d\n", &n), n){
int cnt = 0;
for(int i = 2; ... | 177 |
Project_CodeNet | 2,014 | #include <iostream>
#include <cstring>
#include <vector>
using namespace std;
const int MX = 50001;
bool sieve[MX];
void prepare() {
memset(sieve, false, sizeof sieve);
sieve[0] = sieve[1] = true;
for (int i=2; i*i<MX; ++i) {
if ( ! sieve[i]) {
for (int j=i*i; j<MX; j+=i) {
... | 193 |
Project_CodeNet | 2,013 | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <c... | 410 |
Project_CodeNet | 2,015 | #include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
bool prime_check(int n)
{
if (n == 1) { return false; }
if (n % 2 == 0)
{
if (n == 2) { return true; }
else { return false; }
}
for (int i = 3; i <= sqrt(n); i += 2)
{
if (n % i == 0) { return false; }
}
return true;
}
i... | 366 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
using db = double;
using ll = long long;
using vi = vector <int>;
#define op operator
#define pb push_back
const int N = 5e4L + 11;
int p[N];
int main() {
iota(p, p + N, 0);
for(int i = 2; i < N; i ++) if(p[i] == i)
for(int j = i; j < N; j += i) p[j] = i;
cout << f... | 201 |
Project_CodeNet | 2,009 | #include<iostream>
const int MAX = 50001;
using namespace std;
int main(void){
int i = 3;
int n = 0;
int ps[MAX];
for(int i = 0; i < MAX; i++){
ps[i] = 1;
}
for(int i = 2; i < MAX; i++){
if( ps[i] ){
for(int j = 2; i * j < MAX; j++){
ps[i * j] = 0;
}
}
}
while( 1 ){
int n;
int cnt = 0;
... | 224 |
Project_CodeNet | 2,015 | #include<iostream>
#include<math.h>
using namespace std;
int p[50000] = { 0 };
int main(){
int n, q, count, k, l = 0;
for (int i = 2; i <= 300;i++)
for (int j = i*2; j <= 50000; j += i){
p[j] = 1;
}
while ((cin >> n), n){
int count = 0;
for (int i = 2; i <= n / 2; i++){
if (p[n - i] == 0 && p... | 160 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef pair<int, int>P;
bool is_prime[50001];
int main() {
memset(is_prime, 1, sizeof(is_prime));
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= 50000; i++) {
if (is_prime[i]) {
for (int j = i * 2; j <= 50000; j += i)is... | 196 |
Project_CodeNet | 2,017 | // AOJ 0056: Goldbach's Conjecture
// 2017.10.28 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
#define MAX 50000
#define HALF 2761 // prime[2760]=24989, prime[2761]=25013
char table[MAX+1]; // zero: if prime
int sz, prime[5200] = { // prime[46] = 223, max sz = 5132
3, 5, 7, 11, 13, 17, 19, 23, 29,
31,... | 522 |
Project_CodeNet | 2,013 | function main() {
var
i, j, n, m, x,
len = input.length;
for(i = 0; i < len; i++) {
n = parseInt(input[i], 10);
if(n === 0) break;
m = ~~(n / 2);
for(x = 0, j = 0; primes[j] <= m; j++) {
if(primesTable[n - primes[j]]) x++;
}
console.log(x);
}
}
var
primes = (function(n){
var
... | 307 |
Project_CodeNet | 2,015 | function prime(max){
var arr=[];
for(var i=0;i<=max;i++)arr[i]=i;
arr[0]=false;
arr[1]=false;
var sqrt=Math.floor(Math.sqrt(max));
for(var i=2;i<=sqrt;i++){
if(arr[i]==false)continue;
for(var j=i+i;j<=max;j+=i){
arr[j]=false;
}
}
var result=[];
for(var i=0;... | 245 |
Project_CodeNet | 2,015 | // 標準入力
var fs = require('fs'),
length = fs.fstatSync(process.stdin.fd).size,
buffer = new Buffer(length),
bytesRead = fs.readSync(process.stdin.fd, buffer, 0, length, 0),
input = buffer.toString('utf8', 0, bytesRead).split('\n');
main();
// ここから
function main(){
var primeNumbers = calcPrimeNumbers();
var i =... | 363 |
Project_CodeNet | 2,017 | main = interact $ unlines . map (show . goldbach . read) . takeWhile (/= "0") . lines
goldbach :: Int -> Int
goldbach x
| odd x = if elem (x-2) p then 1 else 0
| otherwise = goldbach' p (reverse p)
where
p = takeWhile (<= x) primes
goldbach' (p1:ps1) (p2:ps2)
| p1 > div x 2 = 0
| p1 == p2 = if p1+p2==x th... | 272 |
Project_CodeNet | 2,017 | import Data.List
import Data.Array
erst :: Int->([Int],[Int])->[Int]
erst nmax (tosearch, primes)
| x*x >= nmax = sort $ primes' ++ tosearch'
| otherwise = erst nmax (tosearch', primes')
where
x = head tosearch
tosearch' = [n|n<-(tail tosearch),(n`mod`x)/=0]
primes' = primes ++ ... | 285 |
Project_CodeNet | 2,017 | import scala.io.StdIn.readInt
object Main {
def sieve(n:Int) = {
val primes = Array.tabulate(n+1) { _ % 2 }
primes(1) = 0
primes(2) = 1
for( i <- 3 to Math.sqrt(n).toInt by 2 )
if(primes(i) == 1)
(i*i to n by i*2).foreach { primes(_) = 0 }
primes
}
def main(args:Array[String])... | 224 |
Project_CodeNet | 2,016 | let for_range s e step f =
let rec loop i =
if i <= e then begin f i;loop (i + step) end
in loop s;;
let sieve num =
let p = Array.init num (fun x -> x mod 2) in
let rec loop i =
if i*i < num then
begin
if p.(i) = 1 then for_range (i*i) num (i*2) (fun x -> p.(x) <- 0);
loop (i+2)... | 315 |
Project_CodeNet | 2,018 | fn main(){
let mxv: usize = 50000;
let mxi: usize = 224;
let mut tbl: Vec<bool> = vec![true; mxv];
tbl[0] = false;
tbl[1] = false;
for i in 2 .. mxi {
if tbl[i] {
let mut j = i * i;
while j < mxv {
tbl[j] = false;
j += i;
}
}
}
loop {
let mut cnt: u32 = 0... | 247 |
Project_CodeNet | 2,012 | <?php
define('MAX', 50001);
define('COUNT', 5133);
$table = new SplFixedArray(MAX);
$table[0] = $table[1] = false;
$primes = new SplFixedArray(COUNT);
$p_i = 0;
$i = 2;
while ($i < MAX) {
$primes[$p_i++] = $i;
$table[$i] = true;
for ($j = $i * 2; $j < MAX; $j += $i) {
$table[$j] = false;
}
... | 247 |
Project_CodeNet | 2,017 | #include <stdio.h>
#include <stdlib.h>
#define NMAX 50000
int comp(const void *c1, const void *c2)
{
int tmp1, tmp2;
tmp1 = *(int *)c1;
tmp2 = *(int *)c2;
if(tmp1 < tmp2 ) return -1;
if(tmp1 == tmp2) return 0;
if(tmp1 > tmp2 ) return 1;
}
int n_primes = 0;
int primes[NMAX];
char primes... | 586 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.