Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #50985776

Rezumat problemă

#2296 gcd

Se dau două șiruri de câte N numere fiecare. Se cere să se găsească valoarea maximă a celui mai mare divizor comun a două numere A și B, astfel încât A să aparțină primului șir, iar B să aparțină celui de-al doilea șir.

Infogim Runda 1 - Clasa 6-7

Rezolvă

Detalii

Problema gcd Operații I/O gcd.in/gcd.out
Limita timp 0.3 secunde Limita memorie Total: 16 MB / Stivă 4 MB
Id soluție #50985776 Utilizator Tudor Aramă (tudorarama)
Fișier gcd.cpp Dimensiune 1.97 KB
Data încărcării 17 Mai 2024, 09:49 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

gcd.cpp:2:10: error: stray '#' in program
 Problema #2296 – gcd – Rezolvari PBInfo

          ^
gcd.cpp:2:1: error: stray '\342' in program
 Problema #2296 – gcd – Rezolvari PBInfo

 ^
gcd.cpp:2:1: error: stray '\200' in program
gcd.cpp:2:1: error: stray '\223' in program
gcd.cpp:2:1: error: stray '\342' in program
gcd.cpp:2:1: error: stray '\200' in program
gcd.cpp:2:1: error: stray '\223' in program
gcd.cpp:5:1: error: stray '\310' in program
 Cerința

 ^
gcd.cpp:5:1: error: stray '\233' in program
gcd.cpp:6:1: error: stray '\304' in program
 Se dau două șiruri de câte N numere fiecare. Se cere să se găsească valoarea maximă a celui mai mare divizor comun a două numere A și B, astfel încât A să aparțină primului șir, iar B să aparțină celui de-al doilea șir.

 ^
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\310' in program
gcd.cpp:6:1: error: stray '\231' in program
gcd.cpp:6:1: error: stray '\303' in program
gcd.cpp:6:1: error: stray '\242' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\310' in program
gcd.cpp:6:1: error: stray '\231' in program
gcd.cpp:6:1: error: stray '\303' in program
gcd.cpp:6:1: error: stray '\256' in program
gcd.cpp:6:1: error: stray '\303' in program
gcd.cpp:6:1: error: stray '\242' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\310' in program
gcd.cpp:6:1: error: stray '\233' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\310' in program
gcd.cpp:6:1: error: stray '\231' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\310' in program
gcd.cpp:6:1: error: stray '\233' in program
gcd.cpp:6:1: error: stray '\304' in program
gcd.cpp:6:1: error: stray '\203' in program
gcd.cpp:6:1: error: stray '\310' in program
gcd.cpp:6:1: error: stray '\231' in program
gcd.cpp:9:1: error: stray '\303' in program
 În fișierul gcd.in se va afla pe prima linie un număr reprezentând valoarea lui N. Pe cea de-a doua linie se vor afla N numere separate prin câte un spațiu, reprezentând elementele primului șir. Pe cea de-a treia linie se vor afla N numere separate prin câte un spațiu, reprezentând elementele celui de-al doilea șir.

 ^
gcd.cpp:9:1: error: stray '\216' in program
gcd.cpp:9:1: error: stray '\310' in program
gcd.cpp:9:1: error: stray '\231' in program
gcd.cpp:9:1: error: stray '\304' in program
gcd.cpp:9:1: error: stray '\203' in program
gcd.cpp:9:1: error: stray '\303' in program
gcd.cpp:9:1: error: stray '\242' in program
gcd.cpp:9:1: error: stray '\303' in program
gcd.cpp:9:1: error: stray '\242' in program
gcd.cpp:9:1: error: stray '\310' in program
gcd.cpp:9:1: error: stray '\233' in program
gcd.cpp:9:1: error: stray '\303' in program
gcd.cpp:9:1: error: stray '\242' in program
gcd.cpp:9:1: error: stray '\310' in program
gcd.cpp:9:1: error: stray '\231' in program
gcd.cpp:9:1: error: stray '\303' in program
gcd.cpp:9:1: error: stray '\242' in program
gcd.cpp:9:1: error: stray '\310' in program
gcd.cpp:9:1: error: stray '\233' in program
gcd.cpp:9:1: error: stray '\303' in program
gcd.cpp:9:1: error: stray '\242' in program
gcd.cpp:9:1: error: stray '\310' in program
gcd.cpp:9:1: error: stray '\231' in program
gcd.cpp:11:1: error: stray '\310' in program
 Date de ieșire

 ^
gcd.cpp:11:1: error: stray '\231' in program
gcd.cpp:12:1: error: stray '\303' in program
 În fișierul gcd.out se va afla pe primia linie un număr natural reprezentând valoarea maximă a celui mai mare divizor comun a două numere A și B, astfel încât A să aparțină primului șir, iar B să aparțină celui de-al doilea șir.

 ^
gcd.cpp:12:1: error: stray '\216' in program
gcd.cpp:12:1: error: stray '\310' in program
gcd.cpp:12:1: error: stray '\231' in program
gcd.cpp:12:1: error: stray '\304' in program
gcd.cpp:12:1: error: stray '\203' in program
gcd.cpp:12:1: error: stray '\303' in program
gcd.cpp:12:1: error: stray '\242' in program
gcd.cpp:12:1: error: stray '\304' in program
gcd.cpp:12:1: error: stray '\203' in program
gcd.cpp:12:1: error: stray '\304' in program
gcd.cpp:12:1: error: stray '\203' in program
gcd.cpp:12:1: error: stray '\310' in program
gcd.cpp:12:1: error: stray '\231' in program
gcd.cpp:12:1: error: stray '\303' in program
gcd.cpp:12:1: error: stray '\256' in program
gcd.cpp:12:1: error: stray '\303' in program
gcd.cpp:12:1: error: stray '\242' in program
gcd.cpp:12:1: error: stray '\304' in program
gcd.cpp:12:1: error: stray '\203' in program
gcd.cpp:12:1: error: stray '\310' in program
gcd.cpp:12:1: error: stray '\233' in program
gcd.cpp:12:1: error: stray '\304' in program
gcd.cpp:12:1: error: stray '\203' in program
gcd.cpp:12:1: error: stray '\310' in program
gcd.cpp:12:1: error: stray '\231' in program
gcd.cpp:12:1: error: stray '\304' in program
gcd.cpp:12:1: error: stray '\203' in program
gcd.cpp:12:1: error: stray '\310' in program
gcd.cpp:12:1: error: stray '\233' in program
gcd.cpp:12:1: error: stray '\304' in program
gcd.cpp:12:1: error: stray '\203' in program
gcd.cpp:12:1: error: stray '\310' in program
gcd.cpp:12:1: error: stray '\231' in program
gcd.cpp:14:1: error: stray '\310' in program
 Restricții și precizări

 ^
gcd.cpp:14:1: error: stray '\233' in program
gcd.cpp:14:1: error: stray '\310' in program
gcd.cpp:14:1: error: stray '\231' in program
gcd.cpp:14:1: error: stray '\304' in program
gcd.cpp:14:1: error: stray '\203' in program
gcd.cpp:16:1: error: stray '\304' in program
 Elementele celor două șiruri <= 1.000.000

 ^
gcd.cpp:16:1: error: stray '\203' in program
gcd.cpp:16:1: error: stray '\310' in program
gcd.cpp:16:1: error: stray '\231' in program
gcd.cpp:16:35: error: too many decimal points in number
 Elementele celor două șiruri <= 1.000.000

                                   ^
gcd.cpp:27:1: error: stray '\310' in program
 Explicație

 ^
gcd.cpp:27:1: error: stray '\233' in program
gcd.cpp:28:1: error: stray '\304' in program
 A = 8, B = 8, iar (A,B) = 8 este valoarea maximă a celui mai mare divizor comun a vreunei perechi.

 ^
gcd.cpp:28:1: error: stray '\203' in program
gcd.cpp:2:1: error: 'Problema' does not name a type
 Problema #2296 – gcd – Rezolvari PBInfo

 ^
gcd.cpp: In function 'int main()':
gcd.cpp:37:5: error: reference to 'cin' is ambiguous
     cin >> n;

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

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gcd.cpp:30:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
gcd.cpp:40:9: error: reference to 'cin' is ambiguous
         cin >> c;

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

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gcd.cpp:30:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
gcd.cpp:46:9: error: reference to 'cin' is ambiguous
         cin >> c;

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

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gcd.cpp:30:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
gcd.cpp:60:5: error: reference to 'cout' is ambiguous
     cout << maxi - ok;

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

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gcd.cpp:30:
/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 gcd 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ă.