admin

nr negative alaturate

by

se citesc n nr.sa se afle toate modalitatile de afisare a nr a.i. 2 nr alaturate sa nu fie negative #include<iostream.h>int st[20],n,k,v[20]; void init(){cout<<“n=”;cin>>n;} int valid(int k){for(int i=1;i<k;i++) if(st[i]==st[k]) return 0;if((v[st[k]]<0) && (v[st[k-1]]<0)) return 0;return 1;} int sol(int k){return (k==n);} void tipar(int k){for(int i=1;i<=k;i++) cout<<v[st[i]];cout<<endl;} void bkt(int k){int val; for(val=1;val<=n;val++) {st[k]=val; if(valid(k)) if (sol(k)) tipar(k); … Read more

structura unei pagini html

by

<html> <head> <title>titlu</title> <body> continut </body> </html> Aceasta structura poate fi scrisa in orice editor de texte, dar nu uitati sa salvati cu extensia .htm sau .html Titlu este ceea ce apare in browser iar continut reprezinta continutul propriu zis al paginii, tot ceea ce apare in pagina.

font

by

Tag-ul font in HTML Tagul <font> este inca folosit, dar va fi indepartat din versiunile viitoare de HTML. Atribute: atribute efect exemplu size=”numar” marimea fontului size=”2″ size=”+numar” incrementeaza marimea fontului size=”+2″ size=”-numar” decrementeaza marimea fontului size=”-3″ face=”nume” defineste numele fontului face=”Times” color=”valoare in hexa” defineste culoarea color=”#eecc00″ color=”nume culoare” defineste culoarea color=”red” In HTML: <p><font … Read more

intervale

by

Fisierul bac.txt contine pe prima linie un nr. natural nenul n, iar pe fiecare din urmatoarele n linii cate 2 nr intregi a si b, fiecare pereche reprezentand un interval inchis de forma [a,b].Scrieti un program care citeste numerele din fisier, apoi determina un interval dintre cele citite care contine cel mai mare nr de … Read more

combinari

by

//combinari#include<iostream.h>int st[20],n,k; void init(){int i;cout<<“n=”;cin>>n;cout<<“k=”;cin>>k;st[0]=0;} void tipar(int p){int j;for(j=1;j<=p;j++)cout<<st[j]<<” “;cout<<endl;} int solutie(int p){return (p==k);} void bkt(int p){int val;for (val=st[p-1]+1;val<=n;val++){st[p]=val;if(solutie(p))tipar(p);elsebkt(p+1);}} void main(){init();bkt(1);} {joscommentenable}

aranjamente

by

//aranjamente#include<iostream.h>int st[20],n,k; void init(){int i;cout<<“n=”;cin>>n;cout<<“k=”;cin>>k;for(i=1;i<=n;i++) st[i]=0;} void tipar(int p){int j;for(j=1;j<=p;j++)cout<<st[j]<<” “;cout<<endl;} int valid(int p){int i,ok;ok=1;for(i=1;i<p;i++)if(st[p]==st[i]) ok=0; return ok;} int solutie(int p){return (p==k);} void bkt(int p){int val;for (val=1;val<=n;val++){st[p]=val;if (valid(p))if(solutie(p))tipar(p);elsebkt(p+1);}} void main(){init();bkt(1);} {joscommentenable}

permutari

by

//permutari#include<iostream.h>int st[20],n; void init(){int i;cout<<“n=”;cin>>n;for(i=1;i<=n;i++) st[i]=0;} void tipar(int p){int j;for(j=1;j<=p;j++)cout<<st[j]<<” “;cout<<endl;} int valid(int p){int i,ok;ok=1;for(i=1;i<p;i++)if(st[p]==st[i]) ok=0;return ok;} int solutie(int p){return (p==n);} void bkt(int p){int val;for (val=1;val<=n;val++){st[p]=val;if (valid(p))if(solutie(p))tipar(p);elsebkt(p+1);}} void main(){init();bkt(1);} {joscommentenable}

numar ce se repeta in vector

by

Se citeste un vector. Sase afiseze de cate ori apare un nr ce se repeta #include <iostream> using namespace std; int main() { int aux,n,i,j,nr,a[20]; cout<<“n=”;cin>>n; for (i=1;i<=n;i++) {cout<<“a[“<<i<<“]=”;cin>>a[i];} aux=-1; for(i=1;i<=n;i++) {nr=1; if(a[i]!=aux) {for(j=i+1;j<=n;j++) if(a[i]==a[j]) {nr++;a[j]=aux;} cout<<“nr”<<a[i]<<“apare de “<<nr<<” ori”; cout<<endl;} } return 0; }

cautare in vector

by

#include<iostream.h>#include<conio.h>typedef int vector[20];int n;vector v; int e(int n,int x){if (n==0) return 0;else if (v[n]==x) return 1; else return e(n-1,x);} void main(){int x,i;cout<<“n=”;cin>>n;cout<<“x=”;cin>>x;for(i=1;i<=n;i++) {cout<<“v[“<<i<<“]=”;cin>>v[i];}if (e(n,x)) cout<<“este”<<endl;else cout<<“nu este”;getch();}