Построить логические схемы. а) a v b & a(отрицательная) а= 0 в=0

Pascal:
1)
const n = 10;
var a:array [1..n] of integer;
     i:integer;
begin
  randomize;
  for i:=1 to n do
   begin
    a[i]:=random(21)-10;
    write (a[i]:3);
   end;
  writeln;
  for i:=1 to n do
   begin
    if a[i]>0 then a[i]:=99;
    write (a[i]:3);
   end;
  writeln;
end.

2)
const n = 10;
var a:array [1..n] of integer;
     p,s,i:longint;
begin
  p:=1;
  s:=0;
  randomize;
  for i:=1 to n do
   begin
    a[i]:=random(21)-10;
    if a[i]>0 then p:=p*a[i] else
     if a[i]<0 then s:=s+a[i];
    write(a[i]:3);
   end;
  writeln;
  writeln ('Proizvedenie: ',p);
  writeln ('Summa: ',s);
end.

C++:
1)
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;

int main()
{
  int a[10];
  srand (time(NULL));
  for (int i = 0; i<10; i++)
  {
    a[i] = rand()%20-10;
    cout <<a[i] <<" ";
    if (a[i]>0)
      a[i] = 99;
  }
  cout <<endl;
  for (int i = 0; i<10; i++)
    cout <<a[i] <<" ";
  cout <<endl;
  return 0;
}

2)
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;

int main()
{
  int a[10];
  int p = 1,s = 0;
  srand (time(NULL));
  for (int i = 0; i<10; i++)
  {
    a[i] = rand()%20-10;
    cout <<a[i] <<" ";
    if (a[i]>0)
      p*=a[i];
    else if (a[i]<0) s+=a[i];
  }
  cout <<endl;
  cout <<"Summa: " <<s <<endl
         <<"Proizvedenie: " <<p <<endl;
  return 0;
}

import java.util.*;
import java.lang.*;

class {
public static void main(String[] args){

Scanner sc = new Scanner(System.in); // то для ввода

System.out.print("Enter ch: ");
int ch = sc.nextInt();

int size = 0;
int toWil = 1;
int i = 1;

while(toWil == 1){
ch /= (10 * i);
if(ch == 0){
toWil = 0;
}
else{
size++;
};
};

int arr[] = new int[size];
i = 1;

while(toWil == 0){
ch /= (10 * i);
if(ch == 0){
toWil = 1;
}
else{
arr[i - 1] = ch;
};
};

i = 0;

while(toWil == 1){
arr[i] += 4;
if(arr[i] >= 10){
if(i == (size - 1)) {

}
else{
arr[i + 1] += 1;
};
};


};

for(i = size; i >= 1; i++){
System.out.print(arr[i]);
}

}
}