Source code for submission s1113

fq.cpp

  1. #include <cstdio>
  2. #include <iostream>
  3. #include <algorithm>
  4. #include <vector>
  5. #include <set>
  6. #include <map>
  7. #include <string>
  8. #include <cmath>
  9. #include <cstdlib>
  10. #include <cstring>
  11. #include <sstream>
  12.  
  13. #include <stdio.h>
  14. #include <ctype.h>
  15. #include <math.h>
  16. #include <string.h>
  17. #include <stdlib.h>
  18.  
  19. using namespace std;
  20.  
  21. #define X first
  22. #define Y second
  23. #define MP make_pair
  24. #define PB push_back
  25. #define SZ size
  26.  
  27.  
  28.  
  29. int main(void) {
  30. /*
  31. string riadok;
  32. vector<int> pole5;
  33. vector<int> pole10;
  34. int pole[1005];
  35.  
  36. while(1) {
  37. getline(cin, riadok);
  38. if(!cin) return 0;
  39. pocet = riadok.SZ();
  40. int pocet5 = pocet / 2, pocet10 = pocet / 2;
  41. for (i = 0; i < pocet; i++) {
  42. if (riadok[i] == '(') {
  43. pole[i] = 5;
  44. pole5.PB(i);
  45. pocet5--;
  46. } else if (riadok[i] == ')') {
  47. pole[i] = 10;
  48. pole10.PB(i);
  49. pocet10--;
  50. } else
  51. pole[i] = 0;
  52. }
  53. if (pole[0] == 10) {
  54. cout << "0\n";
  55. continue;
  56. }
  57. if (pole[0] == 0) {
  58. pole[0] = 5;
  59. pocet5--;
  60. }
  61.  
  62. int pocitaj = 0;
  63. for (int i=1; i < pocet; i++) {
  64. while(pole[i] != 0) {
  65. pocitaj++;
  66. i++;
  67. }
  68.  
  69.  
  70.  
  71.  
  72. }
  73.  
  74.  
  75. }*/
  76.  
  77. return 0;
  78. }
  79.  
  80.