Advertisement
Guest User

Untitled

a guest
Dec 14th, 2019
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.66 KB | None | 0 0
  1. #include <fstream>
  2. #include <algorithm>
  3. using namespace std;
  4.  
  5. ifstream fin("escape.in");
  6. ofstream fout("escape.out");
  7.  
  8. int c, n, x, i, j, camera[10], cifcontrol, punctaj, numar, v1[1000000], v2[1000000], v[1000000], cam[10];
  9. char ciur[1000000];
  10.  
  11. int main()
  12. {
  13. ciur[0] = ciur[1] = 1;
  14. for(i = 2; i * i <= 1000000; i++)
  15. {
  16. if(ciur[i] == 0)
  17. {
  18. for(j = i * i; j <= 1000000; j += i)
  19. ciur[j] = 1;
  20. }
  21. }
  22.  
  23. for(i = 1; i <= 9; i++)
  24. v[i] = i;
  25.  
  26. fin >> c;
  27. fin >> n;
  28.  
  29. // c = 1
  30.  
  31. for(i = 1; i <= n; i++)
  32. {
  33. fin >> x; // 10190
  34.  
  35. numar = x / 100; // numar = 101
  36. punctaj = x % 100; // numar = 90
  37.  
  38. cifcontrol = x % 9;
  39.  
  40. if(cifcontrol == 0)
  41. cifcontrol = 9;
  42.  
  43. cam[cifcontrol]++;
  44. if(ciur[numar] == 0)
  45. {
  46. v1[cifcontrol] += punctaj;
  47. }
  48. else
  49. {
  50. v2[cifcontrol] += punctaj;
  51. }
  52.  
  53.  
  54.  
  55.  
  56. }
  57.  
  58. int maxim1 = -1, maxim2 = -1;
  59. for(i = 1; i <= 9; i++)
  60. {
  61. if(v1[i] > maxim1)
  62. maxim1 = v1[i];
  63.  
  64. if(v2[i] > maxim2)
  65. maxim2 = v2[i];
  66. }
  67.  
  68. // c = 2;
  69.  
  70. for(i = 1; i < 9; i++)
  71. {
  72. for(j = i + 1; j <= 9; j++)
  73. {
  74. if(cam[i] < cam[j])
  75. {
  76. swap(cam[i], cam[j]);
  77. swap(v[i], v[j]);
  78. }
  79. else if(cam[i] == cam[j] && v[i] > v[j])
  80. swap(v[i], v[j]);
  81. }
  82. }
  83.  
  84. for(i = 1; i <= 9; i++)
  85. {
  86. if(cam[i] != 0)
  87. fout << v[i] << " ";
  88. }
  89.  
  90.  
  91. return 0;
  92. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement