here is my code
[c]int Path[20][20];
printpath(int i,int j)
{
if(i!=j) printpath(i,Path [j]);
printf("%d ",j+1);
}
main()
{
double conv[20][20];
int n,i,j,k,arbitrage;
while(scanf("%d",&n)==1){
arbitrage=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++){
if(i==j) conv [j]=1;
else scanf("%lf",&conv [j ...
Search found 3 matches
- Mon Oct 20, 2003 8:03 pm
- Forum: Volume 1 (100-199)
- Topic: 104 - Arbitrage
- Replies: 223
- Views: 37570
- Sat Aug 02, 2003 10:22 am
- Forum: General
- Topic: Why I always P.E
- Replies: 1
- Views: 826
Why I always P.E
I have so solved some prob. but I allways got P.E.Why???
Can some body tell me what will make P.E.
thanx.
Can some body tell me what will make P.E.
thanx.
- Sat Aug 02, 2003 10:22 am
- Forum: General
- Topic: Why I always P.E
- Replies: 2
- Views: 1312
Why I always P.E
I have so solved some prob. but I allways got P.E.Why???
Can some body tell me what will make P.E.
thanx.
Can some body tell me what will make P.E.
thanx.