fork(1) download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_LENGTH = 100;
  5.  
  6. int main() {
  7. int n, x, v[MAX_LENGTH + 1];
  8. cin >> n >> x;
  9. for (int i = 1; i <= n; ++i) {
  10. cin >> v[i];
  11. }
  12. int genCounter = 0;
  13. for (int i = 1; i <= n - x; ++i) {
  14. int evenNo = 0, oddNo = 0;
  15. int xCounter = x;
  16. for (int j = i ; xCounter > 0 && j <= n; ++j, --xCounter) {
  17. cout << v[j] <<" ";
  18. if (v[j] % 2 == 0) {
  19. ++evenNo;
  20. } else {
  21. ++oddNo;
  22. }
  23. }
  24. cout << "\n";
  25. if (evenNo >= (oddNo + oddNo)) {
  26. cout << evenNo <<"." << oddNo <<",|";
  27. ++genCounter;
  28. }
  29. cout << genCounter <<"+" << i <<"|";
  30. }
  31. cout << genCounter;
  32. return 0;
  33. }
Success #stdin #stdout 0s 5296KB
stdin
30 7
1 3 2 2 2 4 8 5 9 6 2 4 0 0 1 5 9 7 7 8 6 4 4 4 0 2 1 1 2 3 
stdout
1 3 2 2 2 4 8 
5.2,|1+1|3 2 2 2 4 8 5 
5.2,|2+2|2 2 2 4 8 5 9 
5.2,|3+3|2 2 4 8 5 9 6 
5.2,|4+4|2 4 8 5 9 6 2 
5.2,|5+5|4 8 5 9 6 2 4 
5.2,|6+6|8 5 9 6 2 4 0 
5.2,|7+7|5 9 6 2 4 0 0 
5.2,|8+8|9 6 2 4 0 0 1 
5.2,|9+9|6 2 4 0 0 1 5 
5.2,|10+10|2 4 0 0 1 5 9 
10+11|4 0 0 1 5 9 7 
10+12|0 0 1 5 9 7 7 
10+13|0 1 5 9 7 7 8 
10+14|1 5 9 7 7 8 6 
10+15|5 9 7 7 8 6 4 
10+16|9 7 7 8 6 4 4 
10+17|7 7 8 6 4 4 4 
5.2,|11+18|7 8 6 4 4 4 0 
6.1,|12+19|8 6 4 4 4 0 2 
7.0,|13+20|6 4 4 4 0 2 1 
6.1,|14+21|4 4 4 0 2 1 1 
5.2,|15+22|4 4 0 2 1 1 2 
5.2,|16+23|16