OJ Board

Code: Select all

print(n*c:*);
print(list_of_prime_no*);
print(\n\n);

Code: Select all

Print 2 new lines after each case EXCEPT the LAST ONE.
but again its a PE.

Code: Select all

#include <iostream>
#include <cmath>
using namespace std;

int primejudge (int n);

int main(){
    int n , c;
    while ((cin >> n >> c) && n >=1 && n <= 1000 && c >= 1 && c <= n){
          int prime[n] , primeaddress;
          if (n == 1){
                prime[0] = 1;
                primeaddress = 1;
          }
          else if (n == 2){
               prime[0] = 1;
               prime[1] = 2;
               primeaddress = 2;
          }
          else if (n == 3 || n == 4){
               prime[0] = 1;
               prime[1] = 2;
               prime[2] = 3;
               primeaddress = 3;
          }
          else{
               prime[0] = 1;
               prime[1] = 2;
               prime[2] = 3;
               primeaddress = 3;
               for (int i = 0 ; (6 * i + 5) <= n ; i ++){
                   if (primejudge (6 * i + 5)){
                             prime[primeaddress] = 6 * i + 5;
                             primeaddress ++;
                   }
                   if ((6 * i + 7) <= n && primejudge (6 * i + 7)){
                          prime[primeaddress] = 6 * i + 7;
                          primeaddress ++;
                   }
               }
          }
          
          if ((c - 1) <= primeaddress / 2 && primeaddress % 2 == 1){
             cout << n << " " << c << " :";
             for (int i = primeaddress / 2 - (c - 1) ; i <= primeaddress / 2 + (c - 1) ; i ++){
                 cout << " " << prime[i];
             }
          }
          else if (c <= primeaddress / 2 && primeaddress % 2 == 0){
               cout << n << " " << c << " :";
               for (int i = primeaddress / 2  - c ; i <= primeaddress / 2 + c - 1 ; i ++){
                   cout << " " << prime[i];
               }
          }
          else{
               cout << n << " " << c << " :";
               for (int i = 0 ; i < primeaddress ; i ++){
                   cout << " " << prime[i];
               }
          }
          cout << endl << endl;
    }
    return 0;
}

int primejudge (int n){
    for (int i = 2 ; i <= sqrt(n) ; i ++){
        if (n % i == 0){
              return 0;
        }
    }
    return 1;
}

Code: Select all

while ((cin >> n >> c) && n >=1 && n <= 1000 && c >= 1 && c <= n)

Code: Select all

#include<stdio.h>
#include<math.h>
#define size 1004
#define true 1
#define false 0

int main()
{
	int a,b[size],m=0,i,j,k=0,t,p[size],prime[size];
	int s;	 
	p[0]=false; p[1]=true;
	
	for(i=2; i<=size; i++)
		p[i]=true;
		
	s=sqrt(size);
	
	for(i=2; i<=s; i++)
		{
			if(p[i]==true)
			for(j=i+i; j<=size; j=j+i)
				p[j]=false;
		}
		
	for(i=0; i<=size; i++)
	{
		if(p[i]==true)
		{
			prime[m]=i;
			//printf("%d ",i);
			m++;
		}
	}
	
	
	while((scanf("%d %d",&a,&m))==2)
	{
		if(!((a>=1 && a<=1000) && (m>=1 && m<=a)))
		 break;
	
		printf("%d %d: ",a,m);
		
		k=0;
		for(i=1; i<a; i++)
		{
			if(p[i]==true)
			{
				b[k]=i;
				k++;
			}
			
		}

		if(m*2>=a)for(i=0;i<k;i++)printf("%d ",b[i]);
		else if(k/2-m<0 && k/2+m>k) for(i=0;i<k;i++)printf("%d ",b[i]);
			
		else 
		{
			if(k%2==0)
				for(i=k/2-m;i<k/2+m;i++)printf("%d ",b[i]);
	
		else for(i=k/2-m+1;i<k/2+m;i++)printf("%d ",b[i]);
		}
		printf("\n\n");
	}
return 0;
}

Code: Select all

#include<stdio.h>          
int isprime(int x)
{
int i=2;
while(i*i<=x)
{
if(x%i==0)
return 0;
i++;
}
return 1;
}

void main()
{
int k=0,i,a[175],n,c=0;
while(scanf("%d %d",&n, &c)!=EOF && (n&&c))
{
printf("%d %d:",n,c);
k=0;
for(i=1; i<=n; i++)
if(isprime(i))
a[k++]=i;
if(c>k/2)
i=0;
else
if(k%2==0)
i=(k/2)-c;
else
i=(k/2)-(c-1);
for( ; i<(k/2)+c; i++)
{
if(i>=k)
break;
printf(" %d ",a[i]);
}
printf("\n\n");
}
}