How to optimize the PASCAL number program?

Try it with bits.

dk, you want to say bit pressure, right, you can also preprocess 2 n

It doesn't have to be multiplied by 2 every time.

You can multiply it by a much larger number of 2 each time, for example: 2048 This is to reduce the number of operations, and you are driving an integer anyway

By the way, you also need to control the number of multiplications.

Didn't look too closely. Just ask you whether you have 1 digit or 4 digits for each a[i]? Hehe. If you are saving 1 digit. You should know what I'm talking about

varn:longint;

i,j:longint;

out:array[1..500] of longint;

sta:array[1..1000] of longint;Description of the variable.

procedure solve(n:longint);Do it with a process.

beginif n=0 then

exit;Judge whether to do it or not.

solve(n div 2)；Recursion.

for i:=1 to 500 do to do the number of Maisons.

for j:=1 to 500 do

if n mod 2=0

thensta[i+j-1]:=sta[i+j-1]+out[i]*out[j]

elsesta[i+j-1]:=sta[i+j-1]+out[i]*out[j]*2;

for i:=1 to 500 do to handle carrying.

beginout[i]:=sta[i] mod 10;

sta[i+1]:=sta[i+1]+sta[i] div 10;

end；for i:=1 to 1000 do sta[i]:=0

end;begin

readln(n)；Input.

writeln(trunc(ln(2)/ln(10)*n)+1);Output the first line.

out[1]:=1;Assign initial value.

solve(n);Invoke the procedure.

for i:=500 downto 2 do output.

beginwrite(out[i]);

end;writeln(out[1]-1);

end.

Look at the manual.,If you don't know after reading it, it's recommended to read it all over!

Optimizer is actually not difficult at all, just clean up the garbage and organize the memory, if your computer is slow and the performance is not very good, you can help it clean up the temporary junk files, or clean up the note and delete table and tidy up most of the storage.

I don't know what you want to do with Windows Optimizer

In general, his auto-optimization --- features are not bad

There is also a general use

The smart uninstall feature --- remove software is good

The feature is good, you can remove the redundant right-click menu

Drive backup --

There's also registry cleanup--

Disk file cleanup - (sometimes deleted by mistake)

All are not bad Anyway, your question is very general

In fact, the menu is also very simple

Once you're familiar with it, you'll be able to get started quickly!

Fainting, the system is to be optimized, and it is difficult to use without optimization. It's also a good idea to use Optimizer. Don't optimize automatically, just optimize manually, because there are too many details to explain one by one.

System cleanup and maintenance.

First: Registry cleanup. Scan first to delete all the files that come out, these are useless and will affect the speed of your computer.

Second: Junk file cleanup. It is also scanned first to delete all the scans.

System performance optimization.

Second: Boot speed optimization. Point optimization.

All of the above will help you optimize your computer, and the rest will not be much use! That's how I use it!

Clean up junk files first.

Clean up the registry.

Cleaning the registry and cleaning junk files can be used with a bit. Junk file cleanup (now Disk Management) can only clean the system disk, and do not clean other disks. Other optimization functions should be optimized manually, but don't go for automatic optimization.

You tried Turbo Pascal without problems, you used Free Pascal

When using Free Pascal, I will encounter the error message "fatal:compilation aborted", which means: fatal: compilation failed. There are generally two possible scenarios for this to occur:

1. Your ** has a fatal mistake; (Upon checking, there are no errors in your **).

2. There is a problem with the free pascal.

The workaround is:

1. Check** to confirm that there is no error;

3. If the above aspects still don't work, the remaining more convenient way is to uninstall Free Pascal and reinstall it again.

Another question: vari: integer;

beginfor i:=0 to 999 do

if (i mod 3 = 0) and ((i div 100=5) or ((i div 10) mod 10=5) or (i mod 10=5)) then

write(i,',');

end.

It can be read by one bit, converted and stored in the array while reading, and jumped into the second array when encountering a space.

You can also use ansistring to read (correct, only 65536-1 bit) pos spaces, and split them into two arrays.

Read in with ansistring type, one line at a time. This kind of string has infinite bits.