1.

#include <iostream>
#include<fstream>
using namespace std;
ifstream fin ("nr.txt");
int
main ()
{
int v[102], n = 0, x, i, j, aux;

while (fin >> x){

if (x > 0)
{
v[n] = x;
n = n + 1;
}
}
//Vector de pozitie//
if (n == 0)cout << "NU EXISTA";
else
//Comparam pozitiile si interschimb//
for (i = 0; i < n - 1; i++){
for (j = i + 1; j < n; j++){
if (v[i] > v[j]){aux = v[i];v[i] = v[j];v[j] = aux;}
}
}
//Mi am sortat crescatorv[i]//
for (i = 0; i < n ; i++)
{
cout << v[i] << " ";
}
fin.close();
return 0;
}

2.
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin ("nr.txt");
int main()
{
int v[102];
int n=0,i,j,x,aux;
while(fin>>x){
if(x>=100){
v[n]=x;
n++;
}
}
if(n==0)cout<<"Nu exista";
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(v[i]>v[j]){aux=v[i];v[i]=v[j];v[j]=aux;}
}
}
 for(i=0;i<n;i++){
cout<<v[i]<<" ";
}

fin.close();
return 0;
}

3.

#include <iostream>
#include<fstream>
using namespace std;
ifstream fin ("nr.txt");
int main()
{
int v[102];
int n=0,i,j,x,aux;
while(fin>>x){
if(x<100){
v[n]=x;
n++;
}
}
if(n==0)cout<<"Nu exista";
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(v[i]<v[j]){aux=v[i];v[i]=v[j];v[j]=aux;}
}
}
for(i=0;i<n;i++){
cout<<v[i]<<" ";
}

fin.close();
return 0;
}

4.

#include <iostream>

using namespace std;

int main()
{
int v[102];
int n,i,j,x,aux;
cin>>n;
for(i=0;i<n*3;i++){
cin>>v[i];
}
j=n*2;
for(i=0;i<n;i++){
aux=v[i];v[i]=v[j];v[j]=aux;
 j++;
}
for(i=0;i<n*3;i++){
cout<<v[i]<<" ";
}

return 0;
}

pag 2 exercitiul 3 ;

#include <iostream>

using namespace std;

int main()
{
int v[5000];
int n=10,i,contor=0;
for(i=1;i<=n;i++){
cin>>v[i];
}
for(i=1;i<=n;i++){
if(v[i]%13==0){contor++;}
}
cout<<contor<<" ";
for(i=1;i<=n;i++){
if(v[i]%13==0){cout<<i<<" ";}
}

return 0;
}

pag 2 exercitiul 4 ;

#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("numere.txt");
int main()
{
int v[100];
int n,i,contor=1;
fin>>n;
for(i=0;i<n;i++){
fin>>v[i];
}
for(i=0;i<n;i++){
if(v[i]<v[i+1])contor++;
else contor=1;
if(contor==4){cout<<v[i-2]<<" "<<v[i-1]<<" "<<v[i]<<" "<<v[i+1];break;}
}

fin.close();
return 0;
}
.eof() = metoda prin care detectăm finalul fişierului. "eof" vine de la "end of
file"

!f.eof() = cât timp citesc din fişier şi acesta nu s-a terminat. Această
instrucţiune va lua caracter cu caracter din fişier, astfel vom putea face operaţii
cu ele.

pag 2 exercitiul 5

#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
ifstream fin("numere.txt");

int main()
{
int contor=0;
double x;
while(fin>>x){
if(x>=0 && floor(x)==x)contor++;
}
if(contor>=10){cout<<"DA";}
else cout<<"NU";

fin.close();
return 0;
}

pag.3 exercitiul 1

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("numere.txt");

int main()
{

int v[100];
int n,i,contor=1;
fin>>n;
for(i=0;i<n;i++){
fin>>v[i];
}
for(i=0;i<n;i++){
if(v[i]>v[i+1])contor++;
else contor=1;
if(contor==4){cout<<v[i-2]<<" "<<v[i-1]<<" "<<v[i]<<" "<<v[i+1];break;}
}

fin.close();

return 0;
}
ULTIMUL EXERCITIU DE PAG 8

#include <iostream>
using namespace std;

int
main ()
{
int v[102], n = 0, x, i, j ,aux,contor=0;
cin>>x;
for(i=0;i<x;i++){
cin>>v[i];
}
for (i = 0; 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;}
if(v[i]==v[j])contor++;
}
}
if(contor>=1)cout<<"NU";
else{cout<<"Se pot ordona"<<endl;
for (i = 0; i < x ; i++)
{
cout <<v[i] << " ";
}
}

return 0;
}