Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<map>
- #include<vector>
- using namespace std;
- int dano[10];
- int a[1000000];
- void PrintArr(int* arr){
- printf("\n");
- for (int i = 1; i < 10; ++i)
- {
- printf("%d ", arr[i]);
- }
- }
- void Digify(int* arr){
- bool isInc = false;
- int sum= 0;
- for (int i =1; i < 10; ++i)
- {
- sum +=arr[i]*i;
- }
- PrintArr(arr);
- printf(" - %d", sum);
- ++a[sum];
- for (int i = 1; i < 10; ++i)
- {
- if(arr[i] < dano[i]) {
- arr[i]++;
- for (int j = 1; j < i; ++j)
- {
- arr[j] = 0;
- }
- isInc = true;
- break;
- }
- }
- if(!isInc) {
- return;
- } else Digify(arr);
- }
- int main(){
- int b[10];
- for (int i = 1; i < 10; ++i)
- {
- b[i]= 0;
- scanf("%d",dano+i);
- }
- Digify(b);
- int ans = 0;
- while(ans < 10000){
- ans++;
- if(a[ans] == 0)
- break;
- }
- printf("answer is %d\n", ans);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement