UVA 113 (Power of Cryptography )Solution

Solve in C:

#include<stdio.h>
#include<math.h>
int main()
  {
      double p,n,r;
      while(scanf("%lf%lf",&n,&p)!=EOF)
      {
          r=pow(p,1/n);
      printf("%.0lf\n",r);
      }
  }

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.