Month: March 2010

vector sortat

by

#include<iostream.h> #include<fstream.h> void main(){int n,i,v[10],gasit=0,c; fstream f(“numere.txt”,ios::in); f>>n; for(i=1;i<=n;i++) f>>v[i]; for(i=1;i<=n;i++) cout<<v[i];while(gasit==0){gasit=1;for(i=1;i<=n-1;i++)if(v[i]>v[i+1]){c=v[i];v[i]=v[i+1];v[i+1]=c;gasit=0;}}for(i=1;i<=n;i++) cout<<v[i];fstream g(“nrsort.txt”,ios::out);for(i=1;i<=n;i++) g<<v[i];f.close();g.close();} {module orizontal600} {joscommentenable}

fotbal

by

//un patron are o suma s;ce jucatori poate lua#include<iostream.h>#include<conio.h>#include<math.h>int st[20],n,p,s,a[20]; int valid(int p){int suma=0;for(int i=1;i<p;i++) if(st[i]>=st[p]) return 0;for(i=1;i<=p;i++) suma=suma+a[st[i]];if(suma>s) return 0;return 1;} int sol(int p){int suma=0;for(int i=1;i<=p;i++) suma=suma+a[st[i]];return (suma==s);} void tipar(int p){for(int i=1;i<=p;i++) cout<<st[i];cout<<endl;} void bkt(int p){int val;for(val=1;val<=n;val++){st[p]=val;if(valid(p)) if(sol(p))tipar(p);else bkt(p+1);}} void main(){cout<<“n=”;cin>>n;cout<<“s=”;cin>>s;for(int i=1;i<=n;i++){cout<<“a[“<<i<<“]=”;cin>>a[i];} bkt(1);} {joscommentenable}

cifre distincte pare alaturate

by

Backtracking cifre distincte pare alaturate Folosind metoda backtracking, sa se afiseze toate nr din n cifre distincte a.i. sa nu fie 2 cifre pare alaturate #include<iostream.h>#include<conio.h>#include<math.h>int st[20],n,k,p; int valid(int p){if(p==1 && st[p]==0) return 0; for(int i=1;i<p;i++) if(st[i]==st[p]) return 0; if(p>1 && st[p]%2==0 && st[p-1]%2==0) return 0;return 1;} int sol(int p){return (p==n);} void tipar(int p){for(int i=1;i<=p;i++) cout<<st[i];cout<<endl;} … Read more

cifre pare alaturate

by

Se citesc n cifre.Sa se afiseze toate nr formate cu acestea astfel incat sa nu existe doua cifre pare alaturate. #include<iostream.h>#include<conio.h> int n,st[10],k,p;int v[10]; int valid(int p){if((p==1) && v[st[p]]==0) return 0;if((p>1) && (v[st[p]]%2==0 && v[st[p-1]]%2==0)) return 0; return 1;} int sol(int p){return (n==p);} void tipar(int p){for(int i=1;i<=p;i++)cout<<v[st[i]];cout<<endl;} void bkt(int p){ for(int val=1;val<=n;val++){st[p]=val;if (valid(p)) if (sol(p)) … Read more