Advertisement
Guest User

Untitled

a guest
Nov 20th, 2017
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.94 KB | None | 0 0
  1. #include <stdio.h>
  2. main()
  3. {
  4. FILE *fdat, *fres;
  5.  
  6. fdat=fopen("cdepi081.res","r");
  7. fres=fopen("cdepi082.res","w");
  8.  
  9. int i, numDossard[31], temps[31][6][4];
  10. int hTot[31], minTot[31], secTot[31], j, nb;
  11. char nom[31][14];
  12. char nat[31][4];
  13. int ind[31];
  14. int place[31];
  15.  
  16. void classement (int , int [][6][4], int[], int, int[] );
  17.  
  18.  
  19. i = 1;
  20. fscanf (fdat,"%2d", &numDossard[i]);
  21.  
  22. while ( !feof(fdat) )
  23. {
  24. fscanf (fdat,"%13s", &nom[i]);
  25. fscanf (fdat,"%3s", &nat[i]);
  26. for ( j = 1 ; j <= 5 ; j++ )
  27. {
  28. fscanf ( fdat,"%1dh%2dm%2ds", &temps[i][j][1], &temps[i][j][2], &temps[i][j][3] );
  29. }
  30. fscanf ( fdat,"%2dh%2dm%2ds", &hTot[i], &minTot[i], &secTot[i] );
  31.  
  32. i++;
  33. fscanf (fdat,"%2d", &numDossard[i]);
  34. }
  35. nb = i - 1;
  36. printf ("%2d", nb);
  37.  
  38. for ( i = 1 ; i <= nb ; i++ )
  39. {
  40. ind[i] = i;
  41. place[i] = i;
  42. }
  43.  
  44. int k = 1;
  45. //classement (nb, temps, ind, 1);
  46. for ( j = 1 ; j <= 5 ; j++ )
  47. {
  48. classement (nb, temps, ind, j, place);
  49. fprintf (fres,"\nClassement de l'étape n°%1d", j);
  50. fprintf (fres,"\n-------------------------\n\n");
  51.  
  52.  
  53. for ( i = 1 ; i <= nb ; i++ )
  54. {
  55.  
  56. }
  57. }
  58.  
  59.  
  60. }
  61.  
  62. void classement (int nb, int temps[][6][4], int ind[], int e, int place[])
  63. {
  64. int i,j;
  65.  
  66. for ( i = 1 ; i < nb ; i++ )
  67. {
  68. for ( j = i+1 ; j <= nb ; j++ )
  69. {
  70. if ( temps[ind[i]][e][1] > temps[ind[j]][e][1] )
  71. {
  72. ind[0]=ind[i];
  73. ind[i]=ind[j];
  74. ind[j]=ind[0];
  75. }
  76. else if ( temps[ind[i]][e][1] == temps[ind[j]][e][1] )
  77. {
  78. if ( temps[ind[i]][e][2] > temps[ind[j]][e][2] )
  79. {
  80. ind[0]=ind[i];
  81. ind[i]=ind[j];
  82. ind[j]=ind[0];
  83. }
  84. }
  85. else if ( temps[ind[i]][e][2] == temps[ind[j]][e][2] )
  86. {
  87. if ( temps[ind[i]][e][3] > temps[ind[j]][e][3] )
  88. {
  89. ind[0]=ind[i];
  90. ind[i]=ind[j];
  91. ind[j]=ind[0];
  92. }
  93. }
  94. }
  95. }
  96.  
  97.  
  98.  
  99.  
  100.  
  101.  
  102.  
  103. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement