Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,012 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stdexcept>
#include<cmath>
#include<memory>
#include<algorithm>
#include<cstring>
#include<ctime>
#include<deque>
#include<sstream>
#include<iomanip>
#include<sstream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<climits>
#incl... | 555 |
Project_CodeNet | 2,010 | #include <iostream>
#include <vector>
using namespace std;
int main( void )
{
register int i, j;
register bool isPrime[50001 + 1];
isPrime[2] = true;
for ( i = 3; i < 50001; i += 2 )
{
isPrime[i] = true;
}
for ( i = 3; i < 50001; i += 2 )
{
for ( j = i + i; j < 50001; j += i )
{
isPrime[j] = false;
... | 291 |
Project_CodeNet | 2,013 | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cst... | 367 |
Project_CodeNet | 2,012 | #include <iostream>
#include <cstring> // require memset
using namespace std;
const int N = 50000;
bool prime[N+1];
void make_prime (void)
{
memset (prime, true , sizeof(prime ) );
prime[0] = false;
prime[1] = false;
for (int i = 2; i*i <= N; ++i ) {
if (prime[i] ) {
for (int j = i*i; j <= N; j += i ) {
... | 231 |
Project_CodeNet | 2,013 | #include <iostream>
using namespace std;
int main(){
int isPrime[50001];
fill(isPrime,isPrime+50001,1);
isPrime[0] = isPrime[1] = 0;
for(int i = 2 ; i*i < 50001 ; i++ ){
if(isPrime[i])for(int j = i*2 ; j < 50001 ; j+=i )isPrime[j] = 0;
}
int n;
while(cin >> n,n){
int cnt = 0;
for(int i = 0 ; ... | 173 |
Project_CodeNet | 2,012 | #include <iostream>
#include <cstring>
using namespace std;
bool primeFlg[1000000];
void makePrime(){
memset(primeFlg, true, sizeof(primeFlg));
primeFlg[0] = primeFlg[1] = false;
for(int i = 2; i * i <= 1000000; i++){
if(primeFlg[i]){
for(int j = i + i; j < 1000000; j += i){
primeFlg[j] = fa... | 203 |
Project_CodeNet | 2,014 | #include <iostream>
#include <cmath>
using namespace std;
int prime(int n);
int main(){
int a[50000];
for (int j=0;j<50000;j++)
a[j]=prime(j);
int b;
Loop:
while(true){
int count =0;
cin >> b;
if (b==0)
break;
for(int x=2;x<b/2+1;x++){
if(a[x]!=0){
... | 217 |
Project_CodeNet | 2,015 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); ... | 603 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define REP(i,n) for(int i=0;i<n;i++)
#define PP(m) REP(i, m.size()) cout << m[i] << endl;
vector<bool> isPrime;
ll primed = 0;
void eratosu(ll max){
if (max < primed) return;
else primed = max;
if (max+1 > isP... | 268 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) noexcept {
return std::vector<T>(n, std::forward<T>(val));
}
template<class... Tail>
sta... | 413 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<bool> prime(50001, true);
prime[0] = prime[1] = false;
for (int i = 2; i <= 223; i++) {
if (prime[i]) {
for (int j = i * 2; j <= 50000; j += i) {
prime[j] = false;
}
}
}
int n, res;
while (cin >> n, n) {
res = 0;
if (n % 2) {
... | 244 |
Project_CodeNet | 2,016 | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <string>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,P> pip;
typedef long lo... | 272 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
bool p[100000];
p[0]=p[1]=false;
for(int i=2;i<100000;i++){
p[i]=true;
}
for(int i=2;i*i<100000;i++){
if(p[i])
for(int j=i*i;j<100000;j+=i){
p[j]=false;
}
}
while(1){
int count=0;
int N;
cin>>N;
if(N==0)
break;
for(int i=2;i<(N/2)+... | 161 |
Project_CodeNet | 2,016 | #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <numeric>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n);... | 370 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
using namespace std;
vector<int> sieve(int n) {
vector<int> prime(n);
for(int i=2; i<n; i++) prime[i]=i;
for(int i=2; i*i<n; i++) {
if(prime[i]) {
for(int j=i*i; j<n; j+=i) prime[j]=0;
}
}
return prime;
}
int main() {
vector<int> prime=sieve(50001);
in... | 175 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int data[50000] = {};
int size = sizeof(data) / sizeof(int);
for (int i = 2; i < size; ++i)
for (int j = i*2; j < size; j+=i)
data[j] = 1;
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int cnt = 0;
for (int i = 2... | 170 |
Project_CodeNet | 2,015 | #include<iostream>
#include <algorithm>
#include<functional>//greater???g—p
using namespace std;
#define MAX_LIST 60000
bool find_list(int *list,int a,int b,int x){
//cout<<list[a]<<" "<<list[b]<<" "<<list[(b+a)/2]<<" "<<x<<endl;
if(b-a<2){
if(list[b]==x){
//cout<<"find"<<endl;
return true;
}
if(find(list+a,list+b,x)!=... | 399 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int prime[50001];
for(int i=2;i<50001;i++)prime[i]=0;
for(int i=2;i<=sqrt(50001);i++){
if(prime[i]==0){
for(int j=i+i;j<50001;j+=i)prime[j]=1;
}
}
int n,cou=0;
while(cin>>n&&n!=0){
for(int i=2;i<=n/2;i... | 146 |
Project_CodeNet | 2,014 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typed... | 543 |
Project_CodeNet | 2,016 | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class t>
using table = vector<vector<t>>;
const ld eps=1e-9;
//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_downloa... | 311 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
bool is_prime[50001];
is_prime[0]=is_prime[1]=false;
for(int i=2; i<50001; i++){
is_prime[i]=true;
}
for(int i=2; i*i<50001; i++){
if(is_prime[i]){
for(int j=i*i; j<50001; j+=i){
is_prime[j]=false;
}
}
}
while(true){
int n;
cin>... | 184 |
Project_CodeNet | 2,011 | #include <iostream>
using namespace std;
const int Max = 1000000;
bool P[Max];
void eratos()
{
for( int i = 0;i < Max;i++ ) P[i] = true;
P[0] = P[1] = false;
for( int i = 2;i * i < Max;i++ ) if( P[i] ) for( int j = 2;i * j < Max;j++) P[i * j] = false;
}
int main(int argc, char const* argv[])
{
int n;
eratos();
... | 191 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(){
short ans[50001]={};
vector<int>pri;
pri.push_back(2);
for(int i=3;i<=50000;i+=2){
int flag=1;
for(int j=2;j<=sqrt(i);j++){
if(i%j==0){
flag=0;
break;
}
}
if(flag)
pri.push_back(i);
}
for... | 179 |
Project_CodeNet | 2,016 | #include <iostream>
using namespace std;
bool flag[50001];
int prime[50001];
int main()
{
int n = 0;
int i, j;
flag[0] = flag[1] = true;
for (i = 2; i * i <= 50000; i++){
if(flag[i] != true){
for(j = i * i; j <= 50000; j += i){
flag[j] = true;
}
}
}
j = 0;
for (i = 0; i... | 215 |
Project_CodeNet | 2,015 | #include <iostream>
using namespace std;
int main()
{
int Pnum[50001] = {1,1,0}, n, ans;
for (int i = 2; i < 50001; i++) {
if (!(Pnum[i])) {
for (int j = i+i; j < 50001; j+=i) {
Pnum[j] = 1;
}
}
}
while (1) {
cin >> n;
if (n == 0) break;
ans = 0;
for (int i = 2; i < n; i++) {
if (!(Pnu... | 191 |
Project_CodeNet | 2,011 | #include<iostream>
#include<string.h>
using namespace std;
bool p[50001];
int cnt;
int n;
void prime()
{
for(int i = 2; i*i <= 50000; i++){
if(!p[i]){
for(int j = i*i; j <= 50000; j+=i){
p[j] = true;
}
}
}
p[0] = p[1] = true;
}
int main(void)
{
prime();
while(cin >>... | 177 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
#define SIZE 50000
int main(void) {
int prime[SIZE + 1] = {};
int p[SIZE] = {};
int len = 0;
int n;
for(int i = 2; i <= SIZE; ++i) {
if(prime[i] != 0) continue;
int j = i * 2;
while(j <= SIZE) {
++prime[j]... | 210 |
Project_CodeNet | 2,013 | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
bool prime[50001];
void eratos(void)
{
memset(prime,true,sizeof(prime));
prime[0]=false;
prime[1]=false;
for(int i=2;i*i<50001;i++)
{
if(!prime[i])continue;
for(int j=i*2;j<50001;j+=i)
{
prime[j]=false;
}
}
return;
}
int mai... | 189 |
Project_CodeNet | 2,012 | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
bool s[55555];
void sosuu(int n){
memset(s,true,sizeof(s));
s[0] = s[1] = false;
for(int i = 2; i*i <= n; i++){
if(!s[i]) continue;
for(int j = i*2; j <= n; j += i){
s[j] = false;
}
}
}
int mai... | 185 |
Project_CodeNet | 2,017 | #include<iostream>
#define m 52000
using namespace std;
bool ba[m+1] = { true };
void cp() {
int co = 0;
for (int i = 0; i < m+1; i++) {
ba[i] = { true };
}
for (int i = 2; i*i <= 52000; i++) {
if (ba[i]) {
for (int j = i*i; j <= 52000; j += i) {
ba[j] = { false };
}
}
}
return ;
}
int main() ... | 207 |
Project_CodeNet | 2,015 | #include <iostream>
using namespace std;
bool isprime(int n) {
for (int i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return n != 1;
}
int main() {
int n;
bool prime[50000];
for (int i = 2; i < 50000; i++)
if (isprime(i))
prime[i] = true;
else
prime[i] = false;
while (cin >> n && n) {
... | 169 |
Project_CodeNet | 2,011 | #include<iostream>
using namespace std;
int prime[50001];
void make(){
for(int i = 0; i < 50001; i++) prime[i] = 1;
prime[0] = 0;
prime[1] = 0;
for(int i = 2; i*i < 50001; i++){
if(prime[i] == 1){
for(int j = i*2; j < 50001; j+=i) prime[j] = 0;
}
}
}
int main(){
make();
int n;
w... | 202 |
Project_CodeNet | 2,009 | #include<iostream>
using namespace std;
int main() {
int list[50000];
int i,j,c;
for(i=2;i<50002;i++)list[i-2]=i;
for(j=2;j*j<50003;j++)
if(list[j-2]!=0)
for(i=1;j-2+list[j-2]*i<50001;i++)
list[j-2+list[j-2]*i]=0;
while(1){
cin>>i,c=0;
if(i==0)break;
for(j=2;j<=(i/2);j++)
if((lis... | 161 |
Project_CodeNet | 2,011 | #include<stdio.h>
#include<bitset>
int main()
{
const int N=50001;
int i,j,n,c;
std::bitset<N>p(3);
p.flip();
for(i=2;i*i<N;++i)if(p[i])for(j=i*2;j<N;j+=i)p[j]=0;
while(scanf("%d",&n),n)
{
for(c=i=0,j=n;i<=j;++i,--j)if(p[i]&&p[j])++c;
printf("%d\n",c);
}
return 0;
} | 120 |
Project_CodeNet | 2,011 | #include <cstdio>
int main()
{
int n;
char prime[50001];
for(int i = 0; i <= 50000; i++)
prime[i] = 1;
prime[0] = 0; prime[1] = 0;
for(int i = 2; i <= 50000; i++){
if(!prime[i]) continue;
for(int j = i + i; j <= 50000; j += i)
prime[j] = 0;
}
while(scanf("%d\n", &n), n){
int cnt = 0;
for(int i = 2; ... | 177 |
Project_CodeNet | 2,014 | #include<iostream>
#include<algorithm>
#include<cmath>
#define N 50000
using namespace std;
int main(){
int prime[N+1], n;
fill(prime, prime+N+1, 1);
prime[0] = 0;
prime[1] = 0;
for(int i=2; i<=N; i++){
if(prime[i] == 1){
for(int j=2; i*j<=N; j++){
prime[i*j] = 0;
}
}
}
in... | 205 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
#include <cstring>
//isprimeðìÁÄêéÖ
int* prime(int num){
std::vector<int> v;
int* res = new int[num+1];
memset(res, 0, sizeof(res));
res[2] = 1;
v.push_back(2);
bool f;
for(int i=3;i<=num;i+=2){
f = true;
for(int j=0;v[j]*v[j]<=i;j++){
if(i % v[j] == 0){f... | 256 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int... | 340 |
Project_CodeNet | 2,020 | // 2020/05/18 Tazoe
#include <iostream>
using namespace std;
int main()
{
bool is_prime[50001];
is_prime[0] = is_prime[1] = false;
for(int i=2; i<50001; i++){
is_prime[i] = true;
}
for(int i=2; i*i<50001; i++){
if(is_prime[i]){
for(int j=i*i; j<50001; j+=i){
is_prime[j] = false;
}
}
}
while(... | 197 |
Project_CodeNet | 2,012 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
bool table[50001];
set<int> primes;
int main() {
table[2] = true;
for (int i = 3; i <= 50000; i += 2)
table[i] = true;
for (int i = 3; i <= 223; i += 2)
if (table[i])
for (int j = 3 * i; j <= 50000; j += 2 * i)
t... | 250 |
Project_CodeNet | 2,013 | #include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
vector<int> sieve(int n) {
vector<int> res(1, 2);
vector<bool> prime(n, true);
for(int i = 3; i < n; i += 2) {
if(prime[i]) {
res.push_back(i);
for(int j = i * 3; j < n; j += i * 2)
prime[j] = false;
}
}
return res;
}
int ... | 230 |
Project_CodeNet | 2,013 | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#i... | 463 |
Project_CodeNet | 2,016 | #include <iostream>
using namespace std;
bool isp(int n){
if(n<2)return 0;
if(n==2)return 1;
if(n%2==0)return 0;
for(int i=3;i*i<=n;i+=2){
if(n%i==0)return 0;
}
return 1;
}
int main(){
int n[50001]={0},sum,a;
for(int i=1;i<=50000;i++){
if(isp(i)){
n[i]=1;
}
}
while(1){
cin>>a... | 185 |
Project_CodeNet | 2,016 | #include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef long double lb;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef pair<int... | 452 |
Project_CodeNet | 2,014 | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <sstream>
#include <vector>
#include <string>
#include <iomanip>
#include <bitset>
#define INF 100000000
#define pb push_back
#define... | 327 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
bool a[100000];
a[0]=a[1]=false;
for(int i=2;i<100000;i++){
a[i]=true;
}
for(int i=2;i*i<100000;i++){
if(a[i]){
for(int j=i*i;j<100000;j+=i){
a[j]=false;
}
}
}
while(true){
int m;
cin>>m;
int count=0;
... | 171 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cmath>
using namespace std;
bool pr[50001];
int prime[114514];
int length = 0;
void insert(int p) { prime[length] = p; pr[p] = true; length++; return; }
int main() {
insert(2);
for (int i = 3; i <= 50000; i += 2) {
for (int j = 0; j < length; j++)
if (i%prime[j] == 0)goto cont;
el... | 200 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
#define MAX 50004
#define MAXL 3000
int dp[MAX], d[MAX];
int main(){
int n, m = 0;
static bool c[MAX]={true, true};
for(int i = 2;i < MAX;i++){
if(!c[i]){
for(int j = 2;i*j < MAX;j++)c[i*j] = true;
d[m++] = i;
}
}
for(int i = 0;i < MAXL;i++)
for(int j = i;d[i... | 158 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int n;
int not_prime[51000];
int ans;
int idx;
not_prime[0]=not_prime[1]=1;
for(int i=2;i<=50000;i++) not_prime[i]=0;
for(int i=2;i<=sqrt(50000);i++) {
if(not_prime[i]==0) {
for(int j=2*i;j<=500... | 221 |
Project_CodeNet | 2,012 | #include<iostream>
using namespace std;
#define N 1000010
int main()
{
int a[N]={0},n,i,j,count;
for(i=2;i<=N/2;i++){
if(a[i]==0){
for(j=2;j*i<=N;j++){
a[i*j]=1;
}
}
}
while(1){
cin>>n;
if(n==0)break;
count=0;
for(i=2;i<=n/2;i++){
if(a[i]==0&&a[n-i]==0)count++;
... | 141 |
Project_CodeNet | 2,012 | #include <iostream>
#include <complex>
#include <cmath>
#include <cstdio>
#include <string>
#include <sstream>
using namespace std;
const int primemax = 500000;
bool prime[primemax];
void init() {
for (int i = 0; i < primemax; i++) {
prime[i] = true;
}
prime[0] = prime[1] = false;
for (int i ... | 239 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
const int N = 1e6;
vector<bool> is_prime(N,true);
is_prime[0] = false;
is_prime[1] = false;
for(int i=2;i*i<N;i++){
if(is_prime[i]){
for(int j=i*2;j<N;j+=i){
is_prime[j] = false;
... | 202 |
Project_CodeNet | 2,013 | #include <iostream>
#include <cmath>
using namespace std;
bool flg[10000001];
int main(){
for(int i=0;i <= 1000000;i++){
if(i<=1)flg[i]=false;
else flg[i]=true;
}
for(int i=2;i <= 1001 ;i++){
if(flg[i]==true){
for(int j=i*2 ; j<=1000000 ; j=j+i){
flg[j] = false;
}
}
}
while(1){
int n... | 186 |
Project_CodeNet | 2,013 | #include <string>
#include <iostream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const double EPS = 1e-9;
int main(){
static bool prime[50000];
fill(prime, prime+50000, true);
prime[0] = prime[1] = false;
for(int i = 0; i < 50... | 216 |
Project_CodeNet | 2,010 | #include <iostream>
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++){
a[i*j] = 0;
}
}
while(cin >> n){
if(n == 0) break;
int count = 0;
if(n % 2 == 1){
i... | 208 |
Project_CodeNet | 2,010 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include ... | 398 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define pb push_back
typedef long long ll;
typedef long double la;
using namespace std;
bool is_prime(int n)
{
if(n<=1)
return false;
for(int i=2; i*i<=n; i++){
if(n%i==... | 329 |
Project_CodeNet | 2,015 | #include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<vector>
#include<algorithm>
#include<string.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << x << endl;
using namespace std;
int main(){
bool prime[200000];
int primeNum[10100... | 287 |
Project_CodeNet | 2,010 | #include <iostream>
#include <vector>
#include <algorithm>
#define PRIME_MAX 50000
using namespace std;
vector<int> prime;
bool isprime[PRIME_MAX+1];
void sieve() {
fill(isprime, (bool*)isprime+PRIME_MAX+1, true);
isprime[0] = isprime[1] = false;
for(int i = 2; i <= PRIME_MAX; i++) {
if(!isprime[i]) continu... | 231 |
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){
... | 185 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
while(cin >> n){
if(n == 0) return 0;
vector<bool> F(n + 1, true);
for(int i = 2; i <= (int)sqrt(n); i++){
if(F[i]){
for(int j = i + i; j ... | 167 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
#define N 50000
int main(){
int n;
bool is_prime[N];
is_prime[0] = is_prime[1] = false;
for(int i=2; i<N;i++){
is_prime[i] = true;
}
for(int i=2; i*i<N; i++){
if(is_prime[i]){
for(int j=i*i;j<N; j+=i){
is_prime[j] = false... | 193 |
Project_CodeNet | 2,018 | #include <cstdio>
bool pri_sub[100000] = {false};
int arr[50000];
int num;
int main(){
//gen prime number
pri_sub[0] = pri_sub[1] = true;
for(int i = 2;i <= 50000;i++){
if(pri_sub[i] == false){
for(int j = i*2; j <= 50000; j+=i){
pri_sub[j] = true;
}
}
}
num = 0;
for(int i = 2; i <= 50000;i++){
... | 277 |
Project_CodeNet | 2,016 | #include<iostream>
#include<vector>
using namespace std ;
int ans[50010] = {};
int prime[50010] = {};
vector<int> VC;
void calc(){
prime[0] = prime[1] = 1;
for( int i=2 ; i<=50000 ; i++ ){
if( !prime[i] ){
VC.push_back(i) ;
for( int j=2 ; i*j<=50000 ; j++ ){
prime[i*j] = 1;
}
}
}
for( int i=4... | 207 |
Project_CodeNet | 2,011 | #include<iostream>
#define MAX 50000
using namespace std;
int main(){
int p[MAX+1];
for(int i=0; i<MAX; i++) p[i] = 1;
p[0] = p[1] = 0;
for(int i=2; i*i <= MAX; i++){
if(p[i] == 1){
for(int j=i*2; j<=MAX; j+=i){
p[j]=0;
}
}
}
int n;
while(cin >> n){
if(n==0) break;
int count=0;
for(int i=2;... | 177 |
Project_CodeNet | 2,013 | #include <iostream>
#include <utility>
using namespace std;
int prime[50010];
int isprime(int n) {
if (n <= 1) return 0;
for (int i = 2; i*i <= n; ++i)
if (n % i == 0) return 0;
return 1;
}
int main()
{
fill(prime, prime+50010, -1);
for (int i = 0; i < 50010; ++i) {
if (prime[i] == -1) {
pr... | 239 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
bool P[50001];
fill(P, P + 50001, true);
P[0] = P[1] = false;
for (int i = 2; i * i <= 50000; i++) {
if (P[i]) {
for (int j = i * 2; j <= 50000; j += i) {
P[j] = false;
}
}
}
int n;... | 180 |
Project_CodeNet | 2,016 | #include<iostream>
#include<map>
#include<algorithm>
using namespace std;
bool a[50001];
int b[25000];
int main() {
int c = 0;
fill(a, a + 50001, true);
a[0] = false; a[1] = false;
for (int i = 2; i <= 50000;) {
if (a[i]) {
int j = 2;
while (i*j <= 50000) {
a[i*j] = false;
j++;
}
b[c] = i;
... | 251 |
Project_CodeNet | 2,014 | #include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
bool is_prime[50001];
vector<int> prime;
void eratos(){
fill(is_prime,is_prime+50001,true);
is_prime[0]=is_prime[1]=false;
for(int i=2; i<=50000; ++i){
if(is_prime[i]){
prime.push_back(i);
for(int j=2; j*i<=... | 232 |
Project_CodeNet | 2,017 | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define _USE_MATH_DEFINES
#include <math.h>
#define MAX_N 50001
bool IsPrime[MAX_N];
void q56() {
memset(IsPrime, 1, sizeof(IsPrime));
IsPrime[0] = false;
IsPrime[1] = false;
for (int i = 0; i < sqrt(MAX_N); i++) ... | 230 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
bool isp[1<<17];
int n;
main()
{
isp[0]=isp[1]=1;
for(int i=2;i<=5e4;i++)
{
if(!isp[i])
{
for(int j=i+i;j<=5e4;j+=i)isp[j]=1;
}
}
while(cin>>n,n)
{
int c=0;
for(int i=2;i<=n/2;i++)if(!isp[i]&&!isp[n-i])c+... | 128 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int primenumber(int n){
bool is_prime[50001];
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){
... | 223 |
Project_CodeNet | 2,016 | #include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
#define int long long
const int PMAX=50000;
vector<int> PF(PMAX, 1);
void MKPF(){for (int i=2;i<sqrt(PMAX);i++) if(PF[i]==1) for(int j=i*2;j<PMAX;j+=i) PF[j] = 0;}
signed main(){
MKPF();
int a;
while( scanf("%lld", &a) != EOF )... | 171 |
Project_CodeNet | 2,014 | #include <iostream>
using namespace std;
int main(){
int *data;
data = new int[50001];
data[0]=0;
data[1]=0;
data[2]=1;
data[3]=1;
for(int i=3;i<=50000;i++){
int flag=0;
for(int j=3;j*j<=i;j+=2){
if(i%j==0){
flag=1;
break;
}
}
if(flag==1){
data[i]=0;
}
else{
data[i]=1;
}
... | 308 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
bool ip[50001];
int table[50002];
vector<int> vec;
int main() {
for(int i=0;i<50001;i++){
ip[i] = true;
}
ip[0] = ip[1] = false;
table[0] = table[1] = 0;
for(int i=2;i<=50001;i++){
table[i] = 0;
if(ip[i]){
vec.pu... | 236 |
Project_CodeNet | 2,011 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <... | 454 |
Project_CodeNet | 2,014 | #include<iostream>
#include<cmath>
using namespace std;
#define M 50010
int main() {
bool p[M];
int sqM = (int)sqrt(M), n;
for(int i=0; i<M; ++i) p[i] = true;
p[0] = p[1] = false;
for(int i=2; i<sqM+1; ++i) {
if(p[i]) for(int j=i*i; j<M; j+=i) p[j] = false;
}
while(cin >> n && n) {
int ans = 0;
... | 179 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define ITER(c) __typeof... | 340 |
Project_CodeNet | 2,014 | #include <cmath>
#include <iostream>
#include <vector>
typedef std::vector <int> vi;
vi PRIMES,S;
int prime(int n){
int i=0,j=1,h=(n+1)/2,x,r=(int)pow(n,.5);
vi s(h),p;
while(j<=n){
s[i++]=j;
j+=2;
}
for (i=1;i<h;i++)
if (x=s[i]){
p.push_back(x);
if (i... | 312 |
Project_CodeNet | 2,018 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n,x,m;
x=0;
m=0;
vector<int> v;
scanf ("%d",&n);
while(n){
v.push_back(n);
if(n>x){
x=n;
}
scanf ("%d",&n);
m++;
}
vector<int> res;... | 278 |
Project_CodeNet | 2,012 | #include <iostream>
#include <algorithm>
using namespace std;
const int MAX_N = 50000;
bool isPrime[MAX_N + 1];
void setup() {
fill_n(isPrime, MAX_N, true);
isPrime[0] = isPrime[1] = false;
for (int i = 4; i <= MAX_N; i += 2) {
isPrime[i] = false;
}
for (int i = 3; i * i <= MAX_N; i += 2) ... | 253 |
Project_CodeNet | 2,012 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()
const int MAXN = 50100;
bool p[MAXN];
int main()
{
p[0] = p[1] = 1;
REP(MAXN)if(!p[i])f... | 183 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int p[50000];
void era() {
for(int i = 2; i < 50000; i++) {
p[i] = 1;
}
for(int i = 2; (i*i) < 50000; i++) {
if(p[i] == 1) {
for(int j = (i*2); j < 50000; j+=i)
p[j] = 0;
}
}
}
int main() {
int n, cnt;
era();
while(cin>>n) {
if(n =... | 199 |
Project_CodeNet | 2,012 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>... | 476 |
Project_CodeNet | 2,012 | #include <iostream>
using namespace std;
const unsigned LIMIT = 50000;
int main(){
bool table[ LIMIT ] = { false };
table[ 2 ] = true;
for ( int i = 3; i < LIMIT; i += 2 ){
table[ i ] = true;
}
for ( int i = 3; i < LIMIT; i += 2 ){
if ( !table[ i ] ) continue;
for ( int j = i + i; j < LIMIT; j += i ){
t... | 223 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
bool prime[50001];
void eratosutenesu(){
fill(prime, prime + 50001, true);
prime[0] = false; prime[1] = false;
for(int i = 2; i * i <= 50000; i++){
if(prime[i] == true){
for(int j = 2;; j++){
if(j * i > 50000) break;
prime[j * ... | 210 |
Project_CodeNet | 2,016 | #include <iostream>
#include <numeric>
using namespace std;
#define SIZE 50001
int main() {
bool prime[SIZE];
fill(prime, prime + SIZE, true);
prime[0] = prime[1] = false;
for (int i = 2; i * i < SIZE; i++) {
for (int j = 2; j * i < SIZE; j++) {
if (!prime[i * j]) continue;
prime[i * j] = false;
}
}
... | 188 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
#define MAX 50100
bool isPrime(int n){
for(int i = 2; i * i <= n; i++){
if(n % i == 0) return false;
}
return true;
}
int main(void){
int d[MAX] = {0};
for(int i = 2; i < MAX; i++) d[i] = isPrime(i);
while(true){
int n;
cin >> n... | 169 |
Project_CodeNet | 2,012 | #include <iostream>
using namespace std;
int main()
{
int n;
int p[50000] = {};
for (int i = 2; i <= 50000; ++i)
{
if (p[i-2] == 0)
{
p[i-2] = 1;
for (int j = i+i; j <= 50000; j += i) p[j-2] = -1;
}
}
while (cin >> n && n)
{
int r = 0;
for (int i = 2; i <= n/2; ++i) if (p[i-2] == 1 && p[n-i-2]... | 173 |
Project_CodeNet | 2,015 | #include<bits/stdc++.h>
using namespace std;
bool isprime[50001];
void eratos(int n){
for(int i=0 ; i <= n ; i++){
isprime[i]=true;
}
isprime[0]=isprime[1]=false;
for(int i=2 ; i <= sqrt(n) ; i++){
if(isprime[i]){
int j=i+i;
while(j <= n){
isprime[j]=false;
j=j+i;
}
}
}
... | 198 |
Project_CodeNet | 2,014 | #include<iostream>
#include<vector>
using namespace std;
int main(){
vector<bool>L(50000);
for(int i=0;i<50000;i++)L[i]=true;
L[0]=L[1]=false;
for(int i=2;i<50000;i++){
if(L[i]){
for(int j=i*2;j<50000;j+=i)L[j]=false;
}
}
int n;
while(cin>>n&&n){
if(n%2){
... | 165 |
Project_CodeNet | 2,015 | #include<iostream>
using namespace std;
int main(){
bool a[50002]={0};
for(int i=2;i<25002;i++)
for(int j=i;j*i<50002;j++)
a[i*j]=true;
int n;
while(cin>>n,n){
int co=0;
for(int i=2;i<=n/2;i++){
if((!a[i])&&(!a[n-i]))co++;
}
cout<<co<<... | 108 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
bool b[50001];
int a[50001];
int main(){
b[0]=b[1]=1;
for(int i=2;i<50001;i++)
for(int j=i+i;j<50001;j+=i)
b[j]=1;
for(int i=4;i<50001;i++){
for(int j=2;j<=i/2;j++){
if(!b[j]){
if(j+j==i||(!b[i-j]))a[i]++;
}
}
}
int n;
while(... | 139 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
vector<long long int> init() {
vector<bool>prime( 50001, 1 );
vector<long long int>ret;
prime[0] = 0;
prime[1] = 0;
for( size_t i = 2; i <= sqrtl( 50001 ); i++ ) {
if( prime[i] ) {
int j = 1;
while( i*++j < 50001 ) {
prime[i*j] = 0;
}
}
}
for( size_... | 284 |
Project_CodeNet | 2,014 | #include <stdio.h>
int a[100000];
int main(void)
{
int n;
int ans;
for(int i = 0; i < 100000; i++){
a[i] = 1;
}
for(int i = 2; i < 100000; i++){
if(a[i]){
for(int j = i * 2;j < 100000; j = j + i){
a[j] = 0;
}
}
}
scanf("%d",&n);
while(n != 0){
ans = 0;
for(int i = 2; i <= n / 2; i++){
... | 188 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
bool is_prime[60000];
is_prime[0] = is_prime[1] = false;
for(int i=2; i<60000; i++){
is_prime[i] = true;
}
for(int i=2; i*i<60000; i++){
if(is_prime[i]){
for(int j=i*i; j<60000; j+=i){
is_prime[j] = fal... | 184 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
using vb = vector<bool>;
using vi = vector<int>; using vvi = vector<vector<int>>;
using vl = vector<ll>; using vvl = vector<vector<ll>>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define FOR(i,a,b) for(ll i = (... | 397 |
Project_CodeNet | 2,018 | #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;
}
}
}
... | 200 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) << endl
#def... | 452 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
... | 369 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.