Advertisement
Guest User

Untitled

a guest
Apr 1st, 2020
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Pascal 0.42 KB | None | 0 0
  1. //Необходимо определить количество пар, для которых произведение элементов делится без остатка на 10.
  2.  
  3. var k, i, j, N : integer;
  4. a : array[1..1001] of integer;
  5.  
  6. begin
  7. readln(N);
  8. for i:=1 to N do
  9.     readln(a[i]);
  10. k := 0;
  11. for i:=1 to N - 1 do
  12.     for j := i + 1 to N do
  13.         if (a[i] * a[j] mod 10 = 0) then inc(k);
  14. writeln(k);
  15.  
  16. end.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement