Program gt; var n,i,max,min:integer; a:array[1..100]of integer; begin read(n); {n-кол-во учащихся} for i:=1 to n do read(a[i]); max:=a[1]; min:=a[1]; for i:=1 to n do begin if(a[i]>max)then max:=a[i]; if(a[i]<min)then min:=a[i]; end; writeln(max,' ',min,'-росты') max:=max-min; writeln(max); end. 2) program gt; var n,i,a,k:integer; begin read(n); k:=0; for i:=1 to n do begin read(a); if(a<1958)then k:=k+1; end; writeln(k); end. 3) program gt; var i,q,a,l:integer; begin for i:=8 to 20 do begin read(a); if(a<0)then begin q:=q+1; if(q=1)then l:=i; end; end; writeln(l); end.
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cstring>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <climits>typedef unsigned long long ulol;
typedef long double ld;
typedef long long lol;
typedef long int li;#define mp make_pair
#define F first
#define S second
#define sqr(a) ( (a) * (a) )
#define pb push_back
#define INF 999999999
#define ret(a) cout << endl; system("pause"); return(a)
//#define ret(a) return(a)using namespace std;int main()
{
ld x;
cin >> x;
x = ( 8 / sqrt( x ) ) + sqrt(x);
cout << x;
ret(0);
}
var n,i,max,min:integer;
a:array[1..100]of integer;
begin
read(n);
{n-кол-во учащихся}
for i:=1 to n do
read(a[i]);
max:=a[1];
min:=a[1];
for i:=1 to n do
begin
if(a[i]>max)then max:=a[i];
if(a[i]<min)then min:=a[i];
end;
writeln(max,' ',min,'-росты')
max:=max-min;
writeln(max);
end.
2)
program gt;
var n,i,a,k:integer;
begin
read(n);
k:=0;
for i:=1 to n do
begin
read(a);
if(a<1958)then k:=k+1;
end;
writeln(k);
end.
3)
program gt;
var i,q,a,l:integer;
begin
for i:=8 to 20 do
begin
read(a);
if(a<0)then begin
q:=q+1;
if(q=1)then l:=i;
end;
end;
writeln(l);
end.