Fix 2022 misidentified day0

2025-04-05 18:35:34 +03:00
parent 9fc1289f42
commit f3624767fd
50 changed files with 0 additions and 0 deletions
--- a/2022/sector/d0/day0_ro.docx
+++ b/2022/sector/d0/day0_ro.docx
--- a/2022/sector/d0/day0_ru.docx
+++ b/2022/sector/d0/day0_ru.docx
--- a/2022/sector/d0/factorialul/fact.in
+++ b/2022/sector/d0/factorialul/fact.in
@@ -1 +0,0 @@
-4
--- a/2022/sector/d0/factorialul/fact.out
+++ b/2022/sector/d0/factorialul/fact.out
@@ -1 +0,0 @@
-24
--- a/2022/sector/d0/factorialul/fact.pas
+++ b/2022/sector/d0/factorialul/fact.pas
@@ -1,21 +0,0 @@
-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.
--- a/2022/sector/d0/factorialul/statement_ro.docx
+++ b/2022/sector/d0/factorialul/statement_ro.docx
--- a/2022/sector/d0/factorialul/statement_ru.docx
+++ b/2022/sector/d0/factorialul/statement_ru.docx
--- a/2022/sector/d0/factorialul/tests/fact01.in
+++ b/2022/sector/d0/factorialul/tests/fact01.in
@@ -1,2 +0,0 @@
-5
-
--- a/2022/sector/d0/factorialul/tests/fact01.out
+++ b/2022/sector/d0/factorialul/tests/fact01.out
@@ -1 +0,0 @@
-120
--- a/2022/sector/d0/factorialul/tests/fact02.in
+++ b/2022/sector/d0/factorialul/tests/fact02.in
@@ -1,2 +0,0 @@
-7
-
--- a/2022/sector/d0/factorialul/tests/fact02.out
+++ b/2022/sector/d0/factorialul/tests/fact02.out
@@ -1 +0,0 @@
-5040
--- a/2022/sector/d0/factorialul/tests/fact03.in
+++ b/2022/sector/d0/factorialul/tests/fact03.in
@@ -1 +0,0 @@
-8
--- a/2022/sector/d0/factorialul/tests/fact03.out
+++ b/2022/sector/d0/factorialul/tests/fact03.out
@@ -1 +0,0 @@
-40320
--- a/2022/sector/d0/factorialul/tests/fact04.in
+++ b/2022/sector/d0/factorialul/tests/fact04.in
@@ -1 +0,0 @@
-6
--- a/2022/sector/d0/factorialul/tests/fact04.out
+++ b/2022/sector/d0/factorialul/tests/fact04.out
@@ -1 +0,0 @@
-720
--- a/2022/sector/d0/factorialul/tests/fact05.in
+++ b/2022/sector/d0/factorialul/tests/fact05.in
@@ -1,3 +0,0 @@
-12
-
-
--- a/2022/sector/d0/factorialul/tests/fact05.out
+++ b/2022/sector/d0/factorialul/tests/fact05.out
@@ -1 +0,0 @@
-479001600
--- a/2022/sector/d0/suma/statement_ro.docx
+++ b/2022/sector/d0/suma/statement_ro.docx
--- a/2022/sector/d0/suma/statement_ru.docx
+++ b/2022/sector/d0/suma/statement_ru.docx
--- a/2022/sector/d0/suma/suma.in
+++ b/2022/sector/d0/suma/suma.in
@@ -1,4 +0,0 @@
-3
-5
-7
-23
--- a/2022/sector/d0/suma/suma.out
+++ b/2022/sector/d0/suma/suma.out
@@ -1 +0,0 @@
-21
--- a/2022/sector/d0/suma/suma.pas
+++ b/2022/sector/d0/suma/suma.pas
@@ -1,22 +0,0 @@
-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.
--- a/2022/sector/d0/suma/tests/suma01.in
+++ b/2022/sector/d0/suma/tests/suma01.in
@@ -1,3 +0,0 @@
-1
-100
-
--- a/2022/sector/d0/suma/tests/suma01.out
+++ b/2022/sector/d0/suma/tests/suma01.out
@@ -1 +0,0 @@
-100
--- a/2022/sector/d0/suma/tests/suma02.in
+++ b/2022/sector/d0/suma/tests/suma02.in
@@ -1,3 +0,0 @@
-2
-100
-100
--- a/2022/sector/d0/suma/tests/suma02.out
+++ b/2022/sector/d0/suma/tests/suma02.out
@@ -1 +0,0 @@
-200
--- a/2022/sector/d0/suma/tests/suma03.in
+++ b/2022/sector/d0/suma/tests/suma03.in
@@ -1,3 +0,0 @@
-2
-100
-100
--- a/2022/sector/d0/suma/tests/suma03.out
+++ b/2022/sector/d0/suma/tests/suma03.out
@@ -1 +0,0 @@
-0
--- a/2022/sector/d0/suma/tests/suma04.in
+++ b/2022/sector/d0/suma/tests/suma04.in
@@ -1,11 +0,0 @@
-10
-1
-2
-3
-4
-5
-6
-7
-8
-9
-10
--- a/2022/sector/d0/suma/tests/suma04.out
+++ b/2022/sector/d0/suma/tests/suma04.out
@@ -1 +0,0 @@
-55
--- a/2022/sector/d0/suma/tests/suma05.in
+++ b/2022/sector/d0/suma/tests/suma05.in
@@ -1,11 +0,0 @@
-10
-1
-2
-3
-4
-5
-6
-7
-8
-9
-10
--- a/2022/sector/d0/suma/tests/suma05.out
+++ b/2022/sector/d0/suma/tests/suma05.out
@@ -1 +0,0 @@
-35
--- a/2022/sector/d0/texte/statement_corrupted.docx
+++ b/2022/sector/d0/texte/statement_corrupted.docx
--- a/2022/sector/d0/texte/statement_ro.docx
+++ b/2022/sector/d0/texte/statement_ro.docx
--- a/2022/sector/d0/texte/statement_ru.docx
+++ b/2022/sector/d0/texte/statement_ru.docx
--- a/2022/sector/d0/texte/tests/texte01.in
+++ b/2022/sector/d0/texte/tests/texte01.in
@@ -1,2 +0,0 @@
-e
-Rezolvarea problemelor complexe este imposibila fara cunoasterea tehnicilor de programare
--- a/2022/sector/d0/texte/tests/texte01.out
+++ b/2022/sector/d0/texte/tests/texte01.out
@@ -1 +0,0 @@
-13
--- a/2022/sector/d0/texte/tests/texte02.in
+++ b/2022/sector/d0/texte/tests/texte02.in
@@ -1,2 +0,0 @@
-r
-Programarea modulara are mai multe avantaje
--- a/2022/sector/d0/texte/tests/texte02.out
+++ b/2022/sector/d0/texte/tests/texte02.out
@@ -1 +0,0 @@
-5
--- a/2022/sector/d0/texte/tests/texte03.in
+++ b/2022/sector/d0/texte/tests/texte03.in
@@ -1,2 +0,0 @@
-a
-Prelucrarea textelor este o munca migaloasa
--- a/2022/sector/d0/texte/tests/texte03.out
+++ b/2022/sector/d0/texte/tests/texte03.out
@@ -1 +0,0 @@
-6
--- a/2022/sector/d0/texte/tests/texte04.in
+++ b/2022/sector/d0/texte/tests/texte04.in
@@ -1,2 +0,0 @@
-8
-8984723hnd010-23nnoj98483924h928312`--knx209893n1-1-`1219jjj2109jw029jdm
--- a/2022/sector/d0/texte/tests/texte04.out
+++ b/2022/sector/d0/texte/tests/texte04.out
@@ -1 +0,0 @@
-6
--- a/2022/sector/d0/texte/tests/texte05.in
+++ b/2022/sector/d0/texte/tests/texte05.in
@@ -1,2 +0,0 @@
-1
-1111111111222221111111111aaaaa1111111111bbbbb111111111111111111111
--- a/2022/sector/d0/texte/tests/texte05.out
+++ b/2022/sector/d0/texte/tests/texte05.out
@@ -1 +0,0 @@
-51
--- a/2022/sector/d0/texte/texte.in
+++ b/2022/sector/d0/texte/texte.in
@@ -1,2 +0,0 @@
-m
-Olimpiada Raionala / Municipala la Informatica 2022
--- a/2022/sector/d0/texte/texte.out
+++ b/2022/sector/d0/texte/texte.out
@@ -1 +0,0 @@
-2
--- a/2022/sector/d0/texte/texte.pas
+++ b/2022/sector/d0/texte/texte.pas
@@ -1,25 +0,0 @@
-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.