# include <iostream.h>
# include <stdio.h>
# include <math.h>
# include <conio.h>
# include <alloc.h>

int main()
{//----------------------------------------------------------------
    clrscr();
    int w,i,j,n,s,g;
    int * yk;
    cout<<"n="; cin>>n;
    yk=new int[n];
    cout<<"El-ma \n";
    for (i=0; i<n; i++)
    { cin>>* (yk);
      s=*(yk);
      cout<<"\n s="<<s;
//----------------------------------------------------------------
      if (s==1 || s==2) { cout<<"\n s - Prostoe 4islo"; g=*(yk);
      cout<<"\n g="<<g;}
      if (s%2==0) cout<<"\n s - Sostavnoe 4islo";
      else
      {
    w=3;
    while (s&w!=0)
    { w=w+2;
      if (s<=w) { cout<<"\n s - Prostoe 4islo"; g=*(yk);
      cout<<"\n g="<<g; }
      else cout<<"\n s - Sostavnoe 4islo";
    }
      }
    }
//-----------------------------------------------------------------
    delete yk;
    getch();
}

delete []yk;

cin>>* (yk);

cin >> yk[i];

# include <iostream.h>
# include <stdio.h>
# include <math.h>
# include <conio.h>
# include <alloc.h>

int main()
{
      clrscr();
//----------------------------------------------------------------
      int Chislo(int x);
      int i,n,j;
      {
    Chislo=0;
    for (i=0; i<n; i++)
    {
      if (x[i]%2==0) Chislo=0;
      else for (j=1; j>sqrt(x[i]); j+2)
        {
          if (x[i]%j!=0) Chislo=1;
          else
          {
        Chislo=0;
        break;
          }
        }
    }
      }
//-----------------------------------------------------------------
    int w,i,j,n,s,g;
    int yk[99];
    cout<<"n="; cin>>n;
    yk=new int[n];
    cout<<"El-ma \n";
    for (i=0; i<n; i++)
    {
      cin>>yk[i];
      s=yk[i];
      cout<<"\n s="<<s;
    }
//-----------------------------------------------------------------
    delete []yk;
    getch();
}

[тип возвращаемого значения] [имя функции]([список параметров])
{
[код]
}

Chislo(yk[i]);

int IsSimple(int x)
{
    int i;
    if (x<2) return 0; //если меньше двух, дальше функция не будет выполняться
    for(i=2;i<x;i++)
    {
        if(!(x%i))
        {
            return 0; //есть делитель больший или равный двойке, но меньше числа, опять же прекращаем
        }
    }
    return 1; //делителей не нашлось, число простое
}

int main()
{
    int i;
    int x[50];
    for(i=0;i<50;i++)
    {
        cin >> x[i];
        if(IsSimple(x[i])) cout << "Prostoe\n";
        else cout << "Sostavnoe\n";
    }
    return 0; //заметьте, обещал вернуть int и вернул int
}

# include <iostream.h>
# include <stdio.h>
# include <math.h>
# include <conio.h>
# include <alloc.h>

//----------------------------------------------------------------
    int Chislo(int x)
    {
      int j;
      if (x<4) return 1;
      else
       {
         for (j=2; j<floor(x/2)+1; j++)
         if (x%j==0) return 0;
       }
       return 1;
    }
//-----------------------------------------------------------------
    int mani()
    {
      clrscr();
      int w,i,j,n,s,g,yk;
      cout<<"n="; cin>>n;
      yk=new int[n];
      cout<<"El-ma \n";
      for (i=0; i<n; i++)
      {
         cin>>yk[i];
         s=yk[i];
         cout<<"\n s="<<s;
         if (Chislo(yk[i])) cout<<"Prostoe\n";
         else cout<<"Sostavnoe\n";
      }
      delete []yk;
      getch();
      return 0;
    }

int* yk = new int[n]

cin>>yk[i];
s=yk[i];

# include <iostream.h>
# include <stdio.h>
# include <math.h>
# include <conio.h>
# include <alloc.h>

//----------------------------------------------------------------
    int Chislo(int x)
    {
      int j;
      if (x<4) return 1;
      else
       {
         for (j=2; j<ceil(sqrt(x))+1; j++)
         if (x%j==0) return 0;
       }
       return 1;
    }
//-----------------------------------------------------------------
    int main()
    {
      clrscr();
      int w,i,j,n,s,g;
      cout<<"n="; cin>>n;
      int* yk = new int[n];
      cout<<"El-ma \n"<<"\n";
      for (i=0; i<n; i++)
      {
    cin>>yk[i];
    s=yk[i];
    cout<<"s["<<i<<"]="<<s;
    if (Chislo(yk[i])) cout<<" - Prostoe\n"<<"\n";
    else cout<<" - Sostavnoe\n"<<"\n";
      }
      delete []yk;
      getch();
      return 0;
    }

# include <iostream.h>
# include <stdio.h>
# include <math.h>
# include <conio.h>
# include <alloc.h>

//----------------------------------------------------------------
    int Chislo(int x)
    {
      int j;
      if (x<4) return 1;
      else
       {
         for (j=2; j<ceil(sqrt(x))+1; j++)
         if (x%j==0) return 0;
       }
       return 1;
    }
//-----------------------------------------------------------------
    int main()
    {
      clrscr();
      int k,j,i,n; j=0; k=0;
      cout<<"n="; cin>>n;
      int* mas1 = new int[n];
      int* mas2 = new int[n];
      cout<<"El-ma \n"<<"\n";
      for (i=0; i<n; i++)
      {
         cin>>mas1[i];
         if (Chislo(mas1[i])) {mas2[j]=mas1[i]; j=j+1; k=k+1;}
                }
      for (i=0; i<n; i++)
      {
    cout<<"\nmas1["<<i<<"]="<<mas1[i];
      }
      cout<<"\n";
      for (j=0; j<k; j++)
      {
        cout<<"\nmas2["<<j<<"]="<<mas2[j];
      }
      delete []mas1;
      delete []mas2;
      getch();
      return 0;
    }

# include <iostream.h>
# include <stdio.h>
# include <math.h>
# include <conio.h>
# include <alloc.h>

//-----------------------------------------------------------------
    int Chislo(int x)
    {
      int j;
      if (x<4) return 1;
      else
       {
         for (j=2; j<ceil(sqrt(x))+1; j++)
         if (x%j==0) return 0;
       }
       return 1;
    }
//-----------------------------------------------------------------
   /* int Sort()
    {
      return 0;
    } */
//-----------------------------------------------------------------
    int main()
    {
      clrscr();
      int t,k,i2,j,j2,i,n; j=0; k=0;
      cout<<"n="; cin>>n;
      int* mas1 = new int[n];
      int* mas2 = new int[n];
      cout<<"El-ma \n"<<"\n";
      for (i=0; i<n; i++)
      {
    cin>>mas1[i];
      }
      for (i=0; i<n; i++)
      {
    cout<<"\nmas1["<<i<<"]="<<mas1[i];
      }
      cout<<"\n";
//-----------------------------------------------------------------
      for (i2=1; i2<n; i2++)
   {
      for (i=0; i<n-1; i++)
      {
    if (mas1[i]>mas1[i+1])
    {
      t=mas1[i];
      mas1[i]=mas1[i+1];
      mas1[i+1]=t;
    }
      }
   }
//-----------------------------------------------------------------
      for (i=0; i<n; i++)
      {
    cout<<"\nmas1["<<i<<"]="<<mas1[i];
      }
      cout<<"\n";
      for (i=0; i<n; i++)
      {
    if (Chislo(mas1[i])==1) {mas2[j]=mas1[i]; j=j+1; k=k+1;}
      }
      for (j=0; j<k; j++)
      {
    cout<<"\nmas2["<<j<<"]="<<mas2[j];
      }
      cout<<"\n";
//-----------------------------------------------------------------
      for (j2=1; j2<k; j2++)
   {
      for (j=0; j<k-1; j++)
      {
    if (mas2[j]<mas2[j+1])
    {
      t=mas2[j];
      mas2[j]=mas2[j+1];
      mas2[j+1]=t;
    }
      }
   }
//-----------------------------------------------------------------
      for (j=0; j<k; j++)
      {
    cout<<"\nmas2["<<j<<"]="<<mas2[j];
      }
      delete []mas1;
      delete []mas2;
      getch();
      return 0;
    }

void swap(int *p)
{
    int t=p[0];
    p[0]=p[1];
    p[1]=t;
}

void sort(int *arr, int n)
{
    int once_again, i;
    do
    {
        once_again=0;
        for(i=0;i<n-1;i++)
        {
            if(arr[i]<arr[i+1])
            {
                swap(arr+i);
                once_again=1;
            }
        }
    }while(once_again);
}