Advertisement
Guest User

kod

a guest
Apr 21st, 2017
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.15 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <math.h>
  3. #ifndef DEBUG
  4. #define DEBUG(...)printf(__VA_ARGS__)
  5. #endif
  6.  
  7. typedef struct{
  8. int r[10000];
  9. int p[10000]
  10. }meta;
  11. void sort(int array[], int size);
  12. int main(void) {
  13.  
  14. meta m1;
  15. int i,n,m,j;
  16. int x,y;
  17. double ud[10000];
  18.  
  19. scanf("%d",&n);
  20. for(i=0;i<n;i++){
  21. scanf("%d",&m1.r[i]);
  22.  
  23. }
  24. sort(m1.r,n);
  25.  
  26. scanf("%d",&m);
  27. for(i=0;i<m;i++){
  28. scanf("%d %d",&x,&y);
  29. ud[i]=sqrt(x*x+y*y);
  30. }
  31. for(i=0;i<m;i++){
  32. for(j=0;j<n;i++){
  33. if((ud[j]>=m1.p[i])&&(ud[j]<m1.p[i+1])){
  34. m1.p[i]++;
  35. }
  36.  
  37. }
  38. }
  39. for(i=0;i<n;i++){
  40. printf("%d ",m1.p[i]);
  41.  
  42. }
  43.  
  44.  
  45.  
  46.  
  47. return 0;
  48.  
  49. }
  50. void sort(int array[], int size) {
  51. int i, j, min, tmp;
  52.  
  53. for (i = 0; i < size - 1; i++) {
  54. min = i;
  55. for (j = i + 1; j < size; j++) {
  56. if (array[min] > array[j]) {
  57. min = j;
  58. }
  59. }
  60.  
  61. tmp = array[min];
  62. array[min] = array[i];
  63. array[i] = tmp;
  64. }
  65. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement