Finding largest sum of $k$ elements below threshold

I was working on a project and am stuck in the middle unable to find an optimal method to solve this problem. Consider an array $ A$ of $ n$ elements. I have to choose $ k$ elements such that the sum of indices is maximal under the constraint of being less than a given element $ x$ . My approach for this is the naive $ O(n^k)$ algorithm, but this would take a lot of time for large $ n$ .

This is isn’t a homework problem.

How to Delete Code Below the Footer Section

I’m hoping you can give me some advice:

I created a blog post you can see here:

I added videos by embedding the YouTube player. I realized the page became a lot slower. So I tried to fix it by following this tutorial.

I added the script part using google tag manager using custom HTML tag:

Then I added the css under themes, customize, additional css:

The problem is, as you can see near the bottom of the page under the footer the code shows:

I tried to run a system backup using siteground which is my hosting service. But it did not work to revert the change.

Can you give me some tips how I can complete this correctly:

And remove the code at the bottom?

I would really appreciate. -Rey

PS: Before completing the system back up I paused the tag within tag manager and also tried to delete it. But the code at the bottom never went away.

What is the maximum number of attacks given the below constraints for AD&D?

A former DM has had the same recurring NPC/GMPC since I started playing in his game. This was 20+ years ago and we started in 1st edition and slowly made our way through the years and editions. We updated our characters as we went to the new editions. Now this NPC/GMPC is the most reviled in his games, any time he shows up all the players immediately want him dead. We stick to character though.

The question will be broken up to hopefully get expert answers from each of the editions in which we played in this particular question it will be specific to 1e. I am skipping 4e (as we all hated it and only played one session) and 5e because I know for a fact that it is not possible there (yet).

The question is as follows:

Give the following constraints what is the maximum number of attacks in this edition:

  1. NPC is an Elf (This is just to set the prerequisite for the below multiclass possibility).
  2. He was a Thief-Acrobat and I assume multiclassed, probably Fighter-Thief.
  3. The weapon of choice was throwing knives.
  4. Assume unlimited ammunition as he had a bandalier that had the knives return.
  5. I know he could throw 3 knives at a time (pretty sure this was a thing for shuriken from Oriental Adventures).
  6. Assume all official sources and Dragon Magazine since the first issue are open.
  7. I know of this question and assume there is a variant with knives.
  8. If I recall he threw with both hands as well.
  9. We were always between 8th and 15th level when I met this character.
  10. I do not recall spell-casting but not ruling it out entirely but main build would likely have been focused on mundane means.
  11. Assume focused magical item augmentation as well, just calling it out even though the aforementioned bandolier alluded to it, but for the most part official items other than that.

The end result in game was quite literally at least 2 dozen attacks per round, perhaps more. Which I have questioned him multiple times about the build and legitimacy but he as refused to provide any answers. I know DMs do not have to justify but this, combined with a number of other things over the years has lead to distrust. I have since stopped playing his games altogether, so this is just a verification on whether I have overreacted.

This was broken into 3 questions for each of the editions.

AD&D, AD&D 2nd Edition, and Dungeons & Dragons 3.X.

Time Complexity of the below code? [duplicate]

This question already has an answer here:

  • Is there a system behind the magic of algorithm analysis? 3 answers

here is a nested loop where all the variable are integers.This is another question to the thread. I understood the solution part , but stuck in the time-complexity part.

What is the time complexity of the below code and how?

def divide(dividend, divisor):     """     :type dividend: int     :type divisor: int     :rtype: int     """     #Time-complexity ??     while dividend>=divisor:         t=0;k=divisor          while dividend>=k:             dividend-=k             k<<=1             q+=1<<t             t+=1      return q 

How to restrict SharePoint permissions for below senerio?

We have a SharePoint integration with CRM.

CRM creates document libraries, folders and document from its system. Back-end is SharePoint.

From CRM system, users cannot access the files created by other users, but how ever users started accessing back end SharePoint site directly to access the files and folders created by other users.

In SharePoint the permissions are inherited from parent site, breaking inheritance is one option but that option could be very tedious as maintain permissions for 300 folders could be difficult.

Is there anyway we can restrict users from access the SharePoint site directly? Or is there any better solution for the above scenario?

CRC(theoretical)-did not understand the highlighted part given below


…….. Well, at the very least, it would be nice to make sure that the CRC did as well as adding a single parity bit. That is, we would like to avoid using any G(x) that did not guarantee we could detect all instances of errors that change an odd number of bits.

->If a received message T'(x) contains an odd number of inverted bits, then E(x) must contain an odd number of terms with coefficients equal to 1.
->As a result, E(1) must equal to 1 (since if x = 1 then xi = 1 for all i).
->If G(x) is a factor of E(x), then G(1) would also have to be 1.
->So, if we make sure that G(1) = 0, we can conclude that G(x) does not divide any E(x) corresponding to an odd number of error bits. In this case, a CRC based on G(x) will detect any odd number of errors.
->As long as G(x) has some factor of the form xi + 1, G(1) will equal 0. So, it isn’t hard to find such a polynomial. ……….