406 prime cuts.cpp

UVA Online Judge solutions to the problems

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n,i,k,c,end;
    int arr[200];
    
    while ((cin >> n >> c) && n >=1 && n <= 1000 && c >= 1 && c <= 1000)
    {
    if(n<3)
    {
           cout<<n<<" "<<c<<":";
           for(i=1;i<=n;i++)
           cout<<" "<<i;
           cout<<"\n\n";
    }
    if(n>=3)
    {
                 int flag=0,j=3;
                 arr[0]=1;arr[1]=2;arr[2]=3;
                 for(i=5;i<=n;i=i+2)
                 {
                  for(k=2;k<=sqrt(i);k++)
                  {
                   if(i%k==0)
                   {
                   flag=0;
                   break;
                   }
                   else
                   flag=1;
                  }
                  if(flag==1)
                  {
                  arr[j]=i;
                  j++;
                  }
                 }
                 end=j;
                 
                 cout<<n<<" "<<c<<":";
                 
                 if(end<=2*c-1)
                 {
                         for(i=0;i<end;i++)
                         cout<<" "<<arr[i];
                         
                         cout<<"\n\n";
                         continue;
                 }
                 if(end%2!=0)
                 {
                             for(i=(end/2)-c+1;i<(end/2)+c;i++)
                             cout<<" "<<arr[i];
                             
                             cout<<"\n\n";
                             continue;
                 }
                 if(end%2==0)
                 {
                             for(i=(end/2)-c;i<(end/2)+c;i++)
                             cout<<" "<<arr[i];
                             
                             cout<<"\n\n";
                             continue;
                 }
    }
                 
    }
    system("pause");
}