Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,016 | #include <stdio.h>
int main(void) {
int p[131072] = {0},n,i,j,k;
p[0] = 1;
p[1] = 1;
for(i = 4;i <= 131072;i+=2){
p[i] = 1;
}
for(i = 3;i <= 399;i+=2){
if(p[i]){continue;}
else{
for(j = i * 3;j <= 131072;j+=(i * 2)){
p[j] = 1;
}
}
}
while(scanf("%d",&n) , n != 0){
k = 0;
for(i = 2;i <= n/... | 196 |
Project_CodeNet | 2,013 | /* AOJ 0056 Goldbach's Conjecture */
#include <stdio.h>
void sieve_of_eratosthenes();
#define MAX_N 50000
char is_prime[MAX_N + 1];
int
main()
{
sieve_of_eratosthenes();
for (;;) {
int n, max;
int n_combinations = 0;
int i;
scanf("%d", &n);
if (n == 0) break;
... | 289 |
Project_CodeNet | 2,011 | #include <stdio.h>
#include <math.h>
int prime[65536];
int sosu ( int n ) {
int i , lim = (int)(sqrt(n));
for ( i = 2; i <= lim; i++ ) {
if ( n % i == 0 ) return 0;
}
return 1;
}
void tmp(void) {
int i;
for ( i = 2; i < 50000; i++ ) {
if ( sosu(i) ) {
prime[i]++;
}
}
return;
}
int main (void) {
in... | 237 |
Project_CodeNet | 2,011 | c[99999],i,n;main(j){for(j=i=2;i*i<5e4;!c[i]&&j<5e4?c[j+=i]=1:(j=++i));for(;i=scanf("%d",&j),j;n=!printf("%d\n",n))for(;++i<=j/2;n+=!(c[j-i]+c[i]));exit(0);} | 87 |
Project_CodeNet | 2,017 | #include <stdio.h>
int prime[50001];
void set(void){
int i,o;
for(i=4;i<=50000;i+=2)
prime[i]=1;
for(i=3;i*i<=50000;i+=2){
if(prime[i]==0)
for(o=i*2;o<=50000;o+=i)
prime[o]=1;
}
}
int main(void){
int num,count,i;
set();
for(;count=0,scanf("%d",&num... | 155 |
Project_CodeNet | 2,010 | n,b,f[99999];main(a){for(;++a<5e4;)for(b=a;b<5e4;)f[b+=a]+=!f[a];for(;~scanf("%d",&n);n&&printf("%d\n",b))for(b=0,a=1;a++<n/2;a+=a&1)f[a]+f[n-a]||b++;} | 84 |
Project_CodeNet | 2,015 | #include<stdio.h>
int main(){
int n,i,j,a[50001]={0};
char p[50001]={1,1};
for(i=2;i*i<50001;i++){
if(p[i])continue;
for(j=i*i;j<50001;j+=i)p[j]=1;
}
for(i=0;i<50001;i++){
for(j=1;j*2<=i;j++){
if(p[j]+p[i-j]==0)a[i]++;
}
}
while(scanf("%d",&n),n)printf("%d\n",a[n]);
return 0;
}
... | 134 |
Project_CodeNet | 2,019 | #include <stdio.h>
void sosu(int n,int *a){
int i,j;
for(i=0;i<=n;i++) a[i]=1;
a[0]=a[1]=0;
for(i=2;i<=n;i++){
if(a[i]==1){
for(j=2;i*j<=n;j++) a[i*j]=0;
}
}
}
int main(void){
int n;
int a[50001];
sosu(50000,a);
while(1){
scanf("%d",&n);
... | 179 |
Project_CodeNet | 2,016 | #include <stdio.h> // printf(), scanf()
#include <stdbool.h>
#define MAX_N 50000
#define MAX_SQRT_N 224
#define MAX_P 5140
bool f[MAX_N + 1] = {0};
int primes[MAX_P];
int np;
int
main(int argc, char **argv)
{
int i, j;
np = 0;
for (i = 2; i <= MAX_N; ++i)
{
if (!f[i])
{
primes[np++] = i;
if (... | 261 |
Project_CodeNet | 2,011 | #include<stdio.h>
#include<math.h>
#define SIZE 50000
char primes[SIZE];
int main(){
int i,j,sq,ne,n;
sq=sqrt(SIZE)+1;
for(i=2;i<=25000;i++) primes[i*2-1]=1;
for(i=3;i<=sq;i+=2){
ne=SIZE/i+1;
for(j=2;j<=ne;j++){
primes[j*i-1]=1;
}
}
do{
scanf("%d",&n);
if(n==0) break;
ne=n/2;... | 183 |
Project_CodeNet | 2,015 | #include<stdio.h>
int main()
{
int i,j,n,count,num=0;
int prime[50001]={0};
int p[20000]={0};
for(i = 2;i < 50001;i++) prime[i]=1;
for(i = 2;i < 50001;i++){
if(prime[i]){
p[num]=i;
num++;
for(j=i+i;j<=50001;j+=i){
prime[j]=0;
... | 203 |
Project_CodeNet | 2,010 | #include<stdio.h>
#define N 50400
int prime[N];
int main(){
int i,j,n;
int c;
for(i=0;i<N;i++)prime[i]=1;
prime[0] = prime[1] = 0;
for(i=4;i<N;i+=2)prime[i]=0;
for(i=3;i<N;i+=2){
if(prime[i] == 0 )continue;
for(j=i+i;j<N;j+=i)prime[j]=0;
}
for(;scanf("%d",&n)&&n;){
c=0;
for(i=2;i<=n/2;i++){
if(prime... | 166 |
Project_CodeNet | 2,016 | #include <stdio.h>
#define MAX 50001
int p[MAX];
int prime[10000];
int c;
void hurui(){
int i,j;
for(i=0;i<MAX;i++)p[i]=1;
p[0]=0;p[1]=0;c=0;
for(i=2;i<MAX;i++){
//printf("%d\n",i);
if(p[i]==1){
prime[c++]=i;
for(j=2*i;j<MAX;j+=i)p[j]=0;
}
}
}
int main(){
int n;
int i,j;
int cou... | 221 |
Project_CodeNet | 2,017 | // AOJ 0056: Goldbach's Conjecture
// 2017.10.28 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
#define TM 0
#if TM
#include <time.h>
#endif
#define MAX 50000
#define HALF 2761 // prime[2760]=24989, prime[2761]=25013
char tbl[MAX+1]; // zero: if prime
int sz; // max sz = 5132
int prime[5200] = { // p... | 784 |
Project_CodeNet | 2,013 | #include <stdio.h>
int main(){
int a,i,j,k,n,p[50000];
for(i=1;i<50000;i++) p[i]=1;
for(i=2;i<=224;i++) if(p[i]) for(j=2;i*j<=50000;j++) p[i*j]=0;
while(scanf("%d",&n),n!=0){
a=0;
for(i=2;i<n/2+1;i++){
if(p[i] && p[n-i]) a++;
}
printf("%d\n",a);
}
return 0;
} | 128 |
Project_CodeNet | 2,016 | #include <stdio.h>
int prime[65536];
int main()
{
int n;
int cnt;
int i, j;
// initialize sieve
for (i = 0; i <= 50000; i++){
prime[i] = 1;
}
// make sieve
prime[0] = prime[1] = 0;
for (i = 2; i * i <= 50000; i++){
for (j = i * i; j <= 50000; j += i){
... | 213 |
Project_CodeNet | 2,010 | #include<stdio.h>
#include<string.h>
char so[50001];
main(){
memset(so,0,sizeof(so));
int n,i,j,c,count;
for(i=2;i<225;i++){
c=50000/i;
for(j=i;j<=c;j++){
so[j*i]=1;
}
}
while(~scanf("%d",&n)){
if(n==0)break;
count=0;
for(i=2;i<=n/2;i++){
if(so[i]==0 && so[n-i]==0){
++count;
}
}
... | 142 |
Project_CodeNet | 2,015 | #include<stdio.h>
int main(){
int n,j,i,a[50001]={},t2;
a[2]=1;
a[3]=1;
for(i=1;i<=50000;i++){
for(j=2;j<=i/2;j++){
if(i%j==0)
break;
if(j==i/2 && i%j!=0)
a[i]=1;
}
}
while(1){
t2=0;
scanf("%d",&n);
if(n==0) break;
for(i=1;i<=n/2;i++){
if(a[i]==1 ... | 172 |
Project_CodeNet | 2,011 | #include<stdio.h>
#include<math.h>
int main(){
int i,j,k;
int p,c,n,r,s[5133];
s[0]=2;
for(i=3,j=1;i<50000;i+=2){
r=(int)sqrt(i)+1;
for(k=3;k<r;k+=2){
if(i%k==0)
r=0;
}
if(r){
s[j]=i;
j++;
}
}
n=j;
for(;;){
scanf("%d",&p);
if(p==0)
break;
c=0;
i... | 299 |
Project_CodeNet | 2,013 | #include <stdio.h>
#include <stdlib.h>
int *flag;
void prime(int num){
int i,j;
flag = (int *)calloc(sizeof(int),num+1);
for(i = 2;i*i <= num;i++){
if(flag[i] == 0){
for(j = 2;i*j <= num;j++){
flag[i*j] = 1;
}
}
}
}
int main(){
int n,i,cnt;
prime(50000);
while(1){
scanf("%d",&n);
if(n ==... | 184 |
Project_CodeNet | 2,014 | #include <stdio.h>
#include <string.h>
#include <math.h>
char prime[50001];
void eratosthenes() {
int i, l, j, d;
memset(prime, 1, sizeof(prime));
prime[0] = prime[1] = 0;
for (i = 3, l = (int)sqrt(50000) + 1; i < l; i++) {
if (prime[i] == 1) {
for (d = i * 2, j = i + d; j <= 50000... | 293 |
Project_CodeNet | 2,011 | #include<stdio.h>
#include<string.h>
int i,j,n,ans,flag[50000];
int main(){
memset(flag,0,sizeof(int)*50000);
for(i=2;i<=50000;i++){
if(flag[i]==0){
for(j=2;j*i<=50000;j++){
flag[j*i]=1;
}
}
}
while(scanf("%d",&n)!=EOF){
if(n==0)break;ans=0;
for(i=2;i<=n/2;i++){
if(n-i>1 && flag[i]==0 && fl... | 150 |
Project_CodeNet | 2,015 | #include <stdio.h>
int main(void) {
_Bool flag[50000];
int prime[10000];
int i, j;
int n;
int count;
int max;
for (i = 2; i <= 3 || i <= sqrt(50000); i++) {
for (j = 2; i * j <= 50000; j++) {
flag[i*j-1] = 1;
}
}
j = 0;
for (i = 2; i < 50000; i++) {
if (!flag[i-1]) {
prime[j++] = i;
}
}
max =... | 276 |
Project_CodeNet | 2,017 | #include <stdio.h>
#include<math.h>
int main()
{
int a, n, i, j, k=2,m=0, flag = 0,cnt;
int arr[50001] = { 0,0,1 }, sum[10000] = {0};
for (a = 3; a <= 50000; a += 2)
{
for (i = 2; i <= sqrt(a); i++)
{
if (a%i == 0)
{
flag = 1;
break;
}
}
if (flag)
{
flag = 0;
}
else
{
arr[a]... | 297 |
Project_CodeNet | 2,012 | #include <stdio.h>
int main()
{
int n, i, j, isprime[51000], primes[5500], matches;
/* pre-processing */
for(i = 0; i < 51000; i++) isprime[i] = 1;
isprime[0] = 0;
isprime[1] = 0;
for(i = 2; i < 51000; i++) if(isprime[i]) for(j = 2; i * j < 51000; j++) isprime[i * j] = 0;
while(1) {
matches = 0;
scanf("%d... | 214 |
Project_CodeNet | 2,016 | #include <stdio.h>
#define N 50000
int p[N+1];
void era(void){
int i,j;
for(i=2;i<N;i++)
p[i]=1;
for(i=2;i*i<N;i++){
if(p[i]){
for(j=2*i;j<=N;j=j+i){
p[j]=0;
}
}
}
}
int main(void){
int n,i,ans;
era();
while(1){
scanf("%d",&n);
if(!n)
break;
ans=0;
for(i=2;i<=n/2;i++){
if(p[i]&&p[n-... | 161 |
Project_CodeNet | 2,012 | #include<stdio.h>
int main()
{
int n,m=1,s,i,j,p[50000]={1,1},d[5200]={2};
for(i=2;i*2<50000;i++)
p[2*i]=1;
for(i=3;i<50000;i+=2)
if(p[i]==0)
{
d[m++]=i;
for(j=i*2;j<50000;j+=i)
p[j]=1;
}
while(1)
{
s=0;
scanf("%d",&n);
if(!n)
break;
for(i=0;d[i]<=n/2;i++)
if(n-d[i]>1&&!p[n-d[i]])
... | 173 |
Project_CodeNet | 2,017 | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<math.h>
#define N 50000
int main() {
int i, j, cnt, p[N] = { 0 }, n;
for (i = 2; i <= (int)sqrt((double)N); ++i) if (!p[i]) for (j = 2; j*i < N; j++) p[i*j] = 1;
while (1) {
scanf("%d", &n);
if (n == 0) break;
cnt = 0;
... | 168 |
Project_CodeNet | 2,013 | #include <stdio.h>
#define MAX_NUM (50001)
void enum_prime(char list[]) {
int i, j;
list[0] = list[1] = 0;
for (i = 2; i < MAX_NUM; i++) {
list[i] = 1;
}
for (i = 2; i < MAX_NUM; i++) {
if (list[i] == 0)
continue;
for (j = i + i; j < MAX_NUM; j += i) {
list[j] = 0;
}
if (MAX_NUM < i * i)
break... | 312 |
Project_CodeNet | 2,014 | #include <stdio.h>
#define Max 50000
int main(void)
{
int n,i,j;
int prime[Max]={1,1,0};
for(i=2;i*i<Max;i++){ //エラトステネスの篩
for(j=2;i*j<Max;j++){
prime[i*j]=1;
}
}
while(scanf("%d",&n)){
if(n==0) break;
int count=0;
for(i=2;2*i<=n;i++){ //i≦jかつj=n-i⇒i≦n/2
j=n-i;
if(prime [i]==0 && prime[j]... | 176 |
Project_CodeNet | 2,012 | #include <stdio.h>
#include <stdlib.h>
#define SIZE 50001
int *prime, size;
int *sum;
void init();
int goldbach(int n);
int isPrime(int n);
int main(int argc, const char *argv[])
{
int n = 1;
init();
while(scanf("%d", &n)!=EOF && n!=0)
printf("%d\n", goldbach(n));
free(prime);
free(sum);
return 0;
}
void ... | 324 |
Project_CodeNet | 2,014 | #include <stdio.h>
#define SIZE 50001
int hurui[SIZE];
int primeList[SIZE] = {0};
//エラトステネスのふるいを作る関数。 ついでにprimeListに素数のみを入れていき、素数の数を返す。 範囲はSIZE
int makeHurui(void);
//int check(int data[], int key, int from, int to);
int check02(int data[], int key, int pos, int to);
int main(){
int i, k;
int n;
k = makeHu... | 620 |
Project_CodeNet | 2,011 | #include<stdio.h>
int main(void){
long long i,j;
int n,prime[50001];
prime[0]=1;
prime[1]=1;
for(i=2;i<50001;i++)
prime[i]=0;
for(i=2;i*i<50001;i++){
if(prime[i]==0){
for(j=i*i;j<50001;j+=i)
prime[j]=1;
}
}
while(1){
int count=0;
scanf("%d",&n);
if(n==0)break;
... | 170 |
Project_CodeNet | 2,011 | #include <stdio.h>
int main(void)
{
char number[50000] = {0};
int prime[5150];
int i, j;
int num;
int counter;
number[2] = 1;
for (i = 3; i <= 50000; i += 2) number[i] = 1;
for (i = 3; i * i<= 50000; i += 2){
if (number[i] == 1){
for (j = 2; i * j <= 50000; j++){
number[i * j] = 0;
}
}
}
... | 305 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <math.h>
int nmax=50000;
int pr[50000]={0};
int comb[50001]={0};
int main(void) {
int i,p,j,n;
for(i=2;i<nmax;i++){
if (i!=2 && i%2==0){
pr[i-2]=0;
}
else{
pr[i-2]=i;
}
}
for (p=0;p<sqrt(nmax);p++){
if(!pr[p]){continue;}
for(i=p+1;i<nmax;i++){
if (pr[i]%(p+2)==0){pr... | 238 |
Project_CodeNet | 2,012 | #include <stdio.h>
int main(){
int x[50000],i,n,j,sum=1;
for(i=0;i<50000;i++){x[i]=1;}
for(i=2;i*i<50000;i++){
if(x[i]==1){
for(j=2;i*j<50000;j++){
x[i*j]=0;
}}}
while(1){
scanf("%d",&n);
if(n==0) break;
for(i=2;i<n-1;i++){
if(x[i]==1&&x[n-i]==1){
sum++;
continue;
}}
printf("%d\n",sum/2);
sum=1;
}
return 0;
} | 135 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<math.h>
int main(){
int a[50000],b=0,i=3,c=0,d=2,e,num=0,sum,k,l,cir=0,low,high;
while(d<50030){
if(d==2){
a[b]=d;
b++,d++;
}
else{
while(i<=sqrt(d)){
if(d%i==0){
c++;
break;
}
i=i+2;
}
if(c!=1){
a[b]=d;
b++;
}
c=0,i=3;
d=d+2;
}
}
while(1){
scanf("%d\n",&e);
if(e==0){
break;
}
for(i=0;;i++){
... | 280 |
Project_CodeNet | 2,009 | #define M 50000
p[M+1];main(i,j,n){p[1]=1;for(;i<=M;i++)if(!p[i])for(j=i*2;j<=M;j+=i)p[j]=1;for(;scanf("%d",&n),n;printf("%d\n",j))for(i=2,j=0;i<=n/2;i++)if(!p[i]&&!p[n-i])j++;return 0;} | 97 |
Project_CodeNet | 2,017 | #include<stdio.h>
#include<math.h>
int main(){
int sosu[100001],n,p,q,i,j,count;
// FILE *fo;
// fo=fopen("data.txt","r");
// fscanf(fo,"%d",&n);
for(i=0;i<=100000;i++)sosu[i]=i;
for(i=2;i<=316;i++)
if(sosu[i]!=0)
for(j=i*i;j<=100000;j=j+i)sosu[j]=0;
// for(i=2;i<=50000;i++)
// if(sosu[i]!=0)pri... | 234 |
Project_CodeNet | 2,013 | #include<stdio.h>
int a[50001];
main(){
int i,j,cnt=0,n=50000,b;
for(i=2;i<=n;i++){
if(a[i]==0){
for(j=2;i*j<=n;j++){
a[i*j]=1;
}
}
}
while(1){
scanf("%d",&b);
if(b==0)break;
for(i=2;i<=b/2;i++){
if(a[i]==0&&a[b-i]==0)cnt++;
}
printf("%d\n",cnt);
cnt=0;
... | 137 |
Project_CodeNet | 2,018 | #include <stdio.h>
#define MAX 50001
int makePrimeTable( int * table )
{
int i, j;
for ( i = 0 ; i < MAX ; i++ ) {
table[i] = 0;
}
for ( i = 2 ; i < MAX ; i++ ) {
if ( table[i] == 0 ) {
for ( j = 2 ; i * j < MAX ; j++ ) {
... | 251 |
Project_CodeNet | 2,013 | #include <stdio.h>
int main() {
int prime[60000] = {1, 1};
int prime_num[10000] = {0};
int num;
int i, j;
int n;
int ans;
int temp;
for(i = 2; i < 60000; i++)
if(!prime[i])
for(j = 2; i * j < 60000; j++)
prime[i * j] = 1;
for(i = 0, num = 0; i < 60000; i++) {
if(!prime[i]) {
prime_num[num] = i... | 256 |
Project_CodeNet | 2,012 | a[' '];n,q;main(s){for(;++s<224;)for(q=s;q<5e4;a[q+=s]=1);for(;s=q=scanf("%d",&n),n--;printf("%d\n",s-1))for(;++q<n--;s+=!a[n]&!a[q]);} | 72 |
Project_CodeNet | 2,013 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<stdarg.h>
#include<malloc.h>
int prime(int);
int p[50001] = {0};
int main()
{
int i, j, n, s, t, m, count, buf[5200] = {0}, ans;
for(i=2; i<=50000; i++)
p[i] = 1;
j = 0;... | 507 |
Project_CodeNet | 2,010 | #include<stdio.h>
#define MAX 50000
#define sqrtMAX 224
int main(void)
{
int n;
int b[MAX+1] = {0};
int p[5134] = {0};
int c[MAX+1] = {0};
int i, j;
int count;
// ツエツδ可トツスツテツネツスツづ個づ督づゥツつ「
b[0] = 1;
b[1] = 1;
for(i=4; i<=MAX; i+=2)
b[i] = 1;
for(i=3; i<sqrtMAX; i+=2)
for(j=i+i; j<=MA... | 340 |
Project_CodeNet | 2,012 | #include <stdio.h>
#include <math.h>
#define N 50000
int main()
{
int i,j,n;
int prime[N];
for (i=0;i<N;i++){
prime[i]=1;
}
prime[0]=0;
for (i=1;i<(int)sqrt(N);i++){
if (prime[i]==1){
for (j=i+1;(i+1)*j<=N;j++){
prime[(i+1)*j-1]=0;
}
}
}
while(scanf("%d",&n)){
if (n=... | 204 |
Project_CodeNet | 2,013 | #include <stdio.h>
#include <math.h>
#include <string.h>
int main(void){
int a[50001],p[5200],i,j,k,x,ans;
for(i=0;i<=50000;i++)a[i]=1;
for(i=2,k=0;i<50000;i++){
if(a[i]==1){
p[k]=i;k++;
if(i<225)for(j=i*i;j<=50000;j+=i)a[j]=0;
}
}
while(scanf("%d",&x)){
if(x==0)break;
ans=0;
if(x%2==1 || x==4){i... | 204 |
Project_CodeNet | 2,014 | #include <stdio.h>
int a[100000];
int main(void)
{
int n;
int i, j, sum;
for (i = 2; i <= 50000; i++)a[i] = 1;
for (i = 2; i * i <= 50000; i++){
if (a[i] == 1){
for (j = i * i; j <= 50000; j += i)a[j] = 0;
}
}
// for (i = 0; i <= 100; i++)printf("a[%d]=%d\n", i, a[i]);
while (1){
sum = 0;
scanf... | 248 |
Project_CodeNet | 2,012 | #include <stdio.h>
#define N_MAX 50000
#include <stdlib.h>
#include <math.h>
char* eratosthenes(int N){
char *a=malloc(N+1); int i, j;
a[0]=0, a[1]=0; for(i=2; i<=N; i++) a[i]=1;
for(i=2; i<=(int)sqrt(N); i++)
if(a[i]!=0) for(j=2*i; j<=N; j+=i) a[j]=0;
return a;
}
int main(int argc, char *argv... | 222 |
Project_CodeNet | 2,012 | #include<stdio.h>
#define M 100000
int main(void){
int i,j;
int n,ans;
int num[M];
num[0]=0;
for(i=1;i<M;i++)
num[i]=1;
for(i=1;i<M;i++)
if(num[i]==1)
for(j=i+i+1;j<M;j+=i+1)
num[j]=0;
for(;;){
scanf("%d",&n);
if(n==0)
break;
ans=0;
for(i=1;i<n/2;i++)
... | 157 |
Project_CodeNet | 2,014 | #include <stdio.h>
#define MAX (50000)
char prime[MAX + 1];
int main(void)
{
int n, i, j, num;
prime[0] = prime[1] = 0;
for (i = 2; i <= MAX; i++){
prime[i] = 1;
}
for (i = 2; i * i <= MAX; i++){
for (j = i * i; j <= MAX; j += i){
prime[j] = 0;
}
}
while (scanf("%d", &n), n != 0){
i = 1;
j ... | 241 |
Project_CodeNet | 2,017 | #include <stdio.h>
#define MAX 50001
int main(int argc, const char * argv[]) {
int t[MAX],n,i,j,count=0;
for(i=0;i<MAX;i++){
t[i]=1;
}
t[0]=t[1]=0;
for(i=2;i*i<MAX;i++){
if(t[i]==1){
for(j=i*i;j<MAX;j+=i){
t[j]=0;
}
}
}
while(1... | 227 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(void){
int i,j,prm[60000];
for(i=0;i<60000;i++) prm[i]=1;
for(i=4;i<60000;i+=2) prm[i]=0;
prm[0]=0; prm[1]=0;
for(i=3;i*i<60000;i+=2){
if(prm[i]==1){
for(j=i+i;j<60000;j+=i) prm[j]=0;
}
}
int n;
while(scanf("%d",&n)!=EOF){
if(n==0) break;
els... | 218 |
Project_CodeNet | 2,011 | #include <stdio.h>
int main(int argc,char* argv[]){
int comb[50001];
int i,j;
int n;
for(i = 2;i <= 50000; i++){
comb[i] = 1;
}
comb[0] = comb[1] = 0;
for(i = 2; i < 224; i++){
if(comb[i] == 0){continue;}
for(j = 2; (i*j) <= 50000; j++){
comb[i*j] = 0;
}
}
for(;;){
in... | 216 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main(void){
int n,a,b;
int p[50001];
int ans;
for (int i = 0; i < 2; i++) {
p[i] = 0;
}
for (int i = 2; i <= 50000; i++) {
p[i] = 2;
}
for (int i = 2; i <= 50000; i++) {
if (p[i] != 0) {
p[i] = 1;
for (int j = i + 1; j <= 50000; j++) {
if (j % i == ... | 271 |
Project_CodeNet | 2,017 | #include<stdio.h>
#include<math.h>
int sosu1(int m){
int i;
for(i=2;i<=sqrt(m);i++){
if(m%i==0){
return 0;
}
}
return 1;
}
int main(void){
int n,count=0;
int i,j;
int sosu[50001];
for(i=0;i<=50000;i++){
sosu[i]=1;
}
for(i=2;i<=sqrt(50000);i++){
if(sosu[i]==1){
for(j... | 246 |
Project_CodeNet | 2,011 | // AOJ Volume 0 Problem 0056
#include <stdio.h>
#define GET_FLG(n) (flg_prime[((n) / 2) - 1])
#define SET_FLG(n) (flg_prime[((n) / 2) - 1] = 1)
char flg_prime[50000];
int main(void)
{
int i;
int j;
int n;
int cnt;
flg_prime[0] = flg_prime[1] = 1;
for (i = 2; i <= 50000; i++){
if ... | 294 |
Project_CodeNet | 2,014 | #include <stdio.h>
#define MAX 50001
int main(){
int n, i, j, c, prime[MAX] = {};
prime[0] = prime[1] = 1;
for(i = 2;i < MAX;i++){
if(prime[i] != 1){
for(j = i * 2;j < MAX;j += i)
prime[j] = 1;
}
}
while(scanf("%d", &n) && n){
c = 0;
for(i = 0;i <= n / 2;i++)
if(!prime[i]... | 155 |
Project_CodeNet | 2,012 | /* AOJ 0056
*
* http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0056
*
*/
#include <stdio.h>
#define true 1
#define false 0
int table[51000];
int isprime(int n){
int i;
for(i=2;i*i<=n;i++){
if(table[i] && !(n%i)){
return false;
}
}
return true;
}
void build(v... | 253 |
Project_CodeNet | 2,010 | #include <stdio.h>
int data[50001];
int sosu[50000];
main(){
int n, i, j, k, sa, count;
data[2]=1;
sosu[0]=2;
k=1;
for(i=3;i<50001;i++){
for(j=0;;j++){
if(sosu[j]*sosu[j]>i){
data[i]=1;
sosu[k]=i;
k++;
break;
}
if(i%sosu[j]==0) break;
}
}
while(1){
scanf("%d", &n);
... | 206 |
Project_CodeNet | 2,013 |
/*
AizuOnline A0056
Title Goldbach's Conjecture
*/
#include <stdio.h>
// Select Below
//#include <stdlib.h>
//#include <string.h>
//#include <float.h>
//#include <math.h>
//#include <limits.h>
//Global data section
int n;
int prime_f[50001];
int prime_table[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,
53,59,61,... | 402 |
Project_CodeNet | 2,013 | #include <stdio.h>
#include <math.h>
#include <string.h>
#define N (600000)
char isPrime[N];
int makePrime(void)
{
int i, j;
int lim;
memset(isPrime, 0, sizeof(isPrime));
lim = sqrt(N);
for (i = 2; i < lim; i++){
for (j = i * i; j < N; j += i){
isPrime[j] = 1;
}
}
return (0);
}
int main(void)
{
int... | 199 |
Project_CodeNet | 2,011 | #include <stdio.h>
#include <stdlib.h>
#define MAX_N 50000
int p = 0;
int prime[MAX_N];
int is_prime[MAX_N + 1];
void eratosthenes() {
int i, j;
for (i = 0; i < MAX_N; i++) { is_prime[i] = 1; }
is_prime[0] = is_prime[1] = 0;
for (i = 2; i <= MAX_N; i++) {
if (is_prime[i]) {
prime[p++] = i;
... | 490 |
Project_CodeNet | 2,015 | #include<stdio.h>
int main(){
int i, j, k = 0;
int n, count;
int prime[50000];
for(i = 1; i < 50000; i++) prime[i] = 1;
for(i = 2; i <= 224; i++) if(prime[i] == 1) for(j = 2; i * j <= 50000; j++) prime[i * j] = 0;
while(scanf("%d", &n), n != 0){
count = 0;
for(i = 2; i < n/2+1... | 170 |
Project_CodeNet | 2,015 | #include <stdio.h>
#define NUM 50001
int prime[NUM];
void eratosthenes(void) {
int i, j;
prime[0] = 1;
prime[1] = 1;
for(i = 2; i < NUM; i++ ) {
for(j = 2; j * i < NUM; j++ ) {
prime[i*j] = 1;
}
}
}
int main(void) {
int n, i, j, count;
eratosthenes();
while... | 231 |
Project_CodeNet | 2,010 | #include <stdio.h>
int main(void) {
int sosuu[50000];
int sosuulist[50000];
int i,j;
int n;
int count;
int aikata;
for(i=0;i<50000;i++)sosuu[i]=1;
sosuu[0]=0;
for(i=1;i*i<50000;i++) {
if(sosuu[i]==0)continue;
for(j=i+i+1;j<50000;j+=i+1) {
sosuu[j]=0;
}
}
for(i=0,j=0;i<50000;i++) {
if(sosuu[i]) {
... | 244 |
Project_CodeNet | 2,011 | r,p[' '],i;main(i,n){for(;i*i++<1e5;)if(!p[i])for(n=i+i;n<1e5;n+=i)p[n]=1;for(;i=scanf("%d",&n),n;r=!printf("%d\n",r))for(;i++<n/2;)r+=!p[i]&!p[n-i];exit(0);} | 88 |
Project_CodeNet | 2,014 | import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.math;
immutable limitList = 100000;
void main() {
int input;
bool[] listNumbers = new bool[](limitList);
int[] listPrimeNumbers; //List of prime numbers.
listNumbers.fill(true);
listNumbers[0..2] = false;
... | 199 |
Project_CodeNet | 2,014 | import std.stdio,std.string,std.conv;
int prime[1000000];
int main()
{
prime[0] = prime[1] = 0;
foreach(i;2..1000000)
{
prime[i] = 1;
}
foreach(i;2..1000000)
{
if(prime[i])
{
for(int j = i*2; j < 1000000 ;j += i)
{
prime[j] = 0;
}
}
}
int n;
while((n = readln.chomp.to!int) != 0)
{
... | 201 |
Project_CodeNet | 2,014 | import std.stdio, std.string, std.conv;
import std.array, std.algorithm, std.range;
void main()
{
auto ns = stdin.byLine().map!(to!int).array().until(0).array();
immutable m = reduce!max(ns)+1;
auto p = new bool[m];
foreach(i;2..m) if(!p[i]) for(int j=2; i*j<m; ++j) p[i*j]=true;
foreach(n;ns)
{... | 165 |
Project_CodeNet | 2,015 | import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
void main()
{
immutable MAX = 50001;
bool p[MAX];
p[] = 1;
p[0..2] = 0;
foreach (i; 2..sqrt(MAX*1.0).ceil.to!int) {... | 194 |
Project_CodeNet | 2,018 | p = [True for i in range(50000)]
p[0] = 0
for i in range(2,int(50000**(1/2)+1)):
if p[i-1]:
for j in range(i**2,50000,i):
p[j-1] = False
prime = [i+1 for i in range(50000) if p[i]]
while(1):
n = int(input())
if not n:
break
count = 0
half = n//2
for i in prime:
... | 150 |
Project_CodeNet | 2,018 | import bisect,sys
from itertools import *
n=range(50001);a=list(n);a[1]=0
for i in range(2,224):a[i*2::i]=[0]*len(a[i*2::i])
p=list(compress(n,a))
for x in map(int,sys.stdin):
if x:print(len([1 for d in p[:bisect.bisect(p,x//2)]if a[x-d]]))
| 97 |
Project_CodeNet | 2,020 | import sys
readline = sys.stdin.readline
write = sys.stdout.write
L = 50000
sq = int(L**.5)
p = [1]*(L+1)
p[0] = p[1] = 0
pn = []
for x in range(sq+1):
if not p[x]:
continue
for y in range(x*x, L+1, x):
p[y] = 0
pn.append(x)
for x in range(sq+1, L+1):
if not p[x]:
continue
p... | 228 |
Project_CodeNet | 2,016 | from math import sqrt, floor
p = [2]
for i in range(3, 50000, 2):
for j in range(3, floor(sqrt(i)) + 1, 2):
if not i % j:
break
else:
p.append(i)
sp = set(p)
while True:
n = int(input())
if not n:
break
if n & 1:
print(int(n - 2 in sp))
continue
... | 154 |
Project_CodeNet | 2,012 | import itertools
N=50000+1
p=[True]*N
p[0],p[1]=False,False
for i in xrange(2,int(N**0.5)+1):
if p[i]==True:
for j in xrange(i**2,N,i):
p[j]=False
plist=[i for i in xrange(N) if p[i]]
c=[0]*N*2
for i,j in itertools.combinations(plist,2):
c[i+j]+=1
for i in xrange(N):
if p[i]:c[i+i]+=1
wh... | 143 |
Project_CodeNet | 2,017 | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0056
"""
from math import sqrt, ceil, pow
import bisect
# https://github.com/mccricardo/sieve_of_atkin/blob/master/sieve_of_atkin.py
class SieveOfAtkin:
def __init__(self, limit):
self.limit = limit
self.primes = ... | 974 |
Project_CodeNet | 2,014 | import sys
def sieve(m):
N=range(1,m+2,2)
r=int(m**.5)
h=len(N)
N[0]=0
for i in range(h):
x=N[i]
if x>r: break
if x and i+x<h: N[i+x:h:x]=[0]*((h-1-i-x)/x+1)
return N
def f0056(n):
x=0
if n<4:x=0
elif n==4:x=1
elif n%2==1:
if S[n/2-1]: x=1
else... | 221 |
Project_CodeNet | 2,019 | LIM = 50001
# prepare primes
is_prime = [True for _ in range(LIM)]
is_prime[0] = is_prime[1] = False
# sieve of eratosthenes
for x in range(LIM//2 + 1):
if is_prime[x]:
for y in range(x*x, LIM, x):
is_prime[y] = False
primes = [x for x in range(LIM) if is_prime[x]]
# END `prepare pri... | 212 |
Project_CodeNet | 2,018 | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | 162 |
Project_CodeNet | 2,013 |
import sys
import itertools
def prime_list(n):
limit = int(n ** 0.5) + 1
lis = range(1, n + 1, 2)
lis[0] = 2
while True:
if len(lis) == 0:
break
p = lis.pop(0)
yield p
if p <= limit:
lis = [x for x in lis if x % p != 0]
primes = []
for p in pr... | 197 |
Project_CodeNet | 2,019 | #4から50000までの素数を見つけ出す
MAX=50001
SQRT=233
num=[True for i in range(MAX)]
def prime(num):
num[0]=num[1]=False
for i in range(4,MAX,2):
num[i]=False
for i in range(2,SQRT+1):
if num[i]==True:
for j in range(i*i,MAX,i):
num[j]=False
prime(num)
prime_num=[i for i in ... | 219 |
Project_CodeNet | 2,014 | from itertools import *
def sieve(n):
a = range(n)
a[:2] = None, None
for i in range(2, n):
if i ** 2 >= n: break
if not a[i]: continue
for i in range(i ** 2, n, i):
a[i] = None
return a
b = sieve(50000)
a = [v for v in b if v]
while True:
n = int(raw_input())
... | 154 |
Project_CodeNet | 2,017 | pr = [True] * 50001
for i in range(2,225):
if pr[i]:
for j in range(i * 2, 50001, i):
pr[j] = False
def gold_count(n):
res = 0
if pr[n - 2]:
res += 1
for i in range(3, n // 2 + 1, 2):
if pr[i] and pr[n - i]:
res += 1
return res
while True:
n = in... | 138 |
Project_CodeNet | 2,018 | MAX = 50001
is_prime = [True for _ in range(MAX)]
is_prime[0] = is_prime[1] = False
for i in range(2, int(MAX ** (1 / 2)) + 1):
if is_prime[i]:
for j in range(i ** 2, MAX, i):
is_prime[j] = False
primes = [i for i in range(MAX) if is_prime[i]]
def main():
while True:
n = int(input())
if not n:
... | 160 |
Project_CodeNet | 2,017 | import sys
N = 50001
lst = [True] * N
lst[0] = False
lst[1] = False
for i in range(2, int(N ** 0.5) + 1):
if lst[i]:
for j in range(i * i, N, i):
lst[j] = False
primes = [i for i in range(1, N) if lst[i]]
for s in sys.stdin:
n = int(s)
if n == 0:
break
elif n % 2 == 1:
... | 216 |
Project_CodeNet | 2,017 | isPrime = []
prime = []
count = []
def init():
for i in range(50000 + 1):
isPrime.append(True)
count.append(0)
def eratos():
isPrime[0] = False
isPrime[1] = False
for i in range(2, int((50000 ** (1 / 2))) + 1):
if (isPrime[i]):
for j in range(i * 2, 50000 + 1, i):
... | 217 |
Project_CodeNet | 2,015 | import sys
f = sys.stdin
def create_prime(n):
prime = [1] * (n + 1)
prime[:2] = [0, 0]
for i in range(len(prime)):
if prime[i]:
for j in range(2 * i, len(prime), i):
prime[j] = 0
return prime
sieve = create_prime(50000)
prime = []
for i in range(25001):
if siev... | 176 |
Project_CodeNet | 2,014 | from itertools import *
import sys
maxnum = 50001
primes = [True]*maxnum
primes[0] = primes[1] = False
for i in xrange(maxnum):
if i >= maxnum**0.5 : break
if not primes[i]: continue
for j in xrange(i*2,maxnum,i): primes[j] = False
p = [ i for i in xrange(maxnum) if primes[i] ]
c = [0]*maxnum*2
for i,j in... | 155 |
Project_CodeNet | 2,019 | import math
num = 50000
L = [True] * (num+1)
L[0] = L[1] = False
sqrt = int(num**0.5) +1
for i in range(2, sqrt):
if L[i] == False:
continue
for j in range(i*2,num+1,i):
L[j] = False
p = [x for x in range(num+1) if L[x] ]
#pset = set(p)
while True:
num = int(input())
if num == 0:
... | 178 |
Project_CodeNet | 2,012 | #!/usr/bin/env python:
# -*- coding: utf-8 -*-
import sys
def make_prime_list(lim):
lst = [True for i in xrange(lim + 1)]
num = 2
while num ** 2 <= lim:
for i in xrange(num * 2, lim + 1, num):
lst[i] = False
num += 1
while not lst[num]:
num += 1
return ... | 420 |
Project_CodeNet | 2,019 | p = [1] * (50000 + 1)
p[0], p[1] = 0, 0
for i in range(2, int(50000 ** 0.5) + 1):
if not p[i]:
continue
for j in range(2 * i, 50000 + 1, i):
p[j] = 0
p_num = [i for i in range(50000 + 1) if p[i] == 1]
while 1:
n = int(input())
if (n == 0):
break
cnt = 0
for i in p_num:... | 172 |
Project_CodeNet | 2,013 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
from __future__ import (division, absolute_import, print_function,
unicode_literals)
from sys import stdin
def enum_prime(m):
L = [True for _ in xrange(m + 1)]
L[0] = L[1] = False
for i in xrange(2, m + 1):
if L[i]:
... | 247 |
Project_CodeNet | 2,017 | # Aizu Problem 0056: Goldbach's Conjecture
#
import sys, math, os, bisect
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
def primes2(n):
""" Input n>=6, Returns a list of primes, 2 <= p < n """
n, correction = n-n%6+6, 2-(n%6>1)
sieve = [Tru... | 340 |
Project_CodeNet | 2,016 | def primes(n):
l = [1 for i in range(n+1)]
l[0] = l[1] = 0
for i in range(2,int((n)**(1/2))+1):
if l[i] == 1:
for j in range(2,n//i+1):
l[i*j] = 0
return l
l = primes(50000)
while True:
n = int(input())
if n == 0:
break
count = 0
if not(n%2):
for i in range(3,n//2+1,2):
... | 188 |
Project_CodeNet | 2,014 | import math
r = 50001
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
prime = []
for i in range(len(p)):
if p[i] == 1:
prime.append(i+1)
while True:
n = int(raw_input())
if n == 0:
break
count = 0... | 170 |
Project_CodeNet | 2,016 | # aoj0056.py
LIM = 50001
# prepare primes
is_prime = [True for _ in range(LIM)]
is_prime[0] = is_prime[1] = False
# sieve of eratosthenes
for x in range(LIM//2 + 1):
if is_prime[x]:
for y in range(x*x, LIM, x):
is_prime[y] = False
primes = [x for x in range(LIM) if is_prime[x]]
# END `pre... | 214 |
Project_CodeNet | 2,016 | def make_tbl(n):
tbl = [False, True, False, False, False, True] * (n // 6 + 1)
for i in range(1, 4):
tbl[i] = not tbl[i]
p, stp, sqrt = 5, 2, n ** 0.5
while p < sqrt:
for i in range(p ** 2, n, 2 * p):
tbl[i] = False
while True:
p += stp
stp = 6... | 246 |
Project_CodeNet | 2,017 | import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(input())
if n == 0:
break
I = bisect.bisect(values, n//2)
print(len([1 for v ... | 126 |
Project_CodeNet | 2,014 | import sys
N = 50000
t = [1]*(N)
p = [2]
d = {2:1}
for i in range(3, N, 2):
if t[i]:
p.append(i)
d[i] = 1
for j in range(3*i, N, 2*i): t[j] = 0
while True:
n = int(sys.stdin.readline())
if n == 0: break
count = 0
if n % 2:
if n - 2 in p: count += 1
else:
... | 167 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.