Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,014 | #include <iostream>
#define MAX 50001
using namespace std;
int main(){
bool p[MAX];
p[0] = p[1] = false;
for(int i=2;i<MAX;i++)p[i] = true;
for(int i=2;i<MAX;i++){
if(p[i]){
for(int j=i+i;j<MAX;j=j+i){
p[j] = false;
}
}
}
int cnt[MAX];
for(int i=0;i<MAX;i++) cnt[i] = 0;... | 190 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
ty... | 276 |
Project_CodeNet | 2,011 | #include<algorithm>
#include<iostream>
#include<string>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i,j,k,l;
int a[5140],p;
int ct;
bool b[50000];
memset(b,0,50000);
a[0]=2;
j=1;
b[2]=1;
for(i=3;i<50000;i+=2){
l=(int)sqrt(i)+1;
for(k=3;k<l;k+=2){
... | 236 |
Project_CodeNet | 2,016 | #include<iostream>
using namespace std;
bool isPrime(int n){
for(int i=2;i*i<=n;i++) if(n%i==0) return false;
return true;
}
int main(){
bool d[50000]={};
int i,j,k;
for(i=2;i<50000;i++) d[i]=isPrime(i);
int n;
while(cin>>n,n){
int o=0;
for(i=1;i<=n/2;i++) if(d[i]&&d[n-i]) o++;
cout << o << en... | 129 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#define N 50000
using namespace std;
int main(void){
int p[N+1] = {0};
int n, ans;
for (int i=2; i<N; i++){
if (p[i]==-1) continue;
p[i]=1;
for (int j=i*2; j<N; j+=i){
p[j]=-1;
}
}
while (scanf("%d",&n), n){
ans = 0;
for (int i=2; i<=n/2... | 166 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
using namespace std;
const int max_lim = 50001;
bool prime[max_lim];
vector<int> look;
void init()
{
for (int i = 0; i < max_lim; i++)
prime[i] = true;
prime[0] = prime[1] = false;
for (int i = 2; i * i < max_lim; i++)
for (int j = 2 * i; j < max_li... | 231 |
Project_CodeNet | 2,016 | #define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <sstream>
#include <climits>
#include <map>
#include <stack>
using namespace std;
#define M_PI 3.141592
#def... | 363 |
Project_CodeNet | 2,014 | #include <iostream>
using namespace std;
/** Problem0056 : Goldbach's Conjecture **/
#define MAX 50000
int main()
{
bool prime[MAX];
int input, count;
for (int i=0; i<MAX; i++)
prime[i] = true;
prime[0] = false; prime[1] = false;
for (int i=2; i<MAX; i++) {
if (prime[i]) {
for (int j=2; i*j<MAX; j+... | 212 |
Project_CodeNet | 2,017 | /* 0056*/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
std::vector<int> p;
bool s[50001];
int main(void){
for(int i=0;i<50001;i++)s[i]=true;
s[0]=s[1]=false;
for(int i=2;i<50001;i++){
if(s[i]){
p.push_back(i);
for(int j=i*2;j<50001;s[j]=false,j+=i);
}
}
int n;
while(c... | 177 |
Project_CodeNet | 2,014 | #include <iostream>
#include <vector>
using namespace std;
#define MAX 10000000
typedef long long ll;
bool prime[MAX];
void calcPrime(){
for( ll i = 2; i < MAX; i++ ) prime[i] = true;
for( ll i = 2; i < MAX; i++ ){
if( prime[i] ){
for( ll j = i+i; j < MAX; j += i ) prime[j] = false;
}
}
}
int main(){
calc... | 174 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string.h>
#include <math.h>
#include <time.h>
#include <stdlib.h>
using namespace std;
int main(){
int n,count,prime[100000],u,check[50100];
prime[0] = 2;
count = 0;
check[0]=0;
check[1]=0;
check[2]=1;
for(int i=3;i<50100;i... | 249 |
Project_CodeNet | 2,011 | #include <cstdio>
#include <vector>
using namespace std;
int main()
{
const int MAX_P = 50000;
bool p[MAX_P];
for (int i = 0; i < MAX_P; ++i)
p[i] = true;
p[0] = p[1] = false;
for (int i = 2; i*i <= MAX_P; ++i) {
if (p[i]) {
for (int j = i+i; j < MAX_P; j += i)
p[j] = false;
}
}
int ... | 209 |
Project_CodeNet | 2,017 | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | 630 |
Project_CodeNet | 2,012 | #include <iostream>
#include <math.h>
#define N 50001
using namespace std;
int main(void){
bool isprime[N];
for(int i=0;i<N;i++) isprime[i]=true;
int upto = (int)sqrt(N);
for(int i=2;i<=upto;i++){
if(isprime[i]){//消されてなければその倍数を消す
for(int j=2;i*j<=N;j++) isprime[i*j] = false;
}
}
int n;
while(cin >> n){... | 175 |
Project_CodeNet | 2,015 | #include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<set>
using namespace std;
const int MA=50000;
int p[100000],tcnt,ans[100000];
int main(){
for(int i=2;i<=60000;i++){
... | 208 |
Project_CodeNet | 2,015 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
bool era[10000000]={false};
void makeERA()... | 268 |
Project_CodeNet | 2,020 | #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,013 | #include<vector>
#include<cstdio>
using namespace std;
bool prime[50001];
int ans[50001];
int main(){
prime[1] = true;
for(int i = 2; i*i <= 50000; i++){
if(prime[i] == false){
for(int j = i; j <= 50000; j+=i){
prime[j] = true;
}
prime[i] = false;
... | 215 |
Project_CodeNet | 2,011 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
type... | 337 |
Project_CodeNet | 2,014 | #include <iostream>
using namespace std;
int main() {
int k[50001] ={1};
int g,h;
k[1] = 1;
for (int i = 2; i < 50001; i++) {
if (k[i] == 0) {
for (int j = 2; j < (50000/i+1); j++) {
k[i*j] = 1;
}
}
}
while (cin >> g) {
if (g == 0) {
break;
}
int counter = 0;
for (int i = 2; i < 50001... | 209 |
Project_CodeNet | 2,012 | #include <string>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <utility>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iterator>
#include <sstream>
using namespace std;
bool b[50000];
int main()
{
memset(b,1,sizeof(b));
b[0... | 189 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main()
{
bool prime[1000000];
prime[0]=prime[1]=false;
for(int i=2;i<1000000;i++){
prime[i]=true;
}
for(int i=2;i*i<1000000;i++){
if(prime[i]){
for(int j=i*i;j<1000000;j+=i){
prime[j]=false;
}
}
}
//???????????§?´???°??¨
int n,x,pea;
while(1){
pea=0;... | 212 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define X first
#define Y second
using namespace std;
void era(bool *table){
for(int i = 2; i <= 50000; i++){
if(tab... | 230 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
bool is_prime[50000];
is_prime[0]=is_prime[1]=false;
for(int i=2; i<=50000; i++){
is_prime[i]=true;
}
for(int i=2; i*i<=50000; i++){
if(is_prime[i]){
for(int j=i*i; j<=50000; j+=i){
is_prime[j]=false;
}
}
}
while(true... | 196 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<int ,P> P3;
typedef pair<P ,P> PP;
const ll MOD = ll(1e9+7);
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-6;
const int d... | 376 |
Project_CodeNet | 2,014 | #include<iostream>
bool sosuu[50001];
void init(){
for (int i = 0; i < 50001; i++)sosuu[i] = true;
sosuu[0] = sosuu[1] = false;
for (int i = 2; i*i < 50001; i++){
if (sosuu[i]){
for (int j = i * 2; j < 50001; j += i)sosuu[j] = false;
}
}
}
int main(){
init();
int n;
while (std::cin >> n, n){
int... | 192 |
Project_CodeNet | 2,015 | #include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include <vector>
#include <map>
#include<cstdlib>
using namespace std;
const int N = 50001;
vector<int> prime;
bool data[N];
void Solution()
{
/*the way to get prime number also can check the problems which i did before
... | 363 |
Project_CodeNet | 2,012 | #include<cstdio>
using namespace std;
int sosu[55555];
main(){
int N;
sosu[0]=1;
sosu[1]=1;
for(int j=2;j<224;j++){
if(sosu[j]==1) continue;
for(int i=j+j;i<50001;i+=j){
sosu[i]=1;
}
}
while(1){
scanf("%d",&N);
if(N==0) break;
int res=0;
for(int i=2;i<=N/2;i++){
i... | 163 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<end... | 720 |
Project_CodeNet | 2,010 | #include<cstdio>
using namespace std;
int main()
{
static bool era[50000];
era[0]=era[1]=true;
for(int i=2;i<300;i++){
if(!era[i])for(int j=i*i;j<50000;j+=i)era[j]=true;
}
int sz=0;
static int p[5133];
for(int i=2;i<50000;i++){
if(!era[i])p[sz++]=i;
}
int n;
for(;scanf("%d",&n),n;){
int cnt=0;
for(... | 171 |
Project_CodeNet | 2,013 | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <queue>
using namespace std;
int main(){
int prime[50001]={0};
prime[0]=-1;
prime[1]=-1;
int now =2;
while(now<=50000){
if(prime[now]==-1){
now++;
}else{
... | 199 |
Project_CodeNet | 2,012 | #include <iostream>
#include <bitset>
#define N_MAX 50001
using namespace std;
bitset<N_MAX> prime;
void make_cache() {
prime.set();
for (int i = 2; i < N_MAX; i++) {
if (prime[i]) {
for (int j = i + i; j < N_MAX; j += i) {
prime.reset(j);
}
}
}
}
... | 185 |
Project_CodeNet | 2,011 | //Name: Prime Number II
//Level: 1
//Category: f,Tõ,upper_bound,lower_bound
//Note:
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
vector<int> primes;
vector<int> is_prime(50001, 1);
is_prime[0] = is_prime[1] = 0;
int lim = (int)sqrt... | 282 |
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;
}
}
}... | 194 |
Project_CodeNet | 2,018 | #include <stdio.h>
#define max 50010
int main(void) {
long long i, j, k, n;
bool prime[max];
for(i = 0; i < max; ++i) prime[i] = true;
prime[0] = prime[1] = false;
for(i = 2; i < 250; ++i) if(prime[i]) for(j = 2; i * j < max; ++j) prime[i * j] = false;
while( 1 ) {
int ans = 0;
scanf("%lld", &n);
... | 185 |
Project_CodeNet | 2,010 | #include <iostream>
using namespace std;
#define MN 50001
int main()
{
bool pr[MN] = {0};
for(int i=2; i<MN; i++) pr[i]=1;
for(int i=2; i*i<MN; i++)
{
if(pr[i])
for(int j=i*2; j<MN; j+=i)
{
pr[j] = 0;
}
}
int n,c;
while(cin >> n, n)
{
c=0;
for(int i=2; i<=n/2; i++)
{
if(pr[i] && pr[n-i])... | 157 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> list;
bool sosu[50000] = {false};
for ( long long int i = 2; i < 50000; i++ ) {
if ( sosu[i] == false ) {
list.push_back(i);
for ( long long int j = i*2; j < 50000; j+=i ) {
sosu[j] = true;
}
}
}
... | 323 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define loop for(;;)
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
#define inf (1e9)
#define eps (1e-9)
template<class S, class T> inline
ostream& operator<<(ostream&os, pair<S,T> p) {
return os << '(' << p.first << ", ... | 581 |
Project_CodeNet | 2,014 | #include <iostream>
using namespace std;
int main()
{
bool primes[50000]={false};
primes[0] = true;
for(int i=2;i <= 25000;++i) {
if (primes[i-1]) continue;
for(int j=i+i;j <= 50000;j+=i) {
primes[j-1] = true;
}
}
int n;
while (cin >> n && n) {
int c... | 163 |
Project_CodeNet | 2,013 | #include<iostream>
using namespace std;
int a[50001];
int main(void)
{
a[0]=a[1]=1;
for(int i=2;i<=50000;i++)
{
for(int j=i+i;j<=50000;j+=i)
{
a[j]=1;
}
}
while(1)
{
int n;
cin>>n;
if(n==0)break;
int ans=0;
for(int i=2;i<=n/2;i++)
{
if(a[i]==0&&a[n-i]==0)
ans++;
}
cout<<ans<<end... | 143 |
Project_CodeNet | 2,012 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool isPrime(int n){
if(n<=1||n!=2&&(n&1)==0)return false;
for(int i=3;i*i<=n;i+=2)
if(n%i==0)return false;
return true;
}
int main(){
vector<int> primes;
for(int i=2;i<=50000;i++)
if(isPrime(i))primes.push_back(i);
int n,ans;
whil... | 170 |
Project_CodeNet | 2,012 | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,prime[50000] = {0},c;
bool f = true;
prime[2] = 1;
for(int i = 3;i < 50000;++i){
for(int j = 2;j <= sqrt(i);++j){
if(i % j == 0) f = false;
}
if(f) prime[i] = 1;
f = true;
}
while(cin >> n,n){
c = 0;
for(int i = 0;i <= n/2... | 171 |
Project_CodeNet | 2,011 | #include<iostream>
using namespace std;
int main(void){
long long sosu[50001],i,j,n;
sosu[0]=1;
sosu[1]=1;
for(i=2;i<50001;i++)
sosu[i]=0;
for(i=2;i<50001;i++){
if(sosu[i]==0){
for(j=i*i;j<50001;j+=i)
sosu[j]=1;
}
}
while(1){
int count=0;
cin >> n;
if(n==0)break;
... | 224 |
Project_CodeNet | 2,012 | #include<iostream>
int n;
int p;
bool isprime[50001];
int prime[50001];
int flg[25000001];
void sieve( int x )
{
p = 0;
isprime[0] = isprime[1] = false;
for( int i = 2; i <= x; i++ ) isprime[i] = true;
for( int i = 2; i <= x; i++ ){
if( isprime[i] ){
prime[p++] = i;
for( int j = i * 2; j <= x; j... | 248 |
Project_CodeNet | 2,014 | #include <iostream>
using namespace std;
int p[50001] ={0};
int main()
{
for(int i=4;i<=50000;i++){
if(i%2==0) p[i] = 1;
for(int j=3;j*j<=i;j++){
if(i % j == 0){
p[i] = 1;
}
}
}
int n;
while(cin>>n && n){
int cnt = 0;
for(int i=2;i<=n/2;i++){
if( p[i]==0 && p[n-i]==0 ){
cnt++;
}... | 155 |
Project_CodeNet | 2,013 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const unsigned int MAX = 50010;
char prime[MAX];
int main(){
prime[0] = prime[1] = 1;
for(unsigned int i = 4; i < MAX; i += 2){
prime[i] = 1;
}
unsigned int rt = sqrt(MAX);
for(unsigned int i = 3; i <= rt; i += 2){... | 229 |
Project_CodeNet | 2,017 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=... | 363 |
Project_CodeNet | 2,011 | #include <iostream>
using namespace std;
int prime[50001];
bool is_prime[50001];
int res(int n)
{
int p=0;
for(int i=0;i<n+1;i++){
is_prime[i] = true;
}
is_prime[0] = is_prime[1] = false;
for(int i=2;i<n+1;i++){
if(is_prime[i]){
prime[p++] = i;
for(int j=2*i;j<n+1;j+=i){
is_prime[j] = false;
}
... | 297 |
Project_CodeNet | 2,013 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
vector<int> primes;
bool flag[50000];
int ans[50001];
fill(flag,flag+50000,0);
fill(ans,ans+50001,0);
for(int i = 2; i < 50000; ++i)
{
if(!flag[i])
{
primes.push_back(i);
for(int j = 0; j < primes.size(); ++j)
... | 309 |
Project_CodeNet | 2,013 | #include <iostream>
#define STA 50000
using namespace std;
int prime[50001];
int main(){
int n;
int cnt;
for(int i=2;i<=STA/2;i++){
for(int j=2;i*j<=STA;j++){
prime[i*j] = 1;
}
}
while(1){
cnt = 0;
cin >> n;
if(n == 0) break;
for(int i=2;i<=n/2;i++){
if(prime[i] == 0 && prime[... | 138 |
Project_CodeNet | 2,012 | #include<iostream>
bool sieve[100000];
void makesieve();
int main()
{
makesieve();
while(1)
{
int n,ans=0;
std::cin>>n;
if(n==0)break;
for(int i=0;i<=n/2;i++)
{
if(sieve[i]&&sieve[n-i])ans++;
}
std::cout<<ans<<std::endl;
}
return 0;
}
void makesieve()
{
for(int i=0;i<100000;i++){sieve[i]=true;... | 180 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
bool is_prime[100000];
is_prime[0]=is_prime[1]=false;
for(int i=2;i<100000;i++)
is_prime[i]=true;
for(int i=2;i*i<100000;i++){
if(is_prime[i]){
for(int j=i*i;j<100000;j+=i){
is_prime[j]=false;
}
}
}
... | 177 |
Project_CodeNet | 2,009 | #include<cmath>
using namespace std;
#define MAX 1000000
void eratos ( int n, bool prime[]){
for ( int i = 0; i <= n; i++ ) prime[i] = false;
for ( int i = 3; i <= n; i += 2 ) prime[i] = true;
prime[2] = true;
int limit = (int)sqrt((double)n) + 1;
for ( int i = 3; i <= limit; i += 2 ){
if (... | 255 |
Project_CodeNet | 2,016 | #include <iostream>
#include <algorithm>
#define N 50000
using namespace std;
int main(){
bool ip[N];
int p[N];
for(int i=0;i<N;i++) ip[i]=true;
int q=0;
ip[0]=ip[1]=false;
for(int i=0;i<N;i++){
if(ip[i]){
p[q++]=i;
for(int j=i*2;j<N;j+=i) ip[j]=false;
}
}
int n,a;
while(1){
c... | 214 |
Project_CodeNet | 2,012 | #include<iostream>
#include<cstring>
#include<vector>
using namespace std;
int main()
{
int p[60000];
memset(p,0,sizeof(p));
for(int i=2;i<30000;i++)
if(p[i]==0)
for(int j=i+i;j<60000;j+=i)
p[j]=1;
int n;
for(;cin>>n,n;)
{
int count=0;
for(int i=2;i<=n/2;i++)
if(p[i]==0 && p[n-i]==0)... | 131 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
deque<int> Era(int n) {
deque<int> arr(n+1,1);
deque<int> prime;
arr[0]=0;
arr[1]=1;
for (int i=2;i*i<n;i++) {
if (arr[i]==1) {
for (int j=i*i;j<n;j+=i) {
arr[j]=0;
}
}
}
for (int k=2;k<=n;... | 263 |
Project_CodeNet | 2,018 | /*----------------------
h28i13 織海斗
------------------------*/
#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_pri... | 248 |
Project_CodeNet | 2,011 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <memory.h>
#include <cassert>
#include <i... | 458 |
Project_CodeNet | 2,012 | #include<iostream>
#include <algorithm>
#include<functional>//greaterの使用
using namespace std;
#define MAX_LIST 50000
int main(){
bool prime[MAX_LIST];
for(int i=0;i<MAX_LIST;i++){
prime[i]=1;
}
prime[0]=prime[1]=0;
for(int i=0;i*i<MAX_LIST;i++){
if(prime[i]==1){
for(int j=i*2;j<MAX_LIST;j=j+i){
prime[j... | 241 |
Project_CodeNet | 2,010 | #include<stdio.h>
#include<string.h>
char so[50001];
main(){
memset(so,0,sizeof(so));
int n,i,j,count;
for(i=2;i<225;i++){
for(j=i;j*i<=50000;j++){
so[j*i]=1;
}
}
while(~scanf("%d",&n)){
if(n==0)break;
count=0;
for(i=2;i<(n>=25000 ? 25000:n);i++){
if(i>n-i)break;
if(so[i]==0 && so[n-i]==0)... | 151 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(){
int n,now=1,a[10000],ans;
bool prime[60000],f;
a[0]=2;
for(int i=3;i<60000;i+=2){
prime[i]=true;
}
for(int i=3;i<=60000;i+=2){
if(prime[i]){
a[now]=i;
now++;
if((long long)i*i<60000){
for(int j=i*i;j<6... | 320 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <stack>
#include <iomanip>
#include <numeric>
#include <queue>
#include <climits>
#include <set>
#include <complex>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define MOD 1000000007
#def... | 378 |
Project_CodeNet | 2,014 | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int dp[3][50001] = {}, n, memo[50000];
bool prime[50000] = {};
for (int i = 2; i < 50000; i++){
if (prime[i]) continue;
for (int j = 2; i*j < 50000; j++){
if (prime[i * j]) continue;
prime[i * j] = true;
}
}
dp[0][0] = 1;
for (int i... | 264 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <ctype.h>
#include <algorithm>
using namespace std;
int gcd(int a, int b) {
if(b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
vector<int> prime(60000);
int k;
void primesearch(int x... | 267 |
Project_CodeNet | 2,013 | #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_b... | 286 |
Project_CodeNet | 2,011 | #include <iostream>
#include <set>
using namespace std;
bool p[50000];
int main()
{
int i,j;
set<int> s;
for(i=2;i<50000;i++){
if(!p[i]){
s.insert(i);
for(j=i*2;j<50000;j+=i){
p[j] = true;
}
}
}
while(cin >> i,i){
int c = 0;
set<int>::iterator it = s.begin();
while(it !=... | 160 |
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,016 | #include <iostream>
#include <vector>
using namespace std;
int table[50000];
vector<int> prime;
int main() {
for (int i = 2; i < 50000; i++) {
if (table[i] == 0) {
prime.push_back(i);
for (int j = i; j < 50000; j += i) {
table[j] = 2;
}
tabl... | 225 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
bool is_prime[50000];
is_prime[0]=is_prime[1]=false;
for(int i=2;i<50000;i++){
is_prime[i]=true;
}
for(int i=2;i*i<50000;i++){
if(is_prime[i]){
for(int j=i*i;j<50000;j+=i){
is_prime[j]=false;
}
}
}
while(true){
int n;
cin>>n;
int... | 181 |
Project_CodeNet | 2,012 | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
bool isPrime( int n )
{
for ( int i = 2; ... | 277 |
Project_CodeNet | 2,015 | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | 252 |
Project_CodeNet | 2,014 | #include <iostream>
using namespace std;
bool ifnp[50001];
void set(){
ifnp[0] = ifnp[1] = 1;
for(int n = 2; n*n < 50000; n++){
if( !ifnp[n] ){
int j = n*n;
while( j <= 50000 ){
ifnp[j] = 1;
j += n;
}
}
}
}
int main(){
... | 208 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
#define IOS ios_base::sync_with_stdio(false);cin.tie(nullptr);
#endif
#define FILE_IO freopen("input.txt","r",stdin)
#define int long long
#define f first
#define s second
#define endl '\n'
#define all(c) c.begin(),c.end()
#d... | 609 |
Project_CodeNet | 2,016 | #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>
using namespace std;
#define FOR(i,a,b) for(... | 386 |
Project_CodeNet | 2,019 | #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;
... | 205 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inc... | 370 |
Project_CodeNet | 2,013 | #include <iostream>
#include <cstdio>
using namespace std;
int sosu_f[50001];
void era(void){
sosu_f[0]=sosu_f[1]=1;
for(int i=2;i<=50000;i++){
if(!sosu_f[i]){
for(int j=i+i;j<=50000;j+=i){
sosu_f[j]=1;
}
}
}
}
int main(void){
int n;
int co... | 173 |
Project_CodeNet | 2,018 |
#include<iostream>
using namespace std;
int main(){
bool prime[50000];
prime[0]=prime[1]=false;
for(int i=2;i<50000;i++){
prime[i]=true;
}
for(int i=2;i*i<50000;i++){
if(prime[i]){
for(int j=i*i;j<50000; j+=i){
prime[j]=false;
}
}
}
while(true){
int min,a,cnt;
c... | 171 |
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;
}
}
}
while(true){
int n,count... | 189 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
bool is_prime[100000];
is_prime[0] = is_prime[1] = false;
for(int i=2; i<100000; i++){
is_prime[i] = true;
}
for(int i=2; i*i<100000; i++){
if(is_prime[i]){
for(int j=i*i; j<100000; j+=i){
is_prime[j] = false;
}
}
}
w... | 191 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#define MAX 100000
using namespace std;
int main(){
vector<bool> v(MAX);
for(int i = 0;i<MAX;i++)
v[i]=true;
v[0]=v[1]=false;
for(int i = 2;i<1000;i++){
if(v[i]){
for(int j=i*i;j<MAX;j+=i){
v[j]=false;
}
}
}
while(t... | 164 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MAXN 1000010
#define rep(i,n) for (int i = 0; i < (n); ++i)
const ll mod = 1e9+7;
vector<int> P;
bool is_prime[100010];
void Eratosthenes( const int N )
{
rep(i, N) {
is_p... | 267 |
Project_CodeNet | 2,016 | #include<iostream>
#include<string>
using namespace std;
bool isprime[50000];
int main(){
for(int i=0;i<50000;i++){
isprime[i]=true;
}
for(int i=2;i*i<50000;i++){
for(int j=2;j<50000;j++){
if(j%i==0&&i!=j){
isprime[j]=false;
}
}
}
int n;
while(true){
cin>>n;
if(n==0)
break;
int ... | 154 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#define INPUT_FROM_FILE (0)
#if INPUT_FROM_FILE
#include <fstream>
#endif
class PrimeTest{
private:
std::vector<bool> is_prime_; //nが素数かどうかをis_prime[n]で判定
std::vector<unsigned int> prime_numbers_; //素数の集合
public:
PrimeTest();
~PrimeTest();
const... | 622 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
int inf = 1000000000;
vector<bool> isPrime(int n){
vector<bool> p(n+1, true... | 352 |
Project_CodeNet | 2,015 | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_... | 256 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
vector<int> prime;
bool is_prime[1000010];
int min_factor[1000010];
int sieve(int n) {
fill(is_prime + 2, is_prime + 1000010, true);
min_factor[1] = 1;
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
prim... | 307 |
Project_CodeNet | 2,018 | #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
int n;
const int max = 50000;
int a[max];
a[1] = 0;
for(int i = 2; i < max; i++) a[i] = 1;
for(int i = 2; i * i <= max; i++){
for(int j = 2; j*i <= max; j++){
... | 227 |
Project_CodeNet | 2,013 | #include<iostream>
#define N 50000
using namespace std;
int main(){
int n;
int p[N]={0};
for(int i=3;i<=N;i+=2) p[i] = 1;
p[2] = 1;
for(int i=3;i<=1000;i+=2){
if(p[i]==1){
for(int j=2*i;j<=N;j+=i) p[j] = 0;
}
}
while(cin >> n){
if(n==0) break;
int count = 0;
for(int i=2;i<=n/2;i+... | 168 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
bool is_prime[100000];
int main(){
is_prime[0]=is_prime[1]=false;
for(int i=2;i<100000;i++){
is_prime[i]=true;
}
for(int i=2;i*i<100000;i++){
if(is_prime[i]){
for(int j=i*i;j<100000;j+=i){
is_prime[j]=false;
}
}
}
while(true){
int n;
cin>>n;
if(n... | 172 |
Project_CodeNet | 2,013 | #include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,n) loop(i,0,n)
const int MAX_N=50000;
int p[(MAX_N+1)/2];
bool isp[MAX_N+1];
int f(){
memset(isp,1,sizeof(isp));
isp[0]=isp[1]=false;
int idx=0;
loop(i,2,MA... | 219 |
Project_CodeNet | 2,015 | #include<iostream>
#include<cmath>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
bool prime[50001];
rep(i,50001)prime[i]=true;
prime[0]=prime[1]=false;
for(int i=2;i<50001;i++){
for(int j=i*2;j<50001;j+=i){
prime[j]=false;
}
}
int n;
int cnt=0;
wh... | 167 |
Project_CodeNet | 2,013 | #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 50000
bool is_prime[MAX+1];
void Sieve(){
fill( is_prime, is_prime + MAX, true );
is_prime[0] = is_prime[1] = false;
for(int i=0; i<=MAX; i++) {
if( is_prime[i] ) {
for(int j=2*i; j<=MAX; j+=i) {
is_prime[j] = false;
... | 192 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr... | 321 |
Project_CodeNet | 2,012 | //57
#include<iostream>
using namespace std;
int main(){
bool cmp[50001]={true,true};
for(int i=2;i<50001;i++){
if(!cmp[i]){
for(int j=2;j*i<50001;j++){
cmp[i*j]=true;
}
}
}
for(int n;cin>>n,n;){
int ans=0;
for(int i=0;i<=n-i;i++){
ans+=!cmp[i]&&!cmp[n-i];
}
cout<<an... | 125 |
Project_CodeNet | 2,013 | #include <iostream>
#include <stdio.h>
using namespace std;
int f[50001],pr[5500];
int main() {
int i,j,n=0,cn;
for (i=2;i<50001;i++) if (f[i]==0) { f[i]=1; pr[n++]=i; for (j=i+i;j<50001;j+=i) f[j]=2;}
while(cin >> n) {
if (n==0) break;
cn=0;
for (i=0;n/2>=pr[i];i++) if (f[n-pr[i]]==1) cn++;
cout << cn << ... | 146 |
Project_CodeNet | 2,015 | #include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
////////////////*My library*////////////////////////
#define rep_to(a,i,n) for(i=a;i<n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define rep_r(i,n) for(i=n-1;i>=0;i--)
#define debug_i(x) printf("x:%d\n",x)
#define debug_f(x) pr... | 518 |
Project_CodeNet | 2,017 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long dou... | 301 |
Project_CodeNet | 2,015 | #include <iostream>
using namespace std;
bool so[50001]={};
int main(){
so[0] = 1;
so[1] = 1;
for(int i=2;i*i<=50000;i++)
if(so[i]==0)
for(int j=2;j*i<=50000;j++)
so[i*j] = 1;
int n;
while(cin>>n && n){
int co=0;
for(int i=2;i<=n/2;i++)
if(so[i]==0 && so[n-i]==0) co++;
cout <<co<... | 139 |
Project_CodeNet | 2,011 | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
bool isPrime[1000000];
int main(void){
vector<int> pvec;
//但多
fill(isPrime,isPrime+1000000,true);
for(int i=2;i<=50000;i++){
if(isPrime[i] == true){
pvec.push_back(i);
for(int j=2;i*j<1000000;j++){
isPrime[i*j] =... | 178 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.