UVa 113 – Power of Cryptography


/*
User ID: turing_13
Link : http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=49
*/

#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

int main()
{
    double n,p;
    while(scanf("%lf %lf", &n,&p)==2)
    {
        printf("%.lf\n", pow(p,1/n));
    }
    return 0;
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s