Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <math.h>
- using namespace std;
- bool prost ( int n )
- { int n1=abs(n);
- bool ll=true;
- if ( ( n1==2 ) || ( n1==3 ) )
- return true;
- else
- if(n1==1 ||n1==0) {return false;}
- else
- {for (int i=2; i < n1/2; i++ )
- if ( n1%i==0 )
- ll=false;}
- if ( ll == false )
- return false;
- else
- return true;
- }
- void sort ( int *a, int n )
- {
- for (int i=1; i<n; i++)
- {
- int temp = a[i];
- int j=i-1;
- while ( ( temp < a[j] ) && ( j>=0 ) )
- {
- a[j+1]=a[j];
- j--;
- }
- a[j+1]=temp;
- }
- }
- int main ()
- {
- setlocale ( LC_ALL, ".1251" );
- ifstream fin ("in.txt");
- const int N=100;
- if ( !fin )
- {
- cout << "Файл не найден" << endl;
- return 1;
- }
- int *mas = new int [N];
- fin >> mas[0];
- if ( fin.eof() )
- {
- cout << "Файл пустой" << endl;
- fin.close();
- delete[] mas;
- return 1;
- }
- int i=1;
- while ( !fin.eof() )
- fin>>mas[i++];
- int k=0;
- for (int j=0; j<i-1; j++)
- if ( prost( mas[j] ) == true )
- k++;
- ofstream fout ("out.txt");
- if ( !fout )
- {
- cout << "Выходной файл не создан" << endl;
- delete[] mas;
- return 1;
- }
- int *mas2 = new int [k];
- int z=0;
- for (int j=0; j<i-1; j++)
- {if ( prost( mas[j] ) == true )
- mas2[z++]=mas[j];}
- sort (mas2, k);
- for (int j=0; j<k; j++)
- fout<<mas2[j]<<" ";
- fout.close();
- delete[] mas;
- delete[] mas2;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement