#3

Cod:

int A[number],leftLimit = 0,rightLimit = A.lenght-1;

while(true)
{
	index = random(leftLimit,rightLimit)
	if(index == A[index])
		break;
	if(index < A[index])
		rightLimit = index;
	else if(index > A[index])
		leftLimit = index; 
}

cout<<"i="<<index;

iti mulrumesc..
si totusi, am luat 50 p, iesindu'mi din timp

http://infoarena.ro/job_detail/723601?action=view-source


as fi deosebit de recunoscator celui ce isi va dedica o mica parte din timpul sau pentru a'mi explica ce anume este gresit la aceasta sursa

Cod:

 

#include<fstream>
using namespace std;
int a[500000],b[500000],maxx=-30001,prim,ultim,p,u;
int main()
{ifstream f("secventa.in");
ofstream h("secventa.out");
int n,i,k,j,z;
f>>n>>z;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{j=i-1;
k=0;
while(j>=1&&a[j]>=a[i]&&k<z)
{k++;
j=j-1;}
prim=j+1;
j=i+1;
while(j<=n&&a[j]>=a[i]&&k<z)
{k++;
j=j+1;}
ultim=j-1;
k++;
if(a[i]>maxx&&k>=z)
{maxx=a[i];
p=prim;
u=ultim;}}
h<<p<<" "<<u<<" "<<maxx;	
return 0;}

ma poate ajuta cineva...spunandu'mi ce este gresit la aceast algoritm ?
iau doar 10 puncte ,wrong answer pe cele ramase

DA! iti multumesc
am luat 50 de pct deoarece mi'a iesit din timp, dar da...am accesat memorie nedeclarata

Cod:

#include<fstream>
#include<vector>
//|--|-| |-| |--|_| =
using namespace std;
vector<vector<long> > v(50000),vv(50000);
long k[50000];
long maxim=-2,gh=1;
void create(long x,long y)
{long i,size;
size=v[x].size();
for(i=size-1;i>=0;i--)  
if(v[x][i]!=y)
{vv[x].push_back(v[x][i]);
create(v[x][i],x);
v[x].pop_back();}
else
v[x].pop_back();}
long ccc[25];
void asdass(long x,long y)
{for(long i=0;i<vv[x].size();i++)
{ccc[vv[x][i]]=y;
asdass(vv[x][i],y);}}
void asdass1(long x)
{for(long i=0;i<vv[x].size();i++)
{k[ccc[vv[x][i]]]=k[ccc[vv[x][i]]]+1;
if(k[ccc[vv[x][i]]]>maxim)
{maxim=k[ccc[vv[x][i]]];
if(ccc[vv[x][i]]==0)
gh=1;
else
gh=ccc[vv[x][i]];}
asdass1(vv[x][i]);}}
int main()
{ifstream f("color4.in");
ofstream h("color4.out");
long n,m,c,x,y,i,j,a,b,cc;
f>>n>>m>>c;
for(i=1;i<n;i++)
{f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);}
create(1,1);
for(i=1;i<=m;i++)
{f>>cc;
if(cc==0)
{f>>a>>b;
ccc[a]=b;
asdass(a,b);}
else
{f>>a;
for(j=1;j<=c;j++)
k[j]=0;
maxim=-2;
k[ccc[a]]=1;
asdass1(a);
h<<gh<<" "<<maxim<<"\n";}}
return 0;}

ma poate ajuta cineva spunandu'mi de ce imi da killed by signal 11 ;excluzand primul test?
(nu cred ca acceseaza memorie in afara vectorului sau depaseste limita de memorie...sau?)

Editat de admin: Folosește tagurile "code" atunci cînd postezi surse.

este posibil sa primesc testele?

Va rog foarte mult, daca poate sa'mi descrie cineva greseala..deoarece am primit raspuns incorect pe toate testele
lucru ce ma jeneaza ingrozitor deoarece am petrecut un timp indelungat la crearea acestuia

iar pe toate exemplele ce mi'au venit in minte...mi'a afisat corect

Cod:

  #include<iostream.h>
#include<fstream.h>
#include<string.h>
long k[5001],v[5001],j=0;
int main()
{char a[100];
	ifstream f("nc.in");
ofstream h("nc.out");
long n,i=1,z=0,y=0;
while(!f.eof())
{
	f>>a;
	y=0;
	n=strlen(a);
	if(a[0]!='.'&&a[0]!='?'&&a[0]!='!')
	k[z]=k[z]+1;
	
for(i=0;i<n;i++)
{if(a[i]=='.'&&a[i+1]=='.'&&a[i+2]=='.')
	{z++;
y=1;

j++;
v[j]=k[z-1];
if(i+2<n-1)
k[z]=k[z]+1;	
break; }
if(y==0)
if(a[i]=='.'||a[i]=='?'||a[i]=='!')
	{z++;
j++;
v[j]=k[z-1];
if(i<n-1)
k[z]=k[z]+1;
	break;}
}
}
h<<z<<endl;
for(i=1;i<=j;i++)
	h<<v[i]<<endl;	
	return 0;} 

Cand folosesti tag-ul code, scoate spatiile. (Uita-te in mesaj cum ti-am editat.)

Conform "verificatorului" acest algoritm este gresit (wrong answer)

Asa fiind...poate sa'mi explice cineva unde imi este gresit rationamentul ?

Cod:

#include<iostream.h>
#include<fstream.h>
long long a[9000][9000];
int main()
{int i,j,k,n,m,x,y,z;

	ifstream f("dijkstra.in");
ofstream h("dijkstra.out");
f>>n>>m;

for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
	a[i][j]=10000;


for(i=1;i<=m;i++)
{	f>>x>>y>>z;
a[x][y]=z;}
for(k=1;k<=n;k++)	
for(j=1;j<=n;j++)
 if(a[1][k]+a[k][j]<a[1][j]&&i!=k&&j!=k)	
	a[1][j]=a[1][k]+a[k][j];
for(i=2;i<=n;i++)
	h<<a[1][i]<<" ";


	return 0;}

Modificat de Moderator: Nu mai posta consecutiv si foloseste tag-ul [ code ] ... [ / code ] cand scrii surse

Cod:

#include<iostream.h>
#include<fstream.h>
#include<string.h>
int main()
{char a[200001],b,c[200001];
long i,k=0;
ifstream f("palindrom2.in");
ofstream g("palindrom2.out");
f.getline(a,200000);
i=strlen(a)-1;
b=a[i-1];
while(i!=0)
	{if(a[i]!=b)
		i=0;
	else
		{k++;
	i--;}
	}
if(k==0)
	{strcpy(c,a);
	strcpy(a+strlen(a)-1,a+strlen(a));
strcat(c,strrev(a));
g<<c;}

else
	{strcpy(c,a);
strcpy(c+strlen(c)-k+1,c+strlen(c));
	strcpy(a+strlen(a)-k,a+strlen(a));
strcat(c,strrev(a));
g<<c;
	}

return 0;} 

De ce primesc aceste banale erori de compilare?
la mine merge minunat,compilatorul fiind minGW
este de'a dreptul demoralizant
user.cpp:22: error: 'strrev' was not declared in this scope
user.cpp:29: error: 'strrev' was not declared in this scope

[editat de moderator] folositi tag-ul "code" cand postati cod...

Cod:

#include<iostream.h>
#include<fstream.h>
int main()
{long i,b,j,z,k=0,c,a;
ifstream f("cifra.in");
ofstream g("cifra.out");
f>>a;
for(i=1;i<=a;i++)
{f>>b;k=0;
for(j=1;j<=b;j++)
	{c=1;
	for(z=1;z<=j;z++)
		c=c*j;
k=k+c;}
g<<k%10<<endl;}
return 0;}

nu intaleg dc da 0 puncte
verificatorul sfideaza normalitatea si logica...pe toate testele afiseaza 0 pcte
poti

[Editat de admin] Foloseste tag-ul [ code ] [ /code ] cand postezi surse.

Cod:

#include<iostream.h>
#include<fstream.h>
#include<string.h>
int main()
{char a[200001],b,c[200001];
long i,k=0;
ifstream f("palindrom.in");
ofstream g("palindrom.out");
f.getline(a,200000);
i=strlen(a)-1;
b=a[i-1];
while(i!=0)
	{if(a[i]!=b)
		i=0;
	else
		{k++;
	i--;}
	}
if(k==0)
	{strcpy(c,a);
	strcpy(a+strlen(a)-1,a+strlen(a));
strcat(c,strrev(a));
g<<c;}

else
	{strcpy(c,a);
strcpy(c+strlen(c)-k+1,c+strlen(c));
	strcpy(a+strlen(a)-k,a+strlen(a));
strcat(c,strrev(a));
g<<c;
	}

return 0;}

care este problematica totusi...?
dc apare aceasta inexplicabila eroare?
va multumesc

Editat de admin: Foloseste tagul "code" cand postezi surse.

Cod:

#include<iostream.h>
#include<fstream.h>
#include<string.h>
int main()
{long a,b=1,i=2,c=1;
ifstream f("fact.in");
ofstream g("fact.out");
f>>a;
for(i=1;i<=a;i++)
b=b*10;
while(c%b!=0)
{c=c*i;
i++;}
g<<i;
return 0;}

 
daca privim logic..algoritmul trebuie sa mearga perfect...dar desigur..iau 5 pct daor la prima verificare..dupa care la a2a gresit iar de la 3 la 10 afiseaza mesajul "Killed by signal 8(SIGFPE)"...ceea ce inseamna ca undeva se imparte la 0.Asa fiind am observat ca in "for" se intampla ca b=0..ptr valori imense ale lui "a"..respectiv "p" din problema.Sfaturi?

[editat de moderator] foloseste tagul "code"

Editat de admin: Invata sa te exprimi civilizat!