제출 #102240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102240		IvanC	새로운 문제 (COCI19_akvizna)	C++17	20 / 130	4 ms	896 KiB

Main

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 510;

int vis[MAXN][MAXN],N,K;
double dp[MAXN][MAXN];

double solve(int n,int k){

	if(vis[n][k]) return dp[n][k];

	vis[n][k] = 1;

	if(k == 0) return dp[n][k] = 0;

	double tot = 0;
	for(int i = 1;n - i >= k-1;i++){
		tot = max(tot, double(i)/double(n) + solve(n - i,k-1));
	}

	return dp[n][k] = tot;

}

int main(){

	cin >> N >> K;

	printf("%.9lf\n",solve(N,K));

	return 0;

}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5
• Subtask 24: 0 / 5
• Subtask 25: 0 / 5
• Subtask 26: 0 / 5