Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- int prim(int a){
- int i,ok=0;
- for(i=2;i<=a/2 && ok == 0;i++)
- if(a % i == 0)
- ok=1;
- if(a == 1)
- ok=1;
- if(ok == 0)
- return 1;
- return 0;
- }
- using namespace std;
- int main(){
- ifstream f1("atestat.in");
- ofstream f2("atestat.out");
- int m[100][100],v[10000],i,j,n,test=0,x=0,a,pk,pri=0,aux,y;
- f1>>n;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++){
- f1>>m[i][j];
- if(test == 0){
- test=1;
- x++;
- v[x]=m[i][j];
- }
- else{
- x++;
- y=x;
- pk=0;
- for(a=1;a<x && pk == 0;a++)
- if(v[a] == m[i][j]){
- x--;
- pk=1;
- }
- if(y == x)
- v[x] = m[i][j];
- }
- }
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- if(j > n-i+1)
- if(prim(m[i][j]) == 1)
- pri++;
- if(pri == 0)
- f2<<"NU EXISTA";
- else
- f2<<pri;
- f2<<endl;
- for(i=1;i<=x-1;i++)
- for(j=i+1;j<=x;j++)
- if(v[i] > v[j]){
- aux=v[i];
- v[i]=v[j];
- v[j]=aux;
- }
- for(i=1;i<=x;i++)
- f2<<v[i]<<" ";
- }
Add Comment
Please, Sign In to add comment