コード例 #1
0
SMevent SMreadPostAsCompactPre::read_element()
{
  if ((have_new + have_triangle) == 0)
  {
    next_new = 0;
    have_finalized = next_finalized = 0;
    
    int ok = read_triangle();
    if (ok <= 0)
    {
      return (SMevent)ok;
    }
  }
  if (have_new)
  {
    v_idx = t_idx[new_vertices[next_new]];
    VecCopy3fv(v_pos_f,t_pos_f[new_vertices[next_new]]);
    have_new--; next_new++;
    v_count++;
    return SM_VERTEX;
  }
  else
  {
    have_triangle = 0;
    f_count++;
    return SM_TRIANGLE;
  }
}
コード例 #2
0
ファイル: problem_18.c プロジェクト: bill1118qq/Project_Euler
int main(void) {
	int triangle[15][15], biggest = 0;
	route_t route;
	puts("Hello World"); /* prints Hello World */

	memset(triangle, 0, sizeof(int) * 15 * 15);
	read_triangle(triangle);

	trace_route(triangle, 0, 0, 0, &biggest, &route);

	return EXIT_SUCCESS;
}
コード例 #3
0
int main (void) {
	triangle_t t;

	int count = 0;

	while (read_triangle (&t))
		if (contains_origin (&t))
			count++;

	printf ("%d\n", count);

	return 0;
}