fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. typedef long long ll;
  4.  
  5. int main(void)
  6. {
  7.     int a;int j=0;
  8.     while(cin >> a){
  9.         j++;
  10.         ll sum=1;
  11.         int in;
  12.         bool check = true;
  13.         for(int b=0;b<a;b++){
  14.             cin >> in;
  15.             if(in>0)sum*=in;
  16.             check = false;
  17.  
  18.         }
  19.         if(check==true)sum=0;
  20.         printf("Case #%d: The maximum product is ",j);
  21.         cout << sum << "." <<endl;
  22.         cout << endl;
  23.     }
  24.  
  25.     return 0;
  26. }
  27.  
Success #stdin #stdout 0s 2732KB
comments (?)
stdin
copy 
4
2 -4 6 9

15
-3 -10 7 9 0 7 5 -9 5 0 2 -6 1 -2 -9

13
5 -2 -9 -2 9 -6 0 4 -8 -8 -7 -4 8

13
1 -8 -10 -4 -10 -1 -10 3 -2 4 -7 10 6

15
-3 8 7 -9 -7 7 -1 10 -10 7 3 -10 9 5 -4

6
5 6 6 3 10 4

17
10 -4 -1 1 -3 -2 -3 -10 3 -8 6 4 -5 2 -10 -6 0

12
6 1 3 -2 7 -4 -8 2 -9 3 1 3

7
-1 10 -7 10 -6 0 -6

10
-8 -4 9 5 1 -2 5 4 8 2

16
-2 -8 5 -7 -1 7 3 -2 -1 -8 -9 -9 1 9 -7 -2

9
3 3 -5 3 9 -9 -3 -2 -1

3
10 -5 2

4
1 2 -10 4

13
5 -3 -3 -9 -1 -4 -7 8 -6 -4 -7 -6 7

15
-2 -1 1 -3 5 9 7 5 6 10 -6 -9 0 6 -9

18
5 6 -3 -9 7 4 -3 10 -1 -1 -7 2 3 10 -4 9 -3 7

13
10 3 -10 4 -2 10 6 -1 -3 1 0 -3 -5

16
4 -6 10 -3 1 8 6 8 -10 -4 -1 9 2 -3 -7 -4

6
-8 7 1 4 -6 -2

13
1 4 10 9 -10 -7 -9 5 -5 -10 10 5 8

3
2 7 8

10
5 -1 -4 8 3 7 10 -1 -2 3

9
4 10 -9 -3 7 10 -2 10 -10

7
-5 9 8 8 7 1 -1

9
-2 0 -5 5 6 -10 -5 0 10

9
6 0 -6 0 -3 -7 7 -7 -8

18
-9 -10 -10 -4 10 9 -7 4 -3 0 -6 4 8 -1 -2 1 -3 2

5
-4 -7 7 4 -2

1
-10

4
-9 -9 2 -9

12
2 -8 -4 1 -10 -3 -6 -3 8 -4 9 5

17
-5 -4 10 7 -5 -7 10 -9 5 -5 -4 5 5 -3 5 -4 -2

6
6 -2 -7 -5 -2 0

2
4 -3

18
0 -10 -4 5 -4 -4 1 1 -3 1 0 -8 4 6 5 -2 -10 -1

4
-3 -4 -4 5

13
1 -9 9 8 3 -6 1 -8 -6 6 8 0 10

18
9 -4 7 -4 -2 -1 -8 -7 7 -10 0 -3 -3 6 3 -10 -6 -7

2
-9 9

16
-5 0 4 -1 -7 -1 7 -8 6 3 -4 0 9 3 9 9

18
4 8 -7 -10 -6 10 1 -8 -9 4 -9 -10 0 3 -5 10 -3 2

7
4 -4 -10 -1 7 -3 10

18
10 8 0 3 1 -3 6 -1 0 3 10 2 3 1 4 3 -9 -4

17
9 1 -2 10 -5 3 10 2 -1 -6 1 -8 -7 -3 3 4 6

12
0 -5 -3 -10 -6 10 3 6 1 -4 7 7

6
5 -4 -2 2 -1 -10

10
9 0 6 0 0 8 5 -10 1 0

17
9 5 -5 10 10 -6 0 3 5 6 -1 0 6 -9 4 -6 4

7
-6 -7 9 2 7 -2 -10

1
-8

10
-7 3 9 10 -5 -8 7 -6 -4 -3

12
10 -10 -7 -3 7 -7 -10 9 7 -10 -8 8

2
3 4

12
3 -4 -5 1 -3 8 -2 -6 -9 0 -9 -5

17
-4 -10 3 -4 -9 10 -10 -6 8 9 9 8 10 6 5 2 -2

18
-8 2 -6 1 7 -10 9 -10 -9 -2 10 -6 -8 -5 -8 5 0 -6

2
0 -4

8
-3 -5 -2 -4 9 -10 6 -6

16
6 4 -9 -4 -2 10 -5 -1 9 3 -4 -9 3 0 -7 -2

3
-3 -10 -3

13
0 4 7 6 8 3 4 1 6 1 -4 -1 1

9
8 -2 4 -6 -3 -6 0 -2 8

9
-1 -5 7 5 -7 -6 -4 1 6

7
-5 2 3 9 -10 -2 0

17
6 -10 6 1 -2 -1 3 3 1 -10 9 -2 9 -2 3 5 -8

15
7 -4 -5 1 -4 0 -8 7 -4 -8 -7 6 -3 9 4

7
-3 -10 -3 10 1 9 10

2
-4 8

8
8 3 6 1 -3 -9 4 8

8
-9 8 -7 -2 9 -4 -9 -7

12
4 -6 -1 2 -1 -4 -8 -3 -4 0 4 -7

4
-1 4 9 8

11
8 2 7 -8 3 5 -6 9 1 -2 -10

3
1 2 6

4
-7 -5 -6 -7

14
0 2 -9 1 5 0 -5 2 -2 -6 -1 8 -10 0

9
3 4 -3 -7 -9 -5 6 0 7

16
-4 8 2 0 -10 -8 8 2 -7 -4 -5 2 1 5 10 3

8
5 4 1 -8 -6 -6 -1 -4

11
2 10 4 -2 -2 10 -5 -10 -3 -6 -10

18
4 -9 -1 9 3 10 3 0 1 3 -6 -6 -7 -3 -4 -4 4 2

11
-4 1 -9 2 8 -9 8 6 -4 -9 4

4
3 5 8 2

12
5 -8 6 -5 5 -10 -3 7 -5 4 -8 9

1
0

6
3 1 5 0 0 2

7
7 1 7 -7 -7 1 -10

2
7 3

6
3 9 -4 3 -7 -8

11
7 -8 4 9 2 7 1 -9 1 9 1

10
-9 -5 -1 6 -2 0 -6 -4 -9 -9

7
5 2 6 9 -8 7 -9

1
4

5
1 0 4 -5 -10

13
4 7 -7 2 6 -3 -10 1 5 -1 5 10 0

18
7 -8 -5 0 -10 -5 -4 10 -8 8 -9 2 -3 5 7 -5 -3 -1

6
-2 -10 5 5 10 -7

6
-2 7 -3 6 0 -9

4
4 1 6 9
stdout
copy 
Case #1: The maximum product is 108.

Case #2: The maximum product is 22050.

Case #3: The maximum product is 1440.

Case #4: The maximum product is 720.

Case #5: The maximum product is 3704400.

Case #6: The maximum product is 21600.

Case #7: The maximum product is 1440.

Case #8: The maximum product is 2268.

Case #9: The maximum product is 100.

Case #10: The maximum product is 14400.

Case #11: The maximum product is 945.

Case #12: The maximum product is 243.

Case #13: The maximum product is 20.

Case #14: The maximum product is 8.

Case #15: The maximum product is 280.

Case #16: The maximum product is 567000.

Case #17: The maximum product is 31752000.

Case #18: The maximum product is 7200.

Case #19: The maximum product is 276480.

Case #20: The maximum product is 28.

Case #21: The maximum product is 720000.

Case #22: The maximum product is 112.

Case #23: The maximum product is 25200.

Case #24: The maximum product is 28000.

Case #25: The maximum product is 4032.

Case #26: The maximum product is 300.

Case #27: The maximum product is 42.

Case #28: The maximum product is 23040.

Case #29: The maximum product is 28.

Case #30: The maximum product is 1.

Case #31: The maximum product is 2.

Case #32: The maximum product is 720.

Case #33: The maximum product is 437500.

Case #34: The maximum product is 6.

Case #35: The maximum product is 4.

Case #36: The maximum product is 600.

Case #37: The maximum product is 5.

Case #38: The maximum product is 103680.

Case #39: The maximum product is 7938.

Case #40: The maximum product is 9.

Case #41: The maximum product is 1102248.

Case #42: The maximum product is 76800.

Case #43: The maximum product is 280.

Case #44: The maximum product is 3110400.

Case #45: The maximum product is 388800.

Case #46: The maximum product is 8820.

Case #47: The maximum product is 10.

Case #48: The maximum product is 2160.

Case #49: The maximum product is 38880000.

Case #50: The maximum product is 126.

Case #51: The maximum product is 1.

Case #52: The maximum product is 1890.

Case #53: The maximum product is 35280.

Case #54: The maximum product is 12.

Case #55: The maximum product is 24.

Case #56: The maximum product is 93312000.

Case #57: The maximum product is 6300.

Case #58: The maximum product is 1.

Case #59: The maximum product is 54.

Case #60: The maximum product is 19440.

Case #61: The maximum product is 1.

Case #62: The maximum product is 96768.

Case #63: The maximum product is 256.

Case #64: The maximum product is 210.

Case #65: The maximum product is 54.

Case #66: The maximum product is 393660.

Case #67: The maximum product is 10584.

Case #68: The maximum product is 900.

Case #69: The maximum product is 8.

Case #70: The maximum product is 4608.

Case #71: The maximum product is 72.

Case #72: The maximum product is 32.

Case #73: The maximum product is 288.

Case #74: The maximum product is 15120.

Case #75: The maximum product is 12.

Case #76: The maximum product is 1.

Case #77: The maximum product is 160.

Case #78: The maximum product is 504.

Case #79: The maximum product is 76800.

Case #80: The maximum product is 20.

Case #81: The maximum product is 800.

Case #82: The maximum product is 77760.

Case #83: The maximum product is 3072.

Case #84: The maximum product is 240.

Case #85: The maximum product is 37800.

Case #86: The maximum product is 1.

Case #87: The maximum product is 30.

Case #88: The maximum product is 49.

Case #89: The maximum product is 21.

Case #90: The maximum product is 81.

Case #91: The maximum product is 31752.

Case #92: The maximum product is 6.

Case #93: The maximum product is 3780.

Case #94: The maximum product is 4.

Case #95: The maximum product is 4.

Case #96: The maximum product is 84000.

Case #97: The maximum product is 39200.

Case #98: The maximum product is 250.

Case #99: The maximum product is 42.

Case #100: The maximum product is 216.
https://ideone.com/O27Lpr
language:
C++ 4.3.2 (gcc-4.3.2)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!