diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
| commit | c52b36c6a37fdb1d1de146d3939cb42e2c691f44 (patch) | |
| tree | b13bbc546bf9505c875dde5d26424d39d23054c9 /codeforces/ThePowerSum/ThePowerSum.cpp | |
| parent | b79a55ceee2f4532ef6621f9d86c6c61543ce6c9 (diff) | |
| download | competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.tar.xz competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.zip | |
Solved 6 problem in filtrationContest and restructured the repo
Diffstat (limited to 'codeforces/ThePowerSum/ThePowerSum.cpp')
| -rw-r--r-- | codeforces/ThePowerSum/ThePowerSum.cpp | 36 |
1 files changed, 36 insertions, 0 deletions
diff --git a/codeforces/ThePowerSum/ThePowerSum.cpp b/codeforces/ThePowerSum/ThePowerSum.cpp new file mode 100644 index 0000000..7f7e032 --- /dev/null +++ b/codeforces/ThePowerSum/ThePowerSum.cpp @@ -0,0 +1,36 @@ +#include<bits/stdc++.h> + +using namespace std; + +int power(int base, int p){ + if(p == 0) { + return 1; + } + return base * (power(base, p - 1)); +} + +vector<int> ans; + +int powerSum(int x, int n, int lastDigit) { + if (x == 0) { + for(int x : ans) { + cout << x << "^" << n << " + "; + } + cout << endl; + return 1; + } + int sum = 0; + for(int i = lastDigit; x - power(i, n) >= 0; i++) { + ans.push_back(i); + sum += powerSum(x - power(i, n), n, i + 1); + ans.pop_back(); + } + return sum; +} + +int main() { + int x, n, count = 0; + cin >> x >> n; + cout << powerSum(x, n, 1) << endl; + return 0; +} |
