Пример #1
0
void tpie_init(int subsystems) {
	if (subsystems & MEMORY_MANAGER)	
	 	init_memory_manager();

	if (subsystems & DEFAULT_LOGGING)
		init_default_log();

	if (subsystems & PRIMEDB)
		init_prime();

	if (subsystems & CAPTURE_FRACTIONS) {
		init_fraction_db(true);
		init_execution_time_db();
	} else if (subsystems & PROGRESS) {
		init_fraction_db(false);
		init_execution_time_db();
	}

	if (subsystems & JOB_MANAGER)
		init_job();

	if (subsystems & STREAMS) {
		init_stream_buffer_pool();
		init_compressor();
	}

	if (subsystems & HASH)
		init_hash();
}
Пример #2
0
int main() {
	init_prime();
	init_ans();
	int runs, n;
	scanf("%d", &runs);
	while (runs--) {
		scanf("%d", &n);
		printf("%d\n", a[n-1]);
	}
	return 0;
}
int main()
{
    init_prime();
    while(scanf("%d",&n)!=EOF&&n>0)
    {
        int cnt=0;
        for(int i=2;i<=n/2;i++)
        {
            if(is_prime[i]&&is_prime[n-i]) cnt++;
        }
        printf("%d\n",cnt);
    }
    return(0);
}
Пример #4
0
int main(int argc, char *argv[]) {
  int casen = 1;

  init_prime();

  while (scanf("%d\n", &n) != EOF) {
    result[0] = 1;
    used[1] = 1;
    memset(used, sizeof(used)/sizeof(int), 0);
    printf("Case %d:\n", casen++);
    solve(1);
    printf("\n");
  }

  return 0;
}
Пример #5
0
u8 *magic_new(u32 *size)
{
    prime p;
    u8 *m;
    u32 lcm;
    u32 i;

    lcm = 1;
    for (i = 1; i <= MAGIC_PRIMES; ++i)
        lcm *= wheel[i];

    m = ez_malloc(lcm);
    memset(m, 0xff, lcm);

    for (i = 1; i <= MAGIC_PRIMES; ++i) {
        init_prime(&p, 0, i, 0, 0);
        mark_multiples(&p, m, lcm);
    }

    *size = lcm;

    return m;
}