{"url":"https://motumotu.hateblo.jp/entry/2014/12/10/001639","published":"2014-12-10 00:16:39","title":"AOJ 0096 Sum of 4 Integers II","height":"190","provider_name":"Hatena Blog","categories":["AOJ","DP"],"description":"\u554f\u984c\u6587 http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0096 \u6982\u8981 n\u304c\u4e0e\u3048\u3089\u308c\u305f\u3068\u304d\u3001a + b + c + d = n \u3068\u306a\u308b\u7d44\u307f\u5408\u308f\u305b\u6570\u3092\u6c42\u3081\u3088\u3002 \u89e3\u6cd5 \u5168\u63a2\u7d22\u3060\u3068\u30011000^4 \u306a\u306e\u3067\u9593\u306b\u5408\u308f\u306a\u3044\u3002DP[i\u500b\u76ee][\u5408\u8a08]\u3067\u6570\u3048\u4e0a\u3052\u3092\u3059\u308b\u3002 \u30b3\u30fc\u30c9 #include <iostream> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) int main() { long long d\u2026","blog_url":"https://motumotu.hateblo.jp/","author_url":"https://blog.hatena.ne.jp/mo2dx/","version":"1.0","image_url":null,"provider_url":"https://hatena.blog","author_name":"mo2dx","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmotumotu.hateblo.jp%2Fentry%2F2014%2F12%2F10%2F001639\" title=\"AOJ 0096 Sum of 4 Integers II - motu*2\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","type":"rich","blog_title":"motu*2","width":"100%"}