You are on page 1of 4

Probleme-Pbinfo

#1847

Pbinfo

int ok;

void P(int x[],int n,int &s)

{if(n==0)

s=0;

else

{P(x,n-1,s);

ok=1;

if (x[n-1]==1)

ok=0;

for(int i=2;i*i<=x[n-1];i++)

if(x[n-1]%i==0)

{ok=0;break;}

if(ok==1)

s=s+x[n-1];}}

CodeBlocks

#include <iostream>

using namespace std;

int ok,n,x[101],s;

void Citire(int x[],int i)

{if (i<n)

{cin>>x[i];

Citire(x,i+1);}}

void P(int x[],int n,int &s)

{if(n==0)
s=0;

else

{P(x,n-1,s);

ok=1;

if (x[n-1]==1)

ok=0;

for(int i=2;i*i<=x[n-1];i++)

if(x[n-1]%i==0)

{ok=0;break;}

if(ok==1)

s=s+x[n-1];}}

int main()

{cin>>n;

Citire(x,0);

P(x,n,s);

cout<<s;

return 0;}

#925

Pbinfo

void P(int x[],int n,int &mini,int &maxi,int &sum)

{if(n==1)

{maxi=x[0];

mini=x[0];

sum=x[0]; }

else

{P(x,n-1,mini,maxi,sum);

if(x[n-1]<mini)
mini=x[n-1];

if(x[n-1]>maxi)

maxi=x[n-1];

sum=sum+x[n-1];}}

CodeBlocks

#include <iostream>

using namespace std;

int n,x[101];

void Citire(int x[],int i)

{if (i<n)

{cin>>x[i];

Citire(x,i+1);}}

void P(int x[],int n,int &mini,int &maxi,int &sum)

{if(n==1)

{maxi=x[0];

mini=x[0];

sum=x[0];}

else

{P(x,n-1,mini,maxi,sum);

if(x[n-1]<mini)

mini=x[n-1];

if(x[n-1]>maxi)

maxi=x[n-1];

sum=sum+x[n-1];}}

int main()

{int mini=INT_MAX,maxi=INT_MIN,sum=0;

cin>>n;

Citire(x,0);
P(x,n,mini,maxi,sum);

cout<<mini<<" "<<maxi<<" "<<sum;

return 0;}

You might also like