Detalii evaluare #57692132

Rezumat problemă

gradina

#1515

Păcală a reușit să ducă la bun sfârșit înțelegerea cu boierul căruia-i fusese slugă și, conform învoielii, boierul trebuie să-l răsplătească dându-i o parte din livada sa cu pomi fructiferi. Boierul este un om foarte ordonat, așa că livada sa este un pătrat cu latura de N metri unde, pe vremuri, fuseseră plantate N rânduri cu câte N pomi fiecare. Orice pom fructifer putea fi identificat cunoscând numărul rândului pe care se află și poziția sa în cadrul rândului respectiv. Cu timpul, unii pomi s-au uscat şi acum mai sunt doar P pomi. Păcală trebuie să-și delimiteze în livadă o grădină pătrată cu latura de K metri.

Detalii

Problema gradina Operații I/O gradina.in/gradina.out
Limita timp 0.5 secunde Limita memorie Total: 16 MB / Stivă 8 MB
Id soluție #57692132 Utilizator Gelal Ayan (Ayan10)
Fișier gradina.cpp Dimensiune 713 B
Data încărcării 10 Aprilie 2025, 16:00 Scor / rezultat Eroare de compilare

Evaluare

Mesaj compilare

gradina.cpp: In function 'int main()':
gradina.cpp:8:5: error: reference to 'cin' is ambiguous
     cin>>n>>p>>k;

     ^
gradina.cpp:3:10: note: candidates are: std::ifstream cin
 ifstream cin("gradina.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gradina.cpp:1:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
gradina.cpp:10:9: error: reference to 'cin' is ambiguous
         cin>>r>>q,arr[r][q]=1;

         ^
gradina.cpp:3:10: note: candidates are: std::ifstream cin
 ifstream cin("gradina.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gradina.cpp:1:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
gradina.cpp:13:9: error: reference to 'array' is ambiguous
         array[i][j]=array[i][j-1]+array[i-1][j]-array[i-1][j-1]+array[i][j];

         ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:13:21: error: reference to 'array' is ambiguous
         array[i][j]=array[i][j-1]+array[i-1][j]-array[i-1][j-1]+array[i][j];

                     ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:13:35: error: reference to 'array' is ambiguous
         array[i][j]=array[i][j-1]+array[i-1][j]-array[i-1][j-1]+array[i][j];

                                   ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:13:49: error: reference to 'array' is ambiguous
         array[i][j]=array[i][j-1]+array[i-1][j]-array[i-1][j-1]+array[i][j];

                                                 ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:13:65: error: reference to 'array' is ambiguous
         array[i][j]=array[i][j-1]+array[i-1][j]-array[i-1][j-1]+array[i][j];

                                                                 ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:16:15: error: reference to 'array' is ambiguous
           sum=array[i][j]-array[i-k][j]-array[i][j-k]+array[i-k][j-k];

               ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:16:27: error: reference to 'array' is ambiguous
           sum=array[i][j]-array[i-k][j]-array[i][j-k]+array[i-k][j-k];

                           ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:16:41: error: reference to 'array' is ambiguous
           sum=array[i][j]-array[i-k][j]-array[i][j-k]+array[i-k][j-k];

                                         ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:16:55: error: reference to 'array' is ambiguous
           sum=array[i][j]-array[i-k][j]-array[i][j-k]+array[i-k][j-k];

                                                       ^
gradina.cpp:6:27: note: candidates are: int array [1001][1001]
 int n,p,k,arr[1001][1001],array[1001][1001],r,q,maxx=0,cnt=0,sum;

                           ^
In file included from /usr/include/c++/4.8/tuple:39:0,
                 from /usr/include/c++/4.8/functional:55,
                 from /usr/include/c++/4.8/bits/stl_algo.h:66,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from gradina.cpp:1:
/usr/include/c++/4.8/array:81:12: note:                 template<class _Tp, unsigned int _Nm> struct std::array
     struct array
            ^
gradina.cpp:20:9: error: reference to 'cout' is ambiguous
         cout<<maxx<<endl<<cnt;

         ^
gradina.cpp:4:10: note: candidates are: std::ofstream cout
 ofstream cout("gradina.out");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gradina.cpp:1:
/usr/include/c++/4.8/iostream:61:18: note:                 std::ostream std::cout
   extern ostream cout;  /// Linked to standard output
                  ^

Cum funcționează evaluarea?

www.pbinfo.ro permite evaluarea a două tipuri de probleme:

  • probleme la care rezolvarea presupune scrierea unui program complet
  • probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.

Problema gradina face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:

  • Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
  • Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.

Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.

Du-te sus!