nikolas_serafini

Lista 4 - Exercício 14

Jun 22nd, 2013
55
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 1.49 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int main()
  4. {
  5.     int quant,begin,end,i,j,k,aux,number;
  6.  
  7.     doAgain : printf("Entre com o intervalo para o sorteio : (menor/maior)\n");
  8.     scanf("%d %d",&begin,&end);
  9.     if (begin > end)
  10.         goto doAgain;
  11.     printf("Entre com a quantidade de sorteios :\n");
  12.     scanf("%d",&quant);
  13.  
  14.     int vector[end - begin + 1],support[end - begin +1];
  15.  
  16.     for (i = 0; i <= (end - begin); i++)
  17.     {
  18.         vector[i] = 0;
  19.     }
  20.     for (i = 0; i < quant; i++)
  21.     {
  22.         printf("Entre com o numero sorteado :\n");
  23.         scanf("%d",&number);
  24.         vector[number - begin]++;
  25.     }
  26.  
  27.     printf("Distribuicao dos numeros :\n");
  28.     for (i = 0; i < (end - begin); i++)
  29.     {
  30.         printf("Numero %d : %d vez(es) (%.2f%c)\n",i+begin,vector[i],(float)vector[i]/quant*100,37);
  31.         support[i] = i+begin;
  32.     }
  33.  
  34.     k = end - begin-1;
  35.     for (i = 0; i < (end - begin); i++)
  36.     {
  37.         for (j = 0; j < k; j++)
  38.         {
  39.             if (vector[j+1] > vector[j])
  40.             {
  41.                 aux = vector[j];
  42.                 vector[j] = vector[j+1];
  43.                 vector[j+1] = aux;
  44.                 aux = support[j];
  45.                 support[j] = support[j+1];
  46.                 support[j+1] = aux;
  47.             }
  48.         }
  49.         k--;
  50.     }
  51.  
  52.     printf("\nDistribuicao ordenada :\n");
  53.     for (i = 0; i < (end - begin); i++)
  54.     {
  55.         printf("Numero %d : %d vez(es) (%.2f%c)\n",support[i],vector[i],(float)vector[i]/quant*100,37);
  56.     }
  57.  
  58. }
Advertisement
Add Comment
Please, Sign In to add comment