231. {{ 163 }} 2 5-0-0
-
R .
232. {{ 164 }} 5 5-0-0
:
R , , ,
233. {{ 165 }} 11 5-0-0
:
R -
234. {{ 166 }} 12 5-0-0
:
R ,
235. {{ 167 }} 13 5-0-0
, :
R
236. {{ 168 }} 14 5-0-0
:
R ,
237. {{ 169 }} 15 5-0-0
- :
R
238. {{ 170 }} 16 5-0-0
:
R ,
239. {{ 171 }} 21 5-0-0
:
:=0;
X:=X+1;
Y:=X;
X:=2*Y+2*X.
R 4
240. {{ 172 }} 22 5-0-0
, X Y :
R C=X: X=Y: X=C
241. {{ 173 }} 23 5-0-0
X X=X+2, 3:
R 5
242. {{ 174 }} 24 5-0-0
X X=X mod 3 0:
R , 3
243. {{ 175 }} 25 5-0-0
Pascal :
R STEP
244. {{ 176 }} 26 5-0-0
Pascal :
R OR
245. {{ 177 }} 27 5-0-0
Pascal :
R
246. {{ 178 }} 28 5-0-0
Pascal :
R
247. {{ 179 }} 29 5-0-0
EXP(4*LN(5)):
R 625
248. {{ 180 }} 30 5-0-0
Pascal :
R
249. {{ 181 }} 31 5-0-0
LABEL Pascal :
R ,
250. {{ 182 }} 32 5-0-0
CONST Pascal :
R ,
251. {{ 183 }} 33 5-0-0
TYPE Pascal :
R ,
|
|
|
252. {{ 184 }} 34 5-0-0
VAR Pascal :
R ,
253. {{ 185 }} 35 5-0-0
:
R READ
254. {{ 186 }} 36 5-0-0
Pascal :
R WRITE
255. {{ 187 }} 37 5-0-0
Pascal :
R
256. {{ 188 }} 38 5-0-0
:
R MOD
257. {{ 189 }} 39 5-0-0
:
Program T34;
Var x: string[6];
Begin x:=+; Writeln(x) End.
:
R
258. {{ 190 }} 40 5-0-0
EXP(4*LN(5))?
R 625
259. {{ 191 }} 41 5-0-0
:
R .
260. {{ 192 }} 40 5-0-0
, , :
R .
261. {{ 193 }} 54 5-0-0
P:
A= 57; P = mod (A**A,10)
R 7
262. {{ 194 }} 54 5-0-0
P:
A= 38; P = mod (A**A,10)
R 4
263. {{ 195 }} 54 5-0-0
P:
A= 47; P = mod (A**A,10)
R 3
264. {{ 196 }} 54 5-0-0
P:
A= 42; P = mod (A**A,10)
R 4
265. {{ 197 }} 54 5-0-0
P:
A= 63; P = mod (A**A,10)
R 7
266. {{ 361 }} 361
, ?
R .
267. {{ 362 }} 362
, ?
 |
R .
268. {{ 363 }} 363
, ?
R .
269. {{ 364 }} 364
, -?
 |
R ().
270. {{ 365 }} 365
, :
R 8
271. {{ 366 }} 366
, :
R 12
272. {{ 367 }} 367
, :
R 10
273. {{ 368 }} 368
a=5, b=3, c=7. a + b + c
a:=a+b;
b:=a+b;
c:=a+b-c;
R 31
274. {{ 369 }} 369
a=2, b=3, c=7. a + b + c
|
|
|
a:=a+b;
b:=a+b;
c:=a+b-c;
R 19
275. {{ 370 }} 370
a=2, b=2, c=7. a + b + c
a:=a+b;
b:=a+b;
c:=a+b-c;
R 13
276. {{ 371 }} 371
a=2, b=1, c=7. a + b + c
a:=a+b;
b:=a+b;
c:=a+b-c;
R 7
277. {{ 372 }} 372
:
- ;
- ;
(x, y) - (x, y).
n [ 1, 2,, m ] , n .
(0, 0).
:
x =0, , 10 [ x:= x + 1/5, (x, x **3)],
(** - ).
R 0 2 10
£ 0 2 10
£ 0 10 100
£ 0 2 5
278. {{ 373 }} 373
:
() - ;
(b) - b ;
(,d) - d = 1 d = 0;
- ;
- .
n [ 1, 2,, m ] , n .
- , x , "" - .
:
; 6 [ 
, , , , 
].
, x y
R 
279. {{ 374 }} 374
:
- ;
- ;
(x, y) - (x, y).
n [ 1, 2,, m ] , n .
(0, 0).
:
x =0, , 10 [ x:= x + 1/10, (x, 3** x)],
(** - ).
R y=3x 0 1 10
280. {{ 375 }} 375
k ,
N=6, A=(1, -1, 2, -2, 3, -3)
| Pascal | QBasic | |
| k:=0; For i:=1 to N do If A[i]<0 then k:=k+A[i]; | k=0 FOR i=1 TO N IF A(i)<0 THEN k=k+A(i) END IF NEXT i | K:=0 i 1 N A[i]<0 k:=k+A[i] |
R -6
281. {{ 376 }} 376
k ,
N=6, A=(1, -1, 2, -2, 3, -3)
| Pascal | QBasic | |
| k:=1; For i:=1 to N do If A[i]>0 Then k:=k*A[i]; | k=1 FOR i=1 TO N IF A(i)>0 THEN k=k*A(i) END IF NEXT i | K:=1 i 1 N A[i]>0 k:=k*A[i] |
R 6
282. {{ 377 }} 377
k ,
|
|
|
N=6, A=(1, -1, 2, -2, 3, -3)
| Pascal | QBasic | |
| K:=0; For i:=1 to N do If A[i]>0 Then k:=k+1; | k=0 FOR i=1 TO N IF A(i)>0 THEN k=k+1 END IF NEXT i | K:=0 i 1 N A[i]>0 k:=k+1 |
R 3
283. {{ 378 }} 378
, k :
| Pascal K:=0; For i:=50 To 815 Do If i mod 60 = 6 Then k:=k+1; | Basic k=0 FOR i=50 TO 815 IF i MOD 60 = 6 THEN k=k+1 NEXT i | k:=0; i 50 815 mod(i, 60) = 6 k:=k+1; |
R 13
284. {{ 379 }} 379
, k :
| Pascal K:=0; For i:=0 To 825 Do If i mod 60 = 4 Then k:=k+1; | Basic k=0 FOR i=0 TO 825 IF i MOD 60 = 4 THEN k=k+1 NEXT i | k:=0; i 0 825 mod(i, 60) = 4 k:=k+1; |
R 14
285. {{ 380 }} 380
, k :
| Pascal K:=0; For i:=50 To 555 Do If i mod 60 = 4 Then k:=k+1; | Basic k=0 FOR i=50 TO 555 IF i MOD 60 = 4 THEN k=k+1 NEXT i | k:=0; i 50 555 mod(i, 60) = 4 k:=k+1; |
R 9
286. {{ 381 }} 381
, k :
| Pascal K:=0; For i:=90 To 585 Do If i mod 40 = 7 Then k:=k+1; | Basic k=0 FOR i=90 TO 585 IF i MOD 40 = 7 THEN k=k+1 NEXT i | k:=0; i 90 585 mod(i, 40) = 7 k:=k+1; |
R 12
287. {{ 382 }} 382
, k :
| Pascal K:=0; For i:=70 To 665 Do If i mod 20 = 9 Then k:=k+1; | Basic k=0 FOR i=70 TO 665 IF i MOD 20 = 9 THEN k=k+1 NEXT i | k:=0; i 70 665 mod(i, 20) = 9 k:=k+1; |
R 29
288. {{ 383 }} 383
, S .
| Pascal S:=0; For i:=1 To 123 Do S:=S + i div 28; | Basic S=0 FOR i=1 TO 123 S=S + INT(i/28) NEXT i | S:=0; i 1 123 S=S + INT(i/28); |
R 216
289. {{ 384 }} 384
, S .
| Pascal S:=0; For i:=1 To 149 Do S:=S + i div 28; | Basic S=0 FOR i=1 TO 149 S=S + INT(i/28) NEXT i | S:=0; i 1 149 S=S + INT(i/28); |
R 330
290. {{ 385 }} 385
, S .
| Pascal S:=0; For i:=1 To 146 Do S:=S + i div 33; | Basic S=0 FOR i=1 TO 146 S=S + INT(i/33) NEXT i | S:=0; i 1 146 S=S + INT(i/33); |
R 258
291. {{ 386 }} 386
, S .
| Pascal S:=0; For i:=1 To 123 Do S:=S + i div 29; | Basic S=0 FOR i=1 TO 123 S=S + INT(i/29) NEXT i | S:=0; i 1 123 S=S + INT(i/29); |
R 206
292. {{ 387 }} 387
, S .
| Pascal S:=0; For i:=1 To 148 Do S:=S + i div 32; | Basic S=0 FOR i=1 TO 148 S=S + INT(i/32) NEXT i | S:=0; i 1 148 S=S + INT(i/32); |
R 276
293. {{ 388 }} 388
S . .
|
|
|
| Pascal S:=10; For i:=1 To 79 Do S:=S * i / (i + 1); | Basic S=10 FOR i=1 TO 79 S=S * i / (i + 1) NEXT I | S:=10; i 1 79 S=S * i / (i + 1) |
R 1/8
294. {{ 389 }} 389
S . .
| Pascal S:=5; For i:=1 To 49 Do S:=S * i / (i + 1); | Basic S=5 FOR i=1 TO 49 S=S * i / (i + 1) NEXT I | S:=5; i 1 49 S=S * i / (i + 1) |
R 1/10
295. {{ 390 }} 390
S . .
| Pascal S:=5; For i:=1 To 59 Do S:=S * i / (i + 1); | Basic S=5 FOR i=1 TO 59 S=S * i / (i + 1) NEXT I | S:=5; i 1 59 S=S * i / (i + 1) |
R 1/12
296. {{ 391 }} 391
S . .
| Pascal S:=10; For i:=1 To 139 Do S:=S * i / (i + 1); | Basic S=10 FOR i=1 TO 139 S=S * i / (i + 1) NEXT I | S:=10; i 1 139 S=S * i / (i + 1) |
R 1/14
297. {{ 392 }} 392
S . .
| Pascal S:=10; For i:=1 To 79 Do S:=S * i / (i + 1); | Basic S=10 FOR i=1 TO 79 S=S * i / (i + 1) NEXT I | S:=10; i 1 79 S=S * i / (i + 1) |
R 1/8
298. {{ 393 }} 393
, S . .
| Pascal S:=10; For i:=1 To 109 Do S:=S * i / (i + 1); | Basic S=10 FOR i=1 TO 109 S=S * i / (i + 1) NEXT I | S:=10; i 1 109 S=S * i / (i + 1) |
R 1/11
299. {{ 394 }} 394
A(N, N). ( ). , . .
| Pascal S:=0; For i:=1 To N-2 Do For j:=i+1 to N Do S:=s+A[i,j]; | Basic S=0 FOR i=1 TO N-2 FOR j = i+1 TO N S=s+A(i,j) NEXT j NEXT i | S:=0; i 1 N-2 j i+1 N S:=s+a[i,j]; |
R 2
300. {{ 395 }} 395
A(N, N). ( ). , . .
| Pascal S:=0; For i:=2 To N-1 Do For j:= i+1 to N Do S:=s+A[i,j]; | Basic S=0 FOR i=2 TO N -1 FOR j = i+1 TO N S=s+A(i,j) NEXT j NEXT i | S:=0; i 2 N -1 j i+1 N S:=s+a[i,j]; |
R 2
301. {{ 396 }} 396
A(N, N). ( ). , . .
| Pascal S:=0; For i:=1 To N-1 Do For j:=1 to N Do S:=s+A[i,j]; | Basic S=0 FOR i=1 TO N -1 FOR j =1 TO N S=s+A(i,j) NEXT j NEXT i | S:=0; i 1 N -1 j 1 N S:=s+a[i,j]; |
R 3
302. {{ 397 }} 397
A(N, N). ( ). , . .
| Pascal S:=0; For i:=1 To N-1 Do For j:=i+1 to N-1 Do S:=s+A[i,j]; | Basic S=0 FOR i=1 TO N -1 FOR j =i+1 TO N-1 S=s+A(i,j) NEXT j NEXT i | S:=0; i 1 N -1 j i+1 N-1 S:=s+a[i,j]; |
R 3
303. {{ 398 }} 398
A(N, N). ( ). , . .
| Pascal S:=0; For i:=2 To N-1 Do For j:=1 to i-1 Do S:=s+A[i,j]; | Basic S=0 FOR i=2 TO N-1 FOR j =1 TO i-1 S=s+A(i,j) NEXT j NEXT i | S:=0; i 2 N-1 j 1 i-1 S:=s+a[i,j]; |
R 2
|
|
|
304. {{ 198 }} 1 6-0-0
- :
R ,
305. {{ 199 }} 2 6-0-0
-:
R .
306. {{ 200 }} 3 6-0-0
:
R , , .
307. {{ 201 }} 4 6-0-0
:
R .
308. {{ 202 }} 5 6-0-0
, , :
R , .
309. {{ 203 }} 6 6-0-0
:
R .
310. {{ 204 }} 10 6-0-0
, :
R .
311. {{ 205 }} 11 6-0-0
:
R .
312. {{ 206 }} 12 6-0-0
:
R .
313. {{ 207 }} 13 6-0-0
- :
R ,
314. {{ 208 }} 14 6-0-0
, :
R
315. {{ 209 }} 15 6-0-0
- :
R ,
316. {{ 210 }} 16 6-0-0
, :
R
317. {{ 211 }} 17 6-0-0
- :
R ,
318. {{ 212 }} 18 6-0-0
:
R ()
319. {{ 213 }} 19 6-0-0
:
R ,
320. {{ 214 }} 20 6-0-0
:
R
321. {{ 215 }} 21 6-0-0
:
R -
322. {{ 216 }} 22 6-0-0
, :
R
323. {{ 217 }} 23 6-0-0
, (), (). , .. ?
R
324. {{ 218 }} 24 6-0-0
:
R
325. {{ 219 }} 25 6-0-0
, () , :
R BIOS
326. {{ 220 }} 26 6-0-0
, .
. .
. .
. .
. .
. .
R
327. {{ 221 }} 27 6-0-0
.
| WinRar | |
| Doctor Web | |
| Windows Commander | |
| ScanDisc |
328. {{ 222 }} 28 6-0-0
:
. ;
. ;
. ;
. .
:
R
329. {{ 223 }} 29 6-0-0
?
R .
