Cod sursa(job #56926)
| Utilizator | Data | 30 aprilie 2007 20:05:21 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <cstdio>
#include <cmath>
#define MAX 100000
FILE *in = fopen("divprim.in","r"), *out = fopen("divprim.out","w");
int t, n, k;
int a[MAX+1] = {0};
//int sol[MAX][7] = {{0}};
void init()
{
int p = sqrt(MAX*1.0)+1;
for ( int i = 2; i <= MAX; ++i )
{
if ( !a[i] )
{
++a[i];
if ( i <= p )
for ( int j = i+i; j <= MAX; j += i )
++a[j];
}
}
}
int main()
{
init();
// fscanf(in, "%d", &t);
// for ( int i = 0; i < t; ++i )
// {
// fscanf(in, "%d %d", &n, &k);
// }
return 0;
}
