{"id":984,"date":"2023-07-02T23:56:22","date_gmt":"2023-07-15T19:32:13","guid":{"rendered":"https:\/\/www.silicloud.com\/ja\/blog\/index.php\/2023\/11\/30\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/"},"modified":"2025-08-01T04:02:52","modified_gmt":"2025-07-31T19:02:52","slug":"c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/","title":{"rendered":"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217"},"content":{"rendered":"

\u306f\u3058\u3081\u306b<\/h2>\n

C++\u306b\u304a\u3051\u308b\uff12\u6b21\u5143\u914d\u5217\u306f\u3001\u591a\u6b21\u5143\u914d\u5217\u306e\u6700\u3082\u5358\u7d14\u306a\u5f62\u614b\u3067\u3059\u3002\u3053\u308c\u306f\u3001\u914d\u5217\u306e\u914d\u5217\u3068\u3057\u3066\u8996\u899a\u5316\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002\u4ee5\u4e0b\u306e\u30a4\u30e1\u30fc\u30b8\u306f\u3001\uff12\u6b21\u5143\u914d\u5217\u3092\u8868\u3057\u3066\u3044\u307e\u3059\u3002<\/p>\n

\"2D<\/div>\n

\u6b21\u306e\u30bb\u30af\u30b7\u30e7\u30f3\u3067\u306f\u30012\u6b21\u5143\u914d\u5217\u306e\u521d\u671f\u5316\u65b9\u6cd5\u306b\u3064\u3044\u3066\u8aac\u660e\u3057\u307e\u3059\u30022\u6b21\u5143\u914d\u5217\u306f\u3001\u6574\u6570\u3001\u6587\u5b57\u3001\u6d6e\u52d5\u5c0f\u6570\u70b9\u6570\u306a\u3069\u3001\u521d\u671f\u5316\u306b\u5fdc\u3058\u3066\u3069\u3093\u306a\u578b\u3067\u3082\u4f7f\u7528\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3068\u547c\u3070\u308c\u3066\u3044\u307e\u3059\u3002<\/p>\n

C++\u306b\u304a\u3044\u30662\u6b21\u5143\u914d\u5217\u3092\u521d\u671f\u5316\u3059\u308b\u3002<\/h2>\n

\u3067\u306f\u3001C++\u3067\u4e8c\u6b21\u5143\u914d\u5217\u3092\u521d\u671f\u5316\u3059\u308b\u65b9\u6cd5\u306f\u3069\u3046\u3059\u308c\u3070\u3044\u3044\u306e\u3067\u3057\u3087\u3046\u304b\uff1f\u3053\u308c\u307b\u3069\u7c21\u5358\u3067\u3059\uff1a<\/p>\n

int<\/span> arr[<\/span>4<\/span>]<\/span>[<\/span>2<\/span>]<\/span> =<\/span> {<\/span>\r\n{<\/span>1234<\/span>,<\/span> 56<\/span>}<\/span>,<\/span>\r\n{<\/span>1212<\/span>,<\/span> 33<\/span>}<\/span>,<\/span>\r\n{<\/span>1434<\/span>,<\/span> 80<\/span>}<\/span>,<\/span>\r\n{<\/span>1312<\/span>,<\/span> 78<\/span>}<\/span>\r\n}<\/span> ;<\/span>\r\n<\/code><\/pre>\n
\u3067\u3059\u306e\u3067\u3001\u3054\u89a7\u306e\u901a\u308a\u3001\u79c1\u305f\u3061\u306f2\u6b21\u5143\u914d\u5217\u300carr\u300d\u3092\u521d\u671f\u5316\u3057\u307e\u3059\u3002\u3053\u306e\u914d\u5217\u306f4\u884c2\u5217\u306e\u914d\u5217\u3067\u3059\u3002\u914d\u5217\u306e\u5404\u8981\u7d20\u306f\u3001\u518d\u3073\u6574\u6570\u306e\u914d\u5217\u3067\u3059\u3002<\/p>\n
\u4ee5\u4e0b\u306e\u65b9\u6cd5\u3067\u30822D\u914d\u5217\u3092\u521d\u671f\u5316\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002<\/p>\n
int<\/span> arr[<\/span>4<\/span>]<\/span>[<\/span>2<\/span>]<\/span> =<\/span> {<\/span>1234<\/span>,<\/span> 56<\/span>,<\/span> 1212<\/span>,<\/span> 33<\/span>,<\/span> 1434<\/span>,<\/span> 80<\/span>,<\/span> 1312<\/span>,<\/span> 78<\/span>}<\/span>;<\/span>\r\n<\/code><\/pre>\n
\u3053\u306e\u5834\u5408\u3082\u3001arr\u306f4\u884c2\u5217\u306e2\u6b21\u5143\u914d\u5217\u3067\u3059\u3002<\/p>\n
C++\u306b\u304a\u3044\u30662\u6b21\u5143\u914d\u5217\u3092\u51fa\u529b\u3059\u308b<\/h2>\n
2\u6b21\u5143\u914d\u5217\u306e\u521d\u671f\u5316\u304c\u5b8c\u4e86\u3057\u307e\u3057\u305f\u304c\u3001\u305d\u308c\u3092\u5b9f\u969b\u306b\u5370\u5237\u305b\u305a\u306b\u6b63\u3057\u304f\u884c\u308f\u308c\u305f\u304b\u3092\u78ba\u8a8d\u3059\u308b\u3053\u3068\u306f\u3067\u304d\u307e\u305b\u3093\u3002<\/p>\n
\u307e\u305f\u3001\u591a\u304f\u306e\u5834\u5408\u3001\u3042\u308b\u64cd\u4f5c\u3092\u884c\u3063\u305f\u7d50\u679c\u306e2\u6b21\u5143\u914d\u5217\u3092\u51fa\u529b\u3059\u308b\u5fc5\u8981\u304c\u3042\u308a\u307e\u3059\u3002\u3067\u306f\u3001\u305d\u306e\u65b9\u6cd5\u306f\u3069\u306e\u3088\u3046\u306b\u306a\u308b\u306e\u3067\u3057\u3087\u3046\u304b\uff1f<\/p>\n
\u4ee5\u4e0b\u306e\u30b3\u30fc\u30c9\u306f\u3001\u305d\u308c\u3092\u884c\u3046\u65b9\u6cd5\u3092\u793a\u3057\u3066\u3044\u307e\u3059\u3002<\/p>\n
#<\/span>include<\/span><iostream><\/span><\/span>\r\nusing<\/span> namespace<\/span> std;<\/span> \r\nmain<\/span>(<\/span> )<\/span> \r\n{<\/span>  \r\n\tint<\/span> arr[<\/span>4<\/span>]<\/span>[<\/span>2<\/span>]<\/span> =<\/span> {<\/span>\r\n\t\t{<\/span> 10<\/span>,<\/span> 11<\/span> }<\/span>,<\/span>\r\n\t\t{<\/span> 20<\/span>,<\/span> 21<\/span> }<\/span>,<\/span>\r\n\t\t{<\/span> 30<\/span>,<\/span> 31<\/span> }<\/span>,<\/span>\r\n\t\t{<\/span> 40<\/span>,<\/span> 41<\/span> }<\/span>\r\n\t\t}<\/span> ;<\/span>\r\n\t\t\r\n\tint<\/span> i,<\/span>j;<\/span>\r\n\t\r\n\tcout<<<\/span>\"Printing a 2D Array:\\n\"<\/span>;<\/span>\r\n\tfor<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>4<\/span>;<\/span>i++<\/span>)<\/span>\r\n\t{<\/span>\r\n\t\tfor<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>2<\/span>;<\/span>j++<\/span>)<\/span>\r\n\t\t{<\/span>\r\n\t\t\tcout<<<\/span>\"\\t\"<\/span><<<\/span>arr[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\r\n\t\t}<\/span>\r\n\t\tcout<<<\/span>endl;<\/span>\r\n\t}<\/span>\r\n}<\/span>\r\n<\/code><\/pre>\n
\u51fa\u529b:<\/p>\n
\"Printing<\/div>\n
\u4e0a\u8a18\u306e\u30b3\u30fc\u30c9\u306b\u304a\u3044\u3066\u3001<\/p>\n
    \n
  • We firstly initialize a 2D array, arr[4][2] with certain values,<\/li>\n
  • After that, we try to print the respective array using two for loops,<\/li>\n
  • the outer for loop iterates over the rows, while the inner one iterates over the columns of the 2D array,<\/li>\n
  • So, for each iteration of the outer loop, i increases and takes us to the next 1D array. Also, the inner loop traverses over the whole 1D array at a time,<\/li>\n
  • And accordingly, we print the individual element arr[ i ][ j ].<\/li>\n<\/ul>\n
    \u4e8c\u6b21\u5143\u914d\u5217\u306e\u8981\u7d20\u3092\u30e6\u30fc\u30b6\u30fc\u304b\u3089\u306e\u5165\u529b\u3068\u3057\u3066\u53d7\u3051\u53d6\u308b<\/h2>\n
    \u524d\u306b\u306f\u3001\u4e8b\u524d\u306b\u5b9a\u7fa9\u3055\u308c\u305f\u5024\u30672\u6b21\u5143\u914d\u5217\u3092\u521d\u671f\u5316\u3059\u308b\u65b9\u6cd5\u3092\u898b\u307e\u3057\u305f\u3002\u3057\u304b\u3057\u3001\u30e6\u30fc\u30b6\u30fc\u306e\u5165\u529b\u3067\u3082\u4f5c\u6210\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002\u3069\u306e\u3088\u3046\u306b\u3059\u308b\u304b\u898b\u3066\u307f\u307e\u3057\u3087\u3046\u3002<\/p>\n
    #<\/span>include<\/span><iostream><\/span><\/span>\r\nusing<\/span> namespace<\/span> std;<\/span> \r\nmain<\/span>(<\/span> )<\/span> \r\n{<\/span>  \r\n      int<\/span>  s[<\/span>2<\/span>]<\/span>[<\/span>2<\/span>]<\/span>;<\/span>\r\n      int<\/span>  i,<\/span> j;<\/span>\r\n      cout<<<\/span>\"\\n2D Array Input:\\n\"<\/span>;<\/span>\r\n\t  for<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>2<\/span>;<\/span>i++<\/span>)<\/span>\r\n\t  {<\/span>\r\n\t  \tfor<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>2<\/span>;<\/span>j++<\/span>)<\/span>\r\n\t  \t{<\/span>\r\n\t  \t\tcout<<<\/span>\"\\ns[\"<\/span><<<\/span>i<<<\/span>\"][\"<\/span><<<\/span>j<<<\/span>\"]=  \"<\/span>;<\/span>\r\n\t  \t\tcin>><\/span>s[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\r\n\t\t}<\/span>\r\n\t  }<\/span> \r\n\t  \r\n\t  cout<<<\/span>\"\\nThe 2-D Array is:\\n\"<\/span>;<\/span>\r\n      for<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>2<\/span>;<\/span>i++<\/span>)<\/span>\r\n\t  {<\/span>\r\n\t  \tfor<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>2<\/span>;<\/span>j++<\/span>)<\/span>\r\n\t  \t{<\/span>\r\n\t  \t\tcout<<<\/span>\"\\t\"<\/span><<<\/span>s[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\r\n\t\t}<\/span>\r\n\t\tcout<<<\/span>endl;<\/span>\r\n\t  }<\/span> \r\n}<\/span> \r\n<\/code><\/pre>\n
    \u51fa\u529b\uff1a<\/p>\n
    \"2D<\/div>\n
    \u4e0a\u8a18\u306e\u30b3\u30fc\u30c9\u3067\u306f\u30012X2\u306e2\u6b21\u5143\u914d\u5217s\u3092\u5ba3\u8a00\u3057\u307e\u3059\u30022\u3064\u306e\u5165\u308c\u5b50\u306efor\u30eb\u30fc\u30d7\u3092\u4f7f\u7528\u3057\u3066\u3001\u914d\u5217\u306e\u5404\u8981\u7d20\u3092\u30c8\u30e9\u30d0\u30fc\u30b9\u3057\u306a\u304c\u3089\u5bfe\u5fdc\u3059\u308b\u30e6\u30fc\u30b6\u30fc\u306e\u5165\u529b\u3092\u53d6\u5f97\u3057\u307e\u3059\u3002\u3053\u306e\u65b9\u6cd5\u3067\u3001\u914d\u5217\u5168\u4f53\u304c\u57cb\u3081\u3089\u308c\u3001\u7d50\u679c\u3092\u78ba\u8a8d\u3059\u308b\u305f\u3081\u306b\u540c\u3058\u914d\u5217\u3092\u8868\u793a\u3057\u307e\u3059\u3002<\/p>\n
    C++\u3092\u4f7f\u7528\u3057\u305f\u4e8c\u6b21\u5143\u914d\u5217\u3092\u4f7f\u3063\u305f\u884c\u5217\u306e\u52a0\u7b97<\/h2>\n
    \u4f8b\u3068\u3057\u3066\u30012D\u914d\u5217\u3092\u4f7f\u7528\u3057\u3066\u884c\u5217\u306e\u8db3\u3057\u7b97\u3092\u884c\u3044\u3001\u7d50\u679c\u3092\u51fa\u529b\u3059\u308b\u65b9\u6cd5\u3092\u898b\u3066\u307f\u307e\u3057\u3087\u3046\u3002<\/p>\n
    #<\/span>include<\/span><iostream><\/span><\/span>\r\nusing<\/span> namespace<\/span> std;<\/span> \r\nmain<\/span>(<\/span>)<\/span> \r\n{<\/span>  \r\n      int<\/span>  m1[<\/span>5<\/span>]<\/span>[<\/span>5<\/span>]<\/span>,<\/span> m2[<\/span>5<\/span>]<\/span>[<\/span>5<\/span>]<\/span>,<\/span> m3[<\/span>5<\/span>]<\/span>[<\/span>5<\/span>]<\/span>;<\/span>\r\n      int<\/span>  i,<\/span> j,<\/span> r,<\/span> c;<\/span>\r\n      \r\n      cout<<<\/span>\"Enter the no.of rows of the matrices to be added(max 5):\"<\/span>;<\/span>\r\n      cin>><\/span>r;<\/span>\r\n      cout<<<\/span>\"Enter the no.of columns of the matrices to be added(max 5):\"<\/span>;<\/span>\r\n      cin>><\/span>c;<\/span>\r\n      \r\n      cout<<<\/span>\"\\n1st Matrix Input:\\n\"<\/span>;<\/span>\r\n\t  for<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>r;<\/span>i++<\/span>)<\/span>\r\n\t  {<\/span>\r\n\t  \tfor<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>c;<\/span>j++<\/span>)<\/span>\r\n\t  \t{<\/span>\r\n\t  \t\tcout<<<\/span>\"\\nmatrix1[\"<\/span><<<\/span>i<<<\/span>\"][\"<\/span><<<\/span>j<<<\/span>\"]=  \"<\/span>;<\/span>\r\n\t  \t\tcin>><\/span>m1[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\r\n\t\t}<\/span>\r\n\t  }<\/span> \r\n\t  \r\n\t  cout<<<\/span>\"\\n2nd Matrix Input:\\n\"<\/span>;<\/span>\r\n\t  for<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>r;<\/span>i++<\/span>)<\/span>\r\n\t  {<\/span>\r\n\t  \tfor<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>c;<\/span>j++<\/span>)<\/span>\r\n\t  \t{<\/span>\r\n\t  \t\tcout<<<\/span>\"\\nmatrix2[\"<\/span><<<\/span>i<<<\/span>\"][\"<\/span><<<\/span>j<<<\/span>\"]=  \"<\/span>;<\/span>\r\n\t  \t\tcin>><\/span>m2[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\r\n\t\t}<\/span>\r\n\t  }<\/span> \r\n\t  \r\n\t  cout<<<\/span>\"\\nAdding Matrices...\\n\"<\/span>;<\/span>\r\n\t  \r\n\t  for<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>r;<\/span>i++<\/span>)<\/span>\r\n\t  {<\/span>\r\n\t  \tfor<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>c;<\/span>j++<\/span>)<\/span>\r\n\t  \t{<\/span>\r\n\t  \t\tm3[<\/span>i]<\/span>[<\/span>j]<\/span>=<\/span>m1[<\/span>i]<\/span>[<\/span>j]<\/span>+<\/span>m2[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\r\n\t\t}<\/span>\r\n\t  }<\/span> \r\n\t  \r\n\t  cout<<<\/span>\"\\nThe resultant Matrix is:\\n\"<\/span>;<\/span>\r\n\r\n\t  for<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>r;<\/span>i++<\/span>)<\/span>\r\n\t  {<\/span>\r\n\t  \tfor<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>c;<\/span>j++<\/span>)<\/span>\r\n\t  \t{<\/span>\r\n\t  \t\tcout<<<\/span>\"\\t\"<\/span><<<\/span>m3[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\r\n\t\t}<\/span>\r\n\t\tcout<<<\/span>endl;<\/span>\r\n\t  }<\/span> \r\n\t  \r\n}<\/span> \r\n<\/code><\/pre>\n
    \u51fa\u529b\uff1a<\/p>\n
    \"Matrix<\/div>\n
    \u3053\u3053\u3067<\/p>\n
      \n
    • We take two matrices m1 and m2 with a maximum of 5 rows and 5 columns. And another matrix m3 in which we are going to store the result,<\/li>\n
    • As user inputs, we took the number of rows and columns for both the matrices. Since we are performing matrix addition, the number of rows and columns should be the same for both the matrices,<\/li>\n
    • After that, we take both the matrices as user inputs, again using nested for loops,<\/li>\n
    • At this point, we have both the matrices m1 and m2,<\/li>\n
    • then we traverse through the m3 matrix, using two for loops and update the respective elements m3[ i ][ j ] by the value of m1[i][j]+m2[i][j]. In this way, by the end of the outer for loop, we get our desired matrix,<\/li>\n
    • At last, we print out the resultant matrix m3.<\/li>\n<\/ul>\n
      C++\u306b\u304a\u3051\u308b2\u6b21\u5143\u914d\u5217\u3078\u306e\u30dd\u30a4\u30f3\u30bf<\/h2>\n
      \u3082\u3057\u6574\u6570\u3078\u306e\u30dd\u30a4\u30f3\u30bf\u30fc\u3084\u6d6e\u52d5\u5c0f\u6570\u70b9\u6570\u3078\u306e\u30dd\u30a4\u30f3\u30bf\u30fc\u3084\u6587\u5b57\u3078\u306e\u30dd\u30a4\u30f3\u30bf\u30fc\u304c\u3042\u308c\u3070\u3001\u914d\u5217\u3078\u306e\u30dd\u30a4\u30f3\u30bf\u30fc\u3082\u6301\u3066\u306a\u3044\u306e\u3067\u3057\u3087\u3046\u304b\uff1f\u78ba\u304b\u306b\u6301\u3064\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002\u4ee5\u4e0b\u306e\u30d7\u30ed\u30b0\u30e9\u30e0\u306f\u3001\u305d\u308c\u3092\u69cb\u7bc9\u3057\u3066\u4f7f\u7528\u3059\u308b\u65b9\u6cd5\u3092\u793a\u3057\u3066\u3044\u307e\u3059\u3002<\/p>\n
      #<\/span>include<\/span><iostream><\/span><\/span>\r\nusing<\/span> namespace<\/span> std;<\/span>\r\n\/* Usage of pointer to an array *\/<\/span> \r\nmain<\/span>(<\/span> )<\/span> \r\n{<\/span>  \r\n      int<\/span>  s[<\/span>5<\/span>]<\/span>[<\/span>2<\/span>]<\/span> =<\/span> {<\/span>\r\n           {<\/span>1<\/span>,<\/span> 2<\/span>}<\/span>,<\/span>\r\n           {<\/span>1<\/span>,<\/span> 2<\/span>}<\/span>,<\/span>\r\n           {<\/span>1<\/span>,<\/span> 2<\/span>}<\/span>,<\/span>\r\n           {<\/span>1<\/span>,<\/span> 2<\/span>}<\/span>\r\n           }<\/span> ;<\/span>\r\n           \r\n      int<\/span> (<\/span>*<\/span>p)<\/span>[<\/span>2<\/span>]<\/span> ;<\/span>\r\n      int<\/span>  i,<\/span> j;<\/span>\r\n      for<\/span> (<\/span>i =<\/span> 0<\/span> ;<\/span> i <=<\/span> 3<\/span> ;<\/span> i++<\/span>)<\/span>\r\n      {<\/span>\r\n      \t\tp=<\/span>&<\/span>s[<\/span>i]<\/span>;<\/span>\r\n      \t\tcout<<<\/span>\"Row\"<\/span><<<\/span>i<<<\/span>\":\"<\/span>;<\/span>\r\n            for<\/span> (<\/span>j =<\/span> 0<\/span>;<\/span> j <=<\/span> 1<\/span>;<\/span> j++<\/span>)<\/span>\r\n                cout<<<\/span>\"\\t\"<\/span><<<\/span>*<\/span>(<\/span>*<\/span>p+<\/span>j)<\/span>;<\/span>\r\n            cout<<<\/span>endl;<\/span>\r\n      }<\/span> \r\n      \r\n}<\/span>\r\n<\/code><\/pre>\n
      \u51fa\u529b\uff1a<\/p>\n
      \"2D<\/div>\n
      \u3053\u3053\u3067\u306f<\/p>\n
        \n
      • In the above code, we try to print a 2D array using pointers,<\/li>\n
      • As we earlier did, at first we initialize the 2D array, s[5][2]. And also a pointer (*p)[2], where p is a pointer which stores the address of an array with 2 elements,<\/li>\n
      • As we already said, we can break down a 2D array as an array of arrays. So in this case, s is actually an array with 5 elements, which further are actually arrays with 2 elements for each row.<\/li>\n
      • We use a for loop to traverse over these 5 elements of the array, s. For each iteration, we assign p with the address of s[i],<\/li>\n
      • Further, the inner for loop prints out the individual elements of the array s[i] using the pointer p. Here, (*p + j) gives us the address of the individual element s[i][j], so using *(*p+j) we can access the corresponding value.<\/li>\n<\/ul>\n
        2\u6b21\u5143\u914d\u5217\u3092\u95a2\u6570\u306b\u6e21\u3059\u3068\u3044\u3046\u3053\u3068<\/h2>\n
        \u3053\u306e\u30bb\u30af\u30b7\u30e7\u30f3\u3067\u306f\u3001\u3069\u306e\u95a2\u6570\u306b\u30822\u6b21\u5143\u914d\u5217\u3092\u6e21\u3057\u3066\u305d\u306e\u8981\u7d20\u306b\u30a2\u30af\u30bb\u30b9\u3059\u308b\u65b9\u6cd5\u3092\u5b66\u3073\u307e\u3059\u3002\u4ee5\u4e0b\u306e\u30b3\u30fc\u30c9\u3067\u306f\u3001\u914d\u5217a\u3092show()\u95a2\u6570\u3068print()\u95a2\u6570\u306b\u6e21\u3057\u3066\u3001\u6e21\u3055\u308c\u305f2\u6b21\u5143\u914d\u5217\u3092\u51fa\u529b\u3057\u307e\u3059\u3002<\/p>\n
        #<\/span>include<\/span><iostream><\/span><\/span>\r\nusing<\/span> namespace<\/span> std;<\/span>   \r\n \r\nvoid<\/span> show<\/span>(<\/span>int<\/span> (<\/span>*<\/span>q)<\/span>[<\/span>4<\/span>]<\/span>,<\/span> int<\/span>  row,<\/span> int<\/span>  col)<\/span>\r\n{<\/span>\r\n\tint<\/span>  i,<\/span> j ;<\/span>\r\n\tfor<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>row;<\/span>i++<\/span>)<\/span>\r\n\t{<\/span>\r\n\t\tfor<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>col;<\/span>j++<\/span>)<\/span>\r\n    \t\tcout<<<\/span>\"\\t\"<\/span><<<\/span>*<\/span>(<\/span>*<\/span>(<\/span>q +<\/span> i)<\/span>+<\/span>j)<\/span>;<\/span> \r\n\t\tcout<<<\/span>\"\\n\"<\/span>;<\/span>\r\n\t}<\/span>  \r\n    cout<<<\/span>\"\\n\"<\/span>;<\/span>\r\n}<\/span> \r\n \r\nvoid<\/span> print<\/span>(<\/span>int<\/span>  q[<\/span>]<\/span>[<\/span>4<\/span>]<\/span>,<\/span> int<\/span> row,<\/span> int<\/span> col)<\/span>\r\n{<\/span>\r\n    int<\/span>  i,<\/span> j;<\/span> \r\n    for<\/span>(<\/span>i=<\/span>0<\/span>;<\/span>i<<\/span>row;<\/span>i++<\/span>)<\/span>\r\n    {<\/span>   \r\n\t for<\/span>(<\/span>j=<\/span>0<\/span>;<\/span>j<<\/span>col;<\/span>j++<\/span>)<\/span>\r\n   \t    \tcout<<<\/span>\"\\t\"<\/span><<<\/span>q[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\r\n   \t cout<<<\/span>\"\\n\"<\/span>;<\/span>\r\n\t}<\/span>\r\n   cout<<<\/span>\"\\n\"<\/span>;<\/span>\r\n}<\/span>\r\n \r\nint<\/span> main<\/span>(<\/span>)<\/span> \r\n{<\/span>\r\n  int<\/span>  a[<\/span>3<\/span>]<\/span>[<\/span>4<\/span>]<\/span> =<\/span> {<\/span> 10<\/span>,<\/span> 11<\/span>,<\/span> 12<\/span>,<\/span> 13<\/span>,<\/span> 14<\/span>,<\/span> 15<\/span>,<\/span> 16<\/span>,<\/span> 17<\/span>,<\/span> 18<\/span>,<\/span> 19<\/span>,<\/span> 20<\/span>,<\/span> 21<\/span>}<\/span> ;<\/span> \r\n \r\n  show<\/span> (<\/span>a,<\/span> 3<\/span>,<\/span> 4<\/span>)<\/span>;<\/span>\r\n  print<\/span> (<\/span>a,<\/span> 3<\/span>,<\/span> 4<\/span>)<\/span>;<\/span>\r\n  return<\/span> 0<\/span>;<\/span>\r\n}<\/span> \r\n<\/code><\/pre>\n
        \u51fa\u529b:<\/p>\n
        \"2D<\/div>\n
        \u3053\u3053\u3067<\/p>\n
          \n
        • In the show( ) function we have defined q to be a pointer to an array of 4 integers through the declaration int (*q)[4],<\/li>\n
        • q holds the base address of the zeroth 1-D array<\/li>\n
        • This address is then assigned to q, an int pointer, and then using this pointer all elements of the zeroth 1D array are accessed.<\/li>\n
        • Next time through the loop when i takes a value 1, the expression q+i fetches the address of the first 1-D array. This is because q is a pointer to the zeroth 1-D array and adding 1 to it would give us the address of the next 1-D array. This address is once again assigned to q and using it all elements of the next 1-D array are accessed<\/li>\n
        • In the second function print(), the declaration of q looks like this: int q[][4] ,<\/li>\n
        • This is same as int (*q )[4], where q is a pointer to an array of 4 integers. The only advantage is that we can now use the more familiar expression q[i][j] to access array elements. We could have used the same expression in show() as well but for better understanding of the use of pointers, we use pointers to access each element.<\/li>\n<\/ul>\n
          \u7d50\u8ad6\u306f<\/h2>\n
          \u3053\u306e\u8a18\u4e8b\u3067\u306f\u3001C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\u306b\u3064\u3044\u3066\u8a71\u3057\u5408\u3044\u307e\u3057\u305f\u3002\u3055\u307e\u3056\u307e\u306a\u64cd\u4f5c\u3092\u884c\u3046\u65b9\u6cd5\u3084\u884c\u5217\u306e\u8db3\u3057\u7b97\u3067\u306e\u5fdc\u7528\u306b\u3064\u3044\u3066\u3082\u89e6\u308c\u307e\u3057\u305f\u3002\u305d\u306e\u4ed6\u306e\u8cea\u554f\u306f\u30b3\u30e1\u30f3\u30c8\u6b04\u3092\u3054\u5229\u7528\u304f\u3060\u3055\u3044\u3002<\/p>\n
          \u3010\u53c2\u8003\u6587\u732e\u3011<\/h2>\n
            \n
          • https:\/\/en.wikipedia.org\/wiki\/Array_data_structure<\/li>\n
          • \/community\/tutorials\/arrays-in-c<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"
            \u306f\u3058\u3081\u306b C++\u306b\u304a\u3051\u308b\uff12\u6b21\u5143\u914d\u5217\u306f\u3001\u591a\u6b21\u5143\u914d\u5217\u306e\u6700\u3082\u5358\u7d14\u306a\u5f62\u614b\u3067\u3059\u3002\u3053\u308c\u306f\u3001\u914d\u5217\u306e\u914d\u5217\u3068\u3057\u3066\u8996\u899a\u5316\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002\u4ee5\u4e0b\u306e\u30a4\u30e1\u30fc\u30b8\u306f\u3001\uff12\u6b21\u5143\u914d\u5217\u3092\u8868\u3057\u3066\u3044\u307e\u3059\u3002 \u6b21\u306e\u30bb\u30af\u30b7\u30e7\u30f3\u3067\u306f\u30012\u6b21\u5143\u914d\u5217\u306e\u521d\u671f\u5316\u65b9\u6cd5\u306b\u3064\u3044\u3066\u8aac\u660e […]<\/p>\n","protected":false},"author":8,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[26,61],"class_list":["post-984","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-26","tag-61"],"yoast_head":"\nC++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217 - Blog - Silicon Cloud<\/title>\n<meta name=\"description\" content=\"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.silicloud.com\/ja\/blog\/c\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\/\" \/>\n<meta property=\"og:locale\" content=\"ja_JP\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\" \/>\n<meta property=\"og:description\" content=\"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/ja\/blog\/c\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\/\" \/>\n<meta property=\"og:site_name\" content=\"Blog - Silicon Cloud\" \/>\n<meta property=\"article:published_time\" content=\"2023-07-15T19:32:13+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-07-31T19:02:52+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/cdn.silicloud.com\/blog-img\/blog\/img\/6564a744daa94e2bdf7c4628\/2-0.png\" \/>\n<meta name=\"author\" content=\"\u84ee, \u7ffc\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u57f7\u7b46\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"\u84ee, \u7ffc\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u63a8\u5b9a\u8aad\u307f\u53d6\u308a\u6642\u9593\" \/>\n\t<meta name=\"twitter:data2\" content=\"16\u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/\",\"url\":\"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/\",\"name\":\"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217 - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#website\"},\"datePublished\":\"2023-07-15T19:32:13+00:00\",\"dateModified\":\"2025-07-31T19:02:52+00:00\",\"author\":{\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/cdc124a0aaebf26393d8d591183ca413\"},\"description\":\"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/#breadcrumb\"},\"inLanguage\":\"ja\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.silicloud.com\/ja\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#website\",\"url\":\"https:\/\/www.silicloud.com\/ja\/blog\/\",\"name\":\"Blog - Silicon Cloud\",\"description\":\"\",\"inLanguage\":\"ja\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/cdc124a0aaebf26393d8d591183ca413\",\"name\":\"\u84ee, \u7ffc\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ja\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/27308f733c7fcdac8617926a0100c77213339c4e501310a08c0baf946bf823bc?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/27308f733c7fcdac8617926a0100c77213339c4e501310a08c0baf946bf823bc?s=96&d=mm&r=g\",\"caption\":\"\u84ee, \u7ffc\"},\"url\":\"https:\/\/www.silicloud.com\/ja\/blog\/author\/rentsubasa\/\"},{\"@type\":\"ImageObject\",\"inLanguage\":\"ja\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/#local-main-organization-logo\",\"url\":\"\",\"contentUrl\":\"\",\"caption\":\"Blog - Silicon Cloud\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217 - Blog - Silicon Cloud","description":"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.silicloud.com\/ja\/blog\/c\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\/","og_locale":"ja_JP","og_type":"article","og_title":"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217","og_description":"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002","og_url":"https:\/\/www.silicloud.com\/ja\/blog\/c\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\/","og_site_name":"Blog - Silicon Cloud","article_published_time":"2023-07-15T19:32:13+00:00","article_modified_time":"2025-07-31T19:02:52+00:00","og_image":[{"url":"https:\/\/cdn.silicloud.com\/blog-img\/blog\/img\/6564a744daa94e2bdf7c4628\/2-0.png"}],"author":"\u84ee, \u7ffc","twitter_card":"summary_large_image","twitter_misc":{"\u57f7\u7b46\u8005":"\u84ee, \u7ffc","\u63a8\u5b9a\u8aad\u307f\u53d6\u308a\u6642\u9593":"16\u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/","url":"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/","name":"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217 - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/ja\/blog\/#website"},"datePublished":"2023-07-15T19:32:13+00:00","dateModified":"2025-07-31T19:02:52+00:00","author":{"@id":"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/cdc124a0aaebf26393d8d591183ca413"},"description":"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/#breadcrumb"},"inLanguage":"ja","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.silicloud.com\/ja\/blog\/"},{"@type":"ListItem","position":2,"name":"C++\u306b\u304a\u3051\u308b\u4e8c\u6b21\u5143\u914d\u5217"}]},{"@type":"WebSite","@id":"https:\/\/www.silicloud.com\/ja\/blog\/#website","url":"https:\/\/www.silicloud.com\/ja\/blog\/","name":"Blog - Silicon Cloud","description":"","inLanguage":"ja"},{"@type":"Person","@id":"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/cdc124a0aaebf26393d8d591183ca413","name":"\u84ee, \u7ffc","image":{"@type":"ImageObject","inLanguage":"ja","@id":"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/27308f733c7fcdac8617926a0100c77213339c4e501310a08c0baf946bf823bc?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/27308f733c7fcdac8617926a0100c77213339c4e501310a08c0baf946bf823bc?s=96&d=mm&r=g","caption":"\u84ee, \u7ffc"},"url":"https:\/\/www.silicloud.com\/ja\/blog\/author\/rentsubasa\/"},{"@type":"ImageObject","inLanguage":"ja","@id":"https:\/\/www.silicloud.com\/ja\/blog\/c%e3%81%ab%e3%81%8a%e3%81%91%e3%82%8b%e4%ba%8c%e6%ac%a1%e5%85%83%e9%85%8d%e5%88%97\/#local-main-organization-logo","url":"","contentUrl":"","caption":"Blog - Silicon Cloud"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/posts\/984","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/users\/8"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/comments?post=984"}],"version-history":[{"count":1,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/posts\/984\/revisions"}],"predecessor-version":[{"id":47566,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/posts\/984\/revisions\/47566"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/media?parent=984"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/categories?post=984"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/tags?post=984"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}