Explicație:
Pct a): Limbaj C++
#include <iostream>
using namespace std;
int main()
{
int n,c,k;
k=0;
cout<<"n este ";
cin>>n;
while(n!=0)
{
c=n%10;
if(c%2==0)
k++;
n=n/10;
}
cout<<"numarul cifrelor pare este "<<k;
return 0;
}
Pct a): Limbaj Pseudocod
Algorithm_cifre pare
begin algorithm
integer n,c,k
k=0
while(n!=0)
c=n%10
if(c%2==0)
k=k+1
n=n/10
end while
write k
end algorithm
Pct b): Limbaj C++
#include <iostream>
using namespace std;
int main()
{
int n,c,max;
max=0;
cout<<"n este ";
cin>>n;
while(n!=0)
{
c=n%10;
if(max<c)
max=c;
n=n/10;
}
cout<<"cifra maxima este "<<max;
return 0;
}
Pct b): Limbaj Pseudocod
Algorithm_cifra maxima
begin algorithm
integer n,c,max
max=0
while(n!=0)
c=n%10
if(max<c)
max=c
n=n/10
end while
write max
end algorithm
Pct c): Limbaj C++
#include <iostream>
using namespace std;
int main()
{
int n,c,k;
k=0;
cout<<"n este ";
cin>>n;
while(n!=0)
{
c=n%10;
if(c==1 || c==4 || c==6 || c==8 || c==9)
k++;
n=n/10;
}
cout<<"numarul de cifre neprime este "<<k;
return 0;
}
Pct c): Limbaj Pseudocod
Algorithm_cifre neprime
begin algorithm
integer n,c,k
k=0
while(n!=0)
c=n%10
if(c==1 || c==4 || c==6 || c==8 || c==9)
k=k+1
n=n/10
end while
write k
end algorithm
Pct d): Limbaj C++
#include <iostream>
using namespace std;
int main()
{
int n,P;
P=1;
cout<<"n este ";
cin>>n;
while(n!=0)
{
P=P*(n%10);
n=n/10;
}
cout<<"produsul cifrelor este "<<P;
return 0;
}
Pct d): Limbaj Pseudocod
Algorithm_produs
begin algorithm
integer n,P
P=1
while(n!=0)
P=P*(n%10)
n=n/10
end while
write P
end algorithm
