Advertisement
Saleh127

Untitled

May 1st, 2020
74
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.78 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. int main()
  5. {
  6. ll t,a[10000],f[10000],c=1,d,e,i,j=1,k,l;
  7. f[0]=1;
  8. for(i=1; i<=20; i++)
  9. {
  10. c*=i;
  11. f[j++]=c;
  12. }
  13. cin>>t;
  14. for(ll x=1; x<=t; x++)
  15. {
  16. scanf("%lld",&d);
  17. k=0;
  18. for(j=20; j>=0; j--)
  19. {
  20. if(d>=f[j])
  21. {
  22. d=d-f[j];
  23. a[k++]=j;
  24. }
  25. }
  26. if(d==0)
  27. {
  28. printf("Case %lld: ",x);
  29.  
  30. for(i=k-1; i>=0; i--)
  31. {
  32. if(i==0) printf("%lld!\n",a[i]);
  33. else printf("%lld!+",a[i]);
  34. }
  35. }
  36. else
  37. printf("Case %lld: impossible\n",x);
  38. }
  39. return 0;
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement