II.

2 PRE PIM

struct complex{float pre,pim;}z[20];

II.3
a[i][j]=(i-1)*5+j
12345
6 7 8 9 10
III.1
int cifreprime(int n)
{int s=0;
while(n!=0)
{if(n%10==2 || n%10==3|| n%10==5|| n%10==7) s=s+n%10;
n=n/10;}
return s;}
II.2
int main()
{char s[101],*p1,*p2,*p3,*aux,rez[4];;
int i,ok=1;
cin.getline(s,100);
p1=strtok(s,' ');p2=strtok(NULL,' ');

i=0;
while(strchr("aeiou",p1[i])!=NULL && i<strlen(p1)) i++; // se cauta prima consoana
if(i==strlen(p1)) ok=0;//cand nu gasim consoana indicam cu ok=0;fals
else rez[0]=p1[i];//se puna prima consoana
i=0;
while(strchr("aeiou",p2[i])==NULL && i<strlen(p2)) i++; // se cauta prima vocala
if(i==strlen(p2)) ok=0;//cand nu gasim vocala indicam cu ok=0;fals
else rez[1]=p2[i];//se puna vocala in sirul rez
while(p2)
{strcpy(aux,p2);
p2=strtok(NULL,' ');}
//in aux avem ultimul cuvant din sirul s
rez[2]=aux[strlen(aux)-1];
rez[3]=NULL;
if(ok==1) cout<<rez;
else cout<<"Nu exista";
return 0;}