Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int dp[10003];
- int n,m;
- int pow(int k,int n){
- int ret=1;
- for(int i=0;i<n;i++){
- ret*=k;
- }
- return ret;
- }
- int sum=1;
- long double sol=0;
- long double nm;
- int main(){
- cin>>m>>n;
- nm=pow(m,n);
- dp[1]=1;
- for(int i=2;i<=m;i++){
- dp[i]=pow(i,n)-sum;
- sum+=dp[i];
- }
- for(int i=1;i<=m;i++){
- sol+=dp[i]*i;
- }
- cout<<sol/nm<<endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement