Pagini: 1 ... 10 11 [12]   În jos
  Imprimă  
Ajutor Subiect: 008 Cifra  (Citit de 106585 ori)
0 Utilizatori şi 1 Vizitator pe acest subiect.
arvlge
Strain


Karma: -1
Deconectat Deconectat

Mesaje: 13



Vezi Profilul
« Răspunde #275 : Iulie 19, 2018, 19:58:12 »

Bodo171/Bogdan Pop. Multumesc pt sugestii. Pana la urma am reusit sa rezolv problema Very Happy
Memorat
adela15
Strain


Karma: 0
Deconectat Deconectat

Mesaje: 1



Vezi Profilul
« Răspunde #276 : Septembrie 27, 2018, 12:43:48 »

problema este frumoasa dar grea:shock: Shocked Shocked :shock  Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked Shocked
Memorat
Afloarei
Strain


Karma: 0
Deconectat Deconectat

Mesaje: 1



Vezi Profilul
« Răspunde #277 : Ianuarie 29, 2019, 15:03:37 »

Va salut!
Sunt nou pe acest site si aceasta problema este prima la care am incarcat codul pentru evaluare.
Pe laptop programul care l-am scris merge bine dar evaluatorul imi da 0 puncte si nu inteleg de ce.
Aici e codul:
https://infoarena.ro/job_detail/2331277?action=view-source

Ce anume nu am facut bine?

Multumesc
       A.A.
Memorat
vlad082002
Strain


Karma: 0
Deconectat Deconectat

Mesaje: 2



Vezi Profilul
« Răspunde #278 : Iunie 03, 2019, 22:30:53 »

Am memorat solutiile pt n <= 100 intr-un vector si am afisat solutia pt ultimele 2 cifre ale numerelor, dar tot epasesc timpul de executie si iau 60p si nu inteleg de ce.. Ma poate ajuta cineva?
Memorat
GaByxD
Strain


Karma: 0
Deconectat Deconectat

Mesaje: 1



Vezi Profilul
« Răspunde #279 : Iulie 24, 2019, 14:45:25 »

salutare..incerc sa rezolv problema aceasta ..si tot imi da 0 puncte..
Cod:

#include<fstream>
#include<cmath>
using namespace std;
ifstream f ("cifra.in");
ofstream g ("cifra.out");
int t,v[30001];
long long n,s,i,j;
int main()
{
    f>>t;
    for(i=1;i<=t;i++)
        f>>v;
    for(i=1;i<=t;i++)
        {s=0;
        for(j=1;j<=v;j++)
            s = s + pow(j,j);
        g<<s%10<<endl;}



}
Memorat
Pagini: 1 ... 10 11 [12]   În sus
  Imprimă  
 
Schimbă forumul:  

Powered by SMF 1.1.19 | SMF © 2006-2013, Simple Machines