Where can I find more information about Pascal? Don t want the Olympiad version.

n=6m=36

An exhaustive approach is sufficient.

According to the question, two eligible values can be calculated: n=1, m=1 and n=6, m=36, but because n=1 does not meet the question, only n=6 is taken.

My program doesn't have n=1 to be discarded, and I can modify it myself.

Procedure: var m, n: integer;

function try_if_yes:integer;

var i:integer;m:extended;

beginm:=n;

for i:=n-1 downto 1 dobeginm:=m/6*7+i;

if m-trunc(m)<>0 then exit(0);

end;try_if_yes:=trunc(m);

end;begin

for n:=1 to maxint dobeginm:=try_if_yes;

if m<>0 then

beginwriteln('n=',n);

writeln('m=',m);

end;end;

end.

n=6m=36

An exhaustive approach is sufficient.

According to the question, two eligible values can be calculated: n=1, m=1 and n=6, m=36, but because n=1 does not meet the question, only n=6 is taken.

My program doesn't have n=1 to be discarded, and I can modify it myself.

Procedure: var m, n: integer;

function try_if_yes:integer;

var i:integer;m:extended;

beginm:=n;

for i:=n-1 downto 1 dobegin

m:=m/6*7+i;

if m-trunc(m)<>0 then exit(0);

end;try_if_yes:=trunc(m);

end;begin

for n:=1 to maxint dobegin

m:=try_if_yes;

if m<>0 then

beginwriteln('n=',n);

writeln('m=',m);

end;end;

end.

It should be solved mathematically. Your topic isn't too clear.

If you ask something like this: the Games were held for n consecutive days, a total of m medals were issued, 1 plus the remaining medals (1 7) were issued on the first day, 2 medals were issued on the second day plus the remaining medals (1 7), and the medals were issued every day according to this rule, and the remaining N medals were issued on the last day, that is, on the nth day without any left, how many days did the Games last? How many medals were awarded?

So: 6 days, 36 medals.

Reason: N coins were sent on the last day, indicating that there were n coins left on the penultimate day, and 7n 6+n-1 coins left on the penultimate day.

From the above, it can be seen that n should be a multiple of 6,..1 At the same time, on the penultimate day, there are 7*(7n, 6+n-1) 6+n-2, which means that 7n, 6+n-1, should be a multiple of 6. 2 by 1, 2

Let n=6x be substituted for 7n 6+n-1 to get 13x-1 as a multiple of 6.

x=1n=6

Rollout m = 36

What does it mean to issue 1 and leave (m-1) 1 7?

Please give an example.

You can take a look at Peiyou Intelligence, which has 1 6 grade courses and 1 6 grade primary school Olympiad questions. I don't know if I buy it online, and I don't know if I learn to think about the Mystery on the Internet.

In 2004, the 9th China Cup Finals was the second test question of the first group.

1 Hospital A and Hospital B accept the same number of patients at the same time, and each patient suffers from one of the X or Y diseases, and after a few days**, Hospital A treats more patients than Hospital B treats patients. Q: After these days, is it possible that the **rate of disease X and the **rate of disease Y in Hospital A are lower than those in Hospital B? Illustrate. (** rate of disease X = 100%)

2 In a rectangular ABCD, BF=AE=3 cm, DE=6 cm, the area of a triangle GEC is 20 square centimeters, and the area of a triangle GFD is 16 square centimeters, so, what is the area of a rectangular ABCD in square centimeters?

3 A, B, and C respectively start from the apex a, b, and c of δabc, and choose a place to meet, and each car follows a straight road section to the meeting place (ab=c, ac=b, bc=a), and the fuel consumption per unit distance of the three cars is 1 3, 1 6, 1 8 respectively. To minimize the sum of the fuel used on the road for the three vehicles, where should they meet? What is the minimum fuel consumption (denoted by a, b, c)?

4 Some natural number expressed in decimal is equal to 16 times the sum of its digits, and the sum of all such natural numbers is found.

5 Find the natural numbers a,b:

1) a>b; (2);3) a+b is the square number.

6.As shown in the figure, 101 7 rectangular matrix, row spacing and column spacing are 1, on the 6th column (except for the intersection with column 0), each array has a target, and on the first 5 columns, all the array points are placed with obstacles. The sharpshooter stands in column 0 of row 0 and must first clear all obstacles in the trajectory (straight line) of the bullet in order to hit the target, if the sharpshooter can hit the target with each bullet, and each bullet can destroy but only one obstacle, then.

1) How many targets can be hit without clearing obstacles?

2) How many targets do you have to clear an obstacle to hit?

Line 7

Line 6

Line 5

Line 4

Line 3

Line 2

Line 1

Line 0

Article 1

Columns, columns, columns.

I have it, I can share it with you.

The number of Olympiads is very complete on the Internet.

program copyfile;

vara,b:file of boolean;

t:boolean;

beginassign(a,'.pascal/');reset(a);

assign(b,'.');rewrite(b);

repeat

read(a,t);

write(b,t)

until eof(a);

close(a);close(b)end.

To be executed on the desktop, the text is too big if it is not changed.

Right-click-click-right-clickCopy--- right-click on the desktop---paste.

Right-click click Copy-Right-Click on the desktop and right-paste.