Professional Documents
Culture Documents
Probleme Rezolvate C
Probleme Rezolvate C
#include<iostream>
#include<conio.h>
int main(){
int a,b;
cout<<"a="; cin>>a;
cout<<"b="; cin>>b;
cout<<"a+b="<<a+b<<'\n';
cout<<"a-b="<<a-b<<'\n';
cout<<"b-a="<<b-a<<'\n';
cout<<"a*b="<<a*b<<'\n';
cout<<"a and b = "<<(a&b)<<'\n';
cout<<"a or b = "<<(a|b)<<'\n';
cout<<"a xor b = "<<(a^b)<<'\n';
getch();
}
Problema 2
#include<iostream>
#include<conio.h>
using namespace std;
int main(){
char c; int a,b;
cout<<"a="; cin>>a;
cout<<"b="; cin>>b;
cout<<"c="; cin>>c;
switch(c) {
case '+' : cout<<"a+b="<<(a+b)<<'\n'; break;
case '-' : cout<<"a-b="<<(a-b)<<'\n'; break;
case '*' : cout<<"a*b="<<(a*b)<<'\n'; break;
case '/' : if (b!=0) { cout<<"a div b = "<<(a / b)<<'\n';
cout<<"a mod b = "<<(a % b)<<'\n'; break; }
else cout<<"Impartire la zero !!!!"<<endl;
case ',' : cout<<"Predecesor : "<<(--c)<<'\n'; break;
case ':' : cout<<"Succesor : "<<(++c)<<'\n'; break;
case '.' : cout<<"Ordinul : "<<int(c)<<'\n'; break;
default : {
cout<<"Ati dat alt caracter "<<'\n';
cout<<"a and b="<<(a&b)<<endl;
cout<<"a or b="<<(a|b)<<endl;
cout<<"not(a)="<<-(~a)<<endl;
cout<<"not(b)="<<-(~b)<<endl;
cout<<"a xor b="<<(a^b)<<endl;
}
} getch();
}
Problema 3
#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int a,n,k,q;
int suma,min,max,pare,impare;
suma=0; pare=0; impare=0; max=-(1<<30); min=(1<<30); k=1;
cout<<"n="; cin>>n; q=0;
while (n>=k) {
cout<<"Dati numarul "<<k<<" = "; cin>>a;
if (a>max) max=a;
if (a<min) {min=a; q=1;} else if (a==min) q++;
if (a % 2 == 0) pare++; else impare++;
suma+=a;
k++;
}
cout<<"max="<<max<<'\n';
cout<<"min="<<min<<'\n';
if (q==1) cout<<"Avem un singur minim"<<endl; else cout<<"minimul se gaseste de :
"<<q<<" ori"<<endl;
cout<<"suma="<<suma<<'\n';
if (pare==0) cout<<"nu avem numere pare"<<endl; else cout<<"numere pare =
"<<pare<<'\n';
if (impare==0) cout<<"nu avem numere impare"<<endl; else cout<<"numere impare =
"<<impare<<'\n';
getch();
}
Problema 4
#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int a,b,c,d,e,f;
int max,min;
cout<<"a="; cin>>a;
cout<<"b="; cin>>b;
cout<<"c="; cin>>c;
cout<<"d="; cin>>d;
cout<<"e="; cin>>e;
cout<<"f="; cin>>f;
max=maxim(a,b,c,d,e,f);
min=minim(a,b,c,d,e,f);
cout<<"maximul = "<<max<<'\n';
cout<<"minimul = "<<min<<'\n';
if (min!=0) {
cout<<"max div min = "<<max/min<<'\n';
cout<<"max mod min = "<<max%min<<'\n';
}
else cout<<"impartire la zero";
getch();
return 0;
}
Problema 5
#include<iostream>
#include<conio.h>
#include<cmath>
int main(){
float a,p;
int n,i;
cout<<"a="; cin>>a;
cout<<"n="; cin>>n;
if (n<0 && a==0) cout<<"impartire la zero!!!! atentie !!!";
else
if (n==0 && a==0) cout<<"zero la puterea zero nu are sens"<<endl;
else {
p=1;
cout<<a<<" la puterea "<<n<<" este : ";
for (i=1; i<=abs(n); i++) p*=a;
if (n>=0) cout<<p<<endl; else cout<<(1/p);
}
getch();
return 0;
}
Problema 6
#include<iostream>
#include<conio.h>
#include<cmath>
int cifre,suma; long long rast, n;
using namespace std;
bool palindrom(long long n)
{ if (n==rast) return true; else return false; }
void calcul (long long n)
{ bool t; long long k=abs(n);
if (n>=0) t=true; else t=false;
If (n==0) cifre=1;
while (k)
{ rast=rast*10+(k%10); cifre++; suma+=k%10; k/=10; }
if (t==false) rast=-rast;
}
void scrie() {
cout<<"suma cifrelor = "<<suma<<endl;
cout<<"numarul de cifre = "<<cifre<<endl;
cout<<"rasturnatul = "<<rast<<endl;
if (palindrom(n)) cout<<"este palindrom"<<endl; else cout<<"nu este
palindrom"<<endl;
}
int main()
{ cifre=0; suma=0; rast=0; cout<<"Dati numarul n="; cin>>n;
calcul(n); scrie();
getch(); return 0;
}
Problema 7
#include<cmath>
using namespace std;
int a[101];
int i,n;
bool palindrom(int k)
{ bool t; int rast; int j;
k=abs(k);
rast=0;
while (k) {
rast=rast*10+(k % 10);
k/=10;
}
if (rast==abs(a[i])) t=true; else t=false;
return t;
}
int main(){
int suma,max,min,q;
cout<<"n="; cin>>n;
cout<<"Dati cele "<<n<<" elemente ale tabloului"<<'\n';
int main(){
int i,j,aux,y;
cout<<"n="; cin>>n;
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++) if (a[i]<a[j]) {aux=a[i]; a[i]=a[j]; a[j]=aux; }
getch();
return 0;
}