Print 'A' 1000 times with BrainFuck What is the best BrainFuck code (in terms of code size) to print 'A' 1000 times ?

My approach is:


set 'A' to p[0]
set 255 to p[1] to display 255 'A', 3 times
set 235 to p[1] to display 235 'A'


This is not effective but I cannot find a way to use tow counters simultaneously like a multiplication

Is there a better approach than a multiplication ?

A more general question: is there a rule to make a multiplication with a large number with the smallest possible code?
The method you seem to currently be using is 39 bytes:

&gt;&gt;+++[&lt;-[-&lt;.&gt;]&gt;-]++++[&lt;-----&gt;-]&lt;-[-&lt;.&gt;] (not including getting the A) (Try It Online!)

(loop 3 times, each time set the counter to 255 and print that many times, then subtract 20, subtract 1, and print that many times)

However, it is much shorter to loop 250 times and print 4 times each time (thanks to jimmy23013 for optimizing this over my original loop-4 loop-250 print-1 solution):

&gt;------[&lt;....&gt;-] (16 bytes)

If your cells are unbounded (I'm assuming they're 8-bit otherwise you probably wouldn't try using 255 for golfing):

&gt;&gt;++++++++++[&lt;++++++++++[&lt;..........&gt;-]&gt;-] (42 bytes).