var g: text; i: integer; begin assign( g, 'vystup.txt' ); rewrite( g ); i:=0; while i < 1000 do begin i := i+1; writeln( g, i ) end; close( g ) end. var f: text; c: char; begin assign( f, '171016.pas' ); reset( f ); while not eof( f ) do begin read( f,c ); write( c,c ) end; close( f ) end. begin writeln( PI ); writeln( PI:5:2 ) end. var a, soucet: integer; begin soucet := 0; while not SeekEof do begin read( a ); write( '[',a,']' ); soucet := soucet + a end; writeln( soucet ) end. var z: char; begin while not eof do begin read( z ); write( UpCase( z ) )d end end. var z: char; x: integer; begin x := 0; read( z ); { preskoci znaky pred cislemn } while (z<'0') or (z>'9') do begin read( z ) end; { cteni cisla } while (z>='0') and (z<='9') do begin x := 10 * x + (ord(z)-ord('0') ); read( z ) end; writeln( x ) end. var z: char; x: integer; begin x := 0; read( z ); while (z>='0') and (z<='9') do begin x := 10 * x + (ord(z)-ord('0') ); read( z ) end end. {.............} {$B+} { uplne vyhodnocovani logickych vyrazu } {$B-} { ...a odsud zase zkracene } {$O+} var rostla, klesla, stejna: boolean; pocet: integer; x, minx: integer; begin rostla := FALSE; klesla := FALSE; stejna := FALSE; pocet := 0; read( x ); while x<>-1 do begin pocet := pocet + 1; if pocet >= 2 then if x > minx then rostla := TRUE else if x < minx then klesla := TRUE else stejna := TRUE; minx := x; read( x ) end; if pocet=0 then writeln( 'prazdna' ) else if pocet=1 then writeln( 'jednoprvkova' ) else if rostla then if klesla then writeln( 'neni monotonni' ) else if stejna then writeln( 'neklesajici' ) else writeln( 'rostouci' ) else if klesla then if stejna then writeln( 'nerostouci' ) else writeln( 'klesajici' ) else if stejna then writeln( 'konstantni' ) else RunError( 777 ) end. begin if 1 < 2 and 2 < 3 then end. var x, xx, vysledek: longint; N: integer; begin read( x, N ); xx := x; vysledek := 1; while N > 0 do begin if (N mod 2) = 1 then vysledek := vysledek * xx; N := N div 2; if N > 0 then xx := xx * xx; end; writeln( vysledek ) end.