Simion Darius

11c

PORTOFOLIU INFO MODULUL 1

Cuprins:I.functii cu tip si lucrul cu acestea

1.sa se calc m a a doua nr

2.suma cifrelor lui n

3.inv unui nr
Simion Darius
11c

4.Algoritm care verifica daca n contine cif k

Simion Darius
11c

5.Fct c are returneaza 1 daca 2 nr intregi au aceeasi paritate ,0 daca nu

Simion Darius
11c

6.s cif pare

Simion Darius
11c

7.Algoritm care verifica daca nr e palindrom

Simion Darius
11c

8.o fct care returneaza nr de divizori ai unui nr supraunitar n

Simion Darius
11c

9.nr de div proprii

Simion Darius
11c

10.Algoritm care verifica daca nr e prim

Simion Darius
11c

11.suma elem pare din vector si nr elem pare de pe poz imp

Simion Darius
11c

12.prod elem prime din vector

Simion Darius
11c

13.val max
Simion Darius
11c

14.sa se scrie numerele cu cel putin 3 cifre din vector

Simion Darius
11c
Simion Darius
11c

Capitolul II.functii fara tip si lucrul cu acestea

15.Algoritm cu fct fara tip care scrie cate cif imp are n

#include <iostream>
using namespace std;
Simion Darius
11c

void cifre (int n)

{int nr=0;
while(n!=0){
if(n%2==1)
nr=nr+1;
n=n/10;}
cout<<nr;
}

int main()
{int nr,n;
cin>>n;
cifre (n);
return 0;

16.o fct fara tip care afiseaza cmmdc

Simion Darius
11c

#include <iostream>
Simion Darius
11c

using namespace std;

void cmmdc (int a,int b)
{int r=a%b;
while (r!=0)
{a=b;
b=r;
r=a%b;
}
cout<<b;
}

int main()
{int a,b,r;
cin>>a>>b;
cmmdc (a,b);
return 0;

}
17.algoritm fc fara tip care afiseaza elem palindrom din vector
Simion Darius
11c

#include <iostream>
using namespace std;
void palindrom(int n,int v[100])
Simion Darius
11c

{int ok=0;
for (int i=1;i<=n;i++)
{int inv=0;
int x=v[i];
while (v[i]!=0)
{inv=inv*10+x%10;
x=x/10;}
if (v[i]=inv)
{ cout<<x<<" ";
ok=1;}
}
if (ok==1)
cout<<"nu exisa";
}

int main()
{int x,ok,n,v[100],i;
Simion Darius
11c

do
{cin>>n;
}while(n<2 || n>100);
for(i=1;i<=n;i++)
cin>>v[i];
palindrom(n,v);
return 0;

}
18.functie fara tip ce face interschimbarea
Simion Darius
11c

#include <iostream>
Simion Darius
11c

using namespace std;

void interschimbare(int&a,int&b)
{int aux;
aux=a;
a=b;
b=aux;
cout<<a<<" "<<b;
}

int main()
{int a,b,aux;
cin>>a>>b;
interschimbare(a,b);
return 0;

}
19.fc fara tip care citese un vector
Simion Darius
11c

#include <iostream>
using namespace std;
Simion Darius
11c

void citire(int n,int v[100])

{do{cin>>n;
}while(n>100||n<2);
for (int i=1;i<=n;i++)
cin>>v[i];
}

int main()
{int v[100],n,i;
citire(n,v);
return 0;
}
20.fc fara tip care afiseaza vectorul
Simion Darius
11c

#include <iostream>
using namespace std;
void afisare(int n,int v[100])
{for (int i=1;i<=n;i++)
Simion Darius
11c

cout<<v[i]<<" ";
}

int main()
{int v[100],n,i;
do{cin>>n;
}while(n<2||n>100);
for(i=1;i<=n;i++)
cin>>v[i];
afisare(n,v);
return 0;
}
21. .matricea patratica suma elem de pe diagonale si prod elem de pe diag
Simion Darius
11c
Simion Darius
11c

Capiolul III. subprograme ce folosesc si fisiere si lucrul cu acestea

22.o fc care citeste din date.in de pe prima linie n si m nr intre 2 si 10 iar pe urm n linii cate m elemente reprez o matrice(citire intr-un
fisier si normal). Afiseaza matricea (fisier si normal) si mai scrie o fc care calc suma elem de pe linia x,suma de pe orice linie, afiseaza pe
linii dif nr liniei si suma respectiva

citi
Simion Darius
11c
Simion Darius
11c

23. o fct care calc din matricea patratica suma elem de pe diagonale si prod elem de pe diag
Simion Darius
11c

24.citire din fisier n si v[100]

Simion Darius
11c

Afisare v pe o linie cu spatii in fisier date.out

Suma elemente pare de pe poz impare
Val max in v
Poz val max in v
Ord crescaoare v
Inserarea elem cu val x in v pe poz k
Simion Darius
11c
Simion Darius
11c

#include <fstream>
#include <iostream>
Simion Darius
11c

using namespace std;

void citire(int& n,int v[100])
{ifstream f("date.in");
f>>n;
for (int i=1;i<=n;i++)
f>>v[i];
f.close();
}
void afisare(int n,int v[100])
{ofstream g("date.out");
for(int i=1;i<=n;i++)
g<<v[i];
g.close();
}
int s_pare(int n,int v[100])
{int s=0;
for (int i=1;i<=n;i++)
if (i%2==1)
if (v[i]%2==0)
s=s+v[i];
Simion Darius
11c

return s;}
int val_max(int n,int v[100])
{int max=v[1];
for (int i=1;i<=n;i++)
if (v[i]>max)
max=v[i];
return max;
}
void ord_crescatoare(int n,int v[100])
{for (int i=1;i<n;i++)
for (int j=2;j<=n;j++)
if (v[j]<v[i])
j=i;
}
void inserare(int& n,int k,int v[100])
{int x;
for (int i=k;i<=n+1;i++)
v[i+1]=v[i];
v[k]=x;
}
Simion Darius
11c

int main()
{int v[100],n,i,j,x,max,k,s;
citire ( n, v);
afisare ( n, v);
cout<<s_pare(n,v)<<" ";
cout<<val_max(n,v)<<" ";
ord_crescatoare(n,v);
cin>>k;
inserare(n,k,v);
return 0;
25. citire de la tastatura n si m si matricea corespunzatoare
Afisare marice
Suma elem de pe fiecare linie
Prod elem de pe diag princ si cea sec daca matricea ar fi patratica
Nr elem palindrom
Cel mai mare elem de pe linia x
Interschimbarea coloanelor x si y
Simion Darius
11c
Simion Darius
11c

#include <fstream>
Simion Darius
11c

#include <iostream>
using namespace std;
void citire(int& n,int &m,int a[10][10])
{do{
cin>>n>>m;
}while(n>10||n<2||m<2||m>10);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
cin>>a[i][j];
}
void afisare(int n,int m,int a[10][10])
{
for(int i=1;i<=n;i++)
{
for (int j=1;j<=m;j++)
cout<<a[i][j];
cout<<endl;
}
}
int s_fiecarelinie(int n,int m,int a[10][10])
Simion Darius
11c

{int s=0;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
s=s+a[i][j];
return s;
}
int prod_patr(int n,int m,int a[10][10])
{int p=1;
for (int i=1;i<=n;i++)
for (int j=1;i<=n;j++)
if (j==i||j==n-i+1)
p=p*a[i][j];
return p;
}
int elem_palindrom(int n,int m,int a[10][10])
{int nr=0;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
int y=a[i][j];
Simion Darius
11c

int inv=0;
while (y!=0)
{inv=inv*10+y%10;
y=y/10;}
if (inv==a[i][j])
nr=nr+1;
}
return nr;
}
int celmaimare_elem(int n,int m,int x,int a[10][10])
{int max=a[x][1];
for (int j=1;j<=m;j++)
if (a[x][j]>max)
max=a[x][j];
return max;}
void interschimbare(int n,int m,int x,int y,int a[10][10])
{int aux;
for (int i=1;i<=n;i++)
{aux=a[i][x];
a[i][x]=a[i][y];
Simion Darius
11c

a[i][y]=aux;
}
}

int main()
{int a[10][10],n,m,i,j,x,max,s,p,y,aux;
citire ( n,m,a);
afisare ( n,m,a);
cout<<s_fiecarelinie(n,m,a)<<endl;
cout<<prod_patr(n,m,a)<<endl;
cout<<elem_palindrom(n,m,a)<<endl;
do{cin>>x;
}while(x>i||x<2);
cout<<celmaimare_elem(n,m,x,a);
do {cin>>x>>y;
}while(x<2||y<2||x>j||y>j);
interschimbare(n,m,x,y,a);

return 0;
}
Simion Darius
11c

26.toate nr din intervalul 1 x cu proprietatea ca suma div egal cu nr

#include <iostream>
Simion Darius
11c

using namespace std;

int suma_diviz(int x)
{
int s=0;
for (int d=1;d<=x/2;d++)
if (x%d==0)
s=s+d;
return s;
}
void nr_perfecte (int x) //nr egale cu s div
{
for (int i=2;i<=x;i++)
if (suma_diviz(i)==i)
cout<<i<<" ";
}

int main()
{ int x,s,i,d;
do
{
Simion Darius
11c

cin>>x;
}while (x==0);
nr_perfecte(x);
return 0;
}
27.se da un vector cu 100 elemente sa se verifice aceeasi proprietate
Simion Darius
11c

#include <iostream>

using namespace std;

int suma_diviz(int x)
Simion Darius
11c

{
int s=0;
for (int d=1;d<=x/2;d++)
if (x%d==0)
s=s+d;
return s;
}
void nr_perfecte (int v[100],int n) //nr egale cu s div
{ int nr=0;
for (int i=1;i<=n;i++)
if (suma_diviz(v[i])==v[i])
{
nr=nr+1;
cout<<i<<" "<<v[i]<<" "<<endl;;
}
}

int main()
{ int x,s,i,d,nr,n,v[100];
do
Simion Darius
11c

{
cin>>n;
}while (n<2||n>100);
for (i=1;i<=n;i++) cin>>v[i];
nr_perfecte(v,n);
return 0;
}

28.
Simion Darius
11c

include <iostream>

using namespace std;

void imog (int x,int y,int &rez)
Simion Darius
11c

{ int a=x; int b=y;int inv=0;int ok=1;

while (a!=0)
{
if (a%10%2==1)
{
ok=ok*10+a%10;
}
a=a/10;
}
while (b!=0)
{
if (b%10%2==1)
inv=inv*10+b%10;
b=b/10;
}

if (ok==inv)
rez=0;
else
Simion Darius
11c

rez=1;
}

int main()
{ int x,y,rez,inv,a,b,ok;
do
{
cin>>x>>y;
}while (x<0||x>1000||y<0||y>1000);

imog(x,y,rez);
cout<<rez;
return 0;
}
Simion Darius
11c

29.
Simion Darius
11c

#include <iostream>
using namespace std;
void citire(int &n,int &k,int a[10][10])
{do{cin>>n;
}while(n<2||n>20);
do{cin>>k;
}while(k<2||k>n);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
cin>>a[i][j];
}
void interschimbare(int n,int k,int a[10][10])
{int aux;
for (int i=1;i<=n;i++)
{aux=a[k][i];
a[k][i]=a[i][k];
a[i][k]=aux;
}
}
Simion Darius
11c

int main()
{ int aux,n,a[10][10],k;
citire(n,k,a);
interschimbare(n,k,a);
return 0;
}