func_code_string: #include <bits/stdc++.h>   using namespace std;   int tot;   int num[1008];   int is[1005];   int n, pos[1005][5];   int main() {     scanf( %d , &n);     for (int i = 0; i < n; i++) {       for (int j = 0; j < 5; j++) {         scanf( %d , pos[i] + j);       }     }     int flag = 0;     int yes = 0;     if (n < 3) {       if (n == 1) {         printf( 1 n1 n );       } else {         printf( 2 n1 2 n );       }       return 0;     }     for (int i = 0; i < n; i++) {       flag = 1;       if (is[i]) continue;       is[i] = 1;       for (int j = 0; j < n && flag; j++) {         for (int k = 0; k < n && flag; k++) {           if (i == j || i == k || k == j) {             continue;           }           int x[5] = {0}, y[5] = {0};           for (int m = 0; m < 5; m++) {             x[m] = pos[j][m] - pos[i][m];           }           for (int m = 0; m < 5; m++) {             y[m] = pos[k][m] - pos[i][m];           }           int temp = 0;           for (int m = 0; m < 5; m++) {             temp += x[m] * y[m];           }           if (temp <= 0) {             is[j] = 1;             is[k] = 1;           } else {             is[i] = 1;             flag = 0;           }         }       }       if (flag == 1) {         printf( 1 n%d , i + 1);         yes = 1;         break;       }     }     if (yes == 0) {       printf( 0 n );     }     return 0;   }   