#1636
Cifre15
Se dau n
numere naturale nenule. Determinați numărul de cifre 0
de la sfârşitul produsului celor n
numere și care este ultima cifră nenulă a acestui produs.
Olimpiada de informatică 2016, etapa pe sector, clasa a V-a
Problema | Cifre15 | Operații I/O |
cifre15.in /cifre15.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #16112947 | Utilizator | |
Fișier | cifre15.cpp | Dimensiune | 382 B |
Data încărcării | 04 Iunie 2019, 11:04 | Scor / rezultat | Eroare de compilare |
cifre15.cpp:1:9: error: #include expects "FILENAME" or <FILENAME> #include <iostream> ^ cifre15.cpp:2:9: error: #include expects "FILENAME" or <FILENAME> #include <fstream> ^ cifre15.cpp:3:1: error: stray '\302' in program using namespace std; ^ cifre15.cpp:3:1: error: stray '\240' in program cifre15.cpp:3:1: error: stray '\302' in program cifre15.cpp:3:1: error: stray '\240' in program cifre15.cpp:4:1: error: stray '\302' in program ifstream f("cifre15.in"); ^ cifre15.cpp:4:1: error: stray '\240' in program cifre15.cpp:5:1: error: stray '\302' in program ofstream g("cifre15.out"); ^ cifre15.cpp:5:1: error: stray '\240' in program cifre15.cpp:6:1: error: stray '\302' in program int main() ^ cifre15.cpp:6:1: error: stray '\240' in program cifre15.cpp:7:1: error: stray '\302' in program {int n,x,d2=0,d5=0,p=1;f>>n;for(int i=1;i<=n;++i){f>>x;while(x%2==0){d2++;x/=2;}while(x%5==0){d5++;x/=5;}p=(p*(x%10)) %10;}g<<min(d2,d5)<<' ';int k=0,f=0;if(d2>d5){k=d2-d5;f=2;}else{k=d5-d2;f=5;}while (k>0){p=(p*f)%10;k--;}g<<p;return 0;} ^ cifre15.cpp:7:1: error: stray '\240' in program cifre15.cpp:7:1: error: stray '\302' in program cifre15.cpp:7:1: error: stray '\240' in program cifre15.cpp:7:1: error: stray '\302' in program cifre15.cpp:7:1: error: stray '\240' in program cifre15.cpp:7:142: warning: multi-character character constant [-Wmultichar] {int n,x,d2=0,d5=0,p=1;f>>n;for(int i=1;i<=n;++i){f>>x;while(x%2==0){d2++;x/=2;}while(x%5==0){d5++;x/=5;}p=(p*(x%10)) %10;}g<<min(d2,d5)<<' ';int k=0,f=0;if(d2>d5){k=d2-d5;f=2;}else{k=d5-d2;f=5;}while (k>0){p=(p*f)%10;k--;}g<<p;return 0;} ^ cifre15.cpp:7:1: error: stray '\302' in program {int n,x,d2=0,d5=0,p=1;f>>n;for(int i=1;i<=n;++i){f>>x;while(x%2==0){d2++;x/=2;}while(x%5==0){d5++;x/=5;}p=(p*(x%10)) %10;}g<<min(d2,d5)<<' ';int k=0,f=0;if(d2>d5){k=d2-d5;f=2;}else{k=d5-d2;f=5;}while (k>0){p=(p*f)%10;k--;}g<<p;return 0;} ^ cifre15.cpp:7:1: error: stray '\240' in program cifre15.cpp:7:1: error: stray '\302' in program cifre15.cpp:7:1: error: stray '\240' in program cifre15.cpp:7:1: error: stray '\302' in program cifre15.cpp:7:1: error: stray '\240' in program cifre15.cpp:4:1: error: 'ifstream' does not name a type ifstream f("cifre15.in"); ^ cifre15.cpp:5:1: error: 'ofstream' does not name a type ofstream g("cifre15.out"); ^ cifre15.cpp: In function 'int main()': cifre15.cpp:7:25: error: 'f' was not declared in this scope {int n,x,d2=0,d5=0,p=1;f>>n;for(int i=1;i<=n;++i){f>>x;while(x%2==0){d2++;x/=2;}while(x%5==0){d5++;x/=5;}p=(p*(x%10)) %10;}g<<min(d2,d5)<<' ';int k=0,f=0;if(d2>d5){k=d2-d5;f=2;}else{k=d5-d2;f=5;}while (k>0){p=(p*f)%10;k--;}g<<p;return 0;} ^ cifre15.cpp:7:127: error: 'g' was not declared in this scope {int n,x,d2=0,d5=0,p=1;f>>n;for(int i=1;i<=n;++i){f>>x;while(x%2==0){d2++;x/=2;}while(x%5==0){d5++;x/=5;}p=(p*(x%10)) %10;}g<<min(d2,d5)<<' ';int k=0,f=0;if(d2>d5){k=d2-d5;f=2;}else{k=d5-d2;f=5;}while (k>0){p=(p*f)%10;k--;}g<<p;return 0;} ^ cifre15.cpp:7:139: error: 'min' was not declared in this scope {int n,x,d2=0,d5=0,p=1;f>>n;for(int i=1;i<=n;++i){f>>x;while(x%2==0){d2++;x/=2;}while(x%5==0){d5++;x/=5;}p=(p*(x%10)) %10;}g<<min(d2,d5)<<' ';int k=0,f=0;if(d2>d5){k=d2-d5;f=2;}else{k=d5-d2;f=5;}while (k>0){p=(p*f)%10;k--;}g<<p;return 0;} ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Cifre15 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.