Last active
June 9, 2018 13:33
-
-
Save hansen033/a94998abf92135d37f68497d100b8314 to your computer and use it in GitHub Desktop.
2018/4/19
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<iostream> | |
#include<math.h> | |
using namespace std; | |
int main(){ | |
cout << "How many product are you going to buy in RT-Mart?"; | |
int product; | |
cin >> product; | |
int p[product]; | |
for(int t = 0 ; t < product ; t++){ | |
cout << "What is the NO." << t + 1 << " product price?"; | |
cin >> p[t]; | |
} | |
int rankT = pow(2,product); | |
int rank[rankT][product]; | |
for(int x = 0 ; x < product ; x ++){ | |
int change = pow(2, x); | |
int add = 0; | |
for(int y = 0 ; y < rankT ; y ++){ | |
rank[y][x] = add; | |
if(y % change == 0){ | |
add = (add == 0) ? 1 : 0; | |
} | |
} | |
} | |
int A[rankT] = {0}, B[rankT] = {0}; | |
for(int t = 0 ; t < rankT ; t ++){ | |
for(int t2 = 0 ; t2 < product ; t2 ++){ | |
if(rank[t][t2] == 1){ | |
A[t] += p[t2]; | |
} else{ | |
B[t] += p[t2]; | |
} | |
} | |
} | |
int refound[rankT]; | |
for(int t = 0 ; t < rankT ; t ++){ | |
refound[t] = A[t] % 100 + B[t] % 100; | |
} | |
int most = 0, mostR = 0; | |
for(int t = 0 ; t < rankT ; t ++){ | |
if(refound[t] > mostR){ | |
most = t; | |
} | |
} | |
cout << "A should buy "; | |
for(int t = 0 ; t < product ; t ++){ | |
if (rank[most][t] == 1){ | |
cout << "No." << t + 1 << " "; | |
} | |
} | |
cout << "product(s).\nB should buy "; | |
for(int t = 0 ; t < product ; t ++){ | |
if (rank[most][t] == 0){ | |
cout << "No." << t + 1 << " "; | |
} | |
} | |
cout << "product(s)."; | |
system("Pause"); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment