Buổi 1-2. Ngôn ngữ lập trình cơ bản (10 bài)

var    n:int64;
        s:real;
        f:text;
begin
assign(f,'squa.inp');reset(f);
read(f,n);
close(f);
assign(f,'squa.out');rewrite(f);
s:=exp(ln(n)*(1/3));
write(f,s:0:3);
close(f);
end.

var    n,i,t:longint;
        f:text;
begin
assign(f,'ckprime.inp');reset(f);
read(f,n);
close(f);
assign(f,'ckprime.out');rewrite(f);
for i:=2 to trunc(sqrt(n)) do
if (n mod i = 0) then t:=1;
if t=1 then write(f,'false') else write(f,'true');
close(f);
end.

var    n,i,d,j:longint;
        t,x:array [0..10000] of longint;
        f:text;
begin
assign(f,'fprime.inp');reset(f);
readln(f,n);
close(f);
assign(f,'fprime.out');rewrite(f);
t[1]:=1;t[2]:=1;d:=2;
while t[d]<n do
begin
d:=d+1;
t[d]:=t[d-1]+t[d-2];
end;
d:=d-1;
for i:=1 to t[d] do x[i]:=1;i:=2;x[1]:=0;
while (i<=trunc(sqrt(t[d]))) do if x[i]=1 then
begin
j:=2;
while (i*j<=t[d]) do
begin
x[i*j]:=0;
j:=j+1;
end;
i:=i+1;
end else i:=i+1;
j:=0;
for i:=1 to d do if x[t[i]]=1 then j:=j+1;
write(f,j);

close(f);
end.

var    n,i,j:longint;
        x:array [0..10000] of longint;
        f:text;
begin
assign(f,'eratos.inp');reset(f);
readln(f,n);
close(f);
assign(f,'eratos.out');rewrite(f);
for i:=1 to n do x[i]:=1;i:=2;x[1]:=0;
while i<=trunc(sqrt(n)) do if x[i]=1 then
begin
j:=2;
while i*j<=n do
begin
x[i*j]:=0;
j:=j+1;
end;
i:=i+1;
end else i:=i+1;
for i:=1 to n do if x[i]=1 then write(f,i,' ');



close(f);
end.

program dcount;
uses crt;
var a:longint;
function tongcs(n:Longint):longint;
var i:longint;
    s:longint;
begin
clrscr;
        s:=0;
        for i:=1 to n do
                begin
                        s:=s+1;
                end;
exit(n)
end;
begin
        readln(a);
        writeln(tongcs(a));
end.

const fi='amux.inp';
      fo='amux.out';
var a,x,i:longint;
    t:int64;
begin
assign(input,fi); reset(input);
assign(output,fo); rewrite(output);
readln(a,x); t:=1;
for i:=1 to x do
t:=t*a mod 1000000007;
write(t);
close(input);
close(output);
end.

const fi='squa.inp';
      fo='squa.out';
var x:longint;
begin
assign(input,fi); reset(input);
assign(output,fo); rewrite(output);
readln(x);
write(exp(ln(x)*(1/3)):0:3);
close(input);
close(output);
end.

uses math;
var t,res,i,n:longint;
function timcsmax(u:longint):longint;
begin
        t:=0;
        while u>0 do
        begin
                t:=max(t,(u mod 10));
                u:=u div 10;
        end;
        exit(t);
end;
begin
readln(n);
res:=0;
for i:=1 to n do
res:=max(res,timcsmax(i));
write(res);
end.

program xchange;
var x,a,b,c,res:longint;
begin
        readln(x);
        a:=x div 50;
        x:=x-a*50;
        b:=x div 20;
        x:=x-b*20;
        c:=x div 10;
        x:=x-c*10;
        res:=a+b+c;
        if x>0 then write('-1')
        else write(res)
end.

program sdiv;
var
 s: Longint;
function tonguc(u : Longint): Longint;
var
 n,i : Longint;
begin
 for i := 1 to u do
 begin
 if (u mod i = 0) then s := s + i ;
 end;
 exit(s)
end;
begin
 s := 0;
 readln(n);
 writeln(tonguc(n));
end.

const fi='ckprime.inp';
      fo='ckprime.out';
var n:longint;
function nt(n:longint):boolean;
var i:longint;
begin
if (n<=3) and (n>1) then exit(true);
for i:=2 to trunc(sqrt(n)) do
if n mod i =0 then exit(false);
exit(true);
end;
begin
assign(input,fi); reset(input);
assign(output,fo); rewrite(output);
readln(n);
if nt(n) then write('true') else write('false');
close(input);
close(output);
end.

const fi='fprime.inp';
      fo='fprime.out';
var i,n,k,r:longint;
    f:array [0..10000] of longint;
procedure try(i:longint);
begin
f[i]:=f[i-1]+f[i-2];
if i<=n then try(i+1)
end;
function nt(n:longint):boolean;
var i:longint;
begin
if (n<=3) and (n>1) then exit(true);
for i:=2 to trunc(sqrt(n)) do
if n mod i =0 then exit(false);
exit(true);
end;
begin
assign(input,fi); reset(input);
assign(output,fo); rewrite(output);
readln(n);
f[1]:=1; f[2]:=1;  try(3);
for i:=3 to n do
if (nt(f[i])) and (f[i]<=n) then inc(k);
write(k);
close(input);
close(output);
end.

const fi='eratos.inp';
      fo='eratos.out';
var i,n:longint;
function nt(n:longint):boolean;
var i:longint;
begin
if (n<=3) and (n>1) then exit(true);
for i:=2 to trunc(sqrt(n)) do
if n mod i =0 then exit(false);
exit(true);
end;
begin
assign(input,fi); reset(input);
assign(output,fo); rewrite(output);
readln(n);
for i:=2 to n do
if nt(i) then write(i,#32);
close(input);
close(output);
end.

program sdiv;
var n,i:longint;
function tonguoc(u:longint):longint;
var t:longint=0;
begin
        for i:=1 to trunc(sqrt(u)) do
        if u mod i=0 then
        begin
                t:=t+i;inc(t,i);
                if i=u div i then
                t:=t+u div i;
        end;
        exit(t);
        end;
begin
readln(n);
write(tonguoc(n));
end.