Why does the F8 prompt fail in the free pascal?

Press CTRL+F7 to increase the monitoring variable.

f7 runs step by step and does not skip the running of subroutines.

f8 skips the subroutine run.

You can mix the two keys, for example, you can press F8 to skip some known correct subroutines, and then use F7 to slowly look at the problematic subroutines.

To put it simply, because:

Pressing f8 does not allow you to run functions or procedures;

Press F7 to run.

ctrl+f7

It is used for debugging"f7", because"f8"Cannot be debugged"process"with"functions", while"f7"But you can.

alt+f9 compilation.

CTRL+F9.

Alt+F5 screen output.

What does F8 do? I don't know.

There are three errors.

The first one is: you can't add do after else

The second is: y is defined as a real type, and cannot be used modThe third is: If The judgment statement after the semicolon cannot be added so, ** is as follows:

program p1_1;

var x:real;

y,m:integer;

beginread(x);

y:=round(x);

if y-x<>0 then

writeln('wufa')

else m:=y mod 5;

if m=0 then writeln('wufa')else writeln('keyi');

end.Attached is a screenshot of the successful compilation:

Here's what the popularization group is:

Note: The following Chinese content can not be typed.

The problem is in **ah???

Did you forget to send it again???

It's not uncommon to find this kind of untitled brain-dead problem!

The most popular method of finding prime numbers, known as the "screening method", or "the sieve of eratosthenes" by its inventor, is available in the encyclopedia

The principles on which it is based are:

In the following gif animation, you can also see the general steps of the sieve method: (directly delete 1).

How do you do it in Pascal? The way to do this is to construct an array of type boolean, and if prime[ i ]=true it means i is a prime number.

The details are as follows:

var i,j,n,sum:longint;

prime:array[2..1000000000]of boolean;

beginreadln(n);Enter a range to find prime numbers within 2 n;

fillchar(prime,sizeof(prime),true);Set all to true first;

for i:=2 to trunc(sqrt(n)) do

if prime[i] then if i is prime, assign the multiple of all i within n (not counting yourself) to false;

beginfor j:=2 to n div i do

prime[i*j]:=false;

end;for i:=2 to n do output;

if prime[i] then write(i,' ');

end.

Pascal is not familiar with C++ programs.

#include

#include

using namespace std;

int vis[1000];Array elements are all 0int main().