skyler_sdf

-functii fara parametri 100-ariile unor figuri geometrice -functii cu parametri transmisi prin valoare 101-calculeaza media aritmetica a doua nr reale 102-interschimbarea a doua linii intr-o matrice 104-nr +, nr-, nr0 intr un vector 103-calculeaza sumele elementelor de pe liniile matricii, memorandu-le intr un vector S -functii care returneaza o valoare 105-max dintre mediile aritmetice a doua perechi de nr 106-suma cifrelor unui numar 107-verifica cate cifre pare are un nr dat 100. #include<iostream.h> float pi=3.14159; void aria_patrat() { int L; cout<<"Latura: "; cin>>L; if(L>0) cout<<endl<<"Aria este: "<<L*L; else cout<<endl<<"date incorecte!!!"; } void aria_cerc() { int R; cout<<"Raza: "; cin>>R; if(R>0) cout<<endl<<"Aria este: "<<pi*R*R; else cout<<endl<<"date incorecte!!!"; } void aria_triunghi() { int B, H; cout<<"Baza B si inaltimea H: "; cin>>B>>H; if((B>0) && (H>0)) cout<<endl<<"Aria este: "<<(B*H)/2; else cout<<endl<<"date incorecte!!!"; } void main() { int opt; cout<<"optiunea dvs. = 1. Patrat 2. Cerc 3. Triunghi: \n"; cin>>opt; switch(opt) { case 1: aria_patrat(); break; case 2: aria_cerc(); break; case 3: aria_triunghi(); break; default: cout<<endl<<"date incorecte!!"; } } 101. #include<iostream.h> #include<conio.h> void calcul_media(float x, float y) { float M; M=(x+y)/2; cout<<"Media este= "<<M; } void main() { float a, b; cout<<"dati nr: "; cin>>a>>b; calcul_media(a, b); getch(); } 102. #include<iostream.h> int a[20][20], i, j, m, n, L1, L2, temp; void citire_matrice() { cout<<"Dati nr de linii si de coloane: "; cin>>m>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } } void interschimbare(int i1, int i2) { for(j=1; j<=n; j++) { temp=a[i1][j]; a[i1][j]=a[i2][j]; a[i2][j]=temp; } } void afisare_matrice(int a[20][20], int m, int n) { cout<<endl<<"matricea este: "; for(i=0; i<=m-1; i++) { for(j=0; j<=n-1; j++) cout<<a[i][j]<<" "; cout<<endl; } } void main() { citire_matrice(); afisare_matrice(a, m, n); do{ cout<<endl<<"dati liniile care se vor interschimba: "; cin>>L1>>L2; } while(L1<1 || L1>m || L2<1 || L2>m); interschimbare(L1, L2); afisare_matrice(a, m, n); } 103. #include<iostream.h> int a[20][20], m, n, i, j, k, s[80]; void citire_matrice() { cout<<"dati nr de linii si de coloane: "; cin>>m>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } } void formeaza_vector() { k=0; for(i=0; i<=m-1; i++) { for(j=0; j<=n-1; j++) s[k]+=a[i][j]; k++; } } void afisare_vector(int s[80], int k) { for(k=0; k<=m-1; k++) cout<<s[k]<<" "; } void main() { citire_matrice(); formeaza_vector(); afisare_vector(s, k); } 104. #include<iostream.h> int v[20], n, i, np, nn, nl; void citire_vector() { cout<<"n="; cin>>n; for(i=0; i<=n-1; i++) { cout<<endl<<"v["<<i<<"]="; cin>>v[i]; } } void calculvsafisare(int v[20], int n) { np=nn=nl=0; for(i=0; i<=n-1; i++) { if(v[i]>0) np++; if(v[i]<0) nn++; if(nl==0) nl++; } cout<<endl<<"nr elem. pozitive: "<<np; cout<<endl<<"nr elem. neg. : "<<nn; cout<<endl<<"nr elem. nule: "<<nl; } void main() { citire_vector(); calculvsafisare(v, n); } 105. #include<iostream.h> #include<conio.h> float m1, m2, a1, a2, b1, b2; float calcul_media(float x, float y) { return (x+y)/2; } void main() { cout<<"a1, b1= \n"; cin>>a1>>b1; m1=calcul_media(a1, b1); cout<<"a2, b2= \n"; cin>>a2>>b2; m2=calcul_media(a2, b2); if(m1>=m1) cout<<endl<<"max="<<m1; else cout<<endl<<"max="<<m2; getch(); } 106. #include<iostream.h> long x; int suma_cifre(long x) { int d, s; d=x; s=0; do{ s+=d%10; cout<<endl<<s; d/=10; } while(d!=0); return s; } void main() { cout<<endl<<"dati nr: "; cin>>x; cout<<endl<<"suma cifrelor lui: "<<x<<" este "<<suma_cifre(x); } 107. #include<iostream.h> long x; int nr_cifre(long x) { int d, i, nr=0; d=x; do{ i=d%10; if(i%2==0) nr++; d/=10; } while(d!=0); return nr; } void main() { cout<<endl<<"dati nr: "; cin>>x; cout<<endl<<"nr de cifre pare: este "<<nr_cifre(x); }

Matrici-cont. 020-sorteaza crescator elementele de pe diagonala principala 021-spirala Multimi 023-diferenta a doua multimi 024-reuniunea a doua multimi 026-produsul cartezian dintre doua multimi 027-submultimi 020. #include<iostream.h> int a[30][30], i, j, m, n, aux; void main() { cout<<endl<<"dati nr de linii si de coloane: "; cin>>m>>n; for(i=0; i<=n-1; i++) for(j=0; j<=n-1; j++) { cout<<endl<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } for(i=0; i<=m-1; i++) { for(j=i+1; j<=n-1; j++) if(a[j][j]<a[i][i]) { aux=a[i][i]; a[i][i]=a[j][j]; a[j][j]=aux; } } for(i=0; i<=n-1; i++) { for(j=0; j<=n-1; j++) cout<<a[i][j]<<" "; cout<<endl; } } 021. #include<iostream.h> void main() { int mat[10][10], n, i, j, k; cout<<"n= "; cin>>n; for(i=1; i<=n; i++) for(j=1; j<=n; j++) { cout<<"mat["<<i<<"]["<<j<<"]="; cin>>mat[i][j]; } for(k=1; k<=n/2+1; k++) { for(i=k; i<=n-k+1; i++) cout<<mat[k][i]<<endl; for(i=k+1; i<=n-k+1; i++) cout<<mat[i][n-k+1]<<endl; for(i=n-k; i>=k; i--) cout<<mat[n-k+1][i]<<endl; for(i=n-k; i>=k+1; i--) cout<<mat[i][k]<<endl; } } 023. #include<iostream.h> void main(){ int a[20], b[20], c[20], i, j, m, n, k, gasit; cout<<"n="; cin>>n; for(i=0; i<=n-1; i++) { cout<<endl<<"a["<<i<<"]="; cin>>a[i]; } cout<<endl<<"m="; cin>>m; for(i=0; i<=m-1; i++) { cout<<endl<<"b["<<i<<"]="; cin>>b[i]; } k=0; for(i=0; i<=n-1; i++) { gasit=0; for(j=0; j<=m-1 && !gasit; j++) if(a[i]==b[j]) gasit=1; if(!gasit) c[k++]=a[i]; } cout<<endl<<"A-B"<<endl; for(i=0; i<k; i++) cout<<c[i]<<" "<<endl; } 024. #include<iostream.h> void main() { int a[20], b[20], c[50], i, j, m, n, k, gasit; cout<<endl<<"nr de elemente al multimii A"; cin>>n; for(i=0; i<=n-1; i++) { cout<<endl<<"a["<<i<<"]="; cin>>a[i]; } cout<<endl<<"nr de elemente al multimii B"; cin>>m; for(i=0; i<=m-1; i++) { cout<<endl<<"b["<<i<<"]="; cin>>b[i]; } k=0; for(i=0; i<=n-1; i++) { gasit=0; for(j=0; j<=m-1 && !gasit; j++) if(a[i]==b[j]) gasit=1; if(!gasit) c[k++]=a[i]; } cout<<endl<<"A reunit cu B"; for(i=0; i<=m-1; i++) cout<<endl<<b[i]<<" "; for(i=0; i<k; i++) cout<<endl<<c[i]<<" "; } 026. #include<iostream.h> void main() { int i, m, n, j; char a[20], b[20]; cout<<"nr de elemente al multimii A: "; cin>>n; for(i=0; i<=n-1; n++) { cout<<endl<<"a["<<i<<"]="; cin>>a[i]; } cout<<endl<<"nr de elemente al multimii B: "; cin>>m; for(i=0; i<=m-1; i++) { cout<<endl<<"b["<<i<<"]="; cin>>b[i]; } for(i=0; i<n-1; i++) for(j=0; j<m-1; j++) cout<<a[i]<<" "<<b[j]<<endl; } 027. #include<iostream.h> int a[9], n, i, S; void main() { cout<<"nr de elemente al multimii A: "; cin>>n; for(i=0; i<n;) a[i++]=0; do{ a[n-1]++; for(i=n-1; i>=1; i--) if(a[i]>1) { a[i]-=2; a[i-1]+=1; } S=0; for(i=0; i<n; i++) S+=a[i]; for(i=0; i<n; i++) if(a[i]) cout<<i+1<<" "; cout<<endl; } while(S<n); cout<<"multimiea vida!!"; }

matrici 01-matrice triunghiulara superior 02-matrice triunghiulara inferior 03-determina de cate ori apare o valoare data x ca element al matricii 04-calculeaza media aritmatica a elementelor unei matrici 05-sorteaza o linie din matrice data de la tastatura 06-afiseaza numarul elemntelor pozitive, negative, nule din matrice 07-tipareste elementele pare aflate pe linii impare si coloane divizibile cu 3; 08-verifica daca doua linii date L1 si L2 sunt identice(contin aceleasi elemente in aceeasi dispunere pe coloane) 09-afiseaza maximul dintre elementele pare ale liniei L a unei matrici cu m,n linii,coloane 010-afiseaza elementele aflate deasupra diagonalei principale, inclusiv cele de pe diagonala, sub forma unui triunghi de numere; matricea este patratica cu n*nlinii*coloane 011-calculeaza numarul elementelor pozitive de sub diagonala principala 012-memoreaza intr un vector b sumele elementelor de pe fiecare linie a matricii cu m*n linii si coloane(b va reprezenta suma elementelor de pe linia i) 013-afiseaza indicii liniei/iilor pe care se afla cele mai multe valori de 1 intr o matrice 014-copiaza intr un vector elementele pozitive aflate deasupra diagonalei principale intr o matrice 015-interschimba doua linii date L1 si L2, fara a folosi alta matrice 016-afiseaza elementele in ordine crescatoare pe diagonala principala, realizand schimbarile de linii si de coloane necesare 017-sterge min 018-construieste in memorie un tablou t cu n/n linii/coloane, cu elementele nr nat, as.in.pe diagonala principala sa existe numai elemente=1, cele de pe cele doua semidiagonale paralele cu cea princi.=2, =3etc. 01. #include<iostream.h> int a[20][30], i, j, x, n; void main() { cout<<endl<<"dati numarul de linii si de coloane: "; cin>>n; for(i=0; i<n-1; i++) for(j=0; j<=n-1; j++) { cout<<endl<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } x=1; for(i=1; i<=n-1; i++) for(j=0; j<=i-1; j++) if(a[i][j]) x=0; if(!x) cout<<endl<<"nu este triunghiulara superior:"; else cout<<endl<<"este triunghiulara superior:"; } 02. #include<iostream.h> int a[20][20]; int i, j, n, x; void main() { cout<<endl<<"dati nr de linii si de coloane:"; cin>>n; for(i=0; i<=n-1; i++) for(j=0; j<=n-1; j++) { cout<<endl<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } x=1; for(i=0; i<=n-2; i++) for(j=i+1; j<=n-1; j++) if(a[i][j]) x=0; if(!x) cout<<endl<<"nu e triunghiulara inferior:"; else cout<<"e triunghiulara inferior: "; } 03. //stabileste de cate ori apare o valoare x data ca element al unei matrice #include<iostream.h> int a[20][30],i ,j, m, n, nr=0, x; void main() { cout<<"\nDati numarul de linii si de coloane:"; cin>>m>>n; cout<<"x="; cin>>x; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<endl<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; if(a[i][j]==x) nr++; } cout<<endl<<"nr="<<nr; } 04. //determina media aritmetica a elementelor unei matrice #include<iostream.h> int a[20][30], i, j, m, n, s=0; void main() { cout<<"\nDati numarul de linii si de coloane:"; cin>>m>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]"; cin>>a[i][j]; s+=a[i][j]; } cout<<"Media aritmetica este egala cu:"<< (float)s/m*n; } 05. //determina media aritmetica a elementelor unei matrice #include<iostream.h> int a[20][30], i, j, m, n, s=0; void main() { cout<<"\nDati numarul de linii si de coloane:"; cin>>m>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]"; cin>>a[i][j]; s+=a[i][j]; } cout<<"Media aritmetica este egala cu:"<< (float)s/m*n; } 05. #include<iostream.h> int a[30][30], i, j, m, n, L, C1, C2, aux, k; void main() { cout<<"\nDati numarul de linii si de coloane: \n"; cin>>m>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } cout<<"dati linia pe care o sortez:"; cin>>L; for(C1=0; C1<=n-2; C1++) for(C2=C1+1; C2<=n-1; C2++) { if(a[L][C2]<a[L][C1]) for( k=1; k<=m-1; k++) { aux=a[k][C1]; a[k][C1]=a[k][C2]; a[k][C2]=aux; } } for(i=0; i<=m-1; i++) { for(j=0; j<=n-1; j++) cout<<a[i][j]<< " "; cout<<endl; } } 06. #include<iostream.h> int a[20][30], i, j, m, n, nn, np, nl; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } np=nn=nl=0; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) if(a[i][j]>0) np++; if(a[i][j]<0) nn++; if(a[i][j]==0) nl++; cout<<"np="<<np; cout<<endl; cout<<"nn="<<nn; cout<<endl; cout<<"nl="<<nl; } 07. #include<iostream.h> int a[20][30], i, j, m, n; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } for(i=1; i<=m; i+=2) for(j=0; j<=n-1; j+=3) if(a[i][j]%2==0) cout<<a[i][j]<<" "; } 08. #include<iostream.h> int a[20][30], i, j, m, n, L1, L2, ok=1; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } for(i=0; i<=m-1; i++) if(a[L1][i]!=a[L2][i]) ok=0; if(ok) cout<<"liniile sunt identice!!!"; else cout<<endl<<"liniile nu sunt identice"; } 09. #include<iostream.h> #include<values.h> int a[20][30], i, j, m,n, L, max; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]]"<<j<<"]="; cin>>a[i][j]; } cout<<"\nDati linia:"; cin>>L; max=-MAXINT+1; for(j=0; j<=n-1; j++) if(a[L][j]%2==0 && a[L][j]>max) max=a[L][j]; cout<<"max"<<max; } 010. #include<iostream.h> int a[20][30], i, j, m; void main() { cout<<"\nDati nr de linii si de coloane:"; cin>>m; for(i=0; i<=m-1; i++) for(j=0; j<=m-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } for(i=0; i<=m-1; i++) { for(j=0; j<=m-1; j++) if(j>=i) cout<<a[i][j]<<" "; else cout<<" "<<" "; cout<<endl; } } 011. #include<iostream.h> int a[20][30], i, j, m, nr=0; void main() { cout<<"\nDati numarul de linii si de coloane"; cin>>m; for(i=0; i<=m-1; i++) for(j=0; j<=m-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } for(i=0; i<=m-1; i++) { for(j=0; j<=m-1; j++) if(j<i) nr++; } cout<<"\nNumarul elementelor pozitive aflate sub diagonala principala este egal cu: "<<nr; } 012. #include<iostream.h> int a[20][30], i, j, m, n, b[20], k=0; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } for(i=0; i<=m-1; i++) { for(j=0; j<=n-1; j++) b[k]+=a[i][j]; k++; } for(k=0; k<=m-1; k++) cout<<b[k]<<" "; } 013. include<iostream.h> #include<values.h> int a[20][30], b[20], i, j, m, n, k=0, max; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<endl<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } max=-MAXINT; for(i=0; i<=m-1; i++) { for(j=0; j<=n-1; j++) b[k]+=a[i][j]; k++; } for(k=0; k<=m-1; k++) { if(b[k]>max) max=b[k]; } cout<<endl<<"Pozitiile maximului sunt: "; for(k=0; k<=m-1; k++) if(b[k]==max) cout<<k<<" "; } 014. #include<iostream.h> int a[20][30], i, j, m, n, b[20], k=0; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<endl<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } for(i=0; i<=m-2; i++) for(j=i+1; j<=n-1; j++) if(a[i][j]>0) { b[k]=a[i][j]; k++; } m=k; for(k=0; k<=m-1; k++) cout<<b[k]<<" "; } 015. #include<iostream.h> int a[20][30], i, j, m, n, L1, L2, temp; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<endl<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } cout<<"Dati liniile pe care le interschimb:"; cin>>L1>>L2; for(j=0; j<=n-1; j++) { temp=a[L1][j]; a[L1][j]=a[L2][j]; a[L2][j]=temp; } for(i=0; i<=m-1; i++) { for(j=0; j<=n-1; j++) cout<<endl<<a[i][j]<<" "; } } 016. #include<iostream.h> int a[20][30], i, j, m, n, aux, temp; void main() { cout<<"m="; cin>>m; cout<<"n="; cin>>n; for(i=0; i<=m-1; i++) for(j=0; j<=n-1; j++) { cout<<endl<<"a["<<i<<"]["<<j<<"]="; cin>>a[i][j]; } for(i=0; i<=m-1; i++) { for(j=i+1; j<=n; j++) if(a[j][j]<a[i][i]) { for(i=0; i<=m-1; i++) { aux=a[i][i]; a[i][i]=a[j][i]; a[j][i]=aux; } for(j=0; j<=n-1; j++) { temp=a[i][i]; a[i][i]=a[i][j]; a[i][j]=temp; } } } for(i=0; i<=m-1; i++) { for(j=0; j<=n-1; j++) cout<<a[i][j]<<" "; } } 017. #include<iostream.h> #include<values.h> int a[20], i, n, min; void main() { cout<<"n="; cin>>n; for(i=0; i<=n-1; i++) { cout<<endl<<"a["<<i<<"]="; cin>>a[i]; } min=MAXINT; do{ if(a[i]<min) min=a[i]; i++; } while(min<0 || min>n-2); for(i=min+1; i<=n-1; i++) a[i-1]=a[i]; for(i=0; i<=n-2; i++) cout<<a[i]<<" "; } 018. #include<iostream.h> int a[20][20], i, j, n, k; void main() { cout<<endl<<"n="; cin>>n; for(i=0; i<=n-1; i++) { a[i][i]=1; for(k=i+1; k<=n-1; k++) a[i][k]=a[i][k-1]+1; for(k=i-1; k>=0; k--) a[i][k]=a[i][k+1]+1; } for(i=0; i<=n-1; i++) { for(j=0; j<=n-1; j++) cout<<a[i][j]<<" "; cout<<endl; } }

Nume_fis/cerinta probl 35-re-aranjari de elemente intr un sir 36-elementele distincte ale unui sir 38-verifica daca elementele unui vector sunt in ordine crescatoare 40-triunghi de numere 35. //re-aranjari de elemente intr un sir //sa se re-aranjeze elementele unui sir, a.i. cele pare sa ocupe primele pozitii in ordine crescatoare //iar cele impare sa ocupe restul pozitiilor in ordine descrescatoare #include<iostream.h> #include<values.h> int i, j, k, ok, n, min, pmin, temp, v[20], capat; void main() { cout<<endl<<"n="; cin>>n; for(i=0; i<=n-1; i++) { cout<<"v["<<i<<"]="; cin>>v[i]; } //la fiecare pas al algoritmului, privind vectorul ca fiind format din doua parti: //o parte sortata(v[0], ..., v[k-1]) ce contine elementele pare in ordine crescatoare, //si o parte nesortata (v[k], ..., v[n]) in care vor ramane elementele impare k=0; //initial partea sortata este vida capat=0; //in variabile capat vom memora inceputul partii nearanjate while(k<=n-1) { //determinam minimul min al partii nearanjate min=MAXINT; ok=0; //variabila ok va indica daca partea nesortata mai contine elemente pare for(j=k; j<=n-1; j++) if(v[j]<min && v[j]%2==0) { pmin=j; min=v[j]; ok=1; } if(ok) //daca in partea nesortata mai exista elemente pare { //interschimba minimul min al partii nearanjate cu v[k] //crescand astfel partea sortata cu inca un element temp=v[k]; v[k]=v[pmin]; v[pmin]=temp; k++; } else { capat=k; k=n; //iese fortat din ciclu } } cout<<endl; for(i=0; i<=n-1; i++) cout<<v[i]<<" "; //sorteaza partea nearanjata cu elementele impare if(capat>0) { for(i=capat; i<=n-2; i++) for(j=i+1; j<=n-1; j++) if(v[j]>v[i]) { temp=v[i]; v[i]=v[j]; v[j]=temp; } } cout<<endl; for(i=0; i<=n-1; i++) cout<<v[i]<<" "; } 36. //elementele distincte ale unui sir #include<iostream.h> void main() { int v[30], u[30], i, n, j, k, e; cout<<endl<<"n="; cin>>n; for(i=0; i<=n-1; i++) { cout<<"v["<<i<<"]="; cin>>v[i]; } k=0; for(i=0; i<=n-1; i++) { for(e=0, j=0; j<=n-1; j++) if(u[j]==v[i]) e=1; if(!e) u[k++]=v[i]; } for(i=0; i<=k-1; i++) cout<<u[i]<< " "; } 38. #include<iostream.h> void main() { int n, i, v[20], ok; cout<<"n="; cin>>n; for(i=0; i<=n-1; i++) { cout<<endl<<"v["<<i<<"]="; cin>>v[i]; } ok=1; i=1; while(i<=n-1 && ok==1) { if(v[i]<v[i-1]) ok=0; i++; } if(ok) cout<<endl<<"sunt in ordine crescatoare"; else cout<<endl<<"nu sunt in ordine crescatoare";} 40. #include<iostream.h> void main() { int n, j, i; cout<<"dati n: "; cin>>n; for(i=1; i<=n; i++) { for(j=1; j<=i; j++) cout<<(2*j-1)<< " "; cout<<endl; } }

Pe acest site veti gasi cam tot ce va trebuie despre C++: http://www.cplusplus.com/doc/tutorial/

am sa pun si cv doc despre partea d OOP la sectiunea C++.. ok..bravo!bn nu era mare lucru! trebuie sa vrei

super tare.............ptr cei care stiu ce e aia "clasa" in C++, constructori/destructori, si supraincarcarea operatorului "="...

Building a basic thumbnail is a five stage process: 1. load the source image into a php variable 2. determinate the height and width of the original image 3. create a blank thumbnail image of the correct size 4. copy the original image to the blank thumbnail 5. display the thumbnail using the correct content type. Let's create a thumbnail from a large version of the SitePoint logo in jpeg format <?php //specify source image $sourceimage='sample_images/sitepoint_logo.jpg'; //Specify thumbnail height and width $thumbwidht=200; $thumbheight=100; //load the source image $original=imagecreatefromjpeg($sourceimage); //get the size of the original $dims=getimagesize($sourceimage); //create a blank thumbnail (note slightly reduced height) $thumb=imagecreatetruecolor($thumbwidth, $thumbheight); //copy a resized version of the original onto the thumbnail imagecopyresampled($thumb, $original, 0, 0, 0, 0, $thumbwidht, $thumbheight, $dims[0], $dims[1]); //send the content header header("Content-type: image/jpeg"); //display the image imagejpeg($thumb); ?> imagecreatefromjpeg=load an image from the file system into a PHP variable The getimagesize function tells us the width and height of the image (more on getimagesize in a moment) The imagecreatetruecolor function is used to create a blank image(in memory, as a PHP variable) into which the thumbnail image will be placed. The imagecopyresampled function is the point at which the thumbnail is actually created from the original.It places a resized version of the image into the blank thumbnail image, resambling along the way to ensure that the image is resized smoothly. We use imagejpeg to output the completed thumbanil.

Function //Arguments //Side effect //Return value current() //one array argument //none //the value from the key/value pair currently pointed to by the internal "current" pointer(or false if no such value) next() //one array argument //advances the pointer by one. If already at the last element, it will move the pointer "past the end", and subsequent calls to current() will return false. //the value pointed to after the pointer has been advanced (or false if no such value). prev() //one argument array //moves the pointer back by one. If already at the first element, will move the pointer "before the beginning". //the value pointed to after the pointer has been moved back (or false if no such value). prev() //one argument array //moves the pointer back by one. If already at the fisrt element, will move the pointer "before the beginning". //the value pointed to after the pointer has been moved back (or false if no such value). reset() //one argument //moves the pointer back to point to the first key/value pair, or "before the beginning" if the array is empty. //the first value stored in the array, or false for an empty array. end() //one argument //the pointer ahead to the last key/value pair. //the last value that is currently in the list of key/value pairs. pos() //one argument //none. (This function is an alias for current().) //the value of the key/value pair that is currently pointed to. each() //one argument //array moves the pointer ahead to the next key/value pair. //an array that packages the keys and values of the key/value pair that was current before the pointer was moved (or false if no such pair). The returned array stores the key and value under its own keys 0 and 1, respectively, and also under its own keys 'key' and 'value'. array_walk() //1). An array argument 2). the name of two-(or three) argument function to call on each key/value 3). an optional third argument //this function invokes the function named by its second argument on each key/value pair. Side effects depends on the side effects of the passed function. //returns 1

Functions: include('/filepath/filename') require('/filepath/filename') include_once('/filepath/filename') require_once('/filepath/filename') include() and include_once() will merely generate a warning on failure, while require() and require_once() will cause a fatal error and termination of the script. include_once() and require_once() differ from simple include() and require() in that they will allow a file to be included only once per PHP script. Let's see an example: // <?php //we have the: include_me.php echo 'I\ 've been included!<br />'; ?> Every time this script is included it will display the message "I've been included!", so we know it's worked. Now, let's test the various ways we can include this file in another script: <?php //This works fine echo '<br />Requiring once: '; require_once 'include_me.php'; //This works fine as well echo '<br />Including: '; include 'include_me.php'; //Nothing happens as file is already included echo '<br />Includind once: '; include_once 'include_me.php'; //This is fine echo '<br />Requiring: '; require 'include_me.php'; //Again nothing happens - the file is included echo '<br />Requiring once again: '; require-once 'include_me.php'; //Produces a warinig message as the file doesn't exist echo '<br />Include the wrong file: '; include 'include_wrong.php'; //Produces a fatal error and script execution halts echo '<br />Requiring the wrong file: '; require 'include_wrong.php'; //This will never be executed as we have a fatal error echo '<br />Including again: '; include 'include_me.php'; ?> The result will be sth like this: Requiring once: I've been included Including: I've been included Including once: Requiring: I've been included Requiring once: Include the wrong file: Warning: Failed opening 'inlcude_wrong.php' for inclusion Requiring the wrong file: Fatal error: Failed opening required 'include_wrong.php'

thks

//The ckeckbox type has only one possible value per input: off(unchecked) or on(checked). The database field which records this information is almost always going to be a samll integer or bit type with values 0 and 1 corresponding to unchecked or checked check boxes. //The following example demonstrates how to use a check box to DISPLAY and CHANGE a BOOLEAN value. <?php //Open connection to the database mysql_connection("localhost", "phpuser", "sesame") or die("Failure to communicate with database"); mysql_select_db("test"); //If the form has been submitted, record the preference and redisplay if($_post['submit']=='Submit') {$email=$_post['email']; $as_email=addslashes($_post['email']); if(isset($_post['optout'] && $_post['optout']==1) { $optout=1; } else{ $optout=0; } //Update value $query="update checkbox set boxvalue=$optout where boxname='optout' and email='$as_email'"; $result=mysql_query($query); if(mysql_error()==" ") { $succes_msg='<p>Your preference has been updated.</p>'; } else{ error_log(mysql_error()); } //Get the value $query="select boxvalue from checkbox where boxname='optout' and email=='$as_email'"; $result=mysql_query($query); $optout=mysql_result($result, 0, 0); if($optout==0) { $checked=" "; } elseif($optout==1) { $checked='CHECKED'; } } //Now display the page $thispage=$_server['php_self']; //Have to do this for heredoc $form_page=<<<EOFORMPAGE <html> <head> <title></title> </head> $succes_msg <form method="post" action="$thispage"> Email address: <input type="text" name="email" size=25 value="$email"> <br> <br> <font size=+4>please send me lots of e-mail bulletins!</font> <br> <font size=-2>Opt out by clicking this tiny checkbox</font> <input type="checkbox" name="OptOut" value=1 $checked> <br> <br> <input type="submit" name="submit" value="Submit"> </form> </body> </html> EOFORMPAGE; echo $form_page; ?>

mysql_affected_rows([link_id]) =use after nonzero INSERT, UPDATE, or DELETE query to check number of rows changed. mysql_change_user(user, password, [database],[link_id]) =changes MYSQL user on an open link mysql_close([link_id]) =closes the identified link(usually unnecessary) mysql_connect([host][:port][:socket], [username], [password]) =opens a link on the specified host, port, socket; as specified user with password. All arguments are optional mysql_create_bd(db_name, [link_id]) =creates a new MYSQL database on the host associed with the nearest open link mysql_data_seek(result_id, row_num) =moves internal row pointer to specified row number. Use a fetching function to return data from that row mysql-drop_db(db_name, [link_id]) =drops specified MYSQL database mysql_error([link_id]) =returns text error message mysql_fecth_array(result_id, [result_type]) =fetches result set as associative array. Result type can be MYSQL_ASSOC, MYSQL_NUM, or MYSQL_BOTH(default) mysql_fetch_field(result_id, [field_offset]) =returns the information about a field as an object mysql_fecth_lengths(result_id) =returns length of each field in a result set mysql_fetch_object(result_id, [result_type]) =fetches result set as an object. See mysql_fetch_array for result types mysql_field_row(result_id) =fetches result set as an enumerated array mysql_field_name(result_id, field_index) =returns name of enumerated field mysql_field_seek(result_id, field_offset) =moves result pointer to specified field offset. Used with mysql_fetch_field mysql_field_table(result_id, field_offset) =returns name of specified field's table mysql_field_tyoe(result_id, field_offset) =returns type of offset field (for example, TINYINT, BLOB, VARCHAR) mysql_field_flags(result_id, field_offset) =returns flags associated with enumerated field (for example, NOT NULL, AUTO_INCREMENT, BINARY) mysql_field_len(result_id, field_offset) =return lenght of enumerated field mysql_free_result(result_id) =frees memory used by result set(usually unnecessary) mysql_insert_id([link_id]) =returns AUTO_INCREMENT ID of INSERT; or FALSE if insert failed or last query was not an insert mysql_list_fields(database, table,[link_id]) =returns result ID for use in mysql_field functions, without performing an actual query mysql_list_dbs([link_id]) =returns result pointer of databases on mysqld. Used with mysql_tablename mysql_list_tables(database, [link_id]) =returns result pointer of tables in database. Used with mysql_tablename mysql_num_fields(result_id) =returns number of fields in a result set mysql_num_rows(result_id) =returns number of rows in a result set mysql_pconnect([host][:port][:socket], [username], [password]) =opens persistent connection to database. All arguments are optional. Be careful-mysql_close and script termination will not close the connection mysql_query(query_string, [link_id]) =sends query to database. Remember to put the semicolon outside the double-quoted query string mysql_result(result_id, row_id, field_identifier) =returns single-field result. Field identifier can be field offset(0), field name or table-dot name mysql_select_db(database, [link_id]) =selects database for queries mysql_tablename(result_id, table_id) =used with any of the mysql_list functions to return the value referenced by a result pointer

cp:)

e ok si fara "alt=..."

ai facut exemplul?vezi ce iese?

pai eu ce.am zis? nici nu mi.a trecut ceva d rau prin cap si daca ar fi vreo chestie d genul (**) ti.as zice p mess, nu aici in public happy now?

ce?"injuraturi"? D:

//Similar formularului de inregistrare, acest fisier verifica existenta informatiilor, retine username-ul si parola in doua variabile, apoi executa un query SELECT pentru a verifica daca sunt valide. <?php session_start(); require_once("dbconnect.php"); // verifica daca exista date transmise if ($_POST['login_username'] != "" && $_POST['login_password'] != '') { // preia datele din formular $username = $_POST['login_username']; $password = md5($_POST['login_password']); // formeaza si executa query-ul de select din baza de date $query = "SELECT * FROM `users` WHERE `Username` = '".$username."' AND `Password` = '".$password."'"; $result = mysql_query($query) or die ( "Error : ". mysql_error() ); // verifica daca interogarea MySQL a gasit date valide if ($result || mysql_num_rows($result) < 1) { // daca nu, afiseaza un mesaj de eroare echo "Datele introduse sunt incorecte<br> Click <a href='index.php'>aici</a> pentru a reveni la pagina de login"; } else { // salveaza username-ul si parola in sesiune $_SESSION['username'] = $username; $_SESSION['password'] = $password; // afiseaza un mesaj de succes echo "Autentificarea a fost efectuata cu succes."; } } ?> //In caz de succes, numele de utilizator si parola sunt memorate in sesiune. //Acest pas este necesar deoarece permite verificarea unui utilizator utilizand datele din sesiune, fara a-i cere sa introduca de fiecare data numele de utilizator si parola.

//acest fisier verifica daca avem date transmise, apoi preia numele, username-ul si parola utilizatorului din variabila superglobala $_POST si executa un query MySQL de tip INSERT pentru a salva datele in tabela users //(Id-ul lipseste din query deoarece este incrementat automat). Ca metoda de securitate, parola este encodata utilizand functia md5(): <?php session_start(); require_once("dbconnect.php"); // verifica daca exista date transmise if ($_POST['register_name'] != "" && $_POST['register_username'] != "" && $_POST['register_password'] != '') { // preia datele din formular $name = $_POST['register_name']; $username = $_POST['register_username']; $password = md5($_POST['register_password']); // formeaza si executa query-ul de inserare in baza de date $query = "INSERT INTO `users` (`Name`,`Username`,`Password`) VALUES ('".$name."','".$username."','".$password."')"; $result = mysql_query($query) or die ( "Error : ". mysql_error() ); // afiseaza un mesaj de succes if ($result) { echo "Inregistrarea a fost efectuata cu succes.<br> Click <a href='index.php'>aici</a> pentru a reveni la pagina de login"; } } ?> //MD5 (Message Digest Algorithm 5) este o functie criptografica de tip hash unidirectional, care livreaza ca rezultat o valoare fixa ca lungime de 128 Biti. Valuarea calculata cu ajutorul functiei MD5 (pe scurt md5sum), este folosita insa pe scara larga drept suma de control, la verificarea integritatii fisierelor. //Functia md5() din PHP returneaza hash-ul ca un numar hexazecimal (in baza 16) de 32 caractere.

//modificarea transparentei la mouseover //cand mutam cursorul mouse-ului in afara imaginii, aceasta trebuie sa redevina transparenta. Acest lucru este realizat de atributul onmouseout. <img src="imagine1.jpg" style="opacity:0.4;filter:alpha(opacity=40)" onmouseover="this.style.opacity=1;this.filters.alpha.opacity=100" onmouseout="this.style.opacity=0.4;this.filters.alpha.opacity=40" /> //In IE ( filter:alpha(opacity=x) ), x poate lua valori de la 0 la 100. La fel ca in Firefox, cu cat valoarea este mai mica, cu atat elementul este mai transparent. //in cel de al doilea caz imaginea este transparenta pana la prima mutare a cursorului mouse-ului <img src="imagine2.jpg" style="opacity:0.4;filter:alpha(opacity=40)" onmouseover="this.style.opacity=1;this.filters.alpha.opacity=100" />

ok..am inteles ce ai vrut tu sa zici si iti scuz limbajul..da' chiar trebuie sa detaliez fiecare instrc d p fiecare linie?? D: in fine nu ar fi o probl doar ca mai mult vor ocupa detaliile decat codul in sine..

mmda..despre mine: "I'm crazy!!" altceva mai vrei sa stii? si promit sa respect topicul..ca ala d mai sus tine mai mult de mysql..ooups!

thks:) it's my first day at work!

titlul e destul de sugestiv cred eu...