Răspuns:
Pseudocod
int i, n, impar1, impar2, sir;
cat timp(i<=sir) executa
| citeste i;
| daca(i>0 AND i%2<>0) atunci
| | impar1 <- i;
| ------ sfarsit de daca;
| daca(i=0) atunci
| | break;
| ----sfarsit de daca;
| n <- i+1;
| citeste n;
| daca(n>0 AND n%2<>0) atunci
| | impar2 <-n;
| -----sfarsit de daca;
| daca(n=0) atunci
| | break;
| ---sfarsit de daca;
| i++;
----sfarsit de cat timp;
Afiseaza impar1 impar2;