Game of lines (run time error SIGSEGV)

[mido22_sof]

this is the problem
spoj.pl/problems/LINES/

this is my code

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
int main()
{
 int n;
 cin>>n;
 while(n!=0)
 {
  int i,j,miz=0;
  int x[n+1],y[n+1];
  double slope[n+1];
  for(i=0;i<n;i++)
  {
   cin>>x[i]>>y[i];
  }
  for(i=0;i<n;i++)
  {
  for(j=i+1;j<n;j++)
  {
   int r1=x[j]-x[i];
   int r2=y[j]-y[i];
   if(r1==0){continue;}
   slope[miz]=r2/r1;
   miz++;
  }
  }
     int value,idx,u=0;
            for(value=0;value<n;value++)
            {
             for(idx=value+1;idx<n;idx++)
             {
              if(slope[value]==slope[idx]&&slope[value]!=97)
              {
               slope[idx]=97;//any number cann't be slope
              }
             }
            }
            for(value=0;value<n;value++)
            {
             if(slope[value]!=97)
             {
              u++;
             }
            }
            cout<<u+1<<endl;
 cin>>n;
 }
return 0;
}

[leppyr64]

Your error is likely from division by zero.

How big do you think miz will be?

Why are you storing only integers in slope?

[mido22_sof]

yea i know my mistake leppy thx

[mido22_sof]

it gives now tle

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
float fun(float y1,float x1)
{
 float a=y1/x1;
 return a;
}
int main()
{
 for(int N;scanf("%d",&N)==1 && N;)
 {
  int j,miz=0,i;
  float x[N],y[N],w;
  float slope[99999];
  for(i = 0; i<N;i++) scanf("%f%f",&x[i],&y[i]);
  for(i=0;i<N;i++)
  {
  for(j=i+1;j<N;j++)
  {
   slope[miz]=fun(y[i]-y[j],x[i]-x[j]);
   miz++;
  }
  }
     int value,idx,u=miz;
         for(value=0;value<miz;value++)
            {
             for(idx=value+1;idx<miz;idx++)
             {
              if(slope[value]==slope[idx])
              {
               u--;
              }
             }
            }
         printf("%d\n",u);
 }
return 0;
}

can anyone tell me how i remove repeated numbers in array with faster way than me

[leppyr64]

Sort it.

PS: You'll want to avoid float. Use double instead.

[mido22_sof]

after sorting how i remove reapeated numbers and i use double

n.b: thx for your reply leppy

[mido22_sof]

i think if i sort then i put them in another array to remove duplicates it won't make little time!!!!

[mido22_sof]

another failed try i am very sad ,bored , i tried alot

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
float fun(float y1,float x1)
{
 float a=y1/x1;
 return a;
}
int main()
{
 for(int N;scanf("%d",&N)==1 && N;)
 {
  int j,miz=0,i;
  float x[N],y[N],w;
  float slope[99999];
  for(i = 0; i<N;i++) scanf("%f%f",&x[i],&y[i]);
  for(i=0;i<N;i++)
  {
  for(j=i+1;j<N;j++)
  {
   slope[miz]=fun(y[i]-y[j],x[i]-x[j]);
   miz++;
  }
  }
     int value,idx,u=miz;
         for(value=0;value<=miz;value++)
            {
             sort(&slope[0],&slope[miz]);
            }
         for(value=0;value<miz;value++)
            {
             if(slope[value]==slope[value+1]){
              u--;
              value++;
            }
            }
         printf("%d\n",u);
 }
return 0;
}

[mido22_sof]

do u know another faster sort way
or what can i do

[leppyr64]

You only need to sort once per test case.

Sort(slope, slope+ miz)
int u = 0 
If miz > 0 
  U = 1 
For int I = 1 to miz-1 
  If slope[i] != slope[i-1] 
  U++

[mido22_sof]

can u explain more

this is my code after changing but also tle

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>
#include<process.h>
#include<stdlib.h>
using namespace std;
double fun(double y1,double x1)
{
 double a=y1/x1;
 return a;
}
int main()
{
 for(int N;scanf("%d",&N)==1 && N;)
 {
  int j,miz=0,i;
  double x[N],y[N],w;
  double slope[99999];
  for(i = 0; i<N;i++) cin>>x[i]>>y[i];
  for(i=0;i<N;i++)
  {
  for(j=i+1;j<N;j++)
  {
   slope[miz]=fun(y[i]-y[j],x[i]-x[j]);
    sort(&slope[0],&slope[miz+1]);// i don't know where i put it 
   miz++;
  }
  }
     int value,idx,u=0;
     if(miz>0){u=1;}
         for(value=1;value<miz-1;value++)
            {
             if(slope[value]!=slope[value-1]){
              u++;}
            }
         printf("%d\n",u);
 }
return 0;
}

[vinaybajaj]

it's givin WA can anyone tell the mistake....

include

include

include

using namespace std;

define INF 100000000

int main()
{
int n,i,j;
while (scanf ("%d",&n) && n)
{
int a[n],b[n],cnt=0,l=0;
double chek[n*n+1],k1,k2;

for (i=0;i<n;i++)
    scanf ("%d%d",&a[i],&b[i]);
for (i=0;i<n;i++)
{
    for (j=i+1;j<n;j++)
    {
        k1=b[j]-b[i];
        k2=a[j]-a[i];
        if (k2==0 && k1 > 0)
            chek[l++]=INF;
        else if (k2==0 && k1 < 0)
            chek[l++]=-INF;
        else
            chek[l++]=double(k1/(k2*1.0));
       // printf ("== %lf\n",chek[l-1]);
    }
}
sort (chek,chek+l);

if (l>0)
    cnt++;

for (i=1;i<l;i++)
{

    if (chek[i]!=chek[i-1])
         cnt++;
}
printf ("%d\n",cnt);
}
return 0;

}