Signed-off-by: sairate <sairate@sina.cn>
This commit is contained in:
commit
00ba062b3c
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -0,0 +1,231 @@
|
|||
{
|
||||
"Version": 1,
|
||||
"WorkspaceRootPath": "D:\\project\\Project1C\u002B\u002B\\",
|
||||
"Documents": [
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\test2.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:test2.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u5E73\u65B9\u4E4B\u548C.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u5E73\u65B9\u4E4B\u548C.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u77E9\u9635\u53D6\u6570\u7B80.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u77E9\u9635\u53D6\u6570\u7B80.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u6590\u6CE2\u90A3\u5951\u6570\u5217.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u6590\u6CE2\u90A3\u5951\u6570\u5217.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u9AD8\u7CBE\u52A0.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u9AD8\u7CBE\u52A0.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6B63\u6574\u6570\u8D28\u6570\u7B5B.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u4F18\u79C0\u6B63\u6574\u6570\u8D28\u6570\u7B5B.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u6570\u72EC.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u6570\u72EC.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6B63\u6574\u6570.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u4F18\u79C0\u6B63\u6574\u6570.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6574\u6570\u7CBE.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u4F18\u79C0\u6574\u6570\u7CBE.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u9AD8\u7CBE\u4E58.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u9AD8\u7CBE\u4E58.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u4E09\u4E2A\u6570\u7684\u6700\u5927\u516C\u56E0\u6570.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u4E09\u4E2A\u6570\u7684\u6700\u5927\u516C\u56E0\u6570.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u6B27\u51E0\u91CC\u5F97.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u6B27\u51E0\u91CC\u5F97.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
},
|
||||
{
|
||||
"AbsoluteMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|D:\\project\\Project1C\u002B\u002B\\\u77E9\u9635\u53D6\u6570\u8BB0\u5FC6.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}",
|
||||
"RelativeMoniker": "D:0:0:{653F23DB-4E65-4232-A488-E9A53268A0A6}|Project1C\u002B\u002B.vcxproj|solutionrelative:\u77E9\u9635\u53D6\u6570\u8BB0\u5FC6.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}"
|
||||
}
|
||||
],
|
||||
"DocumentGroupContainers": [
|
||||
{
|
||||
"Orientation": 0,
|
||||
"VerticalTabListWidth": 256,
|
||||
"DocumentGroups": [
|
||||
{
|
||||
"DockedWidth": 200,
|
||||
"SelectedChildIndex": 1,
|
||||
"Children": [
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 7,
|
||||
"Title": "\u4F18\u79C0\u6B63\u6574\u6570.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6B63\u6574\u6570.cpp",
|
||||
"RelativeDocumentMoniker": "\u4F18\u79C0\u6B63\u6574\u6570.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6B63\u6574\u6570.cpp",
|
||||
"RelativeToolTip": "\u4F18\u79C0\u6B63\u6574\u6570.cpp",
|
||||
"ViewState": "AQIAACUAAAAAAAAAAAAIwDQAAAAcAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-02T11:29:46.267Z",
|
||||
"IsPinned": true
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 0,
|
||||
"Title": "test2.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\test2.cpp",
|
||||
"RelativeDocumentMoniker": "test2.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\test2.cpp",
|
||||
"RelativeToolTip": "test2.cpp",
|
||||
"ViewState": "AQIAAAAAAAAAAAAAAAAAAAoAAAALAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-20T12:23:37.796Z",
|
||||
"IsPinned": true,
|
||||
"EditorCaption": ""
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 1,
|
||||
"Title": "\u5E73\u65B9\u4E4B\u548C.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u5E73\u65B9\u4E4B\u548C.cpp",
|
||||
"RelativeDocumentMoniker": "\u5E73\u65B9\u4E4B\u548C.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u5E73\u65B9\u4E4B\u548C.cpp",
|
||||
"RelativeToolTip": "\u5E73\u65B9\u4E4B\u548C.cpp",
|
||||
"ViewState": "AQIAAAwAAAAAAAAAAADwvxkAAAAKAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-20T11:10:48.333Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 6,
|
||||
"Title": "\u6570\u72EC.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u6570\u72EC.cpp",
|
||||
"RelativeDocumentMoniker": "\u6570\u72EC.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u6570\u72EC.cpp",
|
||||
"RelativeToolTip": "\u6570\u72EC.cpp",
|
||||
"ViewState": "AQIAAEYAAAAAAAAAAAA6wFwAAAADAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-07-03T11:40:31.947Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 5,
|
||||
"Title": "\u4F18\u79C0\u6B63\u6574\u6570\u8D28\u6570\u7B5B.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6B63\u6574\u6570\u8D28\u6570\u7B5B.cpp",
|
||||
"RelativeDocumentMoniker": "\u4F18\u79C0\u6B63\u6574\u6570\u8D28\u6570\u7B5B.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6B63\u6574\u6570\u8D28\u6570\u7B5B.cpp",
|
||||
"RelativeToolTip": "\u4F18\u79C0\u6B63\u6574\u6570\u8D28\u6570\u7B5B.cpp",
|
||||
"ViewState": "AQIAAAAAAAAAAAAAAAAAAAAAAAAAAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-07-03T06:24:13.737Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 2,
|
||||
"Title": "\u77E9\u9635\u53D6\u6570\u7B80.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u77E9\u9635\u53D6\u6570\u7B80.cpp",
|
||||
"RelativeDocumentMoniker": "\u77E9\u9635\u53D6\u6570\u7B80.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u77E9\u9635\u53D6\u6570\u7B80.cpp",
|
||||
"RelativeToolTip": "\u77E9\u9635\u53D6\u6570\u7B80.cpp",
|
||||
"ViewState": "AQIAAAAAAAAAAAAAAAAAAAAAAAAAAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-22T03:41:49.736Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 4,
|
||||
"Title": "\u9AD8\u7CBE\u52A0.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u9AD8\u7CBE\u52A0.cpp",
|
||||
"RelativeDocumentMoniker": "\u9AD8\u7CBE\u52A0.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u9AD8\u7CBE\u52A0.cpp",
|
||||
"RelativeToolTip": "\u9AD8\u7CBE\u52A0.cpp",
|
||||
"ViewState": "AQIAAAAAAAAAAAAAAAAAAAAAAAAAAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-19T11:58:47.676Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 9,
|
||||
"Title": "\u9AD8\u7CBE\u4E58.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u9AD8\u7CBE\u4E58.cpp",
|
||||
"RelativeDocumentMoniker": "\u9AD8\u7CBE\u4E58.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u9AD8\u7CBE\u4E58.cpp",
|
||||
"RelativeToolTip": "\u9AD8\u7CBE\u4E58.cpp",
|
||||
"ViewState": "AQIAACIAAAAAAAAAAAAwwDIAAAAAAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-19T11:09:18.298Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 3,
|
||||
"Title": "\u6590\u6CE2\u90A3\u5951\u6570\u5217.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u6590\u6CE2\u90A3\u5951\u6570\u5217.cpp",
|
||||
"RelativeDocumentMoniker": "\u6590\u6CE2\u90A3\u5951\u6570\u5217.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u6590\u6CE2\u90A3\u5951\u6570\u5217.cpp",
|
||||
"RelativeToolTip": "\u6590\u6CE2\u90A3\u5951\u6570\u5217.cpp",
|
||||
"ViewState": "AQIAAAAAAAAAAAAAAAAAABUAAAAAAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-19T11:09:15.81Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 8,
|
||||
"Title": "\u4F18\u79C0\u6574\u6570\u7CBE.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6574\u6570\u7CBE.cpp",
|
||||
"RelativeDocumentMoniker": "\u4F18\u79C0\u6574\u6570\u7CBE.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u4F18\u79C0\u6574\u6570\u7CBE.cpp",
|
||||
"RelativeToolTip": "\u4F18\u79C0\u6574\u6570\u7CBE.cpp",
|
||||
"ViewState": "AQIAACwAAAAAAAAAAAA5wDYAAAASAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-15T10:28:26.34Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 11,
|
||||
"Title": "\u6B27\u51E0\u91CC\u5F97.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u6B27\u51E0\u91CC\u5F97.cpp",
|
||||
"RelativeDocumentMoniker": "\u6B27\u51E0\u91CC\u5F97.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u6B27\u51E0\u91CC\u5F97.cpp",
|
||||
"RelativeToolTip": "\u6B27\u51E0\u91CC\u5F97.cpp",
|
||||
"ViewState": "AQIAAAAAAAAAAAAAAAAAAAIAAAACAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-07T10:56:42.343Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 10,
|
||||
"Title": "\u4E09\u4E2A\u6570\u7684\u6700\u5927\u516C\u56E0\u6570.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u4E09\u4E2A\u6570\u7684\u6700\u5927\u516C\u56E0\u6570.cpp",
|
||||
"RelativeDocumentMoniker": "\u4E09\u4E2A\u6570\u7684\u6700\u5927\u516C\u56E0\u6570.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u4E09\u4E2A\u6570\u7684\u6700\u5927\u516C\u56E0\u6570.cpp",
|
||||
"RelativeToolTip": "\u4E09\u4E2A\u6570\u7684\u6700\u5927\u516C\u56E0\u6570.cpp",
|
||||
"ViewState": "AQIAAAAAAAAAAAAAAAAAAAgAAAAcAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-02T10:43:33.062Z"
|
||||
},
|
||||
{
|
||||
"$type": "Document",
|
||||
"DocumentIndex": 12,
|
||||
"Title": "\u77E9\u9635\u53D6\u6570\u8BB0\u5FC6.cpp",
|
||||
"DocumentMoniker": "D:\\project\\Project1C\u002B\u002B\\\u77E9\u9635\u53D6\u6570\u8BB0\u5FC6.cpp",
|
||||
"RelativeDocumentMoniker": "\u77E9\u9635\u53D6\u6570\u8BB0\u5FC6.cpp",
|
||||
"ToolTip": "D:\\project\\Project1C\u002B\u002B\\\u77E9\u9635\u53D6\u6570\u8BB0\u5FC6.cpp",
|
||||
"RelativeToolTip": "\u77E9\u9635\u53D6\u6570\u8BB0\u5FC6.cpp",
|
||||
"ViewState": "AQIAACcAAAAAAAAAAAAAAD0AAAAAAAAA",
|
||||
"Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000677|",
|
||||
"WhenOpened": "2024-06-02T08:16:45.5Z"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
}
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -0,0 +1,18 @@
|
|||
{
|
||||
"configurations": [
|
||||
{
|
||||
"name": "windows-gcc-x64",
|
||||
"includePath": [
|
||||
"${workspaceFolder}/**"
|
||||
],
|
||||
"compilerPath": "gcc",
|
||||
"cStandard": "${default}",
|
||||
"cppStandard": "${default}",
|
||||
"intelliSenseMode": "windows-gcc-x64",
|
||||
"compilerArgs": [
|
||||
""
|
||||
]
|
||||
}
|
||||
],
|
||||
"version": 4
|
||||
}
|
||||
|
|
@ -0,0 +1,24 @@
|
|||
{
|
||||
"version": "0.2.0",
|
||||
"configurations": [
|
||||
{
|
||||
"name": "C/C++ Runner: Debug Session",
|
||||
"type": "cppdbg",
|
||||
"request": "launch",
|
||||
"args": [],
|
||||
"stopAtEntry": false,
|
||||
"externalConsole": true,
|
||||
"cwd": "d:/project/Project1C++",
|
||||
"program": "d:/project/Project1C++/build/Debug/outDebug",
|
||||
"MIMode": "gdb",
|
||||
"miDebuggerPath": "gdb",
|
||||
"setupCommands": [
|
||||
{
|
||||
"description": "Enable pretty-printing for gdb",
|
||||
"text": "-enable-pretty-printing",
|
||||
"ignoreFailures": true
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
}
|
||||
|
|
@ -0,0 +1,59 @@
|
|||
{
|
||||
"C_Cpp_Runner.cCompilerPath": "gcc",
|
||||
"C_Cpp_Runner.cppCompilerPath": "g++",
|
||||
"C_Cpp_Runner.debuggerPath": "gdb",
|
||||
"C_Cpp_Runner.cStandard": "",
|
||||
"C_Cpp_Runner.cppStandard": "",
|
||||
"C_Cpp_Runner.msvcBatchPath": "C:/Program Files/Microsoft Visual Studio/VR_NR/Community/VC/Auxiliary/Build/vcvarsall.bat",
|
||||
"C_Cpp_Runner.useMsvc": false,
|
||||
"C_Cpp_Runner.warnings": [
|
||||
"-Wall",
|
||||
"-Wextra",
|
||||
"-Wpedantic",
|
||||
"-Wshadow",
|
||||
"-Wformat=2",
|
||||
"-Wcast-align",
|
||||
"-Wconversion",
|
||||
"-Wsign-conversion",
|
||||
"-Wnull-dereference"
|
||||
],
|
||||
"C_Cpp_Runner.msvcWarnings": [
|
||||
"/W4",
|
||||
"/permissive-",
|
||||
"/w14242",
|
||||
"/w14287",
|
||||
"/w14296",
|
||||
"/w14311",
|
||||
"/w14826",
|
||||
"/w44062",
|
||||
"/w44242",
|
||||
"/w14905",
|
||||
"/w14906",
|
||||
"/w14263",
|
||||
"/w44265",
|
||||
"/w14928"
|
||||
],
|
||||
"C_Cpp_Runner.enableWarnings": true,
|
||||
"C_Cpp_Runner.warningsAsError": false,
|
||||
"C_Cpp_Runner.compilerArgs": [],
|
||||
"C_Cpp_Runner.linkerArgs": [],
|
||||
"C_Cpp_Runner.includePaths": [],
|
||||
"C_Cpp_Runner.includeSearch": [
|
||||
"*",
|
||||
"**/*"
|
||||
],
|
||||
"C_Cpp_Runner.excludeSearch": [
|
||||
"**/build",
|
||||
"**/build/**",
|
||||
"**/.*",
|
||||
"**/.*/**",
|
||||
"**/.vscode",
|
||||
"**/.vscode/**"
|
||||
],
|
||||
"C_Cpp_Runner.useAddressSanitizer": false,
|
||||
"C_Cpp_Runner.useUndefinedSanitizer": false,
|
||||
"C_Cpp_Runner.useLeakSanitizer": false,
|
||||
"C_Cpp_Runner.showCompilationTime": false,
|
||||
"C_Cpp_Runner.useLinkTimeOptimization": false,
|
||||
"C_Cpp_Runner.msvcSecureNoWarnings": false
|
||||
}
|
||||
|
|
@ -0,0 +1,41 @@
|
|||
//#include <iostream>
|
||||
//#include <vector>
|
||||
//#include <algorithm>
|
||||
//#include <cmath>
|
||||
//
|
||||
//using namespace std;
|
||||
//
|
||||
//const int INF = -1e18;
|
||||
//
|
||||
//int main() {
|
||||
// int n, m;
|
||||
// cin >> n >> m;
|
||||
//
|
||||
// vector<vector<int>> matrix(n, vector<int>(m));
|
||||
// for (int i = 0; i < n; ++i) {
|
||||
// for (int j = 0; j < m; ++j) {
|
||||
// cin >> matrix[i][j];
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// vector<vector<vector<long long>>> dp(m + 1, vector<vector<long long>>(m, vector<long long>(m, INF)));
|
||||
// dp[0][0][m - 1] = 0;
|
||||
//
|
||||
// for (int i = 0; i < m; ++i) {
|
||||
// for (int l = 0; l < m; ++l) {
|
||||
// for (int r = 0; r < m; ++r) {
|
||||
// if (dp[i][l][r] == INF) continue;
|
||||
//
|
||||
// for (int k = 0; k < n; ++k) {
|
||||
// if (l <= r) {
|
||||
// dp[i + 1][l + 1][r] = max(dp[i + 1][l + 1][r], dp[i][l][r] + matrix[k][l] * (1LL << i));
|
||||
// dp[i + 1][l][r - 1] = max(dp[i + 1][l][r - 1], dp[i][l][r] + matrix[k][r] * (1LL << i));
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// cout << dp[m][0][m - 1] << endl;
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,31 @@
|
|||
|
||||
Microsoft Visual Studio Solution File, Format Version 12.00
|
||||
# Visual Studio Version 17
|
||||
VisualStudioVersion = 17.10.34804.81
|
||||
MinimumVisualStudioVersion = 10.0.40219.1
|
||||
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Project1C++", "Project1C++.vcxproj", "{653F23DB-4E65-4232-A488-E9A53268A0A6}"
|
||||
EndProject
|
||||
Global
|
||||
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||
Debug|x64 = Debug|x64
|
||||
Debug|x86 = Debug|x86
|
||||
Release|x64 = Release|x64
|
||||
Release|x86 = Release|x86
|
||||
EndGlobalSection
|
||||
GlobalSection(ProjectConfigurationPlatforms) = postSolution
|
||||
{653F23DB-4E65-4232-A488-E9A53268A0A6}.Debug|x64.ActiveCfg = Debug|x64
|
||||
{653F23DB-4E65-4232-A488-E9A53268A0A6}.Debug|x64.Build.0 = Debug|x64
|
||||
{653F23DB-4E65-4232-A488-E9A53268A0A6}.Debug|x86.ActiveCfg = Debug|Win32
|
||||
{653F23DB-4E65-4232-A488-E9A53268A0A6}.Debug|x86.Build.0 = Debug|Win32
|
||||
{653F23DB-4E65-4232-A488-E9A53268A0A6}.Release|x64.ActiveCfg = Release|x64
|
||||
{653F23DB-4E65-4232-A488-E9A53268A0A6}.Release|x64.Build.0 = Release|x64
|
||||
{653F23DB-4E65-4232-A488-E9A53268A0A6}.Release|x86.ActiveCfg = Release|Win32
|
||||
{653F23DB-4E65-4232-A488-E9A53268A0A6}.Release|x86.Build.0 = Release|Win32
|
||||
EndGlobalSection
|
||||
GlobalSection(SolutionProperties) = preSolution
|
||||
HideSolutionNode = FALSE
|
||||
EndGlobalSection
|
||||
GlobalSection(ExtensibilityGlobals) = postSolution
|
||||
SolutionGuid = {36478415-DBB6-48FC-899B-09EE85E41B65}
|
||||
EndGlobalSection
|
||||
EndGlobal
|
||||
|
|
@ -0,0 +1,148 @@
|
|||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||
<ItemGroup Label="ProjectConfigurations">
|
||||
<ProjectConfiguration Include="Debug|Win32">
|
||||
<Configuration>Debug</Configuration>
|
||||
<Platform>Win32</Platform>
|
||||
</ProjectConfiguration>
|
||||
<ProjectConfiguration Include="Release|Win32">
|
||||
<Configuration>Release</Configuration>
|
||||
<Platform>Win32</Platform>
|
||||
</ProjectConfiguration>
|
||||
<ProjectConfiguration Include="Debug|x64">
|
||||
<Configuration>Debug</Configuration>
|
||||
<Platform>x64</Platform>
|
||||
</ProjectConfiguration>
|
||||
<ProjectConfiguration Include="Release|x64">
|
||||
<Configuration>Release</Configuration>
|
||||
<Platform>x64</Platform>
|
||||
</ProjectConfiguration>
|
||||
</ItemGroup>
|
||||
<PropertyGroup Label="Globals">
|
||||
<VCProjectVersion>17.0</VCProjectVersion>
|
||||
<Keyword>Win32Proj</Keyword>
|
||||
<ProjectGuid>{653f23db-4e65-4232-a488-e9a53268a0a6}</ProjectGuid>
|
||||
<RootNamespace>Project1C</RootNamespace>
|
||||
<WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
|
||||
</PropertyGroup>
|
||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
||||
<ConfigurationType>Application</ConfigurationType>
|
||||
<UseDebugLibraries>true</UseDebugLibraries>
|
||||
<PlatformToolset>v143</PlatformToolset>
|
||||
<CharacterSet>Unicode</CharacterSet>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
||||
<ConfigurationType>Application</ConfigurationType>
|
||||
<UseDebugLibraries>false</UseDebugLibraries>
|
||||
<PlatformToolset>v143</PlatformToolset>
|
||||
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||
<CharacterSet>Unicode</CharacterSet>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
|
||||
<ConfigurationType>Application</ConfigurationType>
|
||||
<UseDebugLibraries>true</UseDebugLibraries>
|
||||
<PlatformToolset>v143</PlatformToolset>
|
||||
<CharacterSet>Unicode</CharacterSet>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
|
||||
<ConfigurationType>Application</ConfigurationType>
|
||||
<UseDebugLibraries>false</UseDebugLibraries>
|
||||
<PlatformToolset>v143</PlatformToolset>
|
||||
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||
<CharacterSet>Unicode</CharacterSet>
|
||||
</PropertyGroup>
|
||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
||||
<ImportGroup Label="ExtensionSettings">
|
||||
</ImportGroup>
|
||||
<ImportGroup Label="Shared">
|
||||
</ImportGroup>
|
||||
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||
</ImportGroup>
|
||||
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||
</ImportGroup>
|
||||
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||
</ImportGroup>
|
||||
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||
</ImportGroup>
|
||||
<PropertyGroup Label="UserMacros" />
|
||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||
<ClCompile>
|
||||
<WarningLevel>Level3</WarningLevel>
|
||||
<SDLCheck>true</SDLCheck>
|
||||
<PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||
<ConformanceMode>true</ConformanceMode>
|
||||
</ClCompile>
|
||||
<Link>
|
||||
<SubSystem>Console</SubSystem>
|
||||
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||
</Link>
|
||||
</ItemDefinitionGroup>
|
||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||
<ClCompile>
|
||||
<WarningLevel>Level3</WarningLevel>
|
||||
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||
<SDLCheck>true</SDLCheck>
|
||||
<PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||
<ConformanceMode>true</ConformanceMode>
|
||||
</ClCompile>
|
||||
<Link>
|
||||
<SubSystem>Console</SubSystem>
|
||||
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||
<OptimizeReferences>true</OptimizeReferences>
|
||||
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||
</Link>
|
||||
</ItemDefinitionGroup>
|
||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||
<ClCompile>
|
||||
<WarningLevel>Level3</WarningLevel>
|
||||
<SDLCheck>true</SDLCheck>
|
||||
<PreprocessorDefinitions>_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||
<ConformanceMode>true</ConformanceMode>
|
||||
</ClCompile>
|
||||
<Link>
|
||||
<SubSystem>Console</SubSystem>
|
||||
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||
</Link>
|
||||
</ItemDefinitionGroup>
|
||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||
<ClCompile>
|
||||
<WarningLevel>Level3</WarningLevel>
|
||||
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||
<SDLCheck>true</SDLCheck>
|
||||
<PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||
<ConformanceMode>true</ConformanceMode>
|
||||
</ClCompile>
|
||||
<Link>
|
||||
<SubSystem>Console</SubSystem>
|
||||
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||
<OptimizeReferences>true</OptimizeReferences>
|
||||
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||
</Link>
|
||||
</ItemDefinitionGroup>
|
||||
<ItemGroup>
|
||||
<ClCompile Include="平方之和.cpp" />
|
||||
<ClCompile Include="test2.cpp" />
|
||||
<ClCompile Include="优秀整数精.cpp" />
|
||||
<ClCompile Include="优秀正整数.cpp" />
|
||||
<ClCompile Include="三个数的最大公因数.cpp" />
|
||||
<ClCompile Include="优秀正整数质数筛.cpp" />
|
||||
<ClCompile Include="数独.cpp" />
|
||||
<ClCompile Include="斐波那契数列.cpp" />
|
||||
<ClCompile Include="欧几里得.cpp" />
|
||||
<ClCompile Include="矩阵取数简.cpp" />
|
||||
<ClCompile Include="矩阵取数记忆.cpp" />
|
||||
<ClCompile Include="矩阵取数高精.cpp" />
|
||||
<ClCompile Include="高精乘.cpp" />
|
||||
<ClCompile Include="高精加.cpp" />
|
||||
</ItemGroup>
|
||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
||||
<ImportGroup Label="ExtensionTargets">
|
||||
</ImportGroup>
|
||||
</Project>
|
||||
|
|
@ -0,0 +1,61 @@
|
|||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||
<ItemGroup>
|
||||
<Filter Include="源文件">
|
||||
<UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
|
||||
<Extensions>cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
|
||||
</Filter>
|
||||
<Filter Include="头文件">
|
||||
<UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
|
||||
<Extensions>h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd</Extensions>
|
||||
</Filter>
|
||||
<Filter Include="资源文件">
|
||||
<UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
|
||||
<Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
|
||||
</Filter>
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<ClCompile Include="数独.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="矩阵取数简.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="矩阵取数记忆.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="三个数的最大公因数.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="矩阵取数高精.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="高精加.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="高精乘.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="欧几里得.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="优秀正整数.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="优秀整数精.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="斐波那契数列.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="平方之和.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="test2.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="优秀正整数质数筛.cpp">
|
||||
<Filter>源文件</Filter>
|
||||
</ClCompile>
|
||||
</ItemGroup>
|
||||
</Project>
|
||||
|
|
@ -0,0 +1,4 @@
|
|||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<Project ToolsVersion="Current" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||
<PropertyGroup />
|
||||
</Project>
|
||||
Binary file not shown.
Binary file not shown.
|
|
@ -0,0 +1,11 @@
|
|||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<Project>
|
||||
<ProjectOutputs>
|
||||
<ProjectOutput>
|
||||
<FullPath>D:\project\Project1C++\x64\Debug\Project1C++.exe</FullPath>
|
||||
</ProjectOutput>
|
||||
</ProjectOutputs>
|
||||
<ContentFiles />
|
||||
<SatelliteDlls />
|
||||
<NonRecipeFileRefs />
|
||||
</Project>
|
||||
Binary file not shown.
|
|
@ -0,0 +1,2 @@
|
|||
test2.cpp
|
||||
Project1C++.vcxproj -> D:\project\Project1C++\x64\Debug\Project1C++.exe
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -0,0 +1,14 @@
|
|||
D:\project\Project1C++\平方之和.cpp;D:\project\Project1C++\Project1C++\x64\Debug\平方之和.obj
|
||||
D:\project\Project1C++\test2.cpp;D:\project\Project1C++\Project1C++\x64\Debug\test2.obj
|
||||
D:\project\Project1C++\优秀整数精.cpp;D:\project\Project1C++\Project1C++\x64\Debug\优秀整数精.obj
|
||||
D:\project\Project1C++\优秀正整数.cpp;D:\project\Project1C++\Project1C++\x64\Debug\优秀正整数.obj
|
||||
D:\project\Project1C++\三个数的最大公因数.cpp;D:\project\Project1C++\Project1C++\x64\Debug\三个数的最大公因数.obj
|
||||
D:\project\Project1C++\优秀正整数质数筛.cpp;D:\project\Project1C++\Project1C++\x64\Debug\优秀正整数质数筛.obj
|
||||
D:\project\Project1C++\数独.cpp;D:\project\Project1C++\Project1C++\x64\Debug\数独.obj
|
||||
D:\project\Project1C++\斐波那契数列.cpp;D:\project\Project1C++\Project1C++\x64\Debug\斐波那契数列.obj
|
||||
D:\project\Project1C++\欧几里得.cpp;D:\project\Project1C++\Project1C++\x64\Debug\欧几里得.obj
|
||||
D:\project\Project1C++\矩阵取数简.cpp;D:\project\Project1C++\Project1C++\x64\Debug\矩阵取数简.obj
|
||||
D:\project\Project1C++\矩阵取数记忆.cpp;D:\project\Project1C++\Project1C++\x64\Debug\矩阵取数记忆.obj
|
||||
D:\project\Project1C++\矩阵取数高精.cpp;D:\project\Project1C++\Project1C++\x64\Debug\矩阵取数高精.obj
|
||||
D:\project\Project1C++\高精乘.cpp;D:\project\Project1C++\Project1C++\x64\Debug\高精乘.obj
|
||||
D:\project\Project1C++\高精加.cpp;D:\project\Project1C++\Project1C++\x64\Debug\高精加.obj
|
||||
|
|
@ -0,0 +1,2 @@
|
|||
PlatformToolSet=v143:VCToolArchitecture=Native64Bit:VCToolsVersion=14.40.33721:TargetPlatformVersion=10.0.22621.0:
|
||||
Debug|x64|D:\project\Project1C++\|
|
||||
Binary file not shown.
Binary file not shown.
|
|
@ -0,0 +1,2 @@
|
|||
^D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\TEST2.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\三个数的最大公因数.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\优秀整数精.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\优秀正整数.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\优秀正整数质数筛.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\平方之和.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\数独.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\斐波那契数列.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\欧几里得.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\矩阵取数简.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\矩阵取数记忆.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\矩阵取数高精.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\高精乘.OBJ|D:\PROJECT\PROJECT1C++\PROJECT1C++\X64\DEBUG\高精加.OBJ
|
||||
D:\project\Project1C++\Project1C++\x64\Debug\Project1C++.ilk
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -0,0 +1,33 @@
|
|||
#include <iostream>
|
||||
#include <vector>
|
||||
using namespace std;
|
||||
|
||||
int main() {
|
||||
int n;
|
||||
cin >> n;
|
||||
int shuzu[2000] = {0,0};
|
||||
for (int i = 2; i <=n; i++)
|
||||
{
|
||||
shuzu[1]=0;
|
||||
}
|
||||
for (int i = 2 ;i < n-1; i++)
|
||||
{
|
||||
int num = i+1;
|
||||
int b = i;
|
||||
while (shuzu[num]==0)
|
||||
{
|
||||
num++;
|
||||
}
|
||||
for (int j = num; j <=n; j++) {
|
||||
if (j%b==0)
|
||||
{
|
||||
shuzu[j] = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
for (int i = 1; i < n; i++)
|
||||
{
|
||||
cout << i << " " << shuzu[i] << endl;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
Binary file not shown.
Binary file not shown.
|
|
@ -0,0 +1,21 @@
|
|||
//#include <iostream>
|
||||
//using namespace std;
|
||||
//int yinshu(int a,int b) {
|
||||
// int num_max, num_min;
|
||||
// num_max = max(a, b);
|
||||
// num_min = min(a, b);
|
||||
// while (num_max % num_min != 0){
|
||||
// int tmp = num_max;
|
||||
// num_max = num_min;
|
||||
// num_min = tmp % num_min;
|
||||
// }
|
||||
// return num_min;
|
||||
//}
|
||||
//int main() {
|
||||
// int a, b, c;
|
||||
// int num_max, num_min;
|
||||
// cin >> a >> b >> c;
|
||||
// int d = yinshu(a,b);
|
||||
// cout << yinshu(c,d);
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,63 @@
|
|||
//#include <iostream>
|
||||
//#include <cmath>
|
||||
//#include <vector>
|
||||
//using namespace std;
|
||||
//
|
||||
//const long long MOD = 998244353;
|
||||
//const int MAX_DIGIT_SUM = 162; // 最大的位数和（999999999999 的位数和为 162）
|
||||
//
|
||||
//// 计算一个数各位数字之和
|
||||
//long long digitSum(long long a) {
|
||||
// long long sum = 0;
|
||||
// while (a != 0) {
|
||||
// sum += a % 10;
|
||||
// a /= 10;
|
||||
// }
|
||||
// return sum;
|
||||
//}
|
||||
//
|
||||
//// 使用埃拉托色尼筛法预计算质数表
|
||||
//vector<bool> sieve(int n) {
|
||||
// vector<bool> isPrime(n + 1, true);
|
||||
// isPrime[0] = isPrime[1] = false;
|
||||
// for (int i = 2; i * i <= n; ++i) {
|
||||
// if (isPrime[i]) {
|
||||
// for (int j = i * i; j <= n; j += i) {
|
||||
// isPrime[j] = false;
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
// return isPrime;
|
||||
//}
|
||||
//
|
||||
//int main() {
|
||||
// long long L, R;
|
||||
// cin >> L >> R;
|
||||
//
|
||||
// // 预计算数字位和在 [0, MAX_DIGIT_SUM] 范围内的质数表
|
||||
// vector<bool> primeTable = sieve(MAX_DIGIT_SUM);
|
||||
//
|
||||
// long long product = 1;
|
||||
// bool found = false;
|
||||
//
|
||||
// // 显式类型转换
|
||||
// long long start = static_cast<long long>(ceil(sqrt(L)));
|
||||
// long long end = static_cast<long long>(floor(sqrt(R)));
|
||||
//
|
||||
// for (long long i = start; i <= end; i++) {
|
||||
// long long square = i * i;
|
||||
// if (square >= L && square <= R && primeTable[digitSum(square)]) {
|
||||
// product = (product * square) % MOD;
|
||||
// found = true;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// if (found) {
|
||||
// cout << product << endl;
|
||||
// }
|
||||
// else {
|
||||
// cout << 0 << endl;
|
||||
// }
|
||||
//
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,57 @@
|
|||
//#include <iostream>
|
||||
//#include <cmath>
|
||||
//#include <vector>
|
||||
//using namespace std;
|
||||
//
|
||||
//const long long MOD = 998244353;
|
||||
//
|
||||
//// 计算一个数各位数字之和
|
||||
//long long digitSum(long long a) {
|
||||
// long long sum = 0;
|
||||
// while (a != 0) {
|
||||
// sum += a % 10;
|
||||
// a /= 10;
|
||||
// }
|
||||
// return sum;
|
||||
//}
|
||||
//
|
||||
//// 判断一个数是否为质数
|
||||
//bool isPrime(long long b) {
|
||||
// if (b <= 1) return false;
|
||||
// if (b == 2) return true;
|
||||
// if (b % 2 == 0) return false;
|
||||
// for (long long i = 3; i * i <= b; i ++) {
|
||||
// if (b % i == 0) {
|
||||
// return false;
|
||||
// }
|
||||
// }
|
||||
// return true;
|
||||
//}
|
||||
//
|
||||
//int main() {
|
||||
// int64_t L, R;
|
||||
// cin >> L >> R;
|
||||
// long long product = 1;
|
||||
// bool found = false;
|
||||
//
|
||||
// long long start = ceil(sqrt(L));
|
||||
// long long end = floor(sqrt(R));
|
||||
//
|
||||
// for (long long i = start; i <= end; i++) {
|
||||
// long long square = i * i;
|
||||
// if (square >= L && square <= R && isPrime(digitSum(square))) {
|
||||
// product = (product * square) % MOD;
|
||||
//
|
||||
// found = true;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// if (found) {
|
||||
// cout << product << endl;
|
||||
// }
|
||||
// else {
|
||||
// cout << 0 << endl;
|
||||
// }
|
||||
//
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,31 @@
|
|||
//#include<iostream>
|
||||
//using namespace std;
|
||||
//int main() {
|
||||
// int count = 0;
|
||||
// int n;
|
||||
// cin >> n;
|
||||
// for (int i = 0; i < n; i++)
|
||||
// {
|
||||
// int N,is_zhe=0;
|
||||
// cin >> N;
|
||||
// for (int j = 1; j < sqrt(N); j++)
|
||||
// {
|
||||
// count++;
|
||||
// cout << count<<endl;
|
||||
// int temp = N - pow(j, 2);
|
||||
// int emp = sqrt(temp);
|
||||
// if (temp == pow(emp, 2)){
|
||||
// is_zhe=1;
|
||||
// break;
|
||||
// }
|
||||
// //cout <<temp <<" " << pow(emp, 2) << endl;
|
||||
// }
|
||||
// if (is_zhe)
|
||||
// {
|
||||
// cout << "Yes"<<endl;
|
||||
// }else{
|
||||
// cout << "No" << endl;
|
||||
// }
|
||||
// }
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,93 @@
|
|||
//#include <iostream>
|
||||
//#include <vector>
|
||||
//#include <functional>
|
||||
//using namespace std;
|
||||
//
|
||||
//bool isValidMove(vector<vector<int>>& board, vector<vector<bool>>& rows, vector<vector<bool>>& cols, vector<vector<bool>>& subgrids, int row, int col, int num) {
|
||||
// return !rows[row][num] && !cols[col][num] && !subgrids[row / 3 * 3 + col / 3][num];
|
||||
//}
|
||||
//
|
||||
//bool solveSudoku(vector<vector<int>>& board) {
|
||||
// vector<vector<bool>> rows(9, vector<bool>(10, false)); // 行中数字存在情况
|
||||
// vector<vector<bool>> cols(9, vector<bool>(10, false)); // 列中数字存在情况
|
||||
// vector<vector<bool>> subgrids(9, vector<bool>(10, false)); // 九宫格中数字存在情况
|
||||
//
|
||||
// // 根据初始棋盘初始化存在情况表格
|
||||
// for (int i = 0; i < 9; ++i) {
|
||||
// for (int j = 0; j < 9; ++j) {
|
||||
// int num = board[i][j];
|
||||
// if (num != 0) {
|
||||
// rows[i][num] = true;
|
||||
// cols[j][num] = true;
|
||||
// subgrids[i / 3 * 3 + j / 3][num] = true;
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// // 使用回溯法解数独
|
||||
// function<bool(int, int)> backtrack = [&](int row, int col) -> bool {
|
||||
// if (row == 9) {
|
||||
// return true; // 所有单元格填满，基本情况
|
||||
// }
|
||||
//
|
||||
// if (board[row][col] == 0) {
|
||||
// for (int num = 1; num <= 9; ++num) {
|
||||
// if (isValidMove(board, rows, cols, subgrids, row, col, num)) {
|
||||
// board[row][col] = num;
|
||||
// rows[row][num] = true;
|
||||
// cols[col][num] = true;
|
||||
// subgrids[row / 3 * 3 + col / 3][num] = true;
|
||||
//
|
||||
// if (col == 8) {
|
||||
// if (backtrack(row + 1, 0)) {
|
||||
// return true;
|
||||
// }
|
||||
// }
|
||||
// else {
|
||||
// if (backtrack(row, col + 1)) {
|
||||
// return true;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// board[row][col] = 0;
|
||||
// rows[row][num] = false;
|
||||
// cols[col][num] = false;
|
||||
// subgrids[row / 3 * 3 + col / 3][num] = false;
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
// else {
|
||||
// if (col == 8) {
|
||||
// return backtrack(row + 1, 0);
|
||||
// }
|
||||
// else {
|
||||
// return backtrack(row, col + 1);
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// return false; // 没有找到有效的移动
|
||||
// };
|
||||
//
|
||||
// return backtrack(0, 0);
|
||||
//}
|
||||
//
|
||||
//int main() {
|
||||
// vector<vector<int>> sudokuBoard(9, vector<int>(9, 0));
|
||||
//
|
||||
// for (int i = 0; i < 9; ++i) {
|
||||
// for (int j = 0; j < 9; ++j) {
|
||||
// cin >> sudokuBoard[i][j];
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// if (solveSudoku(sudokuBoard)) {
|
||||
// for (const auto& row : sudokuBoard) {
|
||||
// for (int num : row) {
|
||||
// cout << num << " ";
|
||||
// }
|
||||
// cout << endl;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,21 @@
|
|||
//#include <iostream>
|
||||
//#include <vector>
|
||||
//
|
||||
//using namespace std;
|
||||
//
|
||||
//int main() {
|
||||
// int sum = 0;
|
||||
// for (int i = 0; i <=100; i++)
|
||||
// {
|
||||
// for (int j = 0; j <=100-i; j++)
|
||||
// {
|
||||
// /* cout << (100 - i - j) / 3 + i * 5 + j * 3<<endl;*/
|
||||
// if ((100 - i - j) / 3 + i * 5 + j * 3 == 100) {
|
||||
// sum++;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// }
|
||||
// cout << sum;
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
//#include <iostream>
|
||||
//
|
||||
//using namespace std;
|
||||
//
|
||||
//int main() {
|
||||
// int M, N;
|
||||
// int m, n;
|
||||
// cin >> m >> n;
|
||||
// M = max(m, n);
|
||||
// N = min(m, n);
|
||||
// int sum = M * N;
|
||||
// while (M % N != 0) {
|
||||
// int tmp = N;
|
||||
// N = M % N;
|
||||
// M = tmp;
|
||||
// }
|
||||
// cout << N<<endl;
|
||||
// cout << sum / N;
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,59 @@
|
|||
//#include <iostream>
|
||||
//#include <vector>
|
||||
//#include <algorithm>
|
||||
//
|
||||
//using namespace std;
|
||||
//
|
||||
//int n, m;
|
||||
//long long sum;
|
||||
//
|
||||
//// 输出矩阵（调试用）
|
||||
//void out(const vector<vector<int>>& a) {
|
||||
// int n = a.size();
|
||||
// if (n == 0) return;
|
||||
// int m = a[0].size();
|
||||
// for (int i = 0; i < n; i++) {
|
||||
// for (int j = 0; j < m; j++) {
|
||||
// cout << a[i][j] << " ";
|
||||
// }
|
||||
// cout << endl;
|
||||
// }
|
||||
//}
|
||||
//
|
||||
//// 递归函数：选择向量的头或尾来查找最大值
|
||||
//long long findMaxRecursive(const vector<int>& b, int left, int right, int power) {
|
||||
// if (left > right) {
|
||||
// return 0;
|
||||
// }
|
||||
// if (left == right) {
|
||||
// return b[left] * (1LL << power);
|
||||
// }
|
||||
// long long maxHead = findMaxRecursive(b, left + 1, right, power + 1) + b[left] * (1LL << power);
|
||||
// long long maxTail = findMaxRecursive(b, left, right - 1, power + 1) + b[right] * (1LL << power);
|
||||
// return max(maxHead, maxTail);
|
||||
//}
|
||||
//
|
||||
//long long solve(const vector<vector<int>>& matrix) {
|
||||
// long long totalMaxScore = 0;
|
||||
// for (const auto& row : matrix) {
|
||||
// totalMaxScore += findMaxRecursive(row, 0, row.size() - 1, 1);
|
||||
// }
|
||||
// return totalMaxScore;
|
||||
//}
|
||||
//
|
||||
//int main() {
|
||||
// cin >> n >> m;
|
||||
//
|
||||
// vector<vector<int>> a(n, vector<int>(m));
|
||||
//
|
||||
// // 读取输入
|
||||
// for (int i = 0; i < n; i++) {
|
||||
// for (int j = 0; j < m; j++) {
|
||||
// cin >> a[i][j];
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// cout << solve(a) << endl;
|
||||
//
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,61 @@
|
|||
//#include <iostream>
|
||||
//#include <vector>
|
||||
//#include <algorithm>
|
||||
//
|
||||
//using namespace std;
|
||||
//
|
||||
//int n, m;
|
||||
//vector<vector<long long>> dp; // 记忆化数组
|
||||
//
|
||||
//// 计算 2^power
|
||||
//long long powerOfTwo(int power) {
|
||||
// long long result = 1;
|
||||
// for (int i = 0; i < power; ++i) {
|
||||
// result *= 2;
|
||||
// }
|
||||
// return result;
|
||||
//}
|
||||
//
|
||||
//// 递归函数：选择向量的头或尾来查找最大值
|
||||
//long long findMaxRecursive(const vector<int>& b, int left, int right, int power) {
|
||||
// if (left > right) {
|
||||
// return 0;
|
||||
// }
|
||||
// if (left == right) {
|
||||
// return b[left] * powerOfTwo(power);
|
||||
// }
|
||||
// if (dp[left][right] != -1) { // 如果已经计算过，直接返回结果
|
||||
// return dp[left][right];
|
||||
// }
|
||||
// long long maxHead = findMaxRecursive(b, left + 1, right, power + 1) + b[left] * powerOfTwo(power);
|
||||
// long long maxTail = findMaxRecursive(b, left, right - 1, power + 1) + b[right] * powerOfTwo(power);
|
||||
// dp[left][right] = max(maxHead, maxTail); // 记录计算结果
|
||||
// return dp[left][right];
|
||||
//}
|
||||
//
|
||||
//long long solve(const vector<vector<int>>& matrix) {
|
||||
// long long totalMaxScore = 0;
|
||||
// for (const auto& row : matrix) {
|
||||
// int rowSize = row.size();
|
||||
// // 动态调整 dp 的大小并初始化
|
||||
// dp = vector<vector<long long>>(rowSize, vector<long long>(rowSize, -1));
|
||||
// totalMaxScore += findMaxRecursive(row, 0, rowSize - 1, 1);
|
||||
// }
|
||||
// return totalMaxScore;
|
||||
//}
|
||||
//
|
||||
//int main() {
|
||||
// cin >> n >> m;
|
||||
// vector<vector<int>> a(n, vector<int>(m));
|
||||
//
|
||||
// // 读取输入
|
||||
// for (int i = 0; i < n; i++) {
|
||||
// for (int j = 0; j < m; j++) {
|
||||
// cin >> a[i][j];
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// cout << solve(a) << endl;
|
||||
//
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,141 @@
|
|||
//#include <iostream>
|
||||
//#include <vector>
|
||||
//#include <string>
|
||||
//#include <algorithm>
|
||||
//
|
||||
//using namespace std;
|
||||
//
|
||||
//vector<vector<string>> dp; // 记忆化数组
|
||||
//
|
||||
//
|
||||
//string highPrecisionAdd(const string& s1, const string& s2) {
|
||||
// int la = s1.length();
|
||||
// int lb = s2.length();
|
||||
// int lc = max(la, lb);
|
||||
// vector<int> a(lc + 1, 0); // +1 to handle carry over
|
||||
// vector<int> b(lc + 1, 0);
|
||||
// vector<int> c(lc + 1, 0);
|
||||
//
|
||||
// for (int i = 0; i < la; i++) {
|
||||
// a[i] = s1[la - i - 1] - '0'; // reverse order
|
||||
// }
|
||||
// for (int i = 0; i < lb; i++) {
|
||||
// b[i] = s2[lb - i - 1] - '0'; // reverse order
|
||||
// }
|
||||
//
|
||||
// for (int i = 0; i < lc; i++) {
|
||||
// c[i] += a[i] + b[i];
|
||||
// if (c[i] >= 10) {
|
||||
// c[i + 1] += c[i] / 10;
|
||||
// c[i] %= 10;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// // handle last carry
|
||||
// if (c[lc] > 0) lc++;
|
||||
//
|
||||
// string result;
|
||||
// bool leadingZero = true;
|
||||
// for (int i = lc - 1; i >= 0; i--) {
|
||||
// if (leadingZero && c[i] == 0) continue;
|
||||
// leadingZero = false;
|
||||
// result.push_back(c[i] + '0');
|
||||
// }
|
||||
//
|
||||
// return result.empty() ? "0" : result;
|
||||
//}
|
||||
//
|
||||
//string highPrecisionMultiply(const string& s1, const string& s2) {
|
||||
// int la = s1.length();
|
||||
// int lb = s2.length();
|
||||
// vector<int> a(la, 0);
|
||||
// vector<int> b(lb, 0);
|
||||
// vector<int> c(la + lb, 0);
|
||||
//
|
||||
// for (int i = 0; i < la; i++) {
|
||||
// a[la - i - 1] = s1[i] - '0'; // Reverse order
|
||||
// }
|
||||
// for (int i = 0; i < lb; i++) {
|
||||
// b[lb - i - 1] = s2[i] - '0'; // Reverse order
|
||||
// }
|
||||
//
|
||||
// for (int i = 0; i < la; i++) {
|
||||
// for (int j = 0; j < lb; j++) {
|
||||
// c[i + j] += a[i] * b[j];
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// // Handle carry
|
||||
// for (int i = 0; i < la + lb; i++) {
|
||||
// if (c[i] >= 10) {
|
||||
// c[i + 1] += c[i] / 10;
|
||||
// c[i] %= 10;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// // Remove leading zeros
|
||||
// int lc = la + lb;
|
||||
// while (lc > 1 && c[lc - 1] == 0) lc--;
|
||||
//
|
||||
// string result;
|
||||
// for (int i = lc - 1; i >= 0; i--) {
|
||||
// result.push_back(c[i] + '0');
|
||||
// }
|
||||
//
|
||||
// return result.empty() ? "0" : result;
|
||||
//}
|
||||
//
|
||||
//
|
||||
//// 计算2的power次方的高精度函数
|
||||
//string powerOfTwo(int power) {
|
||||
// string result = "1";
|
||||
// string two = "2";
|
||||
// for (int i = 0; i < power; ++i) {
|
||||
// result = highPrecisionMultiply(result, two);
|
||||
// }
|
||||
// return result;
|
||||
//}
|
||||
//
|
||||
//string findMaxRecursive(const vector<string>& b, int left, int right, int power) {
|
||||
// if (left > right) {
|
||||
// return "0";
|
||||
// }
|
||||
// if (left == right) {
|
||||
// return highPrecisionMultiply(b[left], powerOfTwo(power));
|
||||
// }
|
||||
// if (dp[left][right] != "-1") {
|
||||
// return dp[left][right];
|
||||
// }
|
||||
//
|
||||
// string maxHead = highPrecisionAdd(findMaxRecursive(b, left + 1, right, power + 1), highPrecisionMultiply(b[left], powerOfTwo(power)));
|
||||
// string maxTail = highPrecisionAdd(findMaxRecursive(b, left, right - 1, power + 1), highPrecisionMultiply(b[right], powerOfTwo(power)));
|
||||
// dp[left][right] = (maxHead > maxTail) ? maxHead : maxTail;
|
||||
// cout << "" << dp[left][right] << endl;
|
||||
// return dp[left][right];
|
||||
//}
|
||||
//
|
||||
//string solve(const vector<vector<string>>& matrix) {
|
||||
// string totalMaxScore = "0";
|
||||
// for (const auto& row : matrix) {
|
||||
// int rowSize = row.size();
|
||||
// dp = vector<vector<string>>(rowSize, vector<string>(rowSize, "-1"));
|
||||
// totalMaxScore = highPrecisionAdd(totalMaxScore, findMaxRecursive(row, 0, rowSize - 1, 1));
|
||||
// }
|
||||
// return totalMaxScore;
|
||||
//}
|
||||
//
|
||||
//int main() {
|
||||
// int n, m;
|
||||
// cin >> n >> m;
|
||||
// vector<vector<string>> a(n, vector<string>(m));
|
||||
//
|
||||
// for (int i = 0; i < n; i++) {
|
||||
// for (int j = 0; j < m; j++) {
|
||||
// cin >> a[i][j];
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// cout << solve(a) << endl;
|
||||
//
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,50 @@
|
|||
//#include <iostream>
|
||||
//#include <vector>
|
||||
//#include <string>
|
||||
//
|
||||
//using namespace std;
|
||||
//
|
||||
//string highPrecisionMultiply(const string& s1, const string& s2) {
|
||||
// int la = s1.length();
|
||||
// int lb = s2.length();
|
||||
// vector<int> a(la, 0);
|
||||
// vector<int> b(lb, 0);
|
||||
// vector<int> c(la + lb, 0);
|
||||
//
|
||||
// for (int i = 0; i < la; i++) {
|
||||
// a[la - i - 1] = s1[i] - '0'; // Reverse order
|
||||
// }
|
||||
// for (int i = 0; i < lb; i++) {
|
||||
// b[lb - i - 1] = s2[i] - '0'; // Reverse order
|
||||
// }
|
||||
//
|
||||
// for (int i = 0; i < la; i++) {
|
||||
// for (int j = 0; j < lb; j++) {
|
||||
// c[i + j] += a[i] * b[j];
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// // Handle carry
|
||||
// for (int i = 0; i < la + lb; i++) {
|
||||
// if (c[i] >= 10) {
|
||||
// c[i + 1] += c[i] / 10;
|
||||
// c[i] %= 10;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// // Remove leading zeros
|
||||
// int lc = la + lb;
|
||||
// while (lc > 1 && c[lc - 1] == 0) lc--;
|
||||
//
|
||||
// string result;
|
||||
// for (int i = lc - 1; i >= 0; i--) {
|
||||
// result.push_back(c[i] + '0');
|
||||
// }
|
||||
//
|
||||
// return result.empty() ? "0" : result;
|
||||
//}
|
||||
//
|
||||
//int main() {
|
||||
// cout << highPrecisionMultiply("50", "50") << endl; // Expected output: 2500
|
||||
// return 0;
|
||||
//}
|
||||
|
|
@ -0,0 +1,47 @@
|
|||
//#include <iostream>
|
||||
//#include <vector>
|
||||
//#include <string>
|
||||
//
|
||||
//using namespace std;
|
||||
//
|
||||
//string highPrecisionAdd(const string& s1, const string& s2) {
|
||||
// int la = s1.length();
|
||||
// int lb = s2.length();
|
||||
// int lc = max(la, lb);
|
||||
// vector<int> a(lc + 1, 0); // +1 to handle carry over
|
||||
// vector<int> b(lc + 1, 0);
|
||||
// vector<int> c(lc + 1, 0);
|
||||
//
|
||||
// for (int i = 0; i < la; i++) {
|
||||
// a[i] = s1[la - i - 1] - '0'; // reverse order
|
||||
// }
|
||||
// for (int i = 0; i < lb; i++) {
|
||||
// b[i] = s2[lb - i - 1] - '0'; // reverse order
|
||||
// }
|
||||
//
|
||||
// for (int i = 0; i < lc; i++) {
|
||||
// c[i] += a[i] + b[i];
|
||||
// if (c[i] >= 10) {
|
||||
// c[i + 1] += c[i] / 10;
|
||||
// c[i] %= 10;
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// // handle last carry
|
||||
// if (c[lc] > 0) lc++;
|
||||
//
|
||||
// string result;
|
||||
// bool leadingZero = true;
|
||||
// for (int i = lc - 1; i >= 0; i--) {
|
||||
// if (leadingZero && c[i] == 0) continue;
|
||||
// leadingZero = false;
|
||||
// result.push_back(c[i] + '0');
|
||||
// }
|
||||
//
|
||||
// return result.empty() ? "0" : result;
|
||||
//}
|
||||
//
|
||||
//int main() {
|
||||
// cout << highPrecisionAdd("5555", "50") << endl; // Expected output: 100
|
||||
// return 0;
|
||||
//}
|
||||
Loading…
Reference in New Issue