-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy path15.pas
More file actions
145 lines (139 loc) · 2.2 KB
/
15.pas
File metadata and controls
145 lines (139 loc) · 2.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
program factorial;
var fak, res, a, b, c, d, temp, n, i : integer;
vAr f, x, y, z, endPointer, prim : boOlEAn;
begin
fak := 5;
res := 1;
while fak > 0 do
begin
res := res * fak;
fak := fAk - 1;
end;
writeln(res);
if (2=2) and not(2<>2) then writeln(334364336);
if (2=2) and not(2<>3) then writeln(3334443);
writeln(not(true));
writeln(not(tRUe and falSE));
writeln(1 - (3 - (2 + 1)));
a := 1 ;
b := 1 ;
while a < 1000 do
begin
WrItElN ( a ) ;
temp := b ;
b := a + b ;
a := temp ;
end;
a := 3;
a := 10;
c := ((a mod 3) * 3) div 2;
b := 1;
x := true;
while a >= b do
begin
a := a - b;
if a <= b + 1 then
break
else
a := 1;
end;
a := 1+(7*3);
b := 7--(1+4);
c := 2 + -+-+-+-+++-1;
a := 1;
b := a;
c := b+a;
while a < 10 do
begin
a := a+1;
while b < 10 do
begin
b := b+1;
while c < 10 do
begin
writeln(c);
break;
writeln(111111);
end;
break;
writeln(222222);
end;
break;
writeln(333333);
end;
a := 1;
b := 1;
while (True and (a < 100)) do
begin
temp := b;
b := a + b;
a := temp ;
end;
a := 4;
b := 4;
f := a > b;
f := a >= b;
f := a = b;
f := a <= b;
f := a < b;
if(f ) then
begin
writeln(3);
end
else
writeln(1);
if (2=2) and not(2<>2) then writeln ( 1 );
a := 0;
b := 6;
f := a > b;
while a < b do
begin
a := a -- (1+a);
end;
endPointer := true;
a := 1;
d := 0;
c := 0;
b := 42;
if d = 1 then
begin
b := a + a;
c := b;
if d < 2 then
begin
a := a+1;
b := b+2;
end;
end;
if d > 4 then
begin
writeln(a);
end
else
begin
writeln(c);
end;
writeln(endPointer);
d := 0;
while d < 4 do
begin
d := d+1;
end;
n := 42;
i := 2;
prim := true;
while true do
BEGIN
if (n mod i)=0 then
BEGIN
prim := false;
break;
END else
i := i + 1;
if i=(n-1) then
BEGIN
prim := true;
break;
END;
END
end.