poj2000,poj2390,poj2509

poj2000

#include<iostream>
using namespace std;
int main(void)
{
    int n;
    while(cin>>n&&n!=0)
    {
        int num=0;
        int i,m;
        for(i=1;;i++)
        {
            num+=i;
            if(num>=n)
            {
                m=n-num+i;
                i--;
                break;
            }
        }
        int sum=0;
        for(int j=1;j<=i;j++)
        {

            sum+=j*j;
        }
        sum+=(i+1)*m;
        cout<<n<<" "<<sum<<endl;
    }
}

poj2390

#include<iostream>
using namespace std;
int main(void)
{
    double r;
    int m,y;
    cin>>r>>m>>y;
    double f=m;
    for(int i=0;i<y;i++)
    {
        f=f*(1+r/100);
    }
    cout<<(int)f<<endl;
}

poj2509

#include<iostream>
using namespace std;
int main(void)
{
    int n,k;
    while(cin>>n&&cin>>k)
    {
        int m=n;
        while(n/k)
        {
            m+=n/k;
            n=n/k+n%k;
        }
        cout<<m<<endl;
    }
}
发布了20 篇原创文章 · 获赞 3 · 访问量 5478

猜你喜欢

转载自blog.csdn.net/treble_csnd/article/details/79593558
POJ