{"id":3863,"date":"2015-05-27T16:31:56","date_gmt":"2015-05-27T07:31:56","guid":{"rendered":"http:\/\/peta.okechan.net\/blog\/?p=3863"},"modified":"2015-05-27T16:43:54","modified_gmt":"2015-05-27T07:43:54","slug":"1%e6%99%82%e9%96%93%e4%bb%a5%e5%86%85%e3%81%ab%e8%a7%a3%e3%81%91%e3%81%aa%e3%81%91%e3%82%8c%e3%81%b0%e3%83%97%e3%83%ad%e3%82%b0%e3%83%a9%e3%83%9e%e5%a4%b1%e6%a0%bc%e3%81%a8%e3%81%aa%e3%81%a3%e3%81%a6","status":"publish","type":"post","link":"https:\/\/peta.okechan.net\/blog\/archives\/3863","title":{"rendered":"1\u6642\u9593\u4ee5\u5185\u306b\u89e3\u3051\u306a\u3051\u308c\u3070\u30d7\u30ed\u30b0\u30e9\u30de\u5931\u683c\u3068\u306a\u3063\u3066\u3057\u307e\u30465\u3064\u306e\u554f\u984c\u3092\u89e3\u3044\u3066\u307f\u3066\u30d7\u30ed\u30b0\u30e9\u30de\u30fc\u5931\u683c\u3060\u3068\u5224\u660e"},"content":{"rendered":"

1\u6642\u9593\u4ee5\u5185\u306b\u89e3\u3051\u306a\u3051\u308c\u3070\u30d7\u30ed\u30b0\u30e9\u30de\u5931\u683c\u3068\u306a\u3063\u3066\u3057\u307e\u30465\u3064\u306e\u554f\u984c\u304c\u8a71\u984c\u306b<\/a>
\n\u3068\u3044\u3046\u3082\u306e\u304c\u3042\u3063\u305f\u306e\u3067C++\u89e3\u3044\u3066\u307f\u307e\u3057\u305f\u3002
\n\u6700\u8fd1\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u3084\u3063\u3066\u306a\u304f\u3066\u30e9\u30a4\u30d6\u30e9\u30ea\u306e\u4f7f\u3044\u65b9\u3092\u8abf\u3079\u306a\u304c\u3089\u3067\u3057\u305f\u3057\u3001\u4f7f\u7528\u3057\u305f\u74b0\u5883\u304c\u30a2\u30c3\u30d7\u30b0\u30ec\u30fc\u30c9\u3057\u305f\u3070\u3063\u304b\u308a\u306eFedora 22\u3067Vim\u306e\u30d7\u30e9\u30b0\u30a4\u30f3\u304c\u52d5\u304b\u306a\u304b\u3063\u305f\u308a\u3001\u5236\u9650\u6642\u9593\u306b\u8ffd\u308f\u308c\u3066\u7126\u308a\u307e\u304f\u3063\u3066\u305f\u306e\u3067\u9177\u3044\u30b3\u30fc\u30c9\u306b\u306a\u3063\u3066\u304a\u308a\u307e\u3059\u3002
\n\u81ea\u5206\u3067\u89e3\u3044\u3066\u307f\u305f\u3044\u65b9\u306b\u3068\u3063\u3066\u3053\u306e\u8a18\u4e8b\u306f\u30cd\u30bf\u30d0\u30ec\u3068\u306a\u308a\u307e\u3059\u306e\u3067\u3054\u6ce8\u610f\u304f\u3060\u3055\u3044\u3002
\n\uff08\u4e0a\u8a18\u306e\u7406\u7531\u306b\u3088\u308a\u3042\u307e\u308a\u53c2\u8003\u306b\u306a\u3089\u306a\u3044\u30b3\u30fc\u30c9\u3060\u3068\u601d\u3044\u307e\u3059\u304c\u2026\uff09<\/p>\n

\u4e00\u5fdc\u89e3\u304f\u306e\u306f\u5168\u90e8\u89e3\u3051\u305f\u3093\u3067\u3059\u304c\uff08\u3044\u3084\u4e00\u90e8\u30a2\u30a6\u30c8\u304b\u2026\uff09\u30015\u554f\u4e2d4\u554f\u7d42\u308f\u308b\u307e\u3067\u30671\u6642\u9593\u639b\u304b\u3063\u3066\u3057\u307e\u3044\u30015\u554f\u76ee\u3060\u3051\u30671\u6642\u9593\u534a\u639b\u304b\u3063\u3066\u3057\u307e\u3044\u307e\u3057\u305f\u3002
\n5\u554f\u76ee\u306f\u6a2a\u7740\u3057\u3088\u3046\u3068\u3057\u305f\u7d50\u679c\u9006\u306b\u3084\u305f\u3089\u3068\u30b3\u30fc\u30c9\u304c\u8907\u96d1\u306b\u306a\u3063\u3066\u3057\u307e\u3044\u305d\u306e\u30d0\u30b0\u53d6\u308a\u306b\u6642\u9593\u304c\u639b\u304b\u3063\u305f\u3093\u3067\u3059\u304c\u3001\u30b9\u30d1\u30c3\u3068\u8ae6\u3081\u3066\u5225\u306e\u65b9\u6cd5\u3067\u66f8\u304d\u306a\u304a\u3057\u305f\u308910\u5206\u304f\u3089\u3044\u3067\u66f8\u3051\u307e\u3057\u305f\u3002
\n\u8ca0\u3051\u60dc\u3057\u307f\u3067\u3059\u3002<\/p>\n

\u30b3\u30f3\u30d1\u30a4\u30e9\uff08clang++\uff09\u306e\u30d0\u30fc\u30b8\u30e7\u30f3\u3002<\/p>\n

\r\nclang version 3.5.0 (tags\/RELEASE_350\/final)\r\nTarget: x86_64-redhat-linux-gnu\r\nThread model: posix\r\n<\/pre>\n
\u5168\u3066 -std=c++14 \u3067\u30b3\u30f3\u30d1\u30a4\u30eb\u3002
\n\uff08\u7279\u306bC++14\u306e\u6a5f\u80fd\u3092\u4f7f\u3063\u3066\u308b\u308f\u3051\u3067\u306f\u306a\u3044\u3002\u306f\u305a\u3002\uff09<\/p>\n
\u305d\u308c\u3067\u306f\u4ee5\u4e0b\u30b3\u30fc\u30c9\u3002<\/p>\n
\u554f1<\/h3>\n
for, while, \u518d\u5e30\u3092\u4f7f\u3063\u3066\u30ea\u30b9\u30c8\u306e\u5408\u8a08\u3092\u8a08\u7b97\u3059\u308b\u95a2\u6570\u30923\u3064\u4f5c\u308c\u3002<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
template\u4f7f\u3063\u3066\u308b\u3068\u3053\u308d\u306b\u4f59\u88d5\u304c\u611f\u3058\u3089\u308c\u307e\u3059\u3002<\/p>\n
\r\n#include <iostream>\r\n#include <vector>\r\n\r\ntemplate<typename T>\r\nT sum_by_for(std::vector<T> &list)\r\n{\r\n  T s = T(0);\r\n  for (size_t i = 0; i < list.size(); ++i)\r\n  {\r\n    s += list[i];\r\n  }\r\n  return s;\r\n}\r\n\r\ntemplate<typename T>\r\nT sum_by_while(std::vector<T> &list)\r\n{\r\n  T s = T(0);\r\n  size_t i = 0;\r\n  while (i < list.size())\r\n  {\r\n    s += list[i];\r\n    ++i;\r\n  }\r\n  return s;\r\n}\r\n\r\ntemplate<typename T>\r\nT sum_by_recursion(std::vector<T> &list, size_t base = 0)\r\n{\r\n  if (base >= list.size()) return 0;\r\n  return list[base] + sum_by_recursion(list, base + 1);\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<double> list{1.0, 2.0, 3.0};\r\n  std::cout << sum_by_for(list) << std::endl;\r\n  std::cout << sum_by_while(list) << std::endl;\r\n  std::cout << sum_by_recursion(list) << std::endl;\r\n}\r\n<\/pre>\n
\u554f2<\/h3>\n
2\u3064\u306e\u30ea\u30b9\u30c8\u3092Python\u306ezip\u95a2\u6570\u306e\u3088\u3046\u306a\u611f\u3058\u3067\u4ea4\u4e92\u306b\u6df7\u305c\u3066\u7d50\u5408\u3059\u308b\u95a2\u6570\u3092\u4f5c\u308c\u3002<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
\u3053\u306e\u8fba\u308a\u3067\u3061\u3087\u3063\u3068\u7126\u308a\u3064\u3064\u3042\u308a\u30b3\u30fc\u30c9\u304c\u5fae\u5999\u306a\u611f\u3058\u306b\u306a\u3063\u3066\u304d\u307e\u3059\u3002<\/p>\n
\r\n#include<iostream>\r\n#include<vector>\r\n\r\ntemplate<typename T>\r\nstd::vector<T> zip(std::vector<T> listA, std::vector<T> listB)\r\n{\r\n  std::vector<T> result;\r\n  size_t iA = 0;\r\n  size_t iB = 0;\r\n  for (size_t i = 0; i < listA.size() + listB.size(); ++i)\r\n  {\r\n    if (i % 2 == 0) {\r\n      if (iA < listA.size()) result.push_back(listA[iA++]);\r\n      else result.push_back(listB[iB++]);\r\n    } else {\r\n      if (iB < listB.size()) result.push_back(listB[iB++]);\r\n      else result.push_back(listA[iA++]);\r\n    }\r\n  }\r\n  return result;\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<double> A{1.0, 2.0, 3.0};\r\n  std::vector<double> B{1.5, 2.5, 3.5, 4.5, 5.5};\r\n  auto list = zip(A, B);\r\n  for (auto v: list)\r\n  {\r\n    std::cout << v << ", ";\r\n  }\r\n  std::cout << std::endl;\r\n}\r\n<\/pre>\n
\u554f3<\/h3>\n
\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u3092100\u756a\u76ee\u307e\u3067\u8a08\u7b97\u3059\u308b\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u4f5c\u308c\u3002<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
\u6574\u6570\u306e\u7bc4\u56f2\u306b\u6c17\u3092\u3064\u3051\u308c\u3070\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u306e\u8a08\u7b97\u306f\u7c21\u5358\u306a\u3093\u3067\u3059\u304c\u3001100\u756a\u76ee\u4ed8\u8fd1\u306e\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u306f\u7b26\u53f7\u306a\u305764\u30d3\u30c3\u30c8\u6574\u6570\u306e\u7bc4\u56f2\u3092\u8d85\u3048\u308b\u305f\u3081\u3001\u3053\u306e\u30d7\u30ed\u30b0\u30e9\u30e0\u3067\u306f\u6700\u5f8c\u306e\u307b\u3046\u306e\u51fa\u529b\u304c\u6b63\u3057\u304f\u3042\u308a\u307e\u305b\u3093\u3002
\n\u305f\u3060\u3001\u51fa\u984c\u8005\u306e\u610f\u56f3\u3068\u3057\u3066\u591a\u500d\u9577\u6574\u6570\u306e\u5b9f\u88c5\u307e\u3067\u6c42\u3081\u3066\u308b\u3088\u3046\u306b\u306f\u601d\u3048\u306a\u3044\u306e\u3067\u305d\u306e\u307e\u307e\u3067\u3059\u3002<\/p>\n
\r\n#include<iostream>\r\n#include<vector>\r\n\r\ntemplate<typename T>\r\nvoid fib(std::vector<T> &list, size_t limit = 100)\r\n{\r\n  if (list.size() == 0)\r\n  { \r\n    list.push_back(0);\r\n    list.push_back(1);\r\n  } \r\n\r\n  while (list.size() < limit)\r\n  {\r\n    list.push_back(list[list.size() - 2] + list[list.size() - 1]);\r\n  }\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<uint64_t> list;\r\n  fib(list);\r\n  for (auto v: list)\r\n  {\r\n    std::cout << v << ", ";\r\n  }\r\n  std::cout << std::endl;\r\n}\r\n<\/pre>\n
\u554f4<\/h3>\n
\u30ea\u30b9\u30c8\u5185\u306e\u6570\u5024\u3092\u6587\u5b57\u5217\u7684\u306b\u7d50\u5408\u3057\u3066\u6700\u5927\u306e\u6570\u3092\u8fd4\u3059\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u4f5c\u308c\u3002
\n\uff08\u4f8b: [30, 2, 51, 8] \u2192 851302\uff09<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
\u6587\u5b57\u5217\u306b\u5909\u63db\u3057\u3066\u6700\u521d\u306e1\u6587\u5b57\u3067\u6bd4\u8f03\u3057\u3066\u5927\u304d\u3044\u9806\u306b\u4e26\u3073\u66ff\u3048\u305f\u5f8c\u7d50\u5408\u3057\u3066\u308b\u3060\u3051\u3067\u3059\u3002
\n\u305f\u3060\u3001cat_max\u306fstd::string\u3067\u306f\u306a\u304f\u3066\u6570\u5024\u578b\u3067\u8fd4\u3059\u3088\u3046\u306b\u66f8\u304f\u3079\u304d\u3060\u3063\u305f\u304b\u3082\u3057\u308c\u307e\u305b\u3093\u3002
\n\u5f8c\u3067\u77e5\u3063\u305f\u306e\u3067\u3059\u304c\u5165\u529b\u304c[5, 50, 56]\u306e\u3088\u3046\u306a\u5834\u5408\u3053\u306e\u30b3\u30fc\u30c9\u3067\u306f\u30c0\u30e1\u3067\u3059\u306d\u3002
\n\u6b63\u89e3\u306f\u30b3\u30fc\u30c9\u306e\u4e2d\u306b\u8ffd\u8a18\u3057\u307e\u3057\u305f\u3002<\/p>\n
\r\n#include<iostream>\r\n#include<vector>\r\n#include<algorithm>\r\n\r\ntemplate<typename T>\r\nbool a(T &left, T &right)\r\n{\r\n  auto ls = std::to_string(left);\r\n  auto rs = std::to_string(right);\r\n  return (ls.at(0) > rs.at(0));\r\n  \/\/ \u8ffd\u8a18\r\n  \/\/ \u2191\u306f\u9593\u9055\u3044\u3002\u2193\u306e\u3088\u3046\u306b\u66f8\u304f\u3079\u304d\u3067\u3057\u305f\u3002\r\n  \/\/ return (ls + rs > rs + ls);\r\n}\r\n\r\ntemplate<typename T>\r\nstd::string cat_max(std::vector<T> &list)\r\n{\r\n  std::sort(list.begin(), list.end(), a<T>);\r\n  std::string result;\r\n  for (auto v: list)\r\n  {\r\n    result += std::to_string(v);\r\n  }\r\n  return result;\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<uint64_t> list{50, 2, 1, 9};\r\n  std::cout << cat_max(list) << std::endl;\r\n}\r\n<\/pre>\n
\u554f5<\/h3>\n
1\u304b\u30899\u307e\u3067\u306e\u5404\u6570\u3092\u8db3\u3057\u305f\u308a\u5f15\u3044\u305f\u308a\u7d50\u5408\u3057\u305f\u308a\u3057\u3066\u7d50\u679c\u304c100\u306b\u306a\u308b\u5f0f\u3092\u5168\u3066\u6c42\u3081\u308b\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u4f5c\u308c\u3002
\n\uff08\u4f8b: 12 + 3 – 4 + 5 + 67 + 8 + 9 = 100\uff09<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
\u30b3\u30e1\u30f3\u30c8\u3067judge\u3068\u66f8\u3044\u3066\u3042\u308b\u90e8\u5206\u306b\u95a2\u3057\u3066\u3001\u6700\u521d\u6a2a\u7740\u3057\u3066\u5404\u6570\u5024\u3092\u6f14\u7b97\u5b50\u306e\u4f4d\u7f6e\u304b\u3089\u7b97\u51fa\u3057\u306a\u304c\u3089\u8a08\u7b97\u3059\u308b\u30b3\u30fc\u30c9\u3092\u66f8\u3044\u305f\u306e\u3067\u3059\u304c\u3001\u3084\u305f\u3089\u3068\u8907\u96d1\u306b\u306a\u3063\u3066\u5927\u5909\u306a\u4e8b\u306b\u306a\u3063\u3066\u3057\u307e\u3044\u307e\u3057\u305f\u3002
\n\u4e00\u56de\u30b3\u30fc\u30c9\u3092\u6368\u3066\u3066\u3001\u6f14\u7b97\u5b50\u3068\u6570\u5024\u3092\u6df7\u305c\u3053\u305c\u306b\u3057\u305f\u30ea\u30b9\u30c8\u3092\u4f5c\u308b\u3088\u3046\u306b\u3057\u3066\u3001\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u8a00\u8a9e\u3092\u5b9f\u88c5\u3059\u308b\u3068\u304d\u306e\u3088\u3046\u306b\u30d1\u30fc\u30b5\u3092\u9069\u7528\u3059\u308c\u3070\u2026\u3068\u601d\u3044\u3064\u3044\u305f\u3089\u4e00\u77ac\u3067\u3057\u305f\u3002
\nhundred\u304chandred\u306b\u306a\u3063\u3066\u307e\u3059\u306d\u2026\u30e4\u30d0\u3044\u3002<\/p>\n
\r\n#include<iostream>\r\n#include<vector>\r\n\r\n#define NONE -0\r\n#define PLUS -1\r\n#define MINUS -2\r\n\r\nvoid print(std::vector<int> &ops, int64_t sum)\r\n{\r\n  for (int i = 0; i < ops.size(); ++i)\r\n  {\r\n    if (ops[i] == PLUS) std::cout << " + ";\r\n    if (ops[i] == MINUS) std::cout << " - ";\r\n    std::cout << i + 1;\r\n  }\r\n  std::cout << " = " << sum << std::endl;\r\n}\r\n\r\nvoid one_handred(std::vector<int> &ops)\r\n{\r\n  if (ops.size() == 9)\r\n  {\r\n    \/\/ judge\r\n    std::vector<int> exp;\r\n    for (int i = 0; i < ops.size(); ++i)\r\n    {\r\n      exp.push_back(ops[i]);\r\n      exp.push_back(i + 1);\r\n    }\r\n\r\n    int64_t sum = 0;\r\n    int64_t num = 0;\r\n    int op = PLUS;\r\n    for (auto v: exp)\r\n    {\r\n      if (v == NONE) num *= 10;\r\n      else if (v == PLUS || v == MINUS)\r\n      {\r\n        sum += (op == PLUS)?num:(-num);\r\n        num = 0;\r\n        op = v;\r\n      }\r\n      else\r\n      {\r\n        num += v;\r\n      }\r\n    }\r\n    sum += (op == PLUS)?num:(-num);\r\n\r\n    if (sum == 100)\r\n    {\r\n      print(ops, sum);\r\n    }\r\n    return;\r\n  }\r\n  \r\n  for (int op = NONE; op >= MINUS; --op)\r\n  {\r\n    ops.push_back(op);\r\n    one_handred(ops);\r\n    ops.pop_back();\r\n  }\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<int> ops{PLUS};\r\n  one_handred(ops);\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
1\u6642\u9593\u4ee5\u5185\u306b\u89e3\u3051\u306a\u3051\u308c\u3070\u30d7\u30ed\u30b0\u30e9\u30de\u5931\u683c\u3068\u306a\u3063\u3066\u3057\u307e\u30465\u3064\u306e\u554f\u984c\u304c\u8a71\u984c\u306b<\/a>
\n\u3068\u3044\u3046\u3082\u306e\u304c\u3042\u3063\u305f\u306e\u3067C++\u89e3\u3044\u3066\u307f\u307e\u3057\u305f\u3002
\n\u6700\u8fd1\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u3084\u3063\u3066\u306a\u304f\u3066\u30e9\u30a4\u30d6\u30e9\u30ea\u306e\u4f7f\u3044\u65b9\u3092\u8abf\u3079\u306a\u304c\u3089\u3067\u3057\u305f\u3057\u3001\u4f7f\u7528\u3057\u305f\u74b0\u5883\u304c\u30a2\u30c3\u30d7\u30b0\u30ec\u30fc\u30c9\u3057\u305f\u3070\u3063\u304b\u308a\u306eFedora 22\u3067Vim\u306e\u30d7\u30e9\u30b0\u30a4\u30f3\u304c\u52d5\u304b\u306a\u304b\u3063\u305f\u308a\u3001\u5236\u9650\u6642\u9593\u306b\u8ffd\u308f\u308c\u3066\u7126\u308a\u307e\u304f\u3063\u3066\u305f\u306e\u3067\u9177\u3044\u30b3\u30fc\u30c9\u306b\u306a\u3063\u3066\u304a\u308a\u307e\u3059\u3002
\n\u81ea\u5206\u3067\u89e3\u3044\u3066\u307f\u305f\u3044\u65b9\u306b\u3068\u3063\u3066\u3053\u306e\u8a18\u4e8b\u306f\u30cd\u30bf\u30d0\u30ec\u3068\u306a\u308a\u307e\u3059\u306e\u3067\u3054\u6ce8\u610f\u304f\u3060\u3055\u3044\u3002
\n\uff08\u4e0a\u8a18\u306e\u7406\u7531\u306b\u3088\u308a\u3042\u307e\u308a\u53c2\u8003\u306b\u306a\u3089\u306a\u3044\u30b3\u30fc\u30c9\u3060\u3068\u601d\u3044\u307e\u3059\u304c\u2026\uff09<\/p>\n
\u4e00\u5fdc\u89e3\u304f\u306e\u306f\u5168\u90e8\u89e3\u3051\u305f\u3093\u3067\u3059\u304c\uff08\u3044\u3084\u4e00\u90e8\u30a2\u30a6\u30c8\u304b\u2026\uff09\u30015\u554f\u4e2d4\u554f\u7d42\u308f\u308b\u307e\u3067\u30671\u6642\u9593\u639b\u304b\u3063\u3066\u3057\u307e\u3044\u30015\u554f\u76ee\u3060\u3051\u30671\u6642\u9593\u534a\u639b\u304b\u3063\u3066\u3057\u307e\u3044\u307e\u3057\u305f\u3002
\n5\u554f\u76ee\u306f\u6a2a\u7740\u3057\u3088\u3046\u3068\u3057\u305f\u7d50\u679c\u9006\u306b\u3084\u305f\u3089\u3068\u30b3\u30fc\u30c9\u304c\u8907\u96d1\u306b\u306a\u3063\u3066\u3057\u307e\u3044\u305d\u306e\u30d0\u30b0\u53d6\u308a\u306b\u6642\u9593\u304c\u639b\u304b\u3063\u305f\u3093\u3067\u3059\u304c\u3001\u30b9\u30d1\u30c3\u3068\u8ae6\u3081\u3066\u5225\u306e\u65b9\u6cd5\u3067\u66f8\u304d\u306a\u304a\u3057\u305f\u308910\u5206\u304f\u3089\u3044\u3067\u66f8\u3051\u307e\u3057\u305f\u3002
\n\u8ca0\u3051\u60dc\u3057\u307f\u3067\u3059\u3002<\/p>\n
\u30b3\u30f3\u30d1\u30a4\u30e9\uff08clang++\uff09\u306e\u30d0\u30fc\u30b8\u30e7\u30f3\u3002<\/p>\n
\r\nclang version 3.5.0 (tags\/RELEASE_350\/final)\r\nTarget: x86_64-redhat-linux-gnu\r\nThread model: posix\r\n<\/pre>\n
\u5168\u3066 -std=c++14 \u3067\u30b3\u30f3\u30d1\u30a4\u30eb\u3002
\n\uff08\u7279\u306bC++14\u306e\u6a5f\u80fd\u3092\u4f7f\u3063\u3066\u308b\u308f\u3051\u3067\u306f\u306a\u3044\u3002\u306f\u305a\u3002\uff09<\/p>\n
\u305d\u308c\u3067\u306f\u4ee5\u4e0b\u30b3\u30fc\u30c9\u3002<\/p>\n
\u554f1<\/h3>\n
for, while, \u518d\u5e30\u3092\u4f7f\u3063\u3066\u30ea\u30b9\u30c8\u306e\u5408\u8a08\u3092\u8a08\u7b97\u3059\u308b\u95a2\u6570\u30923\u3064\u4f5c\u308c\u3002<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
template\u4f7f\u3063\u3066\u308b\u3068\u3053\u308d\u306b\u4f59\u88d5\u304c\u611f\u3058\u3089\u308c\u307e\u3059\u3002<\/p>\n
\r\n#include <iostream>\r\n#include <vector>\r\n\r\ntemplate<typename T>\r\nT sum_by_for(std::vector<T> &list)\r\n{\r\n  T s = T(0);\r\n  for (size_t i = 0; i < list.size(); ++i)\r\n  {\r\n    s += list[i];\r\n  }\r\n  return s;\r\n}\r\n\r\ntemplate<typename T>\r\nT sum_by_while(std::vector<T> &list)\r\n{\r\n  T s = T(0);\r\n  size_t i = 0;\r\n  while (i < list.size())\r\n  {\r\n    s += list[i];\r\n    ++i;\r\n  }\r\n  return s;\r\n}\r\n\r\ntemplate<typename T>\r\nT sum_by_recursion(std::vector<T> &list, size_t base = 0)\r\n{\r\n  if (base >= list.size()) return 0;\r\n  return list[base] + sum_by_recursion(list, base + 1);\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<double> list{1.0, 2.0, 3.0};\r\n  std::cout << sum_by_for(list) << std::endl;\r\n  std::cout << sum_by_while(list) << std::endl;\r\n  std::cout << sum_by_recursion(list) << std::endl;\r\n}\r\n<\/pre>\n
\u554f2<\/h3>\n
2\u3064\u306e\u30ea\u30b9\u30c8\u3092Python\u306ezip\u95a2\u6570\u306e\u3088\u3046\u306a\u611f\u3058\u3067\u4ea4\u4e92\u306b\u6df7\u305c\u3066\u7d50\u5408\u3059\u308b\u95a2\u6570\u3092\u4f5c\u308c\u3002<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
\u3053\u306e\u8fba\u308a\u3067\u3061\u3087\u3063\u3068\u7126\u308a\u3064\u3064\u3042\u308a\u30b3\u30fc\u30c9\u304c\u5fae\u5999\u306a\u611f\u3058\u306b\u306a\u3063\u3066\u304d\u307e\u3059\u3002<\/p>\n
\r\n#include<iostream>\r\n#include<vector>\r\n\r\ntemplate<typename T>\r\nstd::vector<T> zip(std::vector<T> listA, std::vector<T> listB)\r\n{\r\n  std::vector<T> result;\r\n  size_t iA = 0;\r\n  size_t iB = 0;\r\n  for (size_t i = 0; i < listA.size() + listB.size(); ++i)\r\n  {\r\n    if (i % 2 == 0) {\r\n      if (iA < listA.size()) result.push_back(listA[iA++]);\r\n      else result.push_back(listB[iB++]);\r\n    } else {\r\n      if (iB < listB.size()) result.push_back(listB[iB++]);\r\n      else result.push_back(listA[iA++]);\r\n    }\r\n  }\r\n  return result;\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<double> A{1.0, 2.0, 3.0};\r\n  std::vector<double> B{1.5, 2.5, 3.5, 4.5, 5.5};\r\n  auto list = zip(A, B);\r\n  for (auto v: list)\r\n  {\r\n    std::cout << v << ", ";\r\n  }\r\n  std::cout << std::endl;\r\n}\r\n<\/pre>\n
\u554f3<\/h3>\n
\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u3092100\u756a\u76ee\u307e\u3067\u8a08\u7b97\u3059\u308b\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u4f5c\u308c\u3002<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
\u6574\u6570\u306e\u7bc4\u56f2\u306b\u6c17\u3092\u3064\u3051\u308c\u3070\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u306e\u8a08\u7b97\u306f\u7c21\u5358\u306a\u3093\u3067\u3059\u304c\u3001100\u756a\u76ee\u4ed8\u8fd1\u306e\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u306f\u7b26\u53f7\u306a\u305764\u30d3\u30c3\u30c8\u6574\u6570\u306e\u7bc4\u56f2\u3092\u8d85\u3048\u308b\u305f\u3081\u3001\u3053\u306e\u30d7\u30ed\u30b0\u30e9\u30e0\u3067\u306f\u6700\u5f8c\u306e\u307b\u3046\u306e\u51fa\u529b\u304c\u6b63\u3057\u304f\u3042\u308a\u307e\u305b\u3093\u3002
\n\u305f\u3060\u3001\u51fa\u984c\u8005\u306e\u610f\u56f3\u3068\u3057\u3066\u591a\u500d\u9577\u6574\u6570\u306e\u5b9f\u88c5\u307e\u3067\u6c42\u3081\u3066\u308b\u3088\u3046\u306b\u306f\u601d\u3048\u306a\u3044\u306e\u3067\u305d\u306e\u307e\u307e\u3067\u3059\u3002<\/p>\n
\r\n#include<iostream>\r\n#include<vector>\r\n\r\ntemplate<typename T>\r\nvoid fib(std::vector<T> &list, size_t limit = 100)\r\n{\r\n  if (list.size() == 0)\r\n  { \r\n    list.push_back(0);\r\n    list.push_back(1);\r\n  } \r\n\r\n  while (list.size() < limit)\r\n  {\r\n    list.push_back(list[list.size() - 2] + list[list.size() - 1]);\r\n  }\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<uint64_t> list;\r\n  fib(list);\r\n  for (auto v: list)\r\n  {\r\n    std::cout << v << ", ";\r\n  }\r\n  std::cout << std::endl;\r\n}\r\n<\/pre>\n
\u554f4<\/h3>\n
\u30ea\u30b9\u30c8\u5185\u306e\u6570\u5024\u3092\u6587\u5b57\u5217\u7684\u306b\u7d50\u5408\u3057\u3066\u6700\u5927\u306e\u6570\u3092\u8fd4\u3059\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u4f5c\u308c\u3002
\n\uff08\u4f8b: [30, 2, 51, 8] \u2192 851302\uff09<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
\u6587\u5b57\u5217\u306b\u5909\u63db\u3057\u3066\u6700\u521d\u306e1\u6587\u5b57\u3067\u6bd4\u8f03\u3057\u3066\u5927\u304d\u3044\u9806\u306b\u4e26\u3073\u66ff\u3048\u305f\u5f8c\u7d50\u5408\u3057\u3066\u308b\u3060\u3051\u3067\u3059\u3002
\n\u305f\u3060\u3001cat_max\u306fstd::string\u3067\u306f\u306a\u304f\u3066\u6570\u5024\u578b\u3067\u8fd4\u3059\u3088\u3046\u306b\u66f8\u304f\u3079\u304d\u3060\u3063\u305f\u304b\u3082\u3057\u308c\u307e\u305b\u3093\u3002
\n\u5f8c\u3067\u77e5\u3063\u305f\u306e\u3067\u3059\u304c\u5165\u529b\u304c[5, 50, 56]\u306e\u3088\u3046\u306a\u5834\u5408\u3053\u306e\u30b3\u30fc\u30c9\u3067\u306f\u30c0\u30e1\u3067\u3059\u306d\u3002
\n\u6b63\u89e3\u306f\u30b3\u30fc\u30c9\u306e\u4e2d\u306b\u8ffd\u8a18\u3057\u307e\u3057\u305f\u3002<\/p>\n
\r\n#include<iostream>\r\n#include<vector>\r\n#include<algorithm>\r\n\r\ntemplate<typename T>\r\nbool a(T &left, T &right)\r\n{\r\n  auto ls = std::to_string(left);\r\n  auto rs = std::to_string(right);\r\n  return (ls.at(0) > rs.at(0));\r\n  \/\/ \u8ffd\u8a18\r\n  \/\/ \u2191\u306f\u9593\u9055\u3044\u3002\u2193\u306e\u3088\u3046\u306b\u66f8\u304f\u3079\u304d\u3067\u3057\u305f\u3002\r\n  \/\/ return (ls + rs > rs + ls);\r\n}\r\n\r\ntemplate<typename T>\r\nstd::string cat_max(std::vector<T> &list)\r\n{\r\n  std::sort(list.begin(), list.end(), a<T>);\r\n  std::string result;\r\n  for (auto v: list)\r\n  {\r\n    result += std::to_string(v);\r\n  }\r\n  return result;\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<uint64_t> list{50, 2, 1, 9};\r\n  std::cout << cat_max(list) << std::endl;\r\n}\r\n<\/pre>\n
\u554f5<\/h3>\n
1\u304b\u30899\u307e\u3067\u306e\u5404\u6570\u3092\u8db3\u3057\u305f\u308a\u5f15\u3044\u305f\u308a\u7d50\u5408\u3057\u305f\u308a\u3057\u3066\u7d50\u679c\u304c100\u306b\u306a\u308b\u5f0f\u3092\u5168\u3066\u6c42\u3081\u308b\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u4f5c\u308c\u3002
\n\uff08\u4f8b: 12 + 3 – 4 + 5 + 67 + 8 + 9 = 100\uff09<\/p>\n
\u30b3\u30e1\u30f3\u30c8<\/h4>\n
\u30b3\u30e1\u30f3\u30c8\u3067judge\u3068\u66f8\u3044\u3066\u3042\u308b\u90e8\u5206\u306b\u95a2\u3057\u3066\u3001\u6700\u521d\u6a2a\u7740\u3057\u3066\u5404\u6570\u5024\u3092\u6f14\u7b97\u5b50\u306e\u4f4d\u7f6e\u304b\u3089\u7b97\u51fa\u3057\u306a\u304c\u3089\u8a08\u7b97\u3059\u308b\u30b3\u30fc\u30c9\u3092\u66f8\u3044\u305f\u306e\u3067\u3059\u304c\u3001\u3084\u305f\u3089\u3068\u8907\u96d1\u306b\u306a\u3063\u3066\u5927\u5909\u306a\u4e8b\u306b\u306a\u3063\u3066\u3057\u307e\u3044\u307e\u3057\u305f\u3002
\n\u4e00\u56de\u30b3\u30fc\u30c9\u3092\u6368\u3066\u3066\u3001\u6f14\u7b97\u5b50\u3068\u6570\u5024\u3092\u6df7\u305c\u3053\u305c\u306b\u3057\u305f\u30ea\u30b9\u30c8\u3092\u4f5c\u308b\u3088\u3046\u306b\u3057\u3066\u3001\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u8a00\u8a9e\u3092\u5b9f\u88c5\u3059\u308b\u3068\u304d\u306e\u3088\u3046\u306b\u30d1\u30fc\u30b5\u3092\u9069\u7528\u3059\u308c\u3070\u2026\u3068\u601d\u3044\u3064\u3044\u305f\u3089\u4e00\u77ac\u3067\u3057\u305f\u3002
\nhundred\u304chandred\u306b\u306a\u3063\u3066\u307e\u3059\u306d\u2026\u30e4\u30d0\u3044\u3002<\/p>\n
\r\n#include<iostream>\r\n#include<vector>\r\n\r\n#define NONE -0\r\n#define PLUS -1\r\n#define MINUS -2\r\n\r\nvoid print(std::vector<int> &ops, int64_t sum)\r\n{\r\n  for (int i = 0; i < ops.size(); ++i)\r\n  {\r\n    if (ops[i] == PLUS) std::cout << " + ";\r\n    if (ops[i] == MINUS) std::cout << " - ";\r\n    std::cout << i + 1;\r\n  }\r\n  std::cout << " = " << sum << std::endl;\r\n}\r\n\r\nvoid one_handred(std::vector<int> &ops)\r\n{\r\n  if (ops.size() == 9)\r\n  {\r\n    \/\/ judge\r\n    std::vector<int> exp;\r\n    for (int i = 0; i < ops.size(); ++i)\r\n    {\r\n      exp.push_back(ops[i]);\r\n      exp.push_back(i + 1);\r\n    }\r\n\r\n    int64_t sum = 0;\r\n    int64_t num = 0;\r\n    int op = PLUS;\r\n    for (auto v: exp)\r\n    {\r\n      if (v == NONE) num *= 10;\r\n      else if (v == PLUS || v == MINUS)\r\n      {\r\n        sum += (op == PLUS)?num:(-num);\r\n        num = 0;\r\n        op = v;\r\n      }\r\n      else\r\n      {\r\n        num += v;\r\n      }\r\n    }\r\n    sum += (op == PLUS)?num:(-num);\r\n\r\n    if (sum == 100)\r\n    {\r\n      print(ops, sum);\r\n    }\r\n    return;\r\n  }\r\n  \r\n  for (int op = NONE; op >= MINUS; --op)\r\n  {\r\n    ops.push_back(op);\r\n    one_handred(ops);\r\n    ops.pop_back();\r\n  }\r\n}\r\n\r\nint main()\r\n{\r\n  std::vector<int> ops{PLUS};\r\n  one_handred(ops);\r\n}\r\n<\/pre>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[32],"tags":[437],"class_list":["post-3863","post","type-post","status-publish","format-standard","hentry","category-tech","tag-c"],"_links":{"self":[{"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/posts\/3863","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/comments?post=3863"}],"version-history":[{"count":0,"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/posts\/3863\/revisions"}],"wp:attachment":[{"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/media?parent=3863"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/categories?post=3863"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/peta.okechan.net\/blog\/wp-json\/wp\/v2\/tags?post=3863"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}