U E D R , A S I H C RSS

Rabbit Hunt/김태진

Status

Problem2606Userjereneal20
MemoryKTimeMS
LanguageGCCResultWrong Answer

Source


#include <stdio.h>

int main()
{
    int N,i,j,k=0;
    double a[200][200]={0};
    int c[200][200]={0}, C=-1;
    int b[2][200]={0};
    
    scanf("%d",&N);
    for(i=0;i<N;i++){
        scanf("%d %d",&b[0][i],&b[1][i]);
    }
    for(i=0;i<N;i++){
        // 해 a 
        for(j=i+1;j<N;j++){
            //a   i   -1  
            if(b[0][i]==b[0][j]) {C++; continue;}
            a[i][j]=(b[1][i]-b[1][j])/(b[0][i]-b[0][j]);
        }
        for(j=i+1;j<N-1;j++){ 
            // 
            for(k=0;k<N-1;k++){
                //if(a[i][j]!=0){
                    if(a[i][j]==a[i][k+1]) c[i][j]++;
                //}
            }
        }
        c[i][0]=c[i][j-1];
        for(j=i+1;j<N-1;j++){
            if(c[i][0]<c[i][j+1]) c[i][0]=c[i][j+1];
        }
        
    }
    //  a , C  .
    if(C<c[0][0]) C=c[0][0];
    for(i=0;i<N-1;i++){
        if(c[i][0]<c[i+1][0]) C=c[i+1][0];
    }
    if(C==0) C++;
    printf("%d",C+1);
    
    return 0;
}

Trial and Error


  • 5 . . 하 , . accept..... float a ..? ;;

3
1 1
2 1
3 1 .

3
1 1
1 2
1 3 .

2
1 1
-100 101

3
1 1
2 2
101 102


Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:27:49
Processing time 0.0102 sec