{"blog_url":"https://rokugats-pc.hateblo.jp/","provider_url":"https://hatena.blog","image_url":null,"height":"190","type":"rich","width":"100%","author_url":"https://blog.hatena.ne.jp/rokugats/","published":"2014-06-16 07:44:41","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Frokugats-pc.hateblo.jp%2Fentry%2F2014%2F06%2F16%2F074441\" title=\"POJ PKU 3132 Sum of Different Primes - ICPC log\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","version":"1.0","blog_title":"ICPC log","description":"DP\u3002\u7c21\u5358\u3002 dp[n][k][i] := i\u756a\u76ee\u307e\u3067\u306e\u7d20\u6570\u3092k\u500b\u7528\u3044\u3066n\u3092\u4f5c\u308b\u5834\u5408\u306e\u6570 dp[n][k][i] = dp[n - i\u756a\u76ee\u306e\u7d20\u6570][k - 1][i - 1] + dp[n][k][i - 1]#include <cstdio> #include <cstring> #include <algorithm> #define MAX_N 1120 #define MAX_K 14 using namespace std; int I; int p[200]; int dp[1200][20][200]; int main(){ I = 1; bool isp[1200]; fil\u2026","categories":["POJ","DP"],"url":"https://rokugats-pc.hateblo.jp/entry/2014/06/16/074441","title":"POJ PKU 3132 Sum of Different Primes","author_name":"rokugats","provider_name":"Hatena Blog"}