Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <limits.h>
- int minprzek (int A[], int B[], int n)
- {
- int l = 0, p = n - 1, min = INT_MAX, it = -1;
- while (l < p)
- {
- int s = (l + p) / 2;
- int x = A[s], y = B[s];
- if (x * x + y * y < min)
- {
- it = s;
- min = x * x + y * y;
- }
- if (A[s] < B[s]) l = s + 1;
- else p = s;
- }
- l = it; p = n - 1;
- while (l < p)
- {
- int s = (l + p + 1) / 2;
- int x = A[s], y = B[s];
- if (x * x + y * y < min)
- {
- it = s;
- min = x * x + y * y;
- }
- if (A[s] > B[s]) p = s - 1;
- else l = s;
- }
- return it;
- }
- int main ()
- {
- int A[] = {0}, B[] = {0}, n = 1;
- int k = minprzek (A, B, n);
- printf ("%d", k);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement