zoj 2330
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define inc 1e-7
#define e exp(1.0)
double n;
double f(double x)
{
return x/log(x)-n/log(n);
}
void binary(double a)
{
double l=e+inc,r=10000.0,mid;
if(n-e>inc)
{
printf("-1\n");
return ;
}
while(r-l>inc)
{
mid=(l+r)/2;
if(f(l)*f(mid)<0)
r=mid;
else
l=mid;
}
printf("%.5f\n",mid);
}
int main()
{
while(~scanf("%lf",&n))
{
binary(n);
}
return 0;
}
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define M 500002
int a[M];
void get()
{
int i,j;
for( i = 1 ; i <=250000; i ++ )
for ( j = 2 ; i*j <= 500000 ; j ++ )//将所有含因数i的数i*j均加上i
a[i*j] += i;
}
int main()
{
int T;
int n,ans;
//freopen("o.txt","w",stdout);
cin>>T;
get();
while(T--)
{
scanf("%d",&n);
printf("%d\n",a[n]);
}
return 0;
}