2022 sector d0

2022/sector/d0/factorialul/fact.in

@@ -0,0 +1 @@
+4

2022/sector/d0/factorialul/fact.out

@@ -0,0 +1 @@
+24

2022/sector/d0/factorialul/fact.pas

@@ -0,0 +1,21 @@
+Program Factorial;
+var n, i : integer;
+    F : longint;
+    Intrare, Iesire : text;
+    label 1;
+begin
+   { Citirea datelor de intrare }
+   assign(Intrare, 'fact.in');
+   reset(Intrare);
+   readln(Intrare, n);
+   close(Intrare);
+   { Calcularea factorialului }
+   F:=1;
+   if n=0 then goto 1;
+   for i:=1 to n do F:=F*i;
+1: { Scrierea datelor de iesire }
+   assign(Iesire, 'fact.out');
+   rewrite(Iesire);
+   writeln(Iesire, F);
+   close(Iesire);
+end.

2022/sector/d0/factorialul/tests/fact01.in

@@ -0,0 +1,2 @@
+5
+

2022/sector/d0/factorialul/tests/fact01.out

@@ -0,0 +1 @@
+120

2022/sector/d0/factorialul/tests/fact02.in

@@ -0,0 +1,2 @@
+7
+

2022/sector/d0/factorialul/tests/fact02.out

@@ -0,0 +1 @@
+5040

2022/sector/d0/factorialul/tests/fact03.in

@@ -0,0 +1 @@
+8

2022/sector/d0/factorialul/tests/fact03.out

@@ -0,0 +1 @@
+40320

2022/sector/d0/factorialul/tests/fact04.in

@@ -0,0 +1 @@
+6

2022/sector/d0/factorialul/tests/fact04.out

@@ -0,0 +1 @@
+720

2022/sector/d0/factorialul/tests/fact05.in

@@ -0,0 +1,3 @@
+12
+
+

2022/sector/d0/factorialul/tests/fact05.out

@@ -0,0 +1 @@
+479001600

2022/sector/d0/suma/suma.in

@@ -0,0 +1,4 @@
+3
+5
+-7
+23

2022/sector/d0/suma/suma.out

@@ -0,0 +1 @@
+21

2022/sector/d0/suma/suma.pas

@@ -0,0 +1,22 @@
+Program Suma;
+var n, i, S : integer;
+    A : array[1..100] of integer;
+    Intrare, Iesire : text;
+begin
+   { Citirea datelor de intrare }
+   assign(Intrare, 'suma.in');
+   reset(Intrare);
+   readln(Intrare, n);
+   for i:=1 to n do
+      readln(Intrare, A[i]);
+   close(Intrare);
+   { Calcularea sumei }
+   S:=0;
+   for i:=1 to n do
+      S:=S+A[i];
+   { Scrierea datelor de iesire }
+   assign(Iesire, 'suma.out');
+   rewrite(Iesire);
+   writeln(Iesire, S);
+   close(Iesire);
+end.

2022/sector/d0/suma/tests/suma01.in

@@ -0,0 +1,3 @@
+1
+100
+

2022/sector/d0/suma/tests/suma01.out

@@ -0,0 +1 @@
+100

2022/sector/d0/suma/tests/suma02.in

@@ -0,0 +1,3 @@
+2
+100
+100

2022/sector/d0/suma/tests/suma02.out

@@ -0,0 +1 @@
+200

2022/sector/d0/suma/tests/suma03.in

@@ -0,0 +1,3 @@
+2
+100
+-100

2022/sector/d0/suma/tests/suma03.out

@@ -0,0 +1 @@
+0

2022/sector/d0/suma/tests/suma04.in

@@ -0,0 +1,11 @@
+10
+1
+2
+3
+4
+5
+6
+7
+8
+9
+10

2022/sector/d0/suma/tests/suma04.out

@@ -0,0 +1 @@
+55

2022/sector/d0/suma/tests/suma05.in

@@ -0,0 +1,11 @@
+10
+-1
+-2
+-3
+-4
+-5
+-6
+-7
+-8
+-9
+10

2022/sector/d0/suma/tests/suma05.out

@@ -0,0 +1 @@
+-35

2022/sector/d0/texte/tests/texte01.in

@@ -0,0 +1,2 @@
+e
+Rezolvarea problemelor complexe este imposibila fara cunoasterea tehnicilor de programare

2022/sector/d0/texte/tests/texte01.out

@@ -0,0 +1 @@
+13

2022/sector/d0/texte/tests/texte02.in

@@ -0,0 +1,2 @@
+r
+Programarea modulara are mai multe avantaje

2022/sector/d0/texte/tests/texte02.out

@@ -0,0 +1 @@
+5

2022/sector/d0/texte/tests/texte03.in

@@ -0,0 +1,2 @@
+a
+Prelucrarea textelor este o munca migaloasa

2022/sector/d0/texte/tests/texte03.out

@@ -0,0 +1 @@
+6

2022/sector/d0/texte/tests/texte04.in

@@ -0,0 +1,2 @@
+8
+8984723hnd010-23nnoj98483924h928312`--knx209893n1-1-`1219jjj2109jw029jdm

2022/sector/d0/texte/tests/texte04.out

@@ -0,0 +1 @@
+6

2022/sector/d0/texte/tests/texte05.in

@@ -0,0 +1,2 @@
+1
+1111111111222221111111111aaaaa1111111111bbbbb111111111111111111111

2022/sector/d0/texte/tests/texte05.out

@@ -0,0 +1 @@
+51

2022/sector/d0/texte/texte.in

@@ -0,0 +1,2 @@
+m
+Olimpiada Raionala / Municipala la Informatica 2022

2022/sector/d0/texte/texte.out

@@ -0,0 +1 @@
+2

2022/sector/d0/texte/texte.pas

@@ -0,0 +1,25 @@
+Program Texte;
+var N : integer;
+    C : char;
+    T : string;
+    Intrare, Iesire : text;
+    L : integer; { lungimea textului T }
+    i : integer; { contor penru parcurgerea textului T }
+begin
+   { Citirea datelor de intrare }
+   assign(Intrare, 'texte.in');
+   reset(Intrare);
+   readln(Intrare, C);
+   readln(Intrare, T);
+   close(Intrare);
+   { Calcularea numarului de aparitii }
+   N:=0;
+   L:=length(T);
+   for i:=1 to L do
+      if C=T[i] then N:=N+1;
+   { Scrierea datelor de iesire }
+   assign(Iesire, 'texte.out');
+   rewrite(Iesire);
+   writeln(Iesire, N);
+   close(Iesire);
+end.