fork(2) download
  1. #include <stdio.h>
  2.  
  3. int min(int arr[], int len) {
  4. if (len == 1) return arr[0];
  5. int m = arr[0];
  6. for (int i = 0; i < len; i++)
  7. if (arr[i] < m) m = arr[i];
  8. return m;
  9. }
  10.  
  11. int solution(int arr[], int len, int delta) {
  12. int count[delta];
  13. int distance;
  14.  
  15. for (int i = 0; i < delta; i++) count[i] = 0;
  16.  
  17. for (int i = 0; i < len; i++) {
  18. distance = delta - arr[i] % delta;
  19. for (int j = 0; j < delta; j++) {
  20. count[j] += (distance + j) % delta;
  21. }
  22. }
  23.  
  24. return min(count, delta);
  25. }
  26.  
  27. int main() {
  28. int len, delta;
  29. scanf("%d", &len); scanf("%d", &delta);
  30. int arr[len];
  31. for (int i = 0; i < len; i++) scanf("%d", &arr[i]);
  32. printf("%d", solution(arr, len, delta));
  33. }
  34.  
Success #stdin #stdout 0s 9424KB
stdin
6 4
9 3 7 6 11
stdout
6