fork 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 - 1); ++i) {
  14. int evenNo = 0, oddNo = 0;
  15. int xCounter = x;
  16. for (int j = i ; xCounter ; ++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 0.01s 5288KB
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 
3 2 2 2 4 8 5 
2 2 2 4 8 5 9 
2 2 4 8 5 9 6 
2 4 8 5 9 6 2 
4 8 5 9 6 2 4 
8 5 9 6 2 4 0 
5 9 6 2 4 0 0 
9 6 2 4 0 0 1 
6 2 4 0 0 1 5 
2 4 0 0 1 5 9 
4 0 0 1 5 9 7 
0 0 1 5 9 7 7 
0 1 5 9 7 7 8 
1 5 9 7 7 8 6 
5 9 7 7 8 6 4 
9 7 7 8 6 4 4 
7 7 8 6 4 4 4 
7 8 6 4 4 4 0 
8 6 4 4 4 0 2 
6 4 4 4 0 2 1 
4 4 4 0 2 1 1 
4 4 0 2 1 1 2 
4 0 2 1 1 2 3 
16