Guest User

Untitled

a guest
Jan 22nd, 2019
89
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.71 KB | None | 0 0
  1. #!/usr/bin/perl
  2. use Data::Dumper;
  3. use strict;
  4. use warnings;
  5.  
  6. # Complete the divisibleSumPairs function below.
  7. sub divisibleSumPairs {
  8. my $n = shift;
  9. my $k = shift;
  10. my $ar = shift;
  11. my $sum = 0;
  12. my $r =0;
  13. for my $u1(0 .. ($n-1) ){
  14. for my $u2 ( ($u1+1) .. $n){
  15. $sum = $ar->[$u1] + $ar->[$u2];
  16. my $kk = $sum % $k;
  17. if (!($sum % $k)){
  18. $r++;
  19. }
  20. }
  21. }
  22. return $r;
  23. }
  24.  
  25. open(my $fptr, '>', $ENV{'OUTPUT_PATH'});
  26.  
  27. my $nk = <>;
  28. $nk =~ s/\s+$//;
  29. my @nk = split /\s+/, $nk;
  30.  
  31. my $n = $nk[0];
  32. $n =~ s/\s+$//;
  33.  
  34. my $k = $nk[1];
  35. $k =~ s/\s+$//;
  36.  
  37. my $ar = <>;
  38. $ar =~ s/\s+$//;
  39. my @ar = split /\s+/, $ar;
  40.  
  41. $n--;
  42.  
  43. my $result = divisibleSumPairs $n, $k, \@ar;
  44.  
  45. print $fptr "$result\n";
  46.  
  47. close $fptr;
Add Comment
Please, Sign In to add comment