#include<iostream.

h>
int n;
int produs(int p, int u)
{int mij, s1, s2;
if(p==n)
return p;
else
{mij=(p+u)/2;
s1=produs(p,mij);
s2=produs(mij+1, u);
return s1*s2;}
}
int main()
{cin>>n;
cout<<produs(1, n);
return 0;}
#include<iostream.h>
int v[10], n,q=0;
void citire()
{cin>>n;
for(int i=1; i<=n;i++)
cin>>v[i];
}
int prim(int x)
{for(int d=2; d<n/2; d++)
if(d%2==0)
return 0;
return 1;}
int det(int p, int u, int &q)
{int mij;
q+=prim(v[p]);
else
{mij=(p+u)/2;
return (det(p, mij,q)+det(mij+1, u, q));
}
}
int main()
{cin>>n;
cout<<det(1, n, q);
return 0;}
#include <iostream.h>
#include<string.h>
#include<stdlib.h>

char s[101],v[]="aeiou";
int n;
int voc(int p,int u)
{int mij;
if (p==u)
if (strchr(v, s[p]))
return 1;
else
return 0;
else
{mij=(p+u)/2;
return (voc(p, mij)+voc(mij+1, u));
}
}
int main()
{cin.get(s,101);
n=strlen(s);
cout<<voc (0, n-1);
//cout<<r;
return 0;
}
#include <iostream.h>
#include <string.h>
#include <stdlib.h>
int u;
char s[10];
int joc(int p, int u)
{int mij;
if(p==u&&strcmp(s,"egal")==0)
return p;
else
{mij=(p+u)/2;
cout<<"Cum este nr fata de "<<mij;
cin.get(s,10);
cin.get();
if(strcmp (s, "mai mare")==0)
return joc(mij+1, u);
if(strcmp(s,"mai mic")==0)
return joc(p, mij);
}
}
int main()
{cout<<"Numarul cautat este="<<joc(1,101);

return 0;
}
#include<iostream.h>
int n,i,v[100];
void interclasare(int p,int m,int q)
{int i,j,k,b[100];
i=p;
j=m+1;
k=1;
while(i<=m && j<=q)
if(v[i]<v[j])
b[k++]=v[i++];
else
b[k++]=v[j++];
while(i<=m)
b[k++]=v[i++];
while(j<=q)
b[k++]=v[j++];
for(i=p;i<=q;i++)
v[i]=b[i-p+1];
}
void merge(int p, int q)
{int mij;
if(p<q)
{mij=(p+q)/2;
merge(p,mij);
merge(mij+1,q);
interclasare(p,mij,q);}}
int main()
{cin>>n;
for(i=1;i<=n; i++)
cin>>v[i];
merge(1,n);
for(i=1;i<=n; i++)
cout<<v[i]<<" ";
return 0;
}
#include <iostream.h>
#include <fstream.h>
int pr[15][4],n, x[15],aux,t;
ifstream f("date.in");
char s[15][20], s1[20];
void citire ()
{ int i,j;

f>>n>>t;
for(i=1; i<=n; i++)
{f.getline(s[i], 20);
for(j=1; j<=4; j++)
f>>pr[i][j];
x[i]=(pr[i][3]-pr[i][1])*60+(pr[i][4]-pr[i][2]);
}
}
void ordonare()
{int m,ord ;
m=n;
do
{ord=1;
for(int i=1; i<=m-1; i++)
{if(x[i]<=x[i+1])
{aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
strcpy(s1, s[i]);
strcpy(s[i],s[i+1]);
strcpy(s[i+1], s1);
ord=0;}
}
m=m-1;}
while(ord==0);
}
void orar()
{int i,k=1;
while (t>0 && k<=n)
{if(x[k]<t)
{cout<<s[i]<<endl;
t=t-x[k];}
k++;}
}
int main()
{citire();
ordonare();
orar();
return 0;
}
#include <iostream.h>
int a[20], pr[20]={0},np[20]={0},max,aux,n,m,ord,sum=0,k=1, j=1 ;
void citire()
{cin>>n;
for(int i=1; i<=n; i++)

cin>>a[i];
cin>>max;
}
int prim(int x)
{for(int d=2; d<=x/2; d++)
if(x%d==0)
return 0;
return 1;
}
void creare()
{
for(int i=1; i<=n; i++)
if(prim(a[i])==1)
pr[k++]=a[i];
else
np[j++]=a[i];
}
void ordonare_c()
{ m=j;
do
{ord=1;
for(int i=1; i<=m-1; i++)
{if(pr[i]<=pr[i+1])
{aux=pr[i];
pr[i]=pr[i+1];
pr[i+1]=aux;ord=0;}
m=m-1;}}
while(ord==0);
}
void ordonare_d()
{ m=k;
do
{ord=1;
for(int i=1; i<=m-1; i++)
{if(pr[i]>=pr[i+1])
{aux=pr[i];
pr[i]=pr[i+1];
pr[i+1]=aux;
ord=0;}
m=m-1;}}
while(ord==0);
}
void afis()
{for(int i=1; i<=max; i++)
{cout<<pr[i]<<" ";
sum=sum+pr[i];}

cout<<endl;
int i=1;
while(sum>0&&i<=k)
{cout<<np[i]<<" ";
sum=sum-np[i];i++;}
}
int main()
{citire();
creare();
ordonare_c();
ordonare_d();
afis();
return 0;}
#include<iostream.h>
int v[10],n,m;
void citire()
{cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>v[i];}
void ordonare()
{int aux;
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
if(v[i]<v[j])
{aux=v[i];
v[i]=v[j];
v[j]=aux;}}
void premiu()
{int s=0;
for(int i=1;i<=m;i++)
s=s+v[i];
cout<<s<<endl;
for(int i=1;i<=m;i++)
cout<<v[i];}
int main()
{citire();
ordonare();
premiu();
return 0;
}
#include<iostream.h>
#include<fstream.h>
ifstream f("10.in");
ofstream g("10.out");

int a[10],b[10],m,n;
void cit()
{f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=m;i++)
f>>b[i];
}
void ord(int v[],int k)
{int i,j,aux;
for(i=1;i<k;i++)
for(j=i+1;j<=k;j++)
if(v[i]>v[j])
{aux=v[i]; v[i]=v[j]; v[j]=aux;}
}
void p()
{int s=0;
int i=1,j,k;
while(a[i]<0)
{s+a[i]*b[i];
i++;}
j=n; k=m;
while(j>=i)
{s+a[j]*b[k];
k--;j--;}
g<<s;}
int main()
{cit();
ord(a,n);
ord(b,m);
p();
return 0;}
#include<iostream.h>
#include<fstream.h>
ifstream f("date.in");
int a[10],b[10],m,n;
void cit()
{f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=m;i++)
f>>b[i];
}
void ord(int v[],int k)
{int i,j,aux;

for(i=1;i<k;i++)
for(j=i+1;j<=k;j++)
if(v[i]>v[j])
{aux=v[i];
v[i]=v[j];
v[j]=aux;}
}
void p()
{int s=0;
int i=1,j,k;
while(a[i]<0 &&k<n)
{s=s+a[i]*b[i];
i++;}
j=n; k=m;
while(j>=i)
{s=s+a[j]*b[k];
k--;j--;}
cout<<s;}
int main()
{cit();
ord(a,n);
ord(b,m);
p();
return 0;}
#include <iostream.h>
#include<fstream.h>
ifstream f("date.in");
int v[100],n ,g,i,k;
void citire()
{f>>n>>g;
for(int i=1; i<=n; i++)
f>>v[i];
}
void creare()
{int i,j,ok;
for(i=1; i<=n; i++)
{ ok=0;
for(j=i+1;i<=n && ok==0; i++)
if(v[i]+v[j]<=g)
{v[j]=v[j]+v[i];
ok=1;
v[i]=0;}}
}
int main()
{citire();

creare();
for(i=1; i<=n; i++)
if(v[i]>0)
k++;
cout<<k;
return 0;
}