F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_30423417_5348.cpp:24:15: error: expected initializer at end of input
 void getprime()         //Å·À­É¸{    memset(is, false, sizeof(is));    tot = 0;    for(int i=2; i<=MAXN; ++i)    {        if(is[i] == false)            prime[tot++] = i;        for(int j=0; j<tot && i*prime[j] <= MAXN; ++j)        {            is[i*prime[j]] = true;            if(i%prime[j] == 0)                break;        }    }}  ll yueshuSUM(ll x){    ll ans = MAXN;    n = x;    for(int i=0; i<tot && prime[i] < n; ++i)    {        if(n%prime[i] == 0)        {            ll k = 0;            while(n%prime[i] == 0)            {                n/=prime[i];                ++k;            }            ans = min(ans, k);        }        if(ans == 1)            return ans;    }//    if(n > 1)        //²»ÄÜÌØÅÐ//        ans = 1;    return ans;} int main(){    getprime();    int t;    scanf("%d", &t);    while(t--)    {        ll k, m, sum=0, ans;        scanf("%lld", &k);        ans = yueshuSUM(k);        if(n == 1)            printf("%lld\n", ans);        else        {            if(ans > 4 && pow(floor(pow(n, 1.0/4)+eps), 4) == n)                puts("4");            else if(ans > 3 && pow(floor(pow(n, 1.0/3)+eps), 3) == n)                puts("3");            else if(ans > 2 && pow(floor(pow(n, 1.0/2)+eps), 2) == n)                puts("2");            else                puts("1");        }    }    return 0;}
               ^


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-20 07:17:23, Gzip enabled