{"push_id":2418268162,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8129bd2ea1890b5cc0fdaeeb797e451b73e314ec","before":"fea8e9b452a224e7862d30a63cf32397a768b776","commits":[{"sha":"8129bd2ea1890b5cc0fdaeeb797e451b73e314ec","author":{"name":"Upendra Sharma","email":"5a41a437ef61d41365880f3863c7f8bd73da22ce@gmail.com"},"message":"Divisible Sum Pairs\n\nYou are given an array of n integers, and a positive integer,k.Find and print the number of (i,j) pairs where i<j and ai+aj is divisible by k\r\nInput Format\r\nThe first line contains 2 space-separated integers, n and k. \r\nThe second line contains n space-separated integers describing the values of ar array\r\nOutput Format\r\nPrint the number of (i,j) pairs where i<j and ai+aj is divisible by k\r\nSample Input\r\n6 3\r\n1 3 2 6 1 2\r\nSample Output\r\n 5","distinct":true,"url":"https://api.github.com/repos/Upendra28sh/Algorithms/commits/8129bd2ea1890b5cc0fdaeeb797e451b73e314ec"}]}
{"actor":{"display_login":"Upendra28sh"}}