Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,012 | import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args){
BufferedReader sc=new BufferedReader(new InputStreamReader(System.in));
try{
boolean[] prime = new boolean[50000];
Arrays.fill(prime, true);
prime[1]=prime[0]=false;
for(int i=2; i<Math.sqrt(50000); i++)... | 252 |
Project_CodeNet | 2,013 | import java.util.Scanner;
public class Main {
static final int MAX = 50000;
static boolean[] era = new boolean[MAX+1];
static{
era[0]=era[1]=true;
for (int i = 2; i*i <= MAX ; i++) {
if(!era[i]) for (int j = i*2; j <=MAX ; j+=i) {
era[j]=true;
}
}
}
public static void main(String[] args) {
S... | 194 |
Project_CodeNet | 2,013 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
static Main main = new Main();
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String ... | 373 |
Project_CodeNet | 2,012 |
import java.util.*;
public class Main {
public void doIt(){
Scanner sc = new Scanner(System.in);
//ツエツδ可トツスツテツネツスツづ個づ督づゥツつ「
final int MAX = 50000;
boolean [] prime = new boolean[MAX + 1];
for(int i=2; i < prime.length; i++){
prime[i] = true;
}
for(int i=2; i * i < MAX; i++){
if(prime[i]){
f... | 268 |
Project_CodeNet | 2,012 | import java.util.Scanner;
public class Main {
Scanner sc;
int[] table = new int[ 50001 ];
int[] prime = new int[ 50001 ];
int pCounter = 0;
private Main(){
sc = new Scanner( System.in );
table[ 1 ] = 1;
for( int i = 2; i < table.length; i++ ){
table[ i ] = 0;
}
for( int i = 2; i < table.length; i++... | 286 |
Project_CodeNet | 2,013 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int answer;
int[] table = new int[50001];
table[0] = 0;
table[1] = 0;
for (int i = 2; i <= 50000; i++) {
table[i] = 1;
}
for (int i = 2; i <= Math.sqrt(50000) + 1; i++)
if ... | 249 |
Project_CodeNet | 2,012 | import java.util.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
boolean [] prime = new boolean[50000];
for(int i=2;i<prime.length;i++)prime[i]=true;
for(int i=2;i<=Math.sqrt(prime.len... | 192 |
Project_CodeNet | 2,012 | import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0) {
break;
}
boolean[] isPrime = new boolean[n+1];
for (int i = 2; i <= n; i++) {
isPrime[i] = true;
... | 203 |
Project_CodeNet | 2,014 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main{
static boolean[] notPrime=new boolean[51000];
static int[] primes=new int[50000];
static int primeNum=0;
static void setP(){notPrime[0]=true;notPrime[1]=true;
int coun... | 294 |
Project_CodeNet | 2,012 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
boolean[] p = new boolean[50001];
Arrays.fill(p, true);
p[0] = p[1] = false;
for (int i = 2; i < 50001; i++) for (int j = i * 2; j < 50001; j += i)p[j] = false... | 182 |
Project_CodeNet | 2,015 | public class Main{
static int N = 50001;
public void run(java.io.InputStream in, java.io.PrintStream out){
java.util.Scanner sc = new java.util.Scanner(in);
int[] p;
int pn, i, j, n, count, l, m, r;
p = new int[N / 6];
pn = getprime(p);
for(;;){
n = sc.nextInt();
if(n == 0)brea... | 345 |
Project_CodeNet | 2,013 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
boolean prime[] = new boolean[50001];
for(int i=0;i<prime.length;i++)prime[i]=true;
prime[0]=false;prime[1]=false;
for(int s=0;s<prime.length;s++){
if(prime[s])
for(int i=s+s;i<prime.le... | 221 |
Project_CodeNet | 2,011 | import java.util.Arrays;
import java.util.Scanner;
//Goldbach's Conjecture
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
boolean[] p = new boolean[50001];
Arrays.fill(p, true);
p[0] = p[1] = false;
for(int i=2;i<50001;i++)if(p[i])for(int j=i*2;j<50001;j+=i... | 168 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
boolean[] p = new boolean[50001];
p[0] = false;
p[1] = false;
for(int i=2;i<=50000;i++) {
p[i] = true;
}
for(int i=2;i<=Math.sqrt(50000);i++) {
if(p[i] == true) {
for(in... | 227 |
Project_CodeNet | 2,015 | import java.util.Arrays;
import java.util.Scanner;
public class Main{
static boolean[] isPrime = calcPrimes(50100);
private static boolean[] calcPrimes(int n) {
boolean[] result = new boolean[n];
Arrays.fill(result, true);
result[0] = false;
for(int i = 0; i < result.length; i++) {
if(result[i]) {
... | 254 |
Project_CodeNet | 2,014 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = null;
// エラトステネスの篩
int MAX = 50000;
int... | 381 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] primeList = new int[5134];//5134
int limit = 50001;
primeList[0] = 2;
primeList[1] = 3;
int count = 2;
for (int i = 5; i < limit;... | 289 |
Project_CodeNet | 2,015 | import java.awt.geom.Line2D;
import java.awt.geom.Point2D;
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
new Main();
}
public Main() {
new aoj0056().doIt();
}
class aoj0056 {
ArrayList<Integer> array = new ArrayList<Integer>();
vo... | 409 |
Project_CodeNet | 2,011 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static boolean[] p=new boolean[50000];
public static int counter(int n){
int c=0,i,j;
for(i=2;i<=n/2;i++){
if(p[i]&&p[n-i]) c++;
// for(j=2;i+j<=n;j++){
// if(p[j]){
// if(i+j==n){
// c++;
//// System.out.println(... | 229 |
Project_CodeNet | 2,010 | import java.util.*;
import java.lang.*;
import java.math.*;
public class Main {
Scanner sc = new Scanner(System.in);
void run(){
boolean[] np=new boolean[50001];
np[0]=np[1]=true;
for(int i = 0; i < 50001;i++){
if(np[i]) continue;
for(int j=i*2;j<50001;j+=i){
np[j] = true;
}
}
i... | 216 |
Project_CodeNet | 2,011 | import java.util.*;
public class Main{
final int mx = 50001;
boolean[] prm;
void mkPrm(){
prm = new boolean[mx];
for(int i = 2; i < mx; i++)
prm[i] = true;
prm[0] = prm[1] = false;
for(int i = 2; i < mx; i++)
if(prm[i])
for(int j = i+i; j < mx; j += i)
prm[j] = false;
return ;
... | 212 |
Project_CodeNet | 2,013 | import java.util.Scanner;
import java.util.Vector;
public class Main {
public static void main(String[] args) {
int[] p = new int[50000+1];
p[0] = p[1] = 0;
for(int i = 2; i <= 50000; i++) {
p[i] = 1;
}
for(int i = 2; i <= Math.sqrt(50000)+1; i++) {
if(p[i] == 1) {
for(int j = i*2; j <= 50000; j+=... | 245 |
Project_CodeNet | 2,017 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Main {
private static final Integer[] primeNumberArray = getPrimeNumberArray(110000);
private static final int[] ansArray = getAnsArray(50000);
public static void main(String[] args... | 495 |
Project_CodeNet | 2,012 | import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int prime[] = new int[50000];
int n;
int count;
for (int i = 2; i < 50000; i++) {
for (int j = i; j < 50000; j++) {
if (0 <= i * j && i * j < 50000) {
prime[i * j] = 1;
... | 214 |
Project_CodeNet | 2,019 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main{
static int max = 50001;
static boolean[] isPrime = new boolean[max];
public static void main(String[] args) {
aryPrime();
List<Integer> list = new ArrayList<Integer>();
Scanner sc = new Sca... | 323 |
Project_CodeNet | 2,014 | /**
*
*/
import java.util.*;
/**
* @author akira
*
*/
class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
final int MAX_N = 50000;
Scanner scan = new Scanner(System.in);
int n;
boolean[] prime = new boolean[MAX_N + 1];
for(int i = 0;i < prime.lengt... | 342 |
Project_CodeNet | 2,013 | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int[] v = new int[25000];
for(int i = 0;i < 25000;i++){
v[i] = 1;
}
int p = 3;
while(true){
if(p*p > 50000){
break;
... | 322 |
Project_CodeNet | 2,013 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
public class Main {
private static BufferedReader br = null;
private static ArrayList<Integer> borders = null;
static {
br = new BufferedReader(new InputSt... | 719 |
Project_CodeNet | 2,013 | import java.util.*;
public class Main{
static Scanner kbd = new Scanner(System.in);
public static void main(String[] args){
boolean[] p = new boolean[50000];
setp(p);
while(kbd.hasNext()){
int n= kbd.nextInt();
if(n!=0) solve(p, n);
}
}
static void solve(boolean[] p, int n){
int ans=0, i... | 240 |
Project_CodeNet | 2,018 | import java.util.Scanner;
class Main{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
boolean[] prime=new boolean[50001];
for(int i=0; i<=50000; i++) {
prime[i]=false;
}
prime[2]=true;
prime[3]=true;
for(int i=5; i<=50000; i++) {
for(int j=2; j*j<=i; j++) {
if(i%j... | 462 |
Project_CodeNet | 2,015 | import java.util.*;
import java.io.*;
import java.awt.geom.*;
import java.math.*;
public class Main {
static final Scanner in = new Scanner(System.in);
static final PrintWriter out = new PrintWriter(System.out,false);
static ArrayList<Integer> ps;
static int[] cnt = new int[50001];
static boolean solve() {
i... | 400 |
Project_CodeNet | 2,013 | import java.util.Scanner;
public class Main {
public static void main(String[] arg) {
boolean[] notPrime = new boolean[50001];
notPrime[0] = true;
notPrime[1] = true;
final int limit = (int) Math.sqrt(50000);
for (int i = 2; i <= limit; i++) {
if (!notPrime[i]) {
for (int j = i + i; j <= 50000; j = j... | 375 |
Project_CodeNet | 2,012 | import java.util.*;
public class Main {
static Scanner sc = new Scanner(System.in);
static boolean[] prime = new boolean[50001];
static int n;
public static void main(String[] args) {
make_prime();
while(read()){
solve();
}
}
static boolean read(){
n = sc.nextInt();
if(n == 0)return false;
return... | 233 |
Project_CodeNet | 2,015 | import java.io.*;
class Main{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String line="";
int count;
boolean[] p=new boolean[50001];
for(int i=0;i<=50000;i++){
p[i]=true;
}
p[0]=false;
p[1]=false;
for(int i=2;i<=Math.sqrt(50000)+1;i... | 167 |
Project_CodeNet | 2,017 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
BufferedReader br = new Buff... | 553 |
Project_CodeNet | 2,012 | import java.util.*;
class Main {
Scanner sc = new Scanner(System.in);
public void run() {
LinkedList<Integer> primes=new LinkedList<Integer>();
for(int i=2;i<=50000;i++){
boolean isprime=true;
for(int prime:primes){
if(i%prime==0){
isprime=false;
break;
}
if( prime*prime>i){
bre... | 272 |
Project_CodeNet | 2,012 | import java.util.Arrays;
import java.util.Scanner;
public class Main
{
public static void main(String arg[])
{
Scanner sc = new Scanner(System.in);
boolean a[] = new boolean [50001];
Arrays.fill(a, true);
a[0]=a[1]=false;
for(int i=0; i*i<=50000;i++)
{
if(!a[i])
continue;
for(int j=i*2; j<=500... | 214 |
Project_CodeNet | 2,010 | import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class Main{
Scanner sc;
static final int INF=1<<28;
static final double EPS=1e-9;
void run(){
sc=new Scanner(System.in);
boolean[] isPrimes=new boolean[500... | 290 |
Project_CodeNet | 2,014 | import java.util.Scanner;
public class Main {
public static void main(String[] args){
int[] prime=new int[50001];
boolean[] primeflag=new boolean[50001];
Scanner sc=new Scanner(System.in);
prime[0]=2;
primeflag[2]=true;
prime[1]=3;
primeflag[3]=true;
int ptr=2;
for(int i=5;i<=50000;i++){
boolean f... | 240 |
Project_CodeNet | 2,015 | import java.io.*;
import java.util.Arrays;
class Main {
private static final int M = 50000;
public static void main (String args[]) {
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
String buf;
int list[] = new int[M+1];
for (int i=2;i<=M;i++) list[i... | 264 |
Project_CodeNet | 2,012 | import java.util.*;
class Main {
static boolean [] primes;
static void makePrimeList() {
for(int i = 0; i < 50001; i++) {
primes[i] = true;
}
primes[0] = false;
primes[1] = false;
for(int n = 2; n < 50001; n++) {
if (primes[n]) {
... | 252 |
Project_CodeNet | 2,012 | import java.util.*;
import java.io.*;
public class Main{
public static void main(String[] args){
Scanner stdIn = new Scanner(System.in);
List<Integer> prime = new ArrayList<Integer>();
prime.add(2); prime.add(3);
int[] check = new int[50001];
check[2] = 1; check[3] = 1;
outer: for(int i = 5; i < 50000; ... | 326 |
Project_CodeNet | 2,016 | import java.util.ArrayList;
import java.util.Scanner;
public class Main
{
static ArrayList<Integer> prime = new ArrayList<>();
public static void main(String[] args)
{
Scanner scanner = new Scanner(System.in);
create();
for(; ;)
{
int count = 0;
int n = scanner.nextInt();
if(n == 0)
{
... | 331 |
Project_CodeNet | 2,013 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Main {
private static final int MAX = 50000;
private static final Integer[] PRIMES = getPrimeNumbers(MAX);
public static void main(String[] args) throws IOException{
BufferedRead... | 414 |
Project_CodeNet | 2,015 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws NumberFormatException,
IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(
System.in));
StringBuilder builder = new St... | 366 |
Project_CodeNet | 2,011 | import java.util.Scanner;
class Main {
private static boolean[] calcPrimeTable(int n) {
boolean[] table = new boolean[n + 1];
for (int i = 2; i <= Math.sqrt(n); i++) {
if (!table[i]) {
for (int j = i + i; j <= n; j += i) {
table[j] = true;
... | 223 |
Project_CodeNet | 2,015 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main{
public static void main(String[] args)throws IOException{
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader reader = new BufferedReader(isr);
String string;
int n, count;
bo... | 246 |
Project_CodeNet | 2,013 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] pri = new int[50002];
for(int i=2;i<=50000;i++){
pri[i] = i;
}
for(int i=2;i<=100000;i++){
for(int j=i+i;j<=50000;j+=i){
pri[j]=0;
}
}
while(true){
int n =... | 176 |
Project_CodeNet | 2,016 | #include <iostream>
using namespace std;
int main()
{
int n;
bool p[50001] = {false, false};
for (int i = 2; i * i < 50001; i++){
for (int j = i * i; j < 50001; j += i){
p[j] = true;
}
}
while (cin >> n, n){
int c = 0;
for (int i = 2; i <= n / 2; i++){
if (!p[i] && !p[n - i]){
c++;
}
}
... | 147 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
bool is_prime[200000];
int cnt[50001];
vector<int> primes;
void calc_prime(int n){
for(int i = 0; i <= n; ++i)
is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
for(int i = 2; i <= n; ++i){
if(is_prime[i]){
primes.push_back(i);
for(int j = i * 2; j <= n;... | 232 |
Project_CodeNet | 2,016 | #include <iostream>
using namespace std;
const int MAX = 50000;
void eratosthenes(bool* p)
{
for (int i=0; i<=MAX; i++) p[i] = true;
p[1] = false;
for (int i=2; i<=MAX; i++) {
if (!p[i]) continue;
for (int d=2; i*d<=MAX; d++) p[i*d] = false;
}
}
int main()
{
int n;
bool *is_prime = new bool[MAX+1];
if ... | 224 |
Project_CodeNet | 2,011 | #include <iostream>
const int MAX = 50001;
using namespace std;
bool p[MAX];
void f(){
for(int i=0 ; i<MAX ; i++){
p[i] = (i<=1)? false : true ;
}
for(int i=2 ; i<=MAX ; i++){
if( p[i] ){
for(int j=i*2 ; j<MAX ; j+=i){
p[j] = false;
}
}
}... | 224 |
Project_CodeNet | 2,015 | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
using namespace std;
const double eps=1e-10;
const int dy[]={-1,-1,0,1,1, 1, ... | 289 |
Project_CodeNet | 2,011 | #include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX_N = 100000;
bool sieve[MAX_N];
int n;
void solve() {
int res = 0;
for (int i = 2; i < n/2 + 1; i++) {
if (sieve[i] && sieve[n-i]) {
res++;
}
}
cout<<res<<endl;
}
int main(int argc, const char *argv[]) {
// mak... | 215 |
Project_CodeNet | 2,014 | #include<iostream>
using namespace std;
int main(){
bool num[1000000]={true,true};
for(int i=2; i<1000; i++)
if(!num[i])
for(int j=i*i; j<1000000; j+=i)
num[j] = true;
int n;
while(cin >>n,n){
int ans = 0;
for(int i=2; i<=n/2; i++) if(!num[i] && !num[n-i]) ans++;
cout <<ans<<endl;
}
r... | 125 |
Project_CodeNet | 2,015 | #define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <set>
using namespace std;
int main(){
bool p[... | 219 |
Project_CodeNet | 2,014 | //include
//------------------------------------------
#include <bits/stdc++.h> // only for GCC
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef pair<int, int>... | 521 |
Project_CodeNet | 2,013 | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
bool us[1000010]={false};
bool p[1000010] = {0};
int main(){
/*Eratosthenes*/
p[2] = true;
for(int i = 0; i <= 50010; i+=2){
us[i] = true;
}
int cnt = 1;
for(int i = 3; i <= 50010; i+=2){
int q = 0;... | 256 |
Project_CodeNet | 2,015 | #include <iostream>
#include <string>
using namespace std;
const int MAX = 1000100;
bool prime[MAX];
void sieve(){
fill(prime, prime+MAX, true);
prime[0] = prime[1] = false;
for(int i=2; i*i < MAX; i++){
if(!prime[i]) continue;
for(int j=i*i; j < MAX; j += i) prime[j] = false;
}
}
int main(){
sieve();
i... | 157 |
Project_CodeNet | 2,010 | #include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
const int upto=50000;
int main(){
vector<bool> prs(upto+1,true);
prs[0]=prs[1]=false;
for(int i=2;i<=sqrt(upto);i++){
if(prs[i]){
for(int j=i*i;j<=upto;j+=i)prs[j]=false;
}
}
for(;;){
int n;
... | 163 |
Project_CodeNet | 2,010 | #include <iostream>
using namespace std;
int search(const int array[], int high, int key)
{
int low = 0;
int mid;
int n=-1;
while(low<=high){
mid = (low + high)/2;
if( array[mid] == key ){
n = mid;
break;
}else if ( array[mid] < key){
low = mid + 1;
}else{
high = mid -1;
}
}
return(n);
}
i... | 350 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> prime;
bool a[50001]; for(int i=0;i<50001;i++) a[i]=true;
a[0]=a[1]=false;
for(int i=0;i<50000;i++)
{
if(!a[i]) continue;
prime.push_back(i);
for(int j=i*2;j<50000;j+=i) a[j]=false;
}
while(1)
{
int n ; cin >> n ;
if(!... | 225 |
Project_CodeNet | 2,012 | #include <stdio.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define NUM (60000)
int pt[NUM];
int cnt[NUM];
int main() {
vector<int> ps;
for (int i = 2; i < NUM; i++) if (pt[i] == 0) {
ps.push_back(i);
for (int j = i+i; j < NUM; j+=i) pt[j] = i... | 200 |
Project_CodeNet | 2,016 | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sst... | 515 |
Project_CodeNet | 2,011 | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define DEB 0
bool primes[50000];
void make_prime(){
primes[0]=primes[1]=true;
for(int i=2; i*i<=50000; i++)if( !primes[i] ){
for(... | 226 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x... | 406 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int x = 50000;
int pn[50001];
for( int i = 0; i < 50001; i++ )
pn[i] = 0;
//50000以下の素数を配列に格納
for( int i = 2; i <= x; i++ )
{
bool judge = true;
for( int j = 2; j <= sqrt(i); j++ )
{
... | 250 |
Project_CodeNet | 2,012 | //============================================================================
// Name : TopCoderCompetition.cpp
// Author : taguchi
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//=====================================================================... | 667 |
Project_CodeNet | 2,012 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <cstring>
#include <functional>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(int)(n);... | 300 |
Project_CodeNet | 2,017 | #include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>... | 497 |
Project_CodeNet | 2,010 | #include <iostream>
#include <cstdio>
#include <bitset>
#include <vector>
using namespace std;
int main()
{
bitset<60001> is_prime;
is_prime.set();
is_prime[0] = false, is_prime[1] = false;
for (int i = 2; i * i <= 60000; i++) {
for (int j = i + i; j <= 60000; j += i) {
is_prime[j] = false;
}
... | 249 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cmath>
#include<vector>
int main()
{
std::vector<bool>is_prime(50020, true);
const int root = static_cast<int>(floor(sqrt(50021)));
for (int i = 0; i <= root - 2; i++)
{
if (is_prime[i])
{
for (int j = i + 2; (i + 2) * j < 50021; j++)
{
is_prime[(i + 2) * j - 2] = false;
... | 239 |
Project_CodeNet | 2,016 | #include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
bool a[60000]{};
int main() {
for (int b = 2; b <60000; b++) {
if (!(a[b])) {
for (int c = b * 2; c <60000; c += b)a[c] = true;
}
}
int e;
while (cin >> e, e) {
int s = 0;
for (int f = 2; f ... | 151 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
int main() {
bool search[50001];
fill(search, search + 50001, true);
for(int i = 2; i <= sqrt(50000); ++i) {
if(search[i]) {
for(int j = i * 2; j <= 50000; j += i) {
search[j] = false;
}
}
}
ve... | 223 |
Project_CodeNet | 2,014 | #include<cstdio>
#include<cstring>
using namespace std;
#define N 50002
bool is_prime[N];
void sieve(){
memset(is_prime,1,sizeof(is_prime));
is_prime[0] = is_prime[1] = false;
for(int x=2;x<N;++x){
if(is_prime[x]){
for(int i=x+x;i<N;i+=x){
is_prime[i] = false;
}
}
}
}
int main(){
sieve();
int j;
... | 207 |
Project_CodeNet | 2,016 | #include <iostream>
using namespace std;
int main()
{
const int Max = 50010;
bool prime[Max] = {false};
for (int i = 2; i * i < Max; i++){
for (int j = i * i; j < Max; j += i){
prime[j] = true;
}
}
int n;
while (cin >> n, n){
int count = 0;
for (int i = 2; i <= n / 2; i++){
if (!prime[i] && !p... | 146 |
Project_CodeNet | 2,013 | #include<stdio.h>
#include<string>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<string.h>
#include<map>
#include<queue>
using namespace std;
typedef pair<int,int> pii;
#define rep(i,j) for(int i=0;i<(j);i++)
#define reps(i,j,k) for(int i=j;i<=... | 228 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 50001;
bool prime[MAXN] = {true, true};
int main()
{
for (int i = 2; i * i < MAXN; i++){
for (int j = i * i; j < MAXN; j += i){
prime[j] = true;
}
}
int n;
while (scanf("%d", &n), n){
int cnt = 0;
for (int i = 2; i <= n /... | 171 |
Project_CodeNet | 2,015 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999
#define rep(i, n... | 313 |
Project_CodeNet | 2,011 | #include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int prime[50000];
char flag[50001];
int getPrime()
{
flag[0] = flag[1] = 0;
memset(flag, 1, sizeof(flag));
for (int i = 2; i < 50001; i++){
if (flag[i] == 1){
for (int j = 2; i * j < 50001; j++){
flag[i * j] = 0;
}
... | 303 |
Project_CodeNet | 2,013 | #include<stdio.h>
int isPrime[50000];
int a[100000];
void func(){
for(int i = 0; i < 50000; i++)isPrime[i] = 1;
isPrime[0] = 0;
isPrime[1] = 0;
for(int i = 4; i < 50000; i++){
for(int j = 2; j*j <= i; j++){
if(i % j == 0){
isPrime[i] = 0;
break;
}
}
}
for(int i = 0; i < 50000; i++){
for(i... | 209 |
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;
}
... | 215 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
#include<map>
#include<cmath>
#include<complex>
using namespace std;
typedef complex<double> P;
#define X real()
#define Y imag()
typedef int kz;
kz gcd(kz a,kz b) { if(b==0) return a; else gcd(b,a%b); }
bool... | 264 |
Project_CodeNet | 2,010 | #include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
vector<int> prime;
int i,j;
for(i=0;i<1000000;i++)
{
prime.push_back(1);
}
prime[0]=prime[1]=0;
for(i=0;i<1000000;i++)
{
if(prime[i]==1)
{
for(j=2;j*i<1000000;j++)
{
prime[i*j]=0;
}
}
}
for(;;)
{
cin ... | 247 |
Project_CodeNet | 2,013 | #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;
}
}
}
vector<int> primes;
for... | 228 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define MAX 50100
int prime[MAX];
void make()
{
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]... | 230 |
Project_CodeNet | 2,015 | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
int n;
bool f[50010];
memset(f,true,sizeof(f));
f[1]=false;f[0]=false;
for(int i=2;i<300;i++){
if(f[i]){
for(int j=i*i;j<50001;j+=i)f[j]=false;
}
}
while(cin>>n,n){
int ans=0;
for(int i=2;i<=n/2;i++){
if(f[i]&... | 134 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
int cnt;
vector<int> v;
int c[50001];
int ans[50001];
int judge(int n){
int c = 0;
for(int i = 1; i <= sqrt(n); i++){
if(n%i == 0) c++;
}
if(c == 1) return 0;
return 1;
}
void solve(){
int c = 0;
for(int i = 2; i <= 50000; i++){
if(judge(i) == 0){
... | 311 |
Project_CodeNet | 2,012 | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
bool p[50001];
memset(p, 1, sizeof(p));
p[0] = p[1] = 0;
for(int i = 0 ; i < 50001 ; i++){
if(p[i]){
for(int j = 2 * i ; j < 50001 ; j += i){
p[j] = 0;
}
}
}
int n, sum;
while(cin >> n, n){
... | 179 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 50000;
vector<int> primes;
vector<bool> is_prime(N,true);
for (int j=2; j<=N; j++) {
if(is_prime[j]){
for (int k=2; k<=N/j;k++){
is_prime[j*k] = false;
}
}
}
while(1){
... | 169 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAX = 50001;
int main (int argc, char *argv[]) {
vector<bool> v(MAX, true);
vector<int> num(MAX, 0);
for (int i =... | 243 |
Project_CodeNet | 2,011 | #include <cstdio>
#include <algorithm>
#define N 50000
#define PN 5133
using namespace std;
static
int p[ PN ];
static
int furui[ N + 1 ] = { 0 };
/** Application main entry point. */
int main (
int argc,
char * argv[ ]
)
{
int i, j;
int pn;
pn = 0;
for ( i = 2; i <= N; ++i )
{
if ( fur... | 259 |
Project_CodeNet | 2,014 | #include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>
using namespace std;
#... | 559 |
Project_CodeNet | 2,013 | #include<iostream>
#include<algorithm>
using namespace std;
int p[105000];
int main(){
int n;
p[0] = p[1] = 1;
for(int i = 2;i * i <= 105000;i++){
if(p[i])continue;
for(int j = i * i;j <= 105000;j += i){
p[j] = 1;
}
}
while(cin >> n, n){
int res = 0;
for(int i = 0;i <= n / 2;i++){
i... | 152 |
Project_CodeNet | 2,016 | #include <stdio.h>
#include <cmath>
#include <algorithm>
#define NUM 51000
int main(){
int table[NUM],limit;
for(int i=0; i < NUM;i++)table[i] = 1;
table[0] = 0;
table[1] = 0;
limit = sqrt(NUM);
for(int i=2;i<=limit;i++){
if(table[i] == 1){
for(int k=2*i;k < NUM; k += i){
table[k] = 0;
}
}
}
... | 208 |
Project_CodeNet | 2,014 | #include<iostream>
#define N 50000
using namespace std;
bool isP[N+1];
void make_isP(){
isP[0]=isP[1]=false;
for(int i=2;i<=N;i++)isP[i]=true;
for(int i=2;i*i<=N;i++){
if(!isP[i])continue;
for(int j=i*i;j<=N;j+=i)isP[j]=false;
}
}
int main(){
make_isP();
//for(int i=0;i<=20;i++)cout<<i<<" "<<isP[... | 195 |
Project_CodeNet | 2,015 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
#define loop(i,b,a) for(int i = b ; i < a; i ++)
#define rep(i,a) for(int i = 0 ; i < a; i ++)
int main(void){
const int MAX = 600000;
bool prime[MAX];
rep(i,MAX) prime[i] = true;
prime[0] = prime[1] = false;
vect... | 215 |
Project_CodeNet | 2,012 | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
int main(){
int*... | 247 |
Project_CodeNet | 2,012 | #include <stdio.h>
#include <math.h>
#define N 50001
void Eratos(void);
int prime[N];
int main(void){
int n;
int p[N];
int num = 0;
int ans;
Eratos();
for(int i=0; i<N; i++){
if(prime[i] == 1){
p[num] = i;
num++;
}
}
while(1){
ans = 0;
scanf("%d", &n);
if(n == 0) break;
for(int i=0; i<num... | 252 |
Project_CodeNet | 2,014 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
#define sz(c) int((c).size())
vector<bool> primes(50100, true);
void build () {
primes[0] = false;
primes[1] = false;
for (int i = 2; 2*i < sz(primes); i++) {
primes[2*i] = false;
}
f... | 277 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.