├── ACM计划(针对大一).docx ├── README.md ├── VS相关问题.txt ├── ~$的ACM模版.docx ├── 【&自己写的小工具&】 ├── HDOJ题目各题AC总数.exe ├── HDOJ题目各题AC总数.txt ├── windows │ ├── 分析数据（windows）.txt │ ├── 抓取网页（使用C++11的thread）.txt │ ├── 抓取网页（使用_beginthreadex）.txt │ └── 比较代码不同（windows）.txt ├── 使用手册.docx ├── 分析数据.exe ├── 分析数据.txt ├── 抓取网页.exe ├── 抓取网页（使用C++11的thread）.txt ├── 抓取网页（使用_beginthreadex）.txt ├── 无标题文档 ├── 比较代码不同.exe └── 比较代码不同.txt ├── 【ACdreamOJ】 ├── 1000.txt ├── 1001(TC).txt ├── 1069.txt ├── 1071.txt ├── 1073.txt ├── 1090.txt └── 1099.txt ├── 【AOJ】 ├── 0033.txt ├── 0118.txt └── 0558.txt ├── 【BZOJ】 ├── 1001.txt ├── 1003.txt ├── 1008.txt ├── 1012.txt ├── 1026.txt ├── 1031.txt ├── 1036.txt ├── 1208.txt ├── 1415.txt ├── 1493.txt ├── 1500.txt ├── 1503.txt ├── 1507.txt ├── 1588.txt ├── 2002.txt ├── 2038.txt ├── 2243.txt ├── 2588.txt ├── 3224.txt └── 3295.txt ├── 【CF】 ├── 19D.txt ├── 235A.txt ├── 372A.txt ├── 389A.txt ├── 540A.txt ├── 540B.txt ├── 540C.txt ├── 540D.txt ├── 540E.txt ├── 543A.txt ├── 543B.txt ├── 543C.txt ├── 544A.txt ├── 544B.txt ├── 545A.txt ├── 545B.txt ├── 545C.txt ├── 545D.txt ├── 545E.txt ├── 546A.txt ├── 546B.txt ├── 546C.txt ├── 546D.txt ├── 546E.txt ├── 547A.txt ├── 547B.txt ├── 548A.txt ├── 548B.txt ├── 553A.txt ├── 554A.txt ├── 554B.txt ├── 555A.txt ├── 556A.txt ├── 556B.txt ├── 559A.txt ├── 559B.txt ├── 55D.txt ├── 560A.txt └── 560B.txt ├── 【HDU】 ├── 1000.txt ├── 1001.txt ├── 1002.txt ├── 1003.txt ├── 1004.txt ├── 1005.txt ├── 1008.txt ├── 1009.txt ├── 1010.txt ├── 1011.txt ├── 1012.txt ├── 1014.txt ├── 1016.txt ├── 1017.txt ├── 1019.txt ├── 1020.txt ├── 1021.txt ├── 1024.txt ├── 1025.txt ├── 1030.txt ├── 1032.txt ├── 1033.txt ├── 1034.txt ├── 1035.txt ├── 1037.txt ├── 1038.txt ├── 1039.txt ├── 1040.txt ├── 1042.txt ├── 1045.txt ├── 1046.txt ├── 1048.txt ├── 1049.txt ├── 1050.txt ├── 1051.txt ├── 1052.txt ├── 1054.txt ├── 1056.txt ├── 1057.txt ├── 1058.txt ├── 1059.txt ├── 1060.txt ├── 1061.txt ├── 1062.txt ├── 1064.txt ├── 1065.txt ├── 1068.txt ├── 1069.txt ├── 1073.txt ├── 1074.txt ├── 1075.txt ├── 1078.txt ├── 1080.txt ├── 1081.txt ├── 1082.txt ├── 1083.txt ├── 1084.txt ├── 1087.txt ├── 1088.txt ├── 1089.txt ├── 1090.txt ├── 1091.txt ├── 1092.txt ├── 1093.txt ├── 1094.txt ├── 1095.txt ├── 1096.txt ├── 1097.txt ├── 1102.txt ├── 1106.txt ├── 1107.txt ├── 1108.txt ├── 1113.txt ├── 1114.txt ├── 1116.txt ├── 1129.txt ├── 1142.txt ├── 1143.txt ├── 1150.txt ├── 1151.txt ├── 1157.txt ├── 1158.txt ├── 1159.txt ├── 1160.txt ├── 1161.txt ├── 1162.txt ├── 1164.txt ├── 1165.txt ├── 1166.txt ├── 1170.txt ├── 1175.txt ├── 1176.txt ├── 1177.txt ├── 1178.txt ├── 1194.txt ├── 1196.txt ├── 1198.txt ├── 1200.txt ├── 1202.txt ├── 1203.txt ├── 1205.txt ├── 1207.txt ├── 1208.txt ├── 1210.txt ├── 1211.txt ├── 1213.txt ├── 1215.txt ├── 1217.txt ├── 1219.txt ├── 1222.txt ├── 1224.txt ├── 1226.txt ├── 1227.txt ├── 1228.txt ├── 1229.txt ├── 1230.txt ├── 1231.txt ├── 1232.txt ├── 1233.txt ├── 1234.txt ├── 1235.txt ├── 1239.txt ├── 1241.txt ├── 1242.txt ├── 1244.txt ├── 1245.txt ├── 1247.txt ├── 1248.txt ├── 1249.txt ├── 1251.txt ├── 1253.txt ├── 1255.txt ├── 1256.txt ├── 1257.txt ├── 1259.txt ├── 1262.txt ├── 1266.txt ├── 1267.txt ├── 1269.txt ├── 1272.txt ├── 1276.txt ├── 1279.txt ├── 1282.txt ├── 1283.txt ├── 1284.txt ├── 1285.txt ├── 1286.txt ├── 1287.txt ├── 1290.txt ├── 1298.txt ├── 1300.txt ├── 1301.txt ├── 1303.txt ├── 1312.txt ├── 1317.txt ├── 1319.txt ├── 1321.txt ├── 1325.txt ├── 1326.txt ├── 1328.txt ├── 1330.txt ├── 1331.txt ├── 1332.txt ├── 1339.txt ├── 1350.txt ├── 1358.txt ├── 1372.txt ├── 1384.txt ├── 1385.txt ├── 1391.txt ├── 1394.txt ├── 1395.txt ├── 1396.txt ├── 1397.txt ├── 1400.txt ├── 1403.txt ├── 1405.txt ├── 1406.txt ├── 1407.txt ├── 1408.txt ├── 1418.txt ├── 1420.txt ├── 1421.txt ├── 1422.txt ├── 1423.txt ├── 1428.txt ├── 1431.txt ├── 1432.txt ├── 1455.txt ├── 1456.txt ├── 1465.txt ├── 1489.txt ├── 1494.txt ├── 1498.txt ├── 1500.txt ├── 1502.txt ├── 1503.txt ├── 1504.txt ├── 1505.txt ├── 1506.txt ├── 1507.txt ├── 1509.txt ├── 1513.txt ├── 1514.txt ├── 1518.txt ├── 1520.txt ├── 1526.txt ├── 1527.txt ├── 1528.txt ├── 1530.txt ├── 1531.txt ├── 1532.txt ├── 1533.txt ├── 1534.txt ├── 1535.txt ├── 1540.txt ├── 1541.txt ├── 1542.txt ├── 1546.txt ├── 1548.txt ├── 1555.txt ├── 1556.txt ├── 1559.txt ├── 1561.txt ├── 1562.txt ├── 1563.txt ├── 1565.txt ├── 1569.txt ├── 1570.txt ├── 1571.txt ├── 1572.txt ├── 1576.txt ├── 1577.txt ├── 1578.txt ├── 1587.txt ├── 1596.txt ├── 1598.txt ├── 1619.txt ├── 1629.txt ├── 1659.txt ├── 1673.txt ├── 1686.txt ├── 1688.txt ├── 1690.txt ├── 1695.txt ├── 1698.txt ├── 1701.txt ├── 1710.txt ├── 1711.txt ├── 1712.txt ├── 1718.txt ├── 1720.txt ├── 1754.txt ├── 1757.txt ├── 1787.txt ├── 1800.txt ├── 1804.txt ├── 1805.txt ├── 1806.txt ├── 1811.txt ├── 1814.txt ├── 1818.txt ├── 1823.txt ├── 1828.txt ├── 1829.txt ├── 1839.txt ├── 1846.txt ├── 1853.txt ├── 1856.txt ├── 1859.txt ├── 1860.txt ├── 1861.txt ├── 1863.txt ├── 1864.txt ├── 1867.txt ├── 1869.txt ├── 1870.txt ├── 1874.txt ├── 1875.txt ├── 1878.txt ├── 1879.txt ├── 1880.txt ├── 1881.txt ├── 1890.txt ├── 1950.txt ├── 1960.txt ├── 1963.txt ├── 1969.txt ├── 1976.txt ├── 1977.txt ├── 1978.txt ├── 1984.txt ├── 1994.txt ├── 1995.txt ├── 1996.txt ├── 1998.txt ├── 2000.txt ├── 2001.txt ├── 2002.txt ├── 2003.txt ├── 2004.txt ├── 2005.txt ├── 2006.txt ├── 2007.txt ├── 2008.txt ├── 2009.txt ├── 2010.txt ├── 2011.txt ├── 2012.txt ├── 2013.txt ├── 2014.txt ├── 2016.txt ├── 2017.txt ├── 2018.txt ├── 2019.txt ├── 2020.txt ├── 2021.txt ├── 2022.txt ├── 2023.txt ├── 2024.txt ├── 2025.txt ├── 2026.txt ├── 2027.txt ├── 2028.txt ├── 2029.txt ├── 2030.txt ├── 2031.txt ├── 2032.txt ├── 2033.txt ├── 2034.txt ├── 2035.txt ├── 2036.txt ├── 2037.txt ├── 2039.txt ├── 2040.txt ├── 2041.txt ├── 2042.txt ├── 2043.txt ├── 2044.txt ├── 2045.txt ├── 2046.txt ├── 2047.txt ├── 2048.txt ├── 2049.txt ├── 2050.txt ├── 2051.txt ├── 2052.txt ├── 2053.txt ├── 2054.txt ├── 2055.txt ├── 2056.txt ├── 2057.txt ├── 2058.txt ├── 2059.txt ├── 2060.txt ├── 2061.txt ├── 2062.txt ├── 2063.txt ├── 2064.txt ├── 2066.txt ├── 2067.txt ├── 2068.txt ├── 2069.txt ├── 2070.txt ├── 2071.txt ├── 2072.txt ├── 2073.txt ├── 2074.txt ├── 2075.txt ├── 2076.txt ├── 2077.txt ├── 2078.txt ├── 2079.txt ├── 2081.txt ├── 2082.txt ├── 2083.txt ├── 2084.txt ├── 2085.txt ├── 2086.txt ├── 2087.txt ├── 2088.txt ├── 2089.txt ├── 2090.txt ├── 2091.txt ├── 2092.txt ├── 2093.txt ├── 2094.txt ├── 2095.txt ├── 2096.txt ├── 2097.txt ├── 2099.txt ├── 2101.txt ├── 2104.txt ├── 2107.txt ├── 2109.txt ├── 2112.txt ├── 2113.txt ├── 2114.txt ├── 2121.txt ├── 2123.txt ├── 2131.txt ├── 2134.txt ├── 2136.txt ├── 2138.txt ├── 2139.txt ├── 2140.txt ├── 2141.txt ├── 2143.txt ├── 2148.txt ├── 2151.txt ├── 2153.txt ├── 2154.txt ├── 2156.txt ├── 2157.txt ├── 2159.txt ├── 2160.txt ├── 2161.txt ├── 2162.txt ├── 2163.txt ├── 2167.txt ├── 2176.txt ├── 2178.txt ├── 2182.txt ├── 2186.txt ├── 2190.txt ├── 2192.txt ├── 2196.txt ├── 2200.txt ├── 2201.txt ├── 2203.txt ├── 2206.txt ├── 2208.txt ├── 2212.txt ├── 2222.txt ├── 2227.txt ├── 2255.txt ├── 2265.txt ├── 2295.txt ├── 2304.txt ├── 2309.txt ├── 2317.txt ├── 2363.txt ├── 2368.txt ├── 2371.txt ├── 2389.txt ├── 2393.txt ├── 2399.txt ├── 2401.txt ├── 2412.txt ├── 2433.txt ├── 2444.txt ├── 2448.txt ├── 2473.txt ├── 2475.txt ├── 2482.txt ├── 2489.txt ├── 2492.txt ├── 2500.txt ├── 2501.txt ├── 2502.txt ├── 2503.txt ├── 2504.txt ├── 2513.txt ├── 2516.txt ├── 2519.txt ├── 2520.txt ├── 2521.txt ├── 2524.txt ├── 2535.txt ├── 2537.txt ├── 2544.txt ├── 2546.txt ├── 2547.txt ├── 2548.txt ├── 2549.txt ├── 2550.txt ├── 2551.txt ├── 2552.txt ├── 2553.txt ├── 2560.txt ├── 2561.txt ├── 2562.txt ├── 2563.txt ├── 2564.txt ├── 2565.txt ├── 2567.txt ├── 2568.txt ├── 2569.txt ├── 2571.txt ├── 2577.txt ├── 2586.txt ├── 2588.txt ├── 2594.txt ├── 2601.txt ├── 2602.txt ├── 2617.txt ├── 2626.txt ├── 2629.txt ├── 2630.txt ├── 2634.txt ├── 2639.txt ├── 2647.txt ├── 2665.txt ├── 2669.txt ├── 2674.txt ├── 2680.txt ├── 2686.txt ├── 2700.txt ├── 2709.txt ├── 2710.txt ├── 2732.txt ├── 2734.txt ├── 2767.txt ├── 2769.txt ├── 2795.txt ├── 2803.txt ├── 2807.txt ├── 2809.txt ├── 2818.txt ├── 2824.txt ├── 2830.txt ├── 2833.txt ├── 2837.txt ├── 2838.txt ├── 2844.txt ├── 2845.txt ├── 2851.txt ├── 2852.txt ├── 2896.txt ├── 2923.txt ├── 2929.txt ├── 2962.txt ├── 3008.txt ├── 3016.txt ├── 3018.txt ├── 3033.txt ├── 3047.txt ├── 3065.txt ├── 3068.txt ├── 3079.txt ├── 3081.txt ├── 3118.txt ├── 3127.txt ├── 3172.txt ├── 3182.txt ├── 3191.txt ├── 3277.txt ├── 3299.txt ├── 3308.txt ├── 3315.txt ├── 3333.txt ├── 3335.txt ├── 3336.txt ├── 3339.txt ├── 3342.txt ├── 3359.txt ├── 3360.txt ├── 3361.txt ├── 3364.txt ├── 3367.txt ├── 3371.txt ├── 3376.txt ├── 3394.txt ├── 3395.txt ├── 3397.txt ├── 3401.txt ├── 3419.txt ├── 3435.txt ├── 3440.txt ├── 3449.txt ├── 3452.txt ├── 3461.txt ├── 3466.txt ├── 3472.txt ├── 3473.txt ├── 3487.txt ├── 3488.txt ├── 3491.txt ├── 3496.txt ├── 3501.txt ├── 3535.txt ├── 3549.txt ├── 3555.txt ├── 3572.txt ├── 3579.txt ├── 3591.txt ├── 3592.txt ├── 3609.txt ├── 3622.txt ├── 3631.txt ├── 3635.txt ├── 3652.txt ├── 3665.txt ├── 3666.txt ├── 3667.txt ├── 3709.txt ├── 3726.txt ├── 3732.txt ├── 3746.txt ├── 3749.txt ├── 3752.txt ├── 3779.txt ├── 3783.txt ├── 3790.txt ├── 3844.txt ├── 3849.txt ├── 3887.txt ├── 3911.txt ├── 3912.txt ├── 3926.txt ├── 3954.txt ├── 3966.txt ├── 3974.txt ├── 3987.txt ├── 3999.txt ├── 4001.txt ├── 4003.txt ├── 4004.txt ├── 4007.txt ├── 4009.txt ├── 4010.txt ├── 4020.txt ├── 4027.txt ├── 4034.txt ├── 4039.txt ├── 4046.txt ├── 4080.txt ├── 4081.txt ├── 4115.txt ├── 4135.txt ├── 4144.txt ├── 4147.txt ├── 4150.txt ├── 4183.txt ├── 4245.txt ├── 4276.txt ├── 4282.txt ├── 4288.txt ├── 4309.txt ├── 4313.txt ├── 4352.txt ├── 4403.txt ├── 4407.txt ├── 4421.txt ├── 4433.txt ├── 4453.txt ├── 4471.txt ├── 4496.txt ├── 4506.txt ├── 4507.txt ├── 4512.txt ├── 4521.txt ├── 4535.txt ├── 4539.txt ├── 4544.txt ├── 4552.txt ├── 4568.txt ├── 4570.txt ├── 4578.txt ├── 4602.txt ├── 4607.txt ├── 4608.txt ├── 4632.txt ├── 4699.txt ├── 4704.txt ├── 4705.txt ├── 4718.txt ├── 4729.txt ├── 4730.txt ├── 4731.txt ├── 4734.txt ├── 4735.txt ├── 4737.txt ├── 4738.txt ├── 4739.txt ├── 4740.txt ├── 4745.txt ├── 4747.txt ├── 4749.txt ├── 4750.txt ├── 4751.txt ├── 4757.txt ├── 4762.txt ├── 4763.txt ├── 4764.txt ├── 4768.txt ├── 4771.txt ├── 4786.txt ├── 4819.txt ├── 4823.txt ├── 4824.txt ├── 4825.txt ├── 4826.txt ├── 4831.txt ├── 4836.txt ├── 4857.txt ├── 4882.txt ├── 4883.txt ├── 4884.txt ├── 4907.txt ├── 4908.txt ├── 4931.txt ├── 4956.txt ├── 4966.txt ├── 5001.txt ├── 5002.txt ├── 5009.txt ├── 5011.txt ├── 5012.txt ├── 5014.txt ├── 5015.txt ├── 5023.txt ├── 5024.txt ├── 5033.txt ├── 5038.txt ├── 5044.txt ├── 5045.txt ├── 5046.txt ├── 5047.txt ├── 5050.txt ├── 5052.txt ├── 5053.txt ├── 5054.txt ├── 5055.txt ├── 5056.txt ├── 5058.txt ├── 5059.txt ├── 5062.txt ├── 5063.txt ├── 5066.txt ├── 5067.txt ├── 5082.txt ├── 5083.txt ├── 5086.txt ├── 5087.txt ├── 5104.txt ├── 5105.txt ├── 5138.txt ├── 5139.txt ├── 5141.txt ├── 5142.txt ├── 5154.txt ├── 5158.txt ├── 5159.txt ├── 5162.txt ├── 5163.txt ├── 5166.txt ├── 5167.txt ├── 5168.txt ├── 5170.txt ├── 5171.txt ├── 5172.txt ├── 5174.txt ├── 5175.txt ├── 5178.txt ├── 5179.txt ├── 5182.txt ├── 5183.txt ├── 5186.txt ├── 5187.txt ├── 5190.txt ├── 5191.txt ├── 5194.txt ├── 5195.txt ├── 5198.txt ├── 5199.txt ├── 5200.txt ├── 5202.txt ├── 5206.txt ├── 5207.txt ├── 5210.txt ├── 5211.txt ├── 5212.txt ├── 5214.txt ├── 5215.txt ├── 5218.txt ├── 5222.txt ├── 5223.txt ├── 5228.txt ├── 5232.txt ├── 5233.txt ├── 5234.txt ├── 5246.txt ├── 5247.txt ├── 5248.txt ├── 5249.txt ├── 5251.txt ├── 5253.txt ├── 5254.txt ├── 5256.txt ├── 5258.txt ├── 5259.txt ├── 5264.txt ├── 5265.txt ├── 5266.txt ├── 5268.txt ├── 5269.txt ├── 5272.txt ├── 5273.txt ├── 5274.txt ├── 5277.txt ├── 5284.txt ├── 5285.txt ├── 5286.txt ├── 5288.txt ├── 5289.txt ├── 5294.txt ├── 5305.txt ├── 5306.txt ├── 5310.txt ├── 5311.txt ├── 5316.txt ├── 5317.txt ├── 5318.txt ├── 5319.txt ├── 5323.txt ├── 5325.txt ├── 5326.txt ├── 5327.txt ├── 5328.txt ├── 5339.txt ├── 5340.txt ├── 5344.txt ├── 5347.txt ├── 5348.txt ├── 5349.txt ├── 5351.txt ├── 5353.txt ├── 5358.txt ├── 5360.txt ├── 5363.txt ├── 5364.txt ├── 5365.txt ├── 5366.txt ├── 5367.txt ├── 5373.txt ├── 5381.txt ├── 5384.txt ├── 5386.txt ├── 5387.txt ├── 5389.txt ├── 5392.txt ├── 5396.txt ├── 5399.txt ├── 5400.txt ├── 5402.txt ├── 5410.txt ├── 5412.txt ├── 5414.txt ├── 5416.txt ├── 5418.txt ├── 5419.txt ├── 5422.txt ├── 5423.txt ├── 5424.txt ├── 5427.txt ├── 5428.txt ├── 5429.txt ├── 5430.txt ├── 5432.txt ├── 5433.txt ├── 5437.txt ├── 5438.txt ├── 5441.txt ├── 5442.txt ├── 5443.txt ├── 5444.txt ├── 5446.txt ├── 5452.txt ├── 5455.txt ├── 5459.txt ├── 5461.txt ├── 5463.txt ├── 5464.txt ├── 5465.txt ├── 5475.txt ├── 5477.txt ├── 5479.txt ├── 5480.txt ├── 5481.txt ├── 5489.txt ├── 5491.txt ├── 5492.txt ├── 5493.txt ├── 5494.txt ├── 5495.txt ├── 5496.txt ├── 5497.txt ├── 5499.txt ├── 5500.txt ├── 5501.txt ├── 5504.txt ├── 5505.txt ├── 5510.txt ├── 5512.txt ├── 5522.txt ├── 5523.txt ├── 5532.txt ├── 5533.txt ├── 5536.txt ├── 5538.txt ├── 5540.txt ├── 5542.txt ├── 5543.txt ├── 5546.txt ├── 5547.txt ├── 5551.txt ├── 5562.txt ├── 5563.txt ├── 5564.txt ├── 5565.txt ├── 5567.txt ├── 5568.txt ├── 5569.txt ├── 5573.txt ├── 5578.txt ├── 5583.txt ├── 5584.txt ├── 5585.txt ├── 5586.txt ├── 5587.txt ├── 5590.txt ├── 5591.txt ├── 5592.txt ├── 5593.txt ├── 5596.txt ├── 5606.txt ├── 5607.txt ├── 5610.txt ├── 5611.txt ├── 5612.txt ├── 5613.txt ├── 5615.txt ├── 5616.txt ├── 5617.txt ├── 5618.txt ├── 5619.txt ├── 5620.txt ├── 5625.txt ├── 5626.txt ├── 5627.txt ├── 5630.txt ├── 5671.txt └── 5672.txt ├── 【MY】HDOJ题目分类.xlsx ├── 【NYOJ】 ├── 10.txt ├── 100.txt ├── 101.txt ├── 1013.txt ├── 1017.txt ├── 1023.txt ├── 1030.txt ├── 104.txt ├── 105.txt ├── 106.txt ├── 1070.txt ├── 108.txt ├── 1092.txt ├── 1096.txt ├── 1097.txt ├── 110.txt ├── 1101.txt ├── 1102.txt ├── 1103.txt ├── 1104.txt ├── 111.txt ├── 1113.txt ├── 113.txt ├── 115.txt ├── 116.txt ├── 117.txt ├── 118.txt ├── 119.txt ├── 12.txt ├── 120.txt ├── 122.txt ├── 123.txt ├── 125.txt ├── 127.txt ├── 128.txt ├── 129.txt ├── 130.txt ├── 133.txt ├── 136.txt ├── 138.txt ├── 14.txt ├── 15.txt ├── 16.txt ├── 163.txt ├── 168.txt ├── 169.txt ├── 17.txt ├── 170.txt ├── 176.txt ├── 18.txt ├── 187.txt ├── 188.txt ├── 195.txt ├── 198.txt ├── 199.txt ├── 2.txt ├── 20.txt ├── 201.txt ├── 202.txt ├── 203.txt ├── 204.txt ├── 206.txt ├── 21.txt ├── 210.txt ├── 211.txt ├── 214.txt ├── 216.txt ├── 217.txt ├── 218.txt ├── 220.txt ├── 230.txt ├── 232.txt ├── 234.txt ├── 236.txt ├── 237.txt ├── 239.txt ├── 241.txt ├── 242.txt ├── 243.txt ├── 244.txt ├── 246.txt ├── 247.txt ├── 25.txt ├── 252.txt ├── 255.txt ├── 259.txt ├── 260.txt ├── 263.txt ├── 264.txt ├── 268.txt ├── 269.txt ├── 27.txt ├── 273.txt ├── 274.txt ├── 275.txt ├── 276.txt ├── 277.txt ├── 279.txt ├── 283.txt ├── 284.txt ├── 287.txt ├── 289.txt ├── 301.txt ├── 304.txt ├── 31.txt ├── 311.txt ├── 323.txt ├── 324.txt ├── 325.txt ├── 326.txt ├── 33.txt ├── 34.txt ├── 349.txt ├── 35.txt ├── 36.txt ├── 37.txt ├── 38.txt ├── 399.txt ├── 40.txt ├── 41.txt ├── 42.txt ├── 420.txt ├── 434.txt ├── 435.txt ├── 44.txt ├── 448.txt ├── 45.txt ├── 455.txt ├── 456.txt ├── 457.txt ├── 458.txt ├── 463.txt ├── 469.txt ├── 47.txt ├── 477.txt ├── 484.txt ├── 488.txt ├── 489.txt ├── 49.txt ├── 492.txt ├── 5.txt ├── 509.txt ├── 510.txt ├── 515.txt ├── 546.txt ├── 56.txt ├── 57.txt ├── 571.txt ├── 58.txt ├── 586.txt ├── 596.txt ├── 599.txt ├── 6.txt ├── 60.txt ├── 61.txt ├── 613.txt ├── 62.txt ├── 63.txt ├── 64.txt ├── 65.txt ├── 677.txt ├── 708.txt ├── 71.txt ├── 712.txt ├── 72.txt ├── 733.txt ├── 737.txt ├── 74.txt ├── 740.txt ├── 742.txt ├── 745.txt ├── 746.txt ├── 747.txt ├── 749.txt ├── 75.txt ├── 76.txt ├── 760.txt ├── 763.txt ├── 77.txt ├── 776.txt ├── 779.txt ├── 79.txt ├── 808.txt ├── 81.txt ├── 811.txt ├── 813.txt ├── 814.txt ├── 822.txt ├── 832.txt ├── 833.txt ├── 844.txt ├── 845.txt ├── 891.txt ├── 90.txt ├── 91.txt ├── 914.txt ├── 915.txt ├── 93.txt ├── 94.txt ├── 966.txt ├── 97.txt ├── 973.txt ├── 98.txt ├── 983.txt ├── 99.txt └── 995.txt ├── 【POJ】 ├── 1014.txt ├── 1019.txt ├── 1061.txt ├── 1062.txt ├── 1077.txt ├── 1094.txt ├── 1144.txt ├── 1208.txt ├── 1252.txt ├── 1276.txt ├── 1651.txt ├── 1659.txt ├── 1726.txt ├── 1742.txt ├── 1830.txt ├── 1852.txt ├── 1903.txt ├── 1979.txt ├── 2002.txt ├── 2100.txt ├── 2142.txt ├── 2167.txt ├── 2386.txt ├── 2481.txt ├── 2482.txt ├── 2528.txt ├── 2566.txt ├── 2607.txt ├── 2739.txt ├── 2763.txt ├── 2778.txt ├── 2784.txt ├── 2794.txt ├── 2828.txt ├── 2886.txt ├── 2948.txt ├── 3009.txt ├── 3061.txt ├── 3070.txt ├── 3074.txt ├── 3150.txt ├── 3195.txt ├── 3233.txt ├── 3237.txt ├── 3250.txt ├── 3252.txt ├── 3260.txt ├── 3264.txt ├── 3276.txt ├── 3320.txt ├── 3624.txt ├── 3669.txt ├── 3678.txt └── 3734.txt ├── 【SGU】 └── 131.txt ├── 【SPOJ】 ├── BALNUM.txt ├── DQUERY.txt └── QTREE.txt ├── 【UVA】 ├── 10001.txt ├── 10003.txt ├── 10004.txt ├── 10012.txt ├── 10020.txt ├── 10026.txt ├── 10041.txt ├── 10047.txt ├── 10048.txt ├── 10050.txt ├── 10054.txt ├── 10057.txt ├── 10085.txt ├── 10098.txt ├── 101.txt ├── 10118.txt ├── 10125.txt ├── 10129.txt ├── 10132.txt ├── 10152.txt ├── 10160.txt ├── 10167.txt ├── 10245.txt ├── 1025.txt ├── 10274.txt ├── 10282.txt ├── 10285.txt ├── 10305.txt ├── 10340.txt ├── 10341.txt ├── 10344.txt ├── 10375.txt ├── 10382.txt ├── 10391.txt ├── 10400.txt ├── 10422.txt ├── 10474.txt ├── 10487.txt ├── 10491.txt ├── 10534.txt ├── 10557.txt ├── 10562.txt ├── 10564.txt ├── 10591.txt ├── 10596.txt ├── 10602.txt ├── 10603.txt ├── 10618.txt ├── 10624.txt ├── 10635.txt ├── 10670.txt ├── 10700.txt ├── 10706.txt ├── 10714.txt ├── 10716.txt ├── 10718.txt ├── 10720.txt ├── 10723.txt ├── 10755.txt ├── 10763.txt ├── 10791.txt ├── 108.txt ├── 10817.txt ├── 10820.txt ├── 10827.txt ├── 10887.txt ├── 10891.txt ├── 10895.txt ├── 10905.txt ├── 10934.txt ├── 10954.txt ├── 10970.txt ├── 1099.txt ├── 11020.txt ├── 11039.txt ├── 11054.txt ├── 11078.txt ├── 1108.txt ├── 11082.txt ├── 11100.txt ├── 11107.txt ├── 11111.txt ├── 11129.txt ├── 11137.txt ├── 11174.txt ├── 11181.txt ├── 11198.txt ├── 112.txt ├── 11205.txt ├── 1121.txt ├── 11218.txt ├── 11234.txt ├── 11292.txt ├── 11297.txt ├── 11324.txt ├── 11361.txt ├── 11375.txt ├── 11384.txt ├── 11389.txt ├── 11400.txt ├── 11401.txt ├── 11404.txt ├── 11426.txt ├── 1146.txt ├── 11464.txt ├── 11468.txt ├── 1151.txt ├── 11538.txt ├── 11552.txt ├── 11572.txt ├── 11582.txt ├── 11584.txt ├── 116.txt ├── 1160.txt ├── 11636.txt ├── 1169.txt ├── 11729.txt ├── 11732.txt ├── 11795.txt ├── 11825.txt ├── 11922.txt ├── 11990.txt ├── 11991.txt ├── 11992.txt ├── 11995.txt ├── 11997.txt ├── 12003.txt ├── 1203.txt ├── 12105.txt ├── 12169.txt ├── 1218.txt ├── 12186.txt ├── 1220.txt ├── 12219.txt ├── 1252.txt ├── 12563.txt ├── 1262.txt ├── 12661.txt ├── 127.txt ├── 12716.txt ├── 1292.txt ├── 1309.txt ├── 131.txt ├── 1325.txt ├── 1326.txt ├── 1328.txt ├── 1329.txt ├── 133.txt ├── 1330.txt ├── 1339.txt ├── 1347.txt ├── 1349.txt ├── 1362.txt ├── 1364.txt ├── 1366.txt ├── 1368.txt ├── 1376.txt ├── 1377.txt ├── 1382.txt ├── 1394.txt ├── 1395.txt ├── 1398.txt ├── 140.txt ├── 1400.txt ├── 1401.txt ├── 141.txt ├── 1412.txt ├── 1422.txt ├── 1424.txt ├── 1428.txt ├── 1449.txt ├── 1452.txt ├── 146.txt ├── 1479.txt ├── 1515.txt ├── 1625.txt ├── 1626.txt ├── 1627.txt ├── 1629.txt ├── 1632.txt ├── 1635.txt ├── 1636.txt ├── 1637.txt ├── 165.txt ├── 1658.txt ├── 167.txt ├── 188.txt ├── 193.txt ├── 196.txt ├── 208.txt ├── 216.txt ├── 242.txt ├── 247.txt ├── 270.txt ├── 297.txt ├── 301.txt ├── 307.txt ├── 310.txt ├── 311.txt ├── 321.txt ├── 327.txt ├── 331.txt ├── 414.txt ├── 437.txt ├── 439.txt ├── 442.txt ├── 445.txt ├── 457.txt ├── 488.txt ├── 489.txt ├── 490.txt ├── 494.txt ├── 507.txt ├── 532.txt ├── 539.txt ├── 540.txt ├── 548.txt ├── 572.txt ├── 639.txt ├── 657.txt ├── 658.txt ├── 673.txt ├── 694.txt ├── 699.txt ├── 704.txt ├── 705.txt ├── 712.txt ├── 714.txt ├── 729.txt ├── 753.txt ├── 784.txt ├── 839.txt └── 993.txt ├── 【WIKI】 ├── 1010.txt ├── 1014.txt ├── 1025.txt ├── 1039.txt ├── 1040.txt ├── 1043.txt ├── 1044.txt ├── 1058.txt ├── 1068.txt ├── 1075.txt ├── 1077.txt ├── 1078.txt ├── 1079.txt ├── 1085.txt ├── 1115.txt ├── 1154.txt ├── 1155.txt ├── 1169.txt ├── 1214.txt ├── 1219.txt ├── 1220.txt ├── 1231.txt ├── 1267.txt ├── 1297.txt ├── 1315.txt ├── 1506.txt ├── 1576.txt ├── 1669.txt ├── 2503.txt ├── 2557.txt ├── 2710.txt ├── 2837.txt ├── 2894.txt ├── 3027.txt ├── 3111.txt ├── 3115.txt ├── 3116.txt ├── 3117.txt ├── 3130.txt ├── 3231.txt ├── 3269.txt ├── 3301.txt └── 3315.txt ├── 【ZOJ】 ├── 3870 ├── 3879 ├── 1002.txt ├── 1027.txt ├── 1037.txt ├── 1048.txt ├── 1049 .txt ├── 1051.txt ├── 1115.txt ├── 1157.txt ├── 1191.txt ├── 1301.txt ├── 1311.txt ├── 1410.txt ├── 1462.txt ├── 1654.txt ├── 1709.txt ├── 1729.txt ├── 1857.txt ├── 1940.txt ├── 1947.txt ├── 1948.txt ├── 1970.txt ├── 2060.txt ├── 2104.txt ├── 2112.txt ├── 2120.txt ├── 2372.txt ├── 2432.txt ├── 2436.txt ├── 2468.txt ├── 2469.txt ├── 2657.txt ├── 2666.txt ├── 2750.txt ├── 3122.txt ├── 3197.txt ├── 3209.txt ├── 3487.txt ├── 3488.txt ├── 3490.txt ├── 3492.txt ├── 3498.txt ├── 3499.txt ├── 3600.txt ├── 3609.txt ├── 3610.txt ├── 3705.txt ├── 3706.txt ├── 3708.txt ├── 3710.txt ├── 3712.txt ├── 3713.txt ├── 3714.txt ├── 3715.txt ├── 3717.txt ├── 3758.txt ├── 3767.txt ├── 3768.txt ├── 3770.txt ├── 3775.txt ├── 3776.txt ├── 3777.txt ├── 3778.txt ├── 3780.txt ├── 3781.txt ├── 3785.txt ├── 3838.txt ├── 3839.txt ├── 3860.txt ├── 3861.txt ├── 3865.txt ├── 3867.txt ├── 3872.txt ├── 3882.txt ├── 3886.txt ├── 3888.txt └── 3890.txt ├── 【hihocoder】 ├── 1014.txt ├── 1015.txt ├── 1032.txt ├── 1037.txt ├── 1038.txt ├── 1043.txt ├── 1044.txt ├── 1048.txt ├── 1049.txt ├── 1050.txt ├── 1055.txt ├── 1057.txt ├── 1061.txt ├── 1062.txt ├── 1066.txt ├── 1067.txt ├── 1070.txt ├── 1078.txt ├── 1079.txt ├── 1080.txt ├── 1081.txt ├── 1086.txt ├── 1087.txt ├── 1089.txt ├── 1092.txt ├── 1093.txt ├── 1096.txt ├── 1097.txt ├── 1098.txt ├── 1105.txt ├── 1114.txt ├── 1121.txt ├── 1122.txt ├── 1127.txt ├── 1128.txt ├── 1139.txt ├── 1141.txt ├── 1142.txt ├── 1143.txt ├── 1159.txt ├── 1227.txt ├── 1228.txt ├── 1233.txt └── 1234.txt ├── 【论文&&教程】 ├── C++的pb_ds库在OI中的应用.pdf ├── CLJ遗产.7z ├── OI国家集训队论文.7z ├── QTREE解法的一些研究.pdf ├── coding-叉姐.pdf ├── manacher算法(O(n)求最长子回文串).docx ├── memset详解.doc ├── palindromic tree(回文树).pdf ├── 十个利用矩阵乘法解决的经典题目(Maxtrix67).docx ├── 单调队列优化 DP.pdf ├── 博弈之取石子经典游戏.doc ├── 叉姐的魔法数据结构.pdf ├── 可持久化数据结构.pdf ├── 后缀数组——处理字符串的有力工具.pdf ├── 对块状链表的一点研究.pdf ├── 数与编程.chm ├── 状态压缩.doc ├── 用单调性优化动态规划.doc ├── 电子书 │ ├── C++Primer+中文第四版(pdf高清完整版).pdf │ └── 算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析 │ │ ├── 算法艺术与信息学竞赛习题.pdf │ │ ├── 算法艺术与信息学竞赛学习指导.pdf │ │ ├── 算法艺术与信息学竞赛题目完全解析.pdf │ │ └── 算法艺术与信息学竞赛（刘汝佳、黄亮 着）.pdf ├── 算法合集之《浅谈数位类统计问题》.pdf ├── 经典KMP算法(易理解).docx ├── 统计的力量——线段树详细教程.ppt ├── 背包问题九讲.pdf └── 邝斌的ACM模板.pdf ├── 初学的时候C程序源码以及问题解决 ├── &&的前一个表达式为假时不执行后面的，或 相反 │ └── && ; Before an expression for not performing behind false when.cpp ├── c4996安全提示解决 │ └── C4996 To solve the safety tips.txt ├── if中不能写成 90小于=a=小于100 │ └── Cannot write the 90 less than =a= less than 100 in 'if'.cpp ├── 【各种细节问题】笔记 │ ├── for循环嵌套使用.txt │ ├── 如何判断一个浮点型数字x的值是否为0.txt │ └── 循环中更新部分的变量必须是整型 浮点型是个近似值.txt ├── 一元二次方程用do...while实现 │ └── 一元二次方程用do...while实现.cpp ├── 产生指定范围的随机数 │ └── 产生指定范围的随机数.txt ├── 冒泡排序 │ ├── 冒泡排序.cpp │ └── 冒泡排序可自定义长度.txt ├── 函数指针使用 │ └── 函数指针使用.txt ├── 判断一个数字是否为回文数 │ └── 判断是否为回文数.cpp ├── 判断一个数是否为素数 │ └── 判断一个数是否为素数.cpp ├── 学生信息管理（分数排序） │ └── 学生信息管理（分数排序）.cpp ├── 对三个数字排序 │ └── 三个数字排序.cpp ├── 强制转换为float浮点型 │ └── Forcibly converted to floating-point.cpp ├── 材料 │ └── data.cpp ├── 栈的初始化，出栈，压栈，清空栈，遍历输出 │ └── 栈的初始化，出栈，压栈，清空栈，遍历输出.txt ├── 死机 │ └── system halted.cpp ├── 死机程序c │ └── system halted use ‘C’.c ├── 求1到100之间的奇数之和与偶数之和 │ └── 求1到100之间的奇数之和与偶数之和.cpp ├── 求1到100之间的奇数的平均值 │ └── Average between 1 to 100 odd.cpp ├── 求1和100之间的所有奇数的和 │ └── Between 1 and 100 of all odd and.cpp ├── 求斐波拉契序列中的各项值 │ └── 求斐波拉契序列各项值.cpp ├── 清除上次scanf输入的垃圾数据 │ └── The last garbage data input for'scanf'.cpp ├── 用指针在单独函数中调用主函数完成数值互换 │ └── 用指针在单独函数中调用主函数完成数值互换.cpp ├── 跨函数使用内存（动态内存） │ └── 跨函数使用内存（动态内存）.cpp ├── 输入注意.txt ├── 输出二维数组的值 │ └── 输出二维数组的值.cpp ├── 通过函数对结构体变量输入输出 │ └── 通过函数对结构体变量输入输出.cpp ├── 链表创建，删除，插入，排序，输出 │ └── 链表创建，删除，插入，排序，输出.txt ├── 静态循环队列的出队，入队，创建，是否空满，输出 │ └── 静态循环队列的出队，入队，创建，是否空满，输出.txt └── 龌龊程序 │ └── Dirty program.cpp ├── 我最初学的算法 ├── C++map,vector │ ├── C++map用法.txt │ └── C++vector用法.txt ├── HDOJ题目分类排序 Bin神的.xls ├── 《训练指南-习题代码》.rar ├── 《训练指南例题代码》.rar ├── 【1我的算法总结ppt】 │ └── 图的深广度搜索.ppt ├── 【专题】位运算 │ ├── 位运算不用TEMP交换变量 │ │ └── 位运算不用TEMP交换变量.txt │ └── 位运算枚举子集加状态压缩题 │ │ └── UVA11205.txt ├── 【专题】动态规划 │ ├── DP-01背包问题 │ │ └── HDU2602.txt │ ├── DP-02完全背包 │ │ └── HDU1114(最小价值).txt │ ├── DP-03多重背包 │ │ └── POJ1276.txt │ ├── DP-04混合背包(多重背包二进制拆分) │ │ └── HDU2844(完全背包+多重背包).txt │ ├── DP-05二维费用背包 │ │ ├── HDU2159(二维完全背包).txt │ │ └── HDU3496(二维0-1背包).txt │ ├── DP-06分组背包 │ │ ├── HDU1712(模版，每组最多选一个).txt │ │ ├── HDU3033(每组至少选一个).txt │ │ └── HDU3535(上面两种分组背包+不压缩01背包).txt │ ├── DP-07依赖背包 │ │ └── HDU3449.txt │ ├── DP-LCIS(最长公共上升子序列) │ │ └── 博客.txt │ ├── DP-LCS（最长公共子序列） │ │ └── 博客.txt │ ├── DP-LIS（最长上升子序列） │ │ └── 我的博客.txt │ ├── DP-区间DP │ │ ├── NYOJ737石子归并.txt │ │ ├── 括号匹配.txt │ │ └── 矩阵链乘详解(转载).txt │ ├── DP-嵌套矩形 │ │ └── NYOJ16.txt │ └── DP-树形DP │ │ └── HDU1520.txt ├── 【专题】排序 │ ├── 字母重排 │ │ ├── 字母重排.txt │ │ ├── 输入输出.jpg │ │ └── 题目.jpg │ ├── 归并排序 │ │ └── 归并排序.txt │ └── 快速排序 │ │ └── 快速排序.txt ├── 【专题】搜索 │ ├── DFS生成1~10中选取n个数的排列 │ │ └── DFS生成1~10中选取n个数的排列.txt │ ├── 优先队列优化BFS，并用四维vis │ │ └── UVA10047.txt │ ├── 八数码问题BFS+VIS大数组实现 │ │ └── POJ1077八数码问题BFS+VIS大数组实现.txt │ ├── 八皇后问题 │ │ ├── N皇后（入门经典P126）.txt │ │ └── 八皇后问题.txt │ ├── 奇偶剪枝 │ │ └── 奇偶剪枝.txt │ ├── 宽度优先搜索 │ │ └── 宽度优先搜索（走迷宫）.txt │ ├── 寻找最近的两点 │ │ └── UVA10245.txt │ ├── 有环图的最短路(这里用DFS可以用spfa算法) │ │ └── UVA100557.txt │ ├── 用DFS实现拓扑排序 │ │ └── 用DFS实现拓扑排序.txt │ └── 马踏棋盘深搜加回溯 │ │ ├── 图示.jpg │ │ ├── 题目.jpg │ │ └── 马踏棋盘深搜加回溯.txt ├── 【专题】数据结构 │ ├── 二维队列应用 │ │ └── uva540.txt │ ├── 优先队列从小到大排序 │ │ └── UVA10954.txt │ ├── 先序创建二叉树，层序遍历输出 │ │ └── 先序创建二叉树，层序遍历输出.txt │ ├── 判断一个序列是否可图(Havel-Hakimi定理) │ │ ├── Havel-Hakimi定理.txt │ │ ├── POJ1659.txt │ │ └── UVA10720.txt │ ├── 判断先序输入的树是否为完全二叉树的两种方法 │ │ ├── 判断先序输入的树是否为完全二叉树的两种方法.txt │ │ └── 题目.jpg │ ├── 合并两个递增链表后递减输出 │ │ ├── 合并两个递增链表后递减输出.txt │ │ └── 题目.jpg │ ├── 图的两种遍历 │ │ ├── 图.jpg │ │ └── 图的两种遍历.txt │ ├── 寻找字符串最小循环周期 │ │ ├── 寻找字符串最小循环周期.txt │ │ └── 题目.jpg │ ├── 快速查找链表中间元素 │ │ └── 快速查找链表中间元素.txt │ ├── 按访问频率调整链表顺序 │ │ ├── 按访问频率调整链表顺序.txt │ │ └── 题目.jpg │ ├── 有向图的连通性判断 │ │ └── UVA10129.txt │ ├── 树状数组【更新区间查询单点】 │ │ └── NYOJ123.txt │ ├── 树状数组【更新单点查询区间】 │ │ ├── HDU1166.txt │ │ ├── 利用树状数组解决几类问题.doc │ │ ├── 树状数组.pdf │ │ └── 树状数组入门教程.pdf │ ├── 树状数组求比a大的第k小数 │ │ └── HDU2852.txt │ ├── 根据树的中，后序遍历直接遍历整个树 │ │ └── 代码uva548.txt │ ├── 欧拉回路输出 │ │ └── 欧拉回路压栈倒序输出.txt │ ├── 约瑟夫问题 │ │ ├── 约瑟夫问题.txt │ │ ├── 题目1.jpg │ │ └── 题目2.jpg │ ├── 线段树HDU1166 │ │ └── HDU1166.txt │ └── 魔术师发牌问题 │ │ ├── 题目.jpg │ │ └── 魔术师发牌问题.txt ├── 【专题】数论 │ ├── A+B的进位次数 │ │ ├── A+B的进位次数.txt │ │ └── 题目.jpg │ ├── RSA随机加密解密 │ │ └── RSA随机加密解密.txt │ ├── cantor数表 │ │ ├── cantor数表.txt │ │ └── 题目.jpg │ ├── 一个椭圆边上的N个点两两相连最多把椭圆分成几块 │ │ ├── 一个椭圆边上的N个点两两相连最多把椭圆分成几块.txt │ │ └── 题目.jpg │ ├── 分解素因子 │ │ └── 分解素因子.txt │ ├── 判断坐标系中任意一点是否在三角形内 │ │ ├── 公式.jpg │ │ ├── 判断原理.jpg │ │ ├── 判断坐标系中任意一点是否在三角形内.txt │ │ └── 题目.jpg │ ├── 因子和阶乘 │ │ ├── 因子和阶乘.txt │ │ └── 题目.jpg │ ├── 计算a的n次方除以s的余数 │ │ └── 计算a的n次方除以s的余数.txt │ ├── 辗转相除法求最大公约数和最小公倍数 │ │ ├── 最大公约数.txt │ │ └── 最小公倍数.txt │ └── 高精度阶乘 │ │ ├── hdu1042【10000进制】.txt │ │ └── hdu1042【10进制】.txt ├── 【专题】贪心 │ ├── 区间覆盖问题 │ │ └── NYOJ12.txt │ ├── 区间选点问题 │ │ └── NYOJ287.txt │ ├── 最大连续子序列和 │ │ ├── HDU1231(原理版).txt │ │ └── HDU1231(简化版).txt │ ├── 最大连续子矩阵和 │ │ └── UVA108.txt │ ├── 用赫夫曼编码压缩和解压 │ │ └── 用赫夫曼编码压缩和解压.txt │ └── 选择不相交区间 │ │ └── NYOJ14(闭区间).txt ├── 【专题】递推 │ └── 汉诺塔 │ │ ├── 杭电2064汉诺塔Ⅲ实现.txt │ │ └── 汉诺塔.txt ├── 图灵教育-算法书.txt ├── 我的博客.txt └── 算法需要的时间对照表.jpg ├── 我的ACM模版.docx └── 我的各OJ账号.txt /ACM计划(针对大一).docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/ACM计划(针对大一).docx -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/README.md -------------------------------------------------------------------------------- /VS相关问题.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/VS相关问题.txt -------------------------------------------------------------------------------- /~$的ACM模版.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/~$的ACM模版.docx -------------------------------------------------------------------------------- /【&自己写的小工具&】/HDOJ题目各题AC总数.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/HDOJ题目各题AC总数.exe -------------------------------------------------------------------------------- /【&自己写的小工具&】/HDOJ题目各题AC总数.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/HDOJ题目各题AC总数.txt -------------------------------------------------------------------------------- /【&自己写的小工具&】/windows/分析数据（windows）.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/windows/分析数据（windows）.txt -------------------------------------------------------------------------------- /【&自己写的小工具&】/windows/抓取网页（使用C++11的thread）.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/windows/抓取网页（使用C++11的thread）.txt -------------------------------------------------------------------------------- /【&自己写的小工具&】/windows/抓取网页（使用_beginthreadex）.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/windows/抓取网页（使用_beginthreadex）.txt -------------------------------------------------------------------------------- /【&自己写的小工具&】/windows/比较代码不同（windows）.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/windows/比较代码不同（windows）.txt -------------------------------------------------------------------------------- /【&自己写的小工具&】/使用手册.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/使用手册.docx -------------------------------------------------------------------------------- /【&自己写的小工具&】/分析数据.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/分析数据.exe -------------------------------------------------------------------------------- /【&自己写的小工具&】/分析数据.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/分析数据.txt -------------------------------------------------------------------------------- /【&自己写的小工具&】/抓取网页.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/抓取网页.exe -------------------------------------------------------------------------------- /【&自己写的小工具&】/抓取网页（使用C++11的thread）.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/抓取网页（使用C++11的thread）.txt -------------------------------------------------------------------------------- /【&自己写的小工具&】/抓取网页（使用_beginthreadex）.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/抓取网页（使用_beginthreadex）.txt -------------------------------------------------------------------------------- /【&自己写的小工具&】/比较代码不同.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/比较代码不同.exe -------------------------------------------------------------------------------- /【&自己写的小工具&】/比较代码不同.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【&自己写的小工具&】/比较代码不同.txt -------------------------------------------------------------------------------- /【ACdreamOJ】/1000.txt: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){int a,b;while(~scanf ("%d %d", &a, &b))printf ("%d\n",a+b);return 0;} -------------------------------------------------------------------------------- /【ACdreamOJ】/1001(TC).txt: -------------------------------------------------------------------------------- 1 | void SwapInt(int *a,int *b){*a^=*b,*b^=*a,*a^=*b;} -------------------------------------------------------------------------------- /【ACdreamOJ】/1073.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ACdreamOJ】/1073.txt -------------------------------------------------------------------------------- /【ACdreamOJ】/1090.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int t; 6 | scanf("%d%*c", &t); 7 | while (t--) 8 | { 9 | scanf("%*lld%*c"); 10 | puts("Dudu"); 11 | } 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /【ACdreamOJ】/1099.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ACdreamOJ】/1099.txt -------------------------------------------------------------------------------- /【BZOJ】/1001.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/1001.txt -------------------------------------------------------------------------------- /【BZOJ】/1012.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/1012.txt -------------------------------------------------------------------------------- /【BZOJ】/1026.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/1026.txt -------------------------------------------------------------------------------- /【BZOJ】/1031.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/1031.txt -------------------------------------------------------------------------------- /【BZOJ】/1036.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/1036.txt -------------------------------------------------------------------------------- /【BZOJ】/1493.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/1493.txt -------------------------------------------------------------------------------- /【BZOJ】/1500.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/1500.txt -------------------------------------------------------------------------------- /【BZOJ】/1507.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/1507.txt -------------------------------------------------------------------------------- /【BZOJ】/2002.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/2002.txt -------------------------------------------------------------------------------- /【BZOJ】/2038.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/2038.txt -------------------------------------------------------------------------------- /【BZOJ】/2588.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/2588.txt -------------------------------------------------------------------------------- /【BZOJ】/3295.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【BZOJ】/3295.txt -------------------------------------------------------------------------------- /【CF】/19D.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【CF】/19D.txt -------------------------------------------------------------------------------- /【CF】/389A.txt: -------------------------------------------------------------------------------- 1 | #include 2 | //#define scanf scanf_s 3 | 4 | int gcd (int a, int b) 5 | { 6 | if (0 == b%a) 7 | return a; 8 | return gcd(b%a, a); 9 | } 10 | 11 | int main () 12 | { 13 | int n; 14 | while(EOF != scanf ("%d%*c", &n)) 15 | { 16 | int a, b, len = n; 17 | scanf ("%d%*c", &a); 18 | n--; 19 | while(n--) 20 | { 21 | scanf ("%d%*c", &b); 22 | a = gcd(a, b); 23 | } 24 | printf ("%d\n", len*a); 25 | } 26 | 27 | return 0; 28 | } -------------------------------------------------------------------------------- /【CF】/543C.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【CF】/543C.txt -------------------------------------------------------------------------------- /【CF】/545C.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【CF】/545C.txt -------------------------------------------------------------------------------- /【CF】/546E.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【CF】/546E.txt -------------------------------------------------------------------------------- /【HDU】/1000.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, b; 6 | while (EOF != scanf ("%d %d%*c", &a, &b)) 7 | { 8 | printf ("%d\n", a+b); 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /【HDU】/1001.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | long long n; 9 | while (~scanf ("%I64d%*c", &n)) 10 | printf ("%I64d\n\n", n*(n+1)/2); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /【HDU】/1002.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1002.txt -------------------------------------------------------------------------------- /【HDU】/1011.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1011.txt -------------------------------------------------------------------------------- /【HDU】/1021.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define MAXN 1000010 4 | #define MOD 3 5 | int f[MAXN]; 6 | 7 | int main() 8 | { 9 | #ifdef SHY 10 | freopen("e:\\1.txt","r",stdin); 11 | #endif 12 | f[0] = 7%MOD, f[1] = 11%MOD; 13 | for(int i = 2; i < 1000000; i++) 14 | f[i] = (f[i-1]+f[i-2])%MOD; 15 | int n; 16 | while(~scanf("%d%*c", &n)) 17 | { 18 | if(f[n]) puts("no"); 19 | else puts("yes"); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【HDU】/1024.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1024.txt -------------------------------------------------------------------------------- /【HDU】/1025.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1025.txt -------------------------------------------------------------------------------- /【HDU】/1037.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int a, b, c; 9 | while(~scanf ("%d %d %d%*c", &a, &b, &c)) 10 | { 11 | int ans = a < b? a:b; 12 | ans = ans < c ? ans : c; 13 | if (ans <= 168) 14 | printf ("CRASH %d\n", ans); 15 | else 16 | puts("NO CRASH"); 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /【HDU】/1038.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #define PI 3.1415927 3 | 4 | int main () 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | double r,n,t; 10 | int count = 0; 11 | while(~scanf ("%lf %lf %lf%*c", &r,&n,&t) && n) 12 | { 13 | double d = r*PI*n/12/5280; 14 | double v = d/(t/3600); 15 | printf ("Trip #%d: %.2lf %.2lf\n", ++count,d,v); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /【HDU】/1042.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1042.txt -------------------------------------------------------------------------------- /【HDU】/1049.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main () 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | int l, a,b; 10 | while(~scanf ("%d %d %d%*c", &l, &a, &b) && l) 11 | { 12 | int ans = ceil((l-a)/(double)(a-b))*2+1; 13 | printf ("%d\n", ans); 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /【HDU】/1056.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | double a; 9 | while(1) 10 | { 11 | scanf ("%lf", &a); 12 | if (0.00 == a) 13 | break; 14 | int c = 2; 15 | double sum = 0; 16 | for (; sum < a && sum-a < 1e-6; c++) 17 | { 18 | sum += 1.0/c; 19 | } 20 | printf ("%d card(s)\n", c-2); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /【HDU】/1060.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt", "r", stdin); 8 | #endif 9 | int t; 10 | scanf("%d%*c", &t); 11 | while(t--) 12 | { 13 | double n; 14 | scanf("%lf%*c", &n); 15 | double buf = n*log10(n); 16 | putchar((int)pow(10.0,buf-floor(buf))+'0'); 17 | putchar('\n'); 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /【HDU】/1064.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | double sum, a; 9 | for (int i = 0; i < 12; i++) 10 | { 11 | scanf ("%lf%*c", &a); 12 | sum += a; 13 | } 14 | printf ("$%.2lf\n",((int)(sum/12*100+0.5))/100.0); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /【HDU】/1075.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1075.txt -------------------------------------------------------------------------------- /【HDU】/1083.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1083.txt -------------------------------------------------------------------------------- /【HDU】/1089.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, b; 6 | while(~scanf ("%d %d%*c", &a, &b)) 7 | printf ("%d\n",a+b); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /【HDU】/1090.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, b, t; 6 | scanf ("%d%*c", &t); 7 | while(t--) 8 | { 9 | scanf ("%d %d%*c", &a, &b); 10 | printf ("%d\n",a+b); 11 | } 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /【HDU】/1091.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, b; 6 | while(1) 7 | { 8 | scanf ("%d %d%*c", &a, &b); 9 | if(!a && !b) 10 | break; 11 | printf ("%d\n",a+b); 12 | } 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /【HDU】/1092.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, n; 6 | while(~scanf ("%d%*c", &n) && n) 7 | { 8 | int ans = 0; 9 | for (int i = 0; i < n; i++) 10 | { 11 | scanf ("%d%*c", &a); 12 | ans += a; 13 | } 14 | printf ("%d\n",ans); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /【HDU】/1093.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, n, t; 6 | scanf ("%d%*c", &t); 7 | while(t--) 8 | { 9 | int ans = 0; 10 | scanf ("%d%*c", &n); 11 | for (int i = 0; i < n; i++) 12 | { 13 | scanf ("%d%*c", &a); 14 | ans += a; 15 | } 16 | printf ("%d\n",ans); 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /【HDU】/1094.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, n; 6 | while(~scanf ("%d%*c", &n)) 7 | { 8 | int ans = 0; 9 | for (int i = 0; i < n; i++) 10 | { 11 | scanf ("%d%*c", &a); 12 | ans += a; 13 | } 14 | printf ("%d\n",ans); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /【HDU】/1095.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, b; 6 | while(~scanf ("%d %d%*c", &a, &b)) 7 | { 8 | printf ("%d\n\n",a+b); 9 | } 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /【HDU】/1096.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, n, t; 6 | scanf ("%d%*c", &t); 7 | while(t--) 8 | { 9 | int ans = 0; 10 | scanf ("%d%*c", &n); 11 | for (int i = 0; i < n; i++) 12 | { 13 | scanf ("%d%*c", &a); 14 | ans += a; 15 | } 16 | printf ("%d\n",ans); 17 | if (t) 18 | printf ("\n"); 19 | } 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /【HDU】/1107.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1107.txt -------------------------------------------------------------------------------- /【HDU】/1108.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int gcd (int , int); 4 | 5 | int main () 6 | { 7 | int a, b; 8 | while (EOF != scanf("%d %d%*c", &a, &b)) 9 | printf ("%d\n", a*b/gcd(a, b)); 10 | 11 | return 0; 12 | } 13 | 14 | int gcd (int a, int b) 15 | { 16 | if (0 == b%a) 17 | return a; 18 | return gcd(b%a, a); 19 | } -------------------------------------------------------------------------------- /【HDU】/1116.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1116.txt -------------------------------------------------------------------------------- /【HDU】/1143.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1143.txt -------------------------------------------------------------------------------- /【HDU】/1157.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | #define MAXN 10010 6 | int a[MAXN]; 7 | 8 | int main() 9 | { 10 | #ifdef SHY 11 | freopen("e:\\1.txt","r",stdin); 12 | #endif 13 | int n; 14 | while(~scanf("%d%*c", &n)) 15 | { 16 | for (int i = 0; i < n; i++) 17 | scanf("%d%*c", &a[i]); 18 | sort(a,a+n); 19 | printf("%d\n", a[n/2]); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【HDU】/1158.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1158.txt -------------------------------------------------------------------------------- /【HDU】/1160.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1160.txt -------------------------------------------------------------------------------- /【HDU】/1166.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1166.txt -------------------------------------------------------------------------------- /【HDU】/1178.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | double n, ans; 9 | while(~scanf ("%lf%*c", &n) && n) 10 | { 11 | ans = (n*(n+1)/2+(n*(n+1)*(2*n+1))/6)/2; 12 | int sum = 0; 13 | while(ans/10 >= 1) 14 | { 15 | ans *= 0.1; 16 | sum++; 17 | } 18 | printf ("%.2lfE%d\n", ans,sum); 19 | } 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /【HDU】/1196.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef DSHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int a; 9 | while(EOF != scanf ("%d%*c", &a) && a) 10 | { 11 | int t = 0, ans; 12 | while(!(1&(a>>t))) 13 | { 14 | t++; 15 | } 16 | ans = (1< 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int n; 9 | while(~scanf ("%d%*c", &n)) 10 | { 11 | int m = 0, x = 1; 12 | do{ 13 | if (x <= n) 14 | x <<= 1; 15 | else 16 | x = (x-n)*2-1; 17 | m++; 18 | }while(1 != x); 19 | printf ("%d\n",m); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /【HDU】/1215.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1215.txt -------------------------------------------------------------------------------- /【HDU】/1226.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1226.txt -------------------------------------------------------------------------------- /【HDU】/1231.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1231.txt -------------------------------------------------------------------------------- /【HDU】/1235.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int n; 9 | while(~scanf ("%d%*c", &n) && n) 10 | { 11 | int a[101] = {0}, s; 12 | for (int i = 0; i < n; i++) 13 | { 14 | scanf ("%d%*c", &s); 15 | a[s]++; 16 | } 17 | scanf ("%d%*c", &s); 18 | printf ("%d\n", a[s]); 19 | } 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /【HDU】/1242.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1242.txt -------------------------------------------------------------------------------- /【HDU】/1244.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1244.txt -------------------------------------------------------------------------------- /【HDU】/1245.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1245.txt -------------------------------------------------------------------------------- /【HDU】/1249.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define MAXN 10010 4 | int ans[MAXN]; 5 | 6 | int main() 7 | { 8 | #ifdef SHY 9 | freopen("e:\\1.txt","r",stdin); 10 | #endif 11 | ans[1] = 2; 12 | for(int i = 2; i <= 10000; i++) 13 | ans[i] = ans[i-1]+6*(i-1); 14 | int t; 15 | scanf("%d%*c", &t); 16 | while(t--) 17 | { 18 | int n; 19 | scanf("%d%*c", &n); 20 | printf("%d\n", ans[n]); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【HDU】/1251.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1251.txt -------------------------------------------------------------------------------- /【HDU】/1267.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1267.txt -------------------------------------------------------------------------------- /【HDU】/1269.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1269.txt -------------------------------------------------------------------------------- /【HDU】/1284.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | #define MAXN 32770 6 | int d[MAXN] = {0}; 7 | 8 | int main() 9 | { 10 | #ifdef SHY 11 | freopen("e:\\1.txt", "r", stdin); 12 | #endif 13 | int m; 14 | d[0] = 1; 15 | for(int i = 1; i <= 3; i++) 16 | for(int j = i; j <= MAXN; j++) 17 | d[j] += d[j - i]; 18 | while(~scanf("%d%*c", &m)) 19 | { 20 | printf("%d\n", d[m]); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /【HDU】/1290.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define MAXN 1010 4 | int dp[MAXN], w[MAXN]; 5 | 6 | int main() 7 | { 8 | #ifdef SHY 9 | freopen("e:\\1.txt","r",stdin); 10 | #endif 11 | dp[0] = w[0] = 1; 12 | for(int i = 1; i <= 1000; i++) 13 | { 14 | w[i] = w[i-1]+i; 15 | dp[i] = dp[i-1]+w[i-1]; 16 | } 17 | int n; 18 | while(~scanf("%d%*c", &n)) 19 | { 20 | printf("%d\n", dp[n]); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【HDU】/1298.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1298.txt -------------------------------------------------------------------------------- /【HDU】/1317.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1317.txt -------------------------------------------------------------------------------- /【HDU】/1321.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define MAXN 100 4 | char a[MAXN]; 5 | 6 | int main () 7 | { 8 | #ifdef SHY 9 | freopen("e:\\1.txt","r",stdin); 10 | #endif // SHY 11 | int t; 12 | scanf("%d%*c", &t); 13 | while(t--) 14 | { 15 | gets(a); 16 | int len = strlen(a); 17 | for (int i = len-1; i >= 0; i--) 18 | printf ("%c", a[i]); 19 | printf ("\n"); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /【HDU】/1330.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | puts ("# Cards Overhang"); 9 | int n; 10 | while(~scanf ("%d%*c", &n)) 11 | { 12 | double ans = 0; 13 | for (int i = 1; i <= n; i++) 14 | ans += 1.0/(i*2.0); 15 | printf ("%5.d%10.3lf\n", n, ans); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /【HDU】/1339.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | int n,p = 0; 13 | scanf ("%d%*c", &n); 14 | while(!(n&1)) 15 | { 16 | p++; 17 | n >>= 1; 18 | } 19 | printf ("%d %d\n", n,p); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【HDU】/1400.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1400.txt -------------------------------------------------------------------------------- /【HDU】/1418.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | unsigned int n, m; 9 | while(~scanf("%u %u%*c", &n, &m) && n+m) 10 | printf("%u\n", n+m-2); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /【HDU】/1465.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int n, i; 6 | __int64 a[21]; 7 | for (i = 3, a[1] = 0, a[2] = 1; i <= 20; i++) 8 | a[i] = (i-1)*(a[i-1]+a[i-2]); 9 | while (EOF != scanf ("%d%*c", &n)) 10 | { 11 | printf ("%I64d\n", a[n]); 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /【HDU】/1494.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1494.txt -------------------------------------------------------------------------------- /【HDU】/1498.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1498.txt -------------------------------------------------------------------------------- /【HDU】/1502.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1502.txt -------------------------------------------------------------------------------- /【HDU】/1507.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1507.txt -------------------------------------------------------------------------------- /【HDU】/1514.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1514.txt -------------------------------------------------------------------------------- /【HDU】/1520.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1520.txt -------------------------------------------------------------------------------- /【HDU】/1526.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1526.txt -------------------------------------------------------------------------------- /【HDU】/1527.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1527.txt -------------------------------------------------------------------------------- /【HDU】/1528.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1528.txt -------------------------------------------------------------------------------- /【HDU】/1532.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1532.txt -------------------------------------------------------------------------------- /【HDU】/1533.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1533.txt -------------------------------------------------------------------------------- /【HDU】/1542.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1542.txt -------------------------------------------------------------------------------- /【HDU】/1555.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int m,k; 9 | while(~scanf("%d %d%*c", &m, &k) && m+k) 10 | { 11 | int sum = 1; 12 | m--; 13 | while(m) if(++sum%k) m--; 14 | printf("%d\n", sum); 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /【HDU】/1561.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1561.txt -------------------------------------------------------------------------------- /【HDU】/1563.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef DSHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int n; 9 | while(EOF != scanf ("%d%*c", &n) && n) 10 | { 11 | int ans, a; 12 | scanf ("%d%*c", &ans); 13 | n--; 14 | while(n--) 15 | { 16 | scanf ("%d%*c", &a); 17 | ans ^= a; 18 | } 19 | printf ("%d\n", ans); 20 | } 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【HDU】/1565.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1565.txt -------------------------------------------------------------------------------- /【HDU】/1569.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1569.txt -------------------------------------------------------------------------------- /【HDU】/1578.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1578.txt -------------------------------------------------------------------------------- /【HDU】/1659.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1659.txt -------------------------------------------------------------------------------- /【HDU】/1688.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1688.txt -------------------------------------------------------------------------------- /【HDU】/1698.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1698.txt -------------------------------------------------------------------------------- /【HDU】/1711.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1711.txt -------------------------------------------------------------------------------- /【HDU】/1712.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1712.txt -------------------------------------------------------------------------------- /【HDU】/1720.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int a, b; 9 | while(~scanf ("%x %x%*c", &a, &b)) 10 | { 11 | printf ("%d\n", a+b); 12 | } 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /【HDU】/1754.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1754.txt -------------------------------------------------------------------------------- /【HDU】/1811.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1811.txt -------------------------------------------------------------------------------- /【HDU】/1846.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1846.txt -------------------------------------------------------------------------------- /【HDU】/1853.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1853.txt -------------------------------------------------------------------------------- /【HDU】/1874.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1874.txt -------------------------------------------------------------------------------- /【HDU】/1880.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1880.txt -------------------------------------------------------------------------------- /【HDU】/1890.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/1890.txt -------------------------------------------------------------------------------- /【HDU】/1977.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | __int64 n; 13 | scanf ("%I64d%*c", &n); 14 | printf ("%I64d %I64d\n", n*n*n, (n+1)*(n+1)*(n+1)); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /【HDU】/1994.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf("%d%*c", &t); 10 | while(t--) 11 | { 12 | double y,q,e,f,g; 13 | scanf ("%lf %lf %lf %lf %lf%*c", &y,&q,&e,&f,&g); 14 | printf ("%.1lf\n", y*(1+e/100*q/365)*(1+g/100)); 15 | printf ("%.1lf\n", y*(1+f/100*(q+365)/365)); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /【HDU】/1995.txt: -------------------------------------------------------------------------------- 1 | #include 2 | typedef long long LL; 3 | LL ans[61]; 4 | 5 | int main() 6 | { 7 | #ifdef SHY 8 | freopen("e:\\1.txt", "r", stdin); 9 | #endif 10 | int t; 11 | ans[0] = 1; 12 | for(int i = 1; i < 60; i++) 13 | ans[i] = ans[i-1]<<1; 14 | scanf("%d%*c", &t); 15 | while(t--) 16 | { 17 | int n,k; 18 | scanf("%d %d%*c", &n, &k); 19 | printf("%I64d\n", ans[n-k]); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【HDU】/1996.txt: -------------------------------------------------------------------------------- 1 | #include 2 | long long ans[30]; 3 | 4 | int main() 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt", "r", stdin); 8 | #endif 9 | int t; 10 | scanf("%d%*c", &t); 11 | ans[0] = 1; 12 | for(int i = 1; i < 30; i++) 13 | ans[i] = ans[i-1]*3; 14 | while(t--) 15 | { 16 | int n; 17 | scanf("%d%*c", &n); 18 | printf("%I64d\n", ans[n]); 19 | } 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【HDU】/2001.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void main (void) 5 | { 6 | double a, b, c, d; 7 | double s; 8 | char ch; 9 | while (EOF != scanf ("%lf %lf %lf %lf", &a, &b, &c, &d)) 10 | { 11 | while ( (ch=getchar()) !='\n' ) 12 | continue; 13 | s = (sqrt) ((double)(a-c)*(a-c)+(b-d)*(b-d)); 14 | printf("%.2lf\n", s); 15 | } 16 | } -------------------------------------------------------------------------------- /【HDU】/2002.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #define PI 3.1415927 4 | void main (void) 5 | { 6 | double r, v; 7 | while (EOF != scanf ("%lf", &r)) 8 | { 9 | getchar(); 10 | v = 4.0/3.0 *PI*r*r*r; 11 | printf ("%.3lf\n", v); 12 | } 13 | } -------------------------------------------------------------------------------- /【HDU】/2003.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main (void) 4 | { 5 | double a; 6 | 7 | while (EOF != scanf ("%lf", &a)) 8 | { 9 | if (a < 0.0) 10 | { 11 | a = -1.0*a; 12 | } 13 | printf ("%.2lf\n", a); 14 | } 15 | } -------------------------------------------------------------------------------- /【HDU】/2009.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | 5 | void main (void) 6 | { 7 | int n, m, i; 8 | double x = 0, s = 0; 9 | while (EOF != scanf ("%d %d", &n, &m)) 10 | { 11 | getchar(); 12 | for (i = 0, x = n, s = 0; i < m; i++) 13 | { 14 | s += x; 15 | x = sqrt(x); 16 | } 17 | printf ("%.2lf\n", s); 18 | } 19 | } -------------------------------------------------------------------------------- /【HDU】/2011.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main (void) 4 | { 5 | int m, i, j, n; 6 | double s = 0; 7 | scanf("%d", &m); 8 | getchar(); 9 | for (i = 0; i < m; i++) 10 | { 11 | s = 0; 12 | if (i == m-1) 13 | scanf("%d", &n); 14 | else 15 | scanf("%d ", &n); 16 | 17 | for (j = 1; j <= n;j++) 18 | { 19 | if (0 != j%2) 20 | s += 1.0/(j); 21 | else 22 | s -= 1.0/(j); 23 | } 24 | printf ("%.2lf\n", s); 25 | } 26 | } -------------------------------------------------------------------------------- /【HDU】/2013.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main (void) 4 | { 5 | int n, s, i; 6 | while ( EOF != scanf("%d", &n)) 7 | { 8 | s = 1; 9 | for (i = 0; i < n-1; i++) 10 | { 11 | s = 2 * (1 + s); 12 | } 13 | printf ("%d\n", s); 14 | } 15 | } -------------------------------------------------------------------------------- /【HDU】/2018.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2018.txt -------------------------------------------------------------------------------- /【HDU】/2023.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2023.txt -------------------------------------------------------------------------------- /【HDU】/2026.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void main () 5 | { 6 | char a[101]; 7 | int i = 0, n; 8 | 9 | while (NULL != gets (a)) 10 | { 11 | int n = strlen (a); 12 | for (i = 1, a[0] -= 32; i < n; i++) 13 | { 14 | if (' ' == a[i-1]) 15 | { 16 | a[i] -= 32; 17 | } 18 | } 19 | 20 | for (i = 0; i < n; i++) 21 | { 22 | printf ("%c", a[i]); 23 | } 24 | printf ("\n"); 25 | 26 | } 27 | 28 | } 29 | -------------------------------------------------------------------------------- /【HDU】/2034.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2034.txt -------------------------------------------------------------------------------- /【HDU】/2035.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main () 4 | { 5 | int a, b; 6 | 7 | while (1) 8 | { 9 | int i, san; 10 | scanf ("%d %d", &a, &b); 11 | getchar(); 12 | 13 | if (0 == a, 0 == b) 14 | { 15 | return; 16 | } 17 | 18 | for (i = 1, san = a; i < b; i++) 19 | { 20 | san *= a; 21 | if (1000 <= san) 22 | san %= 1000; 23 | } 24 | 25 | printf ("%d\n", san); 26 | } 27 | 28 | } 29 | -------------------------------------------------------------------------------- /【HDU】/2042.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main () 4 | { 5 | int n; 6 | scanf ("%d", &n); 7 | getchar (); 8 | 9 | while (n--) 10 | { 11 | int a, i, s; 12 | scanf ("%d", &a); 13 | getchar (); 14 | 15 | for (i = 0, s = 3; i < a; i++) 16 | { 17 | s = 2 * (s-1); 18 | } 19 | 20 | printf ("%d\n", s); 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /【HDU】/2044.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main () 4 | { 5 | int n, i; 6 | double a[50] = {1,1,2}; 7 | scanf ("%d", &n); 8 | getchar (); 9 | 10 | for (i = 3; i <= 49; i++) 11 | { 12 | a[i] = a[i-1] + a[i-2]; 13 | } 14 | 15 | while (n--) 16 | { 17 | int s, e; 18 | scanf ("%d %d", &s, &e); 19 | getchar (); 20 | 21 | printf ("%.0lf\n", a[e-s]); 22 | 23 | } 24 | } 25 | -------------------------------------------------------------------------------- /【HDU】/2045.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int n, i; 6 | __int64 sum[51]; 7 | for (i = 4, sum[1] = 3, sum[2] = sum[3] = 6; i <= 50; i++) 8 | sum[i] = sum[i-1]+sum[i-2]*2; 9 | while (EOF != scanf ("%d", &n)) 10 | printf ("%I64d\n", sum[n]); 11 | 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /【HDU】/2046.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main () 4 | { 5 | int n, i; 6 | double s[51]; 7 | for (i = 2, s[0] = 1, s[1] = 2; i < 50; i++) 8 | { 9 | s[i] = s[i-1] + s[i-2]; 10 | } 11 | 12 | while (EOF != scanf ("%d", &n)) 13 | { 14 | getchar (); 15 | printf ("%.0lf\n", s[n-1]); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /【HDU】/2047.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2047.txt -------------------------------------------------------------------------------- /【HDU】/2048.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | __int64 cp[20]; 6 | int c; 7 | scanf ("%d%*c", &c); 8 | while (c--) 9 | { 10 | int n, i; 11 | __int64 all = 1; 12 | scanf ("%d%*c", &n); 13 | for (i = 2, cp[0] = 0, cp[1] = 1; i < n; i++) 14 | cp[i] = i*(cp[i-1]+cp[i-2]); 15 | for (i = 0; i < n; i++) 16 | all *= i+1; 17 | printf ("%.2lf%%\n", cp[n-1]*1.0/all*100.0); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /【HDU】/2049.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2049.txt -------------------------------------------------------------------------------- /【HDU】/2050.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main () 4 | { 5 | int n; 6 | scanf ("%d", &n); 7 | getchar (); 8 | 9 | while (n--) 10 | { 11 | int a; 12 | scanf ("%d", &a); 13 | getchar (); 14 | 15 | printf ("%I64d\n", 2*a*a-a+1); 16 | } 17 | } -------------------------------------------------------------------------------- /【HDU】/2051.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void main () 5 | { 6 | int n; 7 | while (EOF != scanf ("%d", &n)) 8 | { 9 | char a[300]; 10 | itoa(n, a, 2); 11 | printf ("%s\n", a); 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /【HDU】/2052.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2052.txt -------------------------------------------------------------------------------- /【HDU】/2054.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2054.txt -------------------------------------------------------------------------------- /【HDU】/2055.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2055.txt -------------------------------------------------------------------------------- /【HDU】/2057.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | __int64 a, b; 6 | 7 | while (EOF != scanf ("%I64X %I64X", &a, &b)) 8 | { 9 | getchar(); 10 | __int64 c = a+b; 11 | if (a+b >= 0) 12 | printf ("%I64X\n", a+b); 13 | else 14 | { 15 | printf ("-%I64X\n", -a-b); 16 | } 17 | } 18 | } -------------------------------------------------------------------------------- /【HDU】/2058.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void main () 5 | { 6 | while (1) 7 | { 8 | int n, m, i, j; 9 | scanf ("%d %d", &n,&m); 10 | getchar (); 11 | if (0 == n && 0 == m) 12 | return; 13 | 14 | for (j = (int)sqrt(2*(double)m); j >= 1; j--) 15 | { 16 | i = m/j - (j-1)/2; 17 | if (m == i*j + (j*(j-1))/2) 18 | { 19 | printf ("[%d,%d]\n", i, i+j-1); 20 | } 21 | } 22 | printf ("\n"); 23 | 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /【HDU】/2059.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2059.txt -------------------------------------------------------------------------------- /【HDU】/2061.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2061.txt -------------------------------------------------------------------------------- /【HDU】/2062.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2062.txt -------------------------------------------------------------------------------- /【HDU】/2067.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2067.txt -------------------------------------------------------------------------------- /【HDU】/2068.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2068.txt -------------------------------------------------------------------------------- /【HDU】/2070.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int i; 6 | __int64 a[51]; 7 | a[0] = 0,a[1] = 1; 8 | for (i = 2; i < 51; i++) 9 | a[i] = a[i-1]+a[i-2]; 10 | while (1) 11 | { 12 | int n; 13 | scanf ("%d%*c", &n); 14 | if (-1 == n) 15 | break; 16 | printf ("%I64d\n", a[n]); 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /【HDU】/2071.txt: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | 4 | int main () 5 | { 6 | int t; 7 | scanf ("%d%*c", &t); 8 | while (t--) 9 | { 10 | int n, i; 11 | double max, a; 12 | scanf ("%d%*c", &n); 13 | scanf ("%lf%*c", &max); 14 | for (i = 1; i < n; i++) 15 | { 16 | scanf ("%lf%*c", &a); 17 | if (max < a) 18 | max = a; 19 | } 20 | printf ("%.2lf\n", max); 21 | } 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /【HDU】/2075.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d", &t); 7 | getchar (); 8 | while(t--) 9 | { 10 | int a, b; 11 | scanf ("%d %d", &a, &b); 12 | getchar (); 13 | if (0 == a%b) 14 | printf ("YES\n"); 15 | else 16 | printf ("NO\n"); 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /【HDU】/2078.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int a[42]; 5 | 6 | int main () 7 | { 8 | #ifdef DSHY 9 | freopen("e:\\1.txt","r",stdin); 10 | #endif 11 | int t; 12 | scanf ("%d%*c", &t); 13 | while(t--) 14 | { 15 | int n, m; 16 | scanf ("%d %d%*c", &n, &m); 17 | for (int i = 0; i < n; i++) 18 | scanf ("%d%*c", &a[i]); 19 | sort(a,a+n); 20 | printf ("%d\n", (100-a[0])*(100-a[0])); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【HDU】/2081.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main () 4 | { 5 | int n; 6 | scanf ("%d", &n); 7 | getchar (); 8 | 9 | while (n--) 10 | { 11 | char c[12]; 12 | int i; 13 | gets (c); 14 | printf ("%d", 6); 15 | for (i = 6; i <= 10; i++) 16 | { 17 | printf ("%d", c[i]-'0'); 18 | } 19 | printf ("\n"); 20 | 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /【HDU】/2084.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2084.txt -------------------------------------------------------------------------------- /【HDU】/2087.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2087.txt -------------------------------------------------------------------------------- /【HDU】/2089.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2089.txt -------------------------------------------------------------------------------- /【HDU】/2090.txt: -------------------------------------------------------------------------------- 1 | #include 2 | char c[1000]; 3 | 4 | int main () 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | double sum = 0, n, p; 10 | while(~scanf ("%s %lf %lf%*c", c,&n, &p)) 11 | { 12 | sum += n*p; 13 | } 14 | printf ("%.1lf\n", sum); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /【HDU】/2095.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int n; 9 | while(~scanf ("%d%*c", &n) && n) 10 | { 11 | int ans, a; 12 | scanf ("%d%*c", &ans); 13 | for (int i = 1; i < n; i++) 14 | { 15 | scanf ("%d%*c", &a); 16 | ans ^= a; 17 | } 18 | printf ("%d\n", ans); 19 | } 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /【HDU】/2096.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int a, b; 10 | scanf ("%d %d%*c", &a, &b); 11 | a %= 100; 12 | b %= 100; 13 | printf ("%d\n", (a+b)%100); 14 | } 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /【HDU】/2101.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int a, b; 9 | while(~scanf ("%d %d%*c", &a, &b)) 10 | { 11 | if ((a+b)%86) 12 | puts("no"); 13 | else 14 | puts("yes"); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /【HDU】/2104.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int gcd(int a, int b) 5 | { 6 | while(b){ 7 | a %= b; 8 | if(a < b) a ^= b, b ^= a, a ^= b; 9 | } 10 | return a; 11 | } 12 | int main() 13 | { 14 | #ifdef SHY 15 | freopen("e:\\1.txt","r",stdin); 16 | #endif 17 | int a,b; 18 | while(~scanf("%d %d%*c", &a, &b) && ~a) 19 | { 20 | if(gcd(a,b) != 1) puts("POOR Haha"); 21 | else puts("YES"); 22 | } 23 | return 0; 24 | } -------------------------------------------------------------------------------- /【HDU】/2114.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | __int64 n, ans; 9 | while(~scanf ("%I64d%*c", &n)) 10 | { 11 | ans = ((n*(n+1)/2)%10000)*((n*(n+1)/2)%10000)%10000; 12 | printf ("%04I64d\n", ans); 13 | } 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /【HDU】/2123.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | int n; 13 | scanf ("%d%*c", &n); 14 | for (int i = 1; i <= n; i++) 15 | { 16 | printf ("%d",i); 17 | for (int j = 2; j <= n; j++) 18 | printf (" %d", i*j); 19 | printf ("\n"); 20 | } 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /【HDU】/2134.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main () 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | double r; 10 | while(scanf ("%lf%*c", &r) && r) 11 | { 12 | printf ("%.3lf ", sqrt(r*r/3.0)); 13 | printf ("%.3lf\n", sqrt(r*r*2.0/3.0)); 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /【HDU】/2139.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | __int64 n, ans; 9 | while(~scanf ("%I64d%*c", &n)) 10 | { 11 | printf ("%I64d\n", n*(n+1)*(n+2)/6); 12 | } 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /【HDU】/2156.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int n; 9 | while(~scanf ("%d%*c", &n) && n) 10 | { 11 | double ans = n; 12 | int c = (n-1)*2; 13 | for (int i = 2; i <= n; i++) 14 | { 15 | ans += 1.0*c/i; 16 | c -= 2; 17 | } 18 | printf ("%.2f\n", ans); 19 | } 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /【HDU】/2159.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2159.txt -------------------------------------------------------------------------------- /【HDU】/2160.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int ans[21]; 4 | 5 | int main() 6 | { 7 | #ifdef SHY 8 | freopen("e:\\1.txt","r",stdin); 9 | #endif 10 | int t; 11 | ans[0] = ans[1] = 1; 12 | for(int i = 2; i <= 20; i++) 13 | ans[i] = ans[i-1]+ans[i-2]; 14 | scanf("%d%*c", &t); 15 | while(t--) 16 | { 17 | int n; 18 | scanf("%d%*c", &n); 19 | printf("%d\n", ans[n]); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【HDU】/2176.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2176.txt -------------------------------------------------------------------------------- /【HDU】/2178.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main () 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | int t; 10 | scanf ("%d%*c", &t); 11 | while(t--) 12 | { 13 | int n; 14 | scanf ("%d%*c", &n); 15 | printf ("%d\n", (int)pow(2,n)-1); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /【HDU】/2182.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2182.txt -------------------------------------------------------------------------------- /【HDU】/2190.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int ans[31]; 4 | 5 | int main() 6 | { 7 | #ifdef SHY 8 | freopen("e:\\1.txt","r",stdin); 9 | #endif 10 | ans[1] = 1, ans[2] = 3; 11 | for(int i = 3; i <= 30; i++) 12 | ans[i] = ans[i-1]+ans[i-2]*2; 13 | int t; 14 | scanf("%d%*c", &t); 15 | while(t--) 16 | { 17 | int n; 18 | scanf("%d%*c", &n); 19 | printf("%d\n", ans[n]); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【HDU】/2196.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2196.txt -------------------------------------------------------------------------------- /【HDU】/2201.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int n, m; 9 | while(~scanf ("%d %d%*c", &n, &m)) 10 | { 11 | printf ("%.2lf\n", 1.0/n); 12 | } 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /【HDU】/2222.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2222.txt -------------------------------------------------------------------------------- /【HDU】/2227.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2227.txt -------------------------------------------------------------------------------- /【HDU】/2255.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2255.txt -------------------------------------------------------------------------------- /【HDU】/2304.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | int sum = 0, n, a; 13 | scanf ("%d%*c", &n); 14 | for (int i = 0; i < n; i++) 15 | { 16 | scanf ("%d%*c", &a); 17 | sum += a; 18 | } 19 | printf ("%d\n", sum-n+1); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /【HDU】/2317.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | int a, b, c; 13 | scanf ("%d %d %d%*c", &a, &b, &c); 14 | if (a > b-c) 15 | puts("do not advertise"); 16 | else if (a < b-c) 17 | puts("advertise"); 18 | else 19 | puts("does not matter"); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /【HDU】/2389.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2389.txt -------------------------------------------------------------------------------- /【HDU】/2401.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int n, w, d, v; 9 | while(~scanf ("%d %d %d %d%*c", &n, &w, &d, &v)) 10 | { 11 | int ans = n*(n-1)/2*w-v; 12 | if (!ans) 13 | printf ("%d\n", n); 14 | else 15 | printf ("%d\n", ans/d); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /【HDU】/2448.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2448.txt -------------------------------------------------------------------------------- /【HDU】/2475.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2475.txt -------------------------------------------------------------------------------- /【HDU】/2482.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2482.txt -------------------------------------------------------------------------------- /【HDU】/2500.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | int n, len; 13 | scanf ("%d%*c", &n); 14 | len = 3*n; 15 | for (int i = 0; i < len; i++) 16 | { 17 | for (int j = 0; j < n; j++) 18 | printf ("HDU"); 19 | printf ("\n"); 20 | } 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /【HDU】/2501.txt: -------------------------------------------------------------------------------- 1 | #include 2 | int ans[31]; 3 | 4 | int main() 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | int t; 10 | ans[0] = ans[1] = 1; 11 | for(int i = 2; i <= 30; i++) ans[i] = ans[i-1]+2*ans[i-2]; 12 | scanf("%d%*c", &t); 13 | while(t--) 14 | { 15 | int n; 16 | scanf("%d%*c", &n); 17 | printf("%d\n", ans[n]); 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /【HDU】/2502.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt", "r", stdin); 8 | #endif 9 | int t; 10 | scanf("%d%*c", &t); 11 | while(t--) 12 | { 13 | int n; 14 | scanf("%d%*c", &n); 15 | printf("%d\n", (1<<(n-2))*(n-1)+(1<<(n-1))); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /【HDU】/2513.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2513.txt -------------------------------------------------------------------------------- /【HDU】/2520.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int n; 9 | scanf ("%d%*c", &n); 10 | while(n--) 11 | { 12 | __int64 t; 13 | scanf ("%I64d%*c", &t); 14 | printf ("%d\n", (t*t)%10000); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /【HDU】/2524.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | int t; 10 | scanf("%d%*c", &t); 11 | while(t--) 12 | { 13 | int m,n; 14 | scanf("%d %d%*c", &n, &m); 15 | printf("%d\n", n*(n+1)/2*m*(m+1)/2); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /【HDU】/2547.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main () 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | int t; 10 | scanf ("%d%*c", &t); 11 | while(t--) 12 | { 13 | double a, b, c, d; 14 | scanf ("%lf %lf %lf %lf%*c", &a, &b, &c, &d); 15 | printf ("%.1lf\n", sqrt((a-c)*(a-c)+(b-d)*(b-d))); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /【HDU】/2548.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | double u,v,w,l; 13 | scanf ("%lf %lf %lf %lf%*c", &u,&v,&w,&l); 14 | printf ("%.3lf\n",l/(u+v)*w); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /【HDU】/2551.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf("%d%*c", &t); 10 | while(t--) 11 | { 12 | __int64 x, sum = 0; 13 | scanf ("%I64d*c", &x); 14 | int ans = 0; 15 | while(sum < x) 16 | { 17 | ans++; 18 | sum += ans*ans*ans; 19 | } 20 | printf ("%d\n", ans); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /【HDU】/2552.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | scanf ("%*f%*c%*f%*c"); 13 | puts("1"); 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /【HDU】/2553.txt: -------------------------------------------------------------------------------- 1 | #include 2 | const int ans[10] = {1,0,0,2,10,4,40,92,352,724}; 3 | int main (){ 4 | int n; 5 | while(EOF != scanf ("%d%*c", &n)&&n) 6 | printf("%d\n", ans[n-1]); 7 | return 0; 8 | } -------------------------------------------------------------------------------- /【HDU】/2561.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int a[11]; 5 | 6 | int main () 7 | { 8 | #ifdef DSHY 9 | freopen("e:\\1.txt","r",stdin); 10 | #endif 11 | int t; 12 | scanf ("%d%*c",&t); 13 | while(t--) 14 | { 15 | int n; 16 | scanf ("%d%*c",&n); 17 | for (int i = 0; i < n; i++) 18 | scanf ("%d%*c", &a[i]); 19 | sort(a,a+n); 20 | printf ("%d\n",a[1]); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【HDU】/2562.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | char a[100]; 4 | 5 | int main () 6 | { 7 | #ifdef DSHY 8 | freopen("e:\\1.txt","r",stdin); 9 | #endif 10 | int t; 11 | scanf ("%d%*c",&t); 12 | while(t--) 13 | { 14 | gets(a); 15 | int len = strlen(a); 16 | for (int i = 0; i < len; i += 2) 17 | { 18 | a[i] ^= a[i+1]; 19 | a[i+1] ^= a[i]; 20 | a[i] ^= a[i+1]; 21 | } 22 | puts(a); 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /【HDU】/2563.txt: -------------------------------------------------------------------------------- 1 | #include 2 | int ans[21]; 3 | 4 | int main() 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | ans[0] = 1,ans[1] = 3; 10 | for(int i = 2; i <= 20; i++) ans[i] = ans[i-1]*2+ans[i-2]; 11 | int t; 12 | scanf("%d%*c", &t); 13 | while(t--) 14 | { 15 | int n; 16 | scanf("%d%*c", &n); 17 | printf("%d\n", ans[n]); 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /【HDU】/2568.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | int n, ans = 0; 13 | scanf ("%d%*c", &n); 14 | while(n) 15 | { 16 | if (n&1) 17 | ans++; 18 | n >>= 1; 19 | } 20 | printf ("%d\n", ans); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【HDU】/2569.txt: -------------------------------------------------------------------------------- 1 | #include 2 | typedef long long LL; 3 | LL ans[40]; 4 | 5 | int main() 6 | { 7 | #ifdef SHY 8 | freopen("e:\\1.txt","r",stdin); 9 | #endif 10 | ans[1] = 3,ans[2] = 9; 11 | for(int i = 3; i < 40; i++) ans[i] = ans[i-1]*2+ans[i-2]; 12 | int t; 13 | scanf("%d%*c", &t); 14 | while(t--) 15 | { 16 | int n; 17 | scanf("%d%*c", &n); 18 | printf("%I64d\n", ans[n]); 19 | } 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【HDU】/2586.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2586.txt -------------------------------------------------------------------------------- /【HDU】/2602.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2602.txt -------------------------------------------------------------------------------- /【HDU】/2647.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2647.txt -------------------------------------------------------------------------------- /【HDU】/2665.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2665.txt -------------------------------------------------------------------------------- /【HDU】/2669.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2669.txt -------------------------------------------------------------------------------- /【HDU】/2674.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int ans[40]; 4 | 5 | int main() 6 | { 7 | #ifdef SHY 8 | freopen("e:\\1.txt","r",stdin); 9 | #endif 10 | int n; 11 | ans[0] = ans[1] = 1; 12 | for(int i = 2; i <= 40; i++) 13 | ans[i] = ans[i-1]*i%2009; 14 | while(~scanf("%d%*c", &n)) 15 | { 16 | if(n <= 40) printf("%d\n", ans[n]); 17 | else puts("0"); 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /【HDU】/2686.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2686.txt -------------------------------------------------------------------------------- /【HDU】/2767.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2767.txt -------------------------------------------------------------------------------- /【HDU】/2769.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2769.txt -------------------------------------------------------------------------------- /【HDU】/2929.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/2929.txt -------------------------------------------------------------------------------- /【HDU】/3008.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3008.txt -------------------------------------------------------------------------------- /【HDU】/3018.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3018.txt -------------------------------------------------------------------------------- /【HDU】/3033.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3033.txt -------------------------------------------------------------------------------- /【HDU】/3068.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3068.txt -------------------------------------------------------------------------------- /【HDU】/3081.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3081.txt -------------------------------------------------------------------------------- /【HDU】/3182.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3182.txt -------------------------------------------------------------------------------- /【HDU】/3191.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3191.txt -------------------------------------------------------------------------------- /【HDU】/3299.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3299.txt -------------------------------------------------------------------------------- /【HDU】/3315.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3315.txt -------------------------------------------------------------------------------- /【HDU】/3333.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3333.txt -------------------------------------------------------------------------------- /【HDU】/3359.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3359.txt -------------------------------------------------------------------------------- /【HDU】/3361.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt","r",stdin); 8 | #endif 9 | int n; 10 | while(~scanf("%d%*c", &n)) 11 | { 12 | int a; 13 | for(int i = 0; i < n; i++) 14 | { 15 | scanf("%d%*c", &a); 16 | putchar(a); 17 | } 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /【HDU】/3364.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3364.txt -------------------------------------------------------------------------------- /【HDU】/3371.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3371.txt -------------------------------------------------------------------------------- /【HDU】/3376.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3376.txt -------------------------------------------------------------------------------- /【HDU】/3394.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3394.txt -------------------------------------------------------------------------------- /【HDU】/3395.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3395.txt -------------------------------------------------------------------------------- /【HDU】/3397.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3397.txt -------------------------------------------------------------------------------- /【HDU】/3401.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3401.txt -------------------------------------------------------------------------------- /【HDU】/3435.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3435.txt -------------------------------------------------------------------------------- /【HDU】/3449.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3449.txt -------------------------------------------------------------------------------- /【HDU】/3466.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3466.txt -------------------------------------------------------------------------------- /【HDU】/3472.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3472.txt -------------------------------------------------------------------------------- /【HDU】/3487.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3487.txt -------------------------------------------------------------------------------- /【HDU】/3488.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3488.txt -------------------------------------------------------------------------------- /【HDU】/3496.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3496.txt -------------------------------------------------------------------------------- /【HDU】/3535.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3535.txt -------------------------------------------------------------------------------- /【HDU】/3549.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3549.txt -------------------------------------------------------------------------------- /【HDU】/3572.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3572.txt -------------------------------------------------------------------------------- /【HDU】/3579.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3579.txt -------------------------------------------------------------------------------- /【HDU】/3591.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3591.txt -------------------------------------------------------------------------------- /【HDU】/3622.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3622.txt -------------------------------------------------------------------------------- /【HDU】/3667.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3667.txt -------------------------------------------------------------------------------- /【HDU】/3726.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3726.txt -------------------------------------------------------------------------------- /【HDU】/3732.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3732.txt -------------------------------------------------------------------------------- /【HDU】/3752.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt","r",stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | int m, n; 13 | scanf ("%d %d%*c" ,&m, &n); 14 | if (m&1) 15 | puts("NO"); 16 | else 17 | puts("YES"); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /【HDU】/3849.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3849.txt -------------------------------------------------------------------------------- /【HDU】/3887.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3887.txt -------------------------------------------------------------------------------- /【HDU】/3912.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3912.txt -------------------------------------------------------------------------------- /【HDU】/3954.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3954.txt -------------------------------------------------------------------------------- /【HDU】/3974.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3974.txt -------------------------------------------------------------------------------- /【HDU】/3987.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/3987.txt -------------------------------------------------------------------------------- /【HDU】/4003.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4003.txt -------------------------------------------------------------------------------- /【HDU】/4009.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4009.txt -------------------------------------------------------------------------------- /【HDU】/4010.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4010.txt -------------------------------------------------------------------------------- /【HDU】/4027.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4027.txt -------------------------------------------------------------------------------- /【HDU】/4080.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4080.txt -------------------------------------------------------------------------------- /【HDU】/4081.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4081.txt -------------------------------------------------------------------------------- /【HDU】/4115.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4115.txt -------------------------------------------------------------------------------- /【HDU】/4276.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4276.txt -------------------------------------------------------------------------------- /【HDU】/4433.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4433.txt -------------------------------------------------------------------------------- /【HDU】/4453.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4453.txt -------------------------------------------------------------------------------- /【HDU】/4521.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4521.txt -------------------------------------------------------------------------------- /【HDU】/4535.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4535.txt -------------------------------------------------------------------------------- /【HDU】/4552.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4552.txt -------------------------------------------------------------------------------- /【HDU】/4568.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4568.txt -------------------------------------------------------------------------------- /【HDU】/4738.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4738.txt -------------------------------------------------------------------------------- /【HDU】/4750.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4750.txt -------------------------------------------------------------------------------- /【HDU】/4762.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4762.txt -------------------------------------------------------------------------------- /【HDU】/4763.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4763.txt -------------------------------------------------------------------------------- /【HDU】/4771.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4771.txt -------------------------------------------------------------------------------- /【HDU】/4826.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4826.txt -------------------------------------------------------------------------------- /【HDU】/4831.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/4831.txt -------------------------------------------------------------------------------- /【HDU】/5002.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5002.txt -------------------------------------------------------------------------------- /【HDU】/5024.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5024.txt -------------------------------------------------------------------------------- /【HDU】/5044.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5044.txt -------------------------------------------------------------------------------- /【HDU】/5045.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5045.txt -------------------------------------------------------------------------------- /【HDU】/5047.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5047.txt -------------------------------------------------------------------------------- /【HDU】/5052.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5052.txt -------------------------------------------------------------------------------- /【HDU】/5063.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5063.txt -------------------------------------------------------------------------------- /【HDU】/5087.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5087.txt -------------------------------------------------------------------------------- /【HDU】/5105.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5105.txt -------------------------------------------------------------------------------- /【HDU】/5141.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5141.txt -------------------------------------------------------------------------------- /【HDU】/5159.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5159.txt -------------------------------------------------------------------------------- /【HDU】/5168.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5168.txt -------------------------------------------------------------------------------- /【HDU】/5171.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5171.txt -------------------------------------------------------------------------------- /【HDU】/5178.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5178.txt -------------------------------------------------------------------------------- /【HDU】/5187.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5187.txt -------------------------------------------------------------------------------- /【HDU】/5199.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5199.txt -------------------------------------------------------------------------------- /【HDU】/5215.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5215.txt -------------------------------------------------------------------------------- /【HDU】/5247.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5247.txt -------------------------------------------------------------------------------- /【HDU】/5249.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5249.txt -------------------------------------------------------------------------------- /【HDU】/5251.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5251.txt -------------------------------------------------------------------------------- /【HDU】/5259.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5259.txt -------------------------------------------------------------------------------- /【HDU】/5266.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5266.txt -------------------------------------------------------------------------------- /【HDU】/5274.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5274.txt -------------------------------------------------------------------------------- /【HDU】/5286.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5286.txt -------------------------------------------------------------------------------- /【HDU】/5294.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5294.txt -------------------------------------------------------------------------------- /【HDU】/5316.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5316.txt -------------------------------------------------------------------------------- /【HDU】/5317.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5317.txt -------------------------------------------------------------------------------- /【HDU】/5318.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5318.txt -------------------------------------------------------------------------------- /【HDU】/5325.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5325.txt -------------------------------------------------------------------------------- /【HDU】/5328.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5328.txt -------------------------------------------------------------------------------- /【HDU】/5340.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5340.txt -------------------------------------------------------------------------------- /【HDU】/5348.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5348.txt -------------------------------------------------------------------------------- /【HDU】/5349.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5349.txt -------------------------------------------------------------------------------- /【HDU】/5351.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5351.txt -------------------------------------------------------------------------------- /【HDU】/5381.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5381.txt -------------------------------------------------------------------------------- /【HDU】/5384.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5384.txt -------------------------------------------------------------------------------- /【HDU】/5412.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5412.txt -------------------------------------------------------------------------------- /【HDU】/5429.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5429.txt -------------------------------------------------------------------------------- /【HDU】/5442.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5442.txt -------------------------------------------------------------------------------- /【HDU】/5444.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5444.txt -------------------------------------------------------------------------------- /【HDU】/5465.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5465.txt -------------------------------------------------------------------------------- /【HDU】/5510.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5510.txt -------------------------------------------------------------------------------- /【HDU】/5543.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5543.txt -------------------------------------------------------------------------------- /【HDU】/5564.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5564.txt -------------------------------------------------------------------------------- /【HDU】/5568.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5568.txt -------------------------------------------------------------------------------- /【HDU】/5585.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5585.txt -------------------------------------------------------------------------------- /【HDU】/5587.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5587.txt -------------------------------------------------------------------------------- /【HDU】/5596.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5596.txt -------------------------------------------------------------------------------- /【HDU】/5618.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5618.txt -------------------------------------------------------------------------------- /【HDU】/5619.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【HDU】/5619.txt -------------------------------------------------------------------------------- /【MY】HDOJ题目分类.xlsx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【MY】HDOJ题目分类.xlsx -------------------------------------------------------------------------------- /【NYOJ】/100.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int m, ans = 0; 10 | scanf ("%d%*c", &m); 11 | while (0 != m) 12 | { 13 | if (1 == m%2) 14 | ans++; 15 | m /= 2; 16 | } 17 | printf ("%d\n",ans); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【NYOJ】/101.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main () 5 | { 6 | int t; 7 | scanf ("%d%*c", &t); 8 | while (t--) 9 | { 10 | double x1, y1, x2, y2; 11 | scanf ("%lf %lf %lf %lf%*c", &x1, &y1, &x2, &y2); 12 | printf ("%.2lf\n", (sqrt)((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))); 13 | } 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /【NYOJ】/104.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/104.txt -------------------------------------------------------------------------------- /【NYOJ】/105.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define MOD 9 4 | #define MAXN 1000010 5 | char a[MAXN]; 6 | 7 | int main() 8 | { 9 | #ifdef SHY 10 | freopen("e:\\1.txt","r",stdin); 11 | #endif 12 | int t; 13 | scanf("%d%*c", &t); 14 | while(t--) 15 | { 16 | scanf("%s%*c", a); 17 | int len = strlen(a), ans = 0; 18 | for(int i = len-1; i >= 0; i--) 19 | ans = (ans*10+a[i]-'0')%MOD; 20 | printf("%d\n", ans); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【NYOJ】/110.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/110.txt -------------------------------------------------------------------------------- /【NYOJ】/115.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/115.txt -------------------------------------------------------------------------------- /【NYOJ】/117.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/117.txt -------------------------------------------------------------------------------- /【NYOJ】/120.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/120.txt -------------------------------------------------------------------------------- /【NYOJ】/122.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t, count = 1; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int n, i, sum = 0; 10 | scanf ("%d%*c", &n); 11 | for (i = 1; i <= n; i++) 12 | { 13 | sum += i*((2+i)*(i+1)/2); 14 | } 15 | printf ("%d %d %d\n", count++, n, sum); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /【NYOJ】/127.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/127.txt -------------------------------------------------------------------------------- /【NYOJ】/15.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/15.txt -------------------------------------------------------------------------------- /【NYOJ】/16.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/16.txt -------------------------------------------------------------------------------- /【NYOJ】/176.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/176.txt -------------------------------------------------------------------------------- /【NYOJ】/206.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | long long a,b; 6 | while (EOF != scanf ("%lld %lld%*c", &a, &b)) 7 | { 8 | printf ("%lld\n", ((1+a)*a/2)*((1+b)*b/2)); 9 | } 10 | 11 | return 0; 12 | } -------------------------------------------------------------------------------- /【NYOJ】/21.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/21.txt -------------------------------------------------------------------------------- /【NYOJ】/216.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main () 5 | { 6 | int t; 7 | scanf ("%d%*c", &t); 8 | while (t--) 9 | { 10 | int i, n; 11 | int ans = 0; 12 | scanf ("%d%*c", &n); 13 | if (1 == n) 14 | ans = 0; 15 | else 16 | { 17 | for (i = 1; i*i <= n+1; i++) 18 | { 19 | if (0 == (n+1)%(i+1)) 20 | ans++; 21 | } 22 | } 23 | printf ("%d\n", ans); 24 | } 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /【NYOJ】/217.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int n; 10 | char c; 11 | scanf ("%c %d%*c", &c,&n); 12 | printf ("%d\n", (c-'a' >= 0 ? (-1)*(c-'a'+1): c-'A'+1)+n); 13 | } 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /【NYOJ】/241.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int a[26] = {0}, max = -1, ans; 10 | char c; 11 | while ('\n' != (c = getchar()) && EOF != c) 12 | { 13 | a[c-'a']++; 14 | } 15 | for (int i = 0; i < 26; i++) 16 | { 17 | if (max < a[i]) 18 | { 19 | max = a[i]; 20 | ans = i; 21 | } 22 | } 23 | printf ("%c\n", 'a'+ans); 24 | } 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /【NYOJ】/242.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #define PI 3.1415926 3 | 4 | int main () 5 | { 6 | double r; 7 | while (EOF != scanf ("%lf%*c", &r)) 8 | { 9 | double ans; 10 | ans = PI*(4*r*r*r)/3.0; 11 | printf ("%d\n", (ans-(int)ans >= 0.50 ? (int)ans+1 : (int)ans)); 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /【NYOJ】/244.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | char f; 10 | int a,b; 11 | scanf ("%x%c%x%*c", &a, &f, &b); 12 | printf ("%o\n", '+' == f ? a+b : a-b); 13 | } 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /【NYOJ】/252.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int ans[41]; 4 | 5 | int main() 6 | { 7 | #ifdef SHY 8 | freopen("e:\\1.txt","r",stdin); 9 | #endif 10 | int t; 11 | ans[1] = 2, ans[2] = 3; 12 | for (int i = 3; i <= 40; i++) 13 | ans[i] = ans[i-2]+ans[i-1]; 14 | scanf("%d%*c", &t); 15 | while(t--) 16 | { 17 | int n; 18 | scanf("%d%*c", &n); 19 | printf("%d\n", ans[n]); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【NYOJ】/259.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | char a; 10 | while(1) 11 | { 12 | a = getchar(); 13 | if ('\n' == a || EOF == a) 14 | break; 15 | printf ("%c", a); 16 | } 17 | printf ("\n"); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【NYOJ】/260.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int n, i, last, ans; 10 | scanf ("%d%*c", &n); 11 | for (i = 1, last = 0; i <= n ;i++) 12 | { 13 | ans = last+(1+i)*i/2; 14 | last = ans; 15 | } 16 | printf ("%d\n", ans); 17 | } 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /【NYOJ】/269.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/269.txt -------------------------------------------------------------------------------- /【NYOJ】/273.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int ans = 0; 10 | char c; 11 | while ('\n' != (c = getchar()) && EOF != c) 12 | { 13 | if ('a' <= c && 'z' >= c) 14 | ans++; 15 | } 16 | ans %= 26; 17 | if (0 == ans) 18 | ans = 26; 19 | printf ("%c\n", ans+'a'-1); 20 | } 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【NYOJ】/274.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define PI 3.1415926 4 | 5 | int main() 6 | { 7 | int t; 8 | scanf ("%d%*c", &t); 9 | while (t--) 10 | { 11 | double n, r; 12 | scanf ("%lf%*c", &n); 13 | r = n/((sqrt)(3.0)); 14 | printf ("%.2lf\n", PI*r*r); 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /【NYOJ】/275.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | long long n; 6 | while (EOF != scanf ("%lld%*c", &n)) 7 | { 8 | int a[40], count = 0; 9 | do 10 | { 11 | a[count++] = n%2; 12 | n /= 2; 13 | }while (0 != n); 14 | for (int i = count-1; i >= 0; i--) 15 | { 16 | printf ("%d", a[i]); 17 | } 18 | printf ("\n"); 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【NYOJ】/276.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | char a, b; 10 | scanf ("%c %c%*c", &a, &b); 11 | if (a == b) 12 | printf ("%c=%c\n", a,b); 13 | else if (a < b) 14 | printf ("%c>%c\n", a, b); 15 | else 16 | printf ("%c<%c\n", a, b); 17 | } 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /【NYOJ】/277.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main () 5 | { 6 | int t; 7 | scanf ("%d%*c", &t); 8 | while (t--) 9 | { 10 | int n, i; 11 | char a[6] = {200},buf[6]; 12 | scanf ("%d%*c", &n); 13 | for (i = 0; i < n;i++) 14 | { 15 | gets (buf); 16 | if (-1 == strcmp(buf, a)) 17 | strcpy(a,buf); 18 | } 19 | puts(a); 20 | } 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【NYOJ】/279.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/279.txt -------------------------------------------------------------------------------- /【NYOJ】/301.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/301.txt -------------------------------------------------------------------------------- /【NYOJ】/304.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/304.txt -------------------------------------------------------------------------------- /【NYOJ】/31.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a, max = -1, min = 11111111; 6 | for (int i = 0; i < 5; i++) 7 | { 8 | scanf ("%d%*c", &a); 9 | if (max < a) 10 | max = a; 11 | if (min > a) 12 | min = a; 13 | } 14 | printf ("%d %d\n", min, max); 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /【NYOJ】/324.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int n, i, ans = 1; 10 | scanf ("%d%*c", &n); 11 | for (i = 0; i < n; i++) 12 | { 13 | ans = (ans+1)*2; 14 | } 15 | printf ("%d\n", ans); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /【NYOJ】/325.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/325.txt -------------------------------------------------------------------------------- /【NYOJ】/326.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/326.txt -------------------------------------------------------------------------------- /【NYOJ】/34.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a,b,c; 6 | while (EOF != scanf ("%d %d %d%*c", &a, &b, &c)) 7 | { 8 | bool in = false; 9 | for (int i = 10; i <= 100; i++) 10 | { 11 | if (i%3 == a && i%5 == b && i%7 == c) 12 | { 13 | printf ("%d\n", i); 14 | in = true; 15 | break; 16 | } 17 | } 18 | if (!in) 19 | printf ("No answer\n"); 20 | 21 | } 22 | 23 | return 0; 24 | } -------------------------------------------------------------------------------- /【NYOJ】/349.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/349.txt -------------------------------------------------------------------------------- /【NYOJ】/35.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/35.txt -------------------------------------------------------------------------------- /【NYOJ】/37.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/37.txt -------------------------------------------------------------------------------- /【NYOJ】/399.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int n, b; 6 | while (EOF != scanf ("%d %d%*c", &n, &b)) 7 | { 8 | printf ("%d\n",n/b); 9 | } 10 | 11 | return 0; 12 | } -------------------------------------------------------------------------------- /【NYOJ】/40.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int gcd (int a, int b) 4 | { 5 | if (0 == b%a) 6 | return a; 7 | return gcd(b%a, a); 8 | } 9 | 10 | int main () 11 | { 12 | int t; 13 | scanf ("%d%*c", &t); 14 | while (t--) 15 | { 16 | int a, b, g; 17 | scanf ("%d %d%*c", &a, &b); 18 | g = gcd(a,b); 19 | printf ("%d %d\n", g, a*b/g); 20 | } 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /【NYOJ】/41.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main () 6 | { 7 | int a[3]; 8 | while (EOF != scanf ("%d %d %d%*c", &a[0],&a[1], &a[2])) 9 | { 10 | sort(a,a+3); 11 | printf ("%d %d %d\n", a[0], a[1],a[2]); 12 | } 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /【NYOJ】/435.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/435.txt -------------------------------------------------------------------------------- /【NYOJ】/45.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/45.txt -------------------------------------------------------------------------------- /【NYOJ】/455.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int a; 10 | scanf ("%d%*c", &a); 11 | printf ("%d\n",a); 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /【NYOJ】/456.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/456.txt -------------------------------------------------------------------------------- /【NYOJ】/457.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | char c; 10 | while ('\n' != (c = getchar()) && EOF != c) 11 | { 12 | if ('a' <= c && 'z' >= c) 13 | printf ("%c", c-32); 14 | else 15 | printf ("%c", c+32); 16 | } 17 | printf ("\n"); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【NYOJ】/458.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | long long n; 10 | scanf ("%lld%*c", &n); 11 | printf ("%lld\n", 471+1000*(n-1)); 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /【NYOJ】/463.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int n, i, j; 10 | scanf ("%d%*c", &n); 11 | for (i = 1; i <= n; i++) 12 | { 13 | for (j = i; j <= 9; j++) 14 | { 15 | printf ("%d*%d=%d", i, j, i*j); 16 | if (9 != j) 17 | printf (" "); 18 | } 19 | printf ("\n"); 20 | } 21 | 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /【NYOJ】/469.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define MAXN 56 4 | int dp[MAXN]; 5 | 6 | int main() 7 | { 8 | #ifdef SHY 9 | freopen("e:\\1.txt","r",stdin); 10 | #endif 11 | int n; 12 | dp[1] = dp[2] = 1; 13 | for (int i = 3; i <= 55; i++) 14 | dp[i] = dp[i-1]+dp[i-3]+1; 15 | while(~scanf("%d%*c", &n)) 16 | { 17 | printf("%d\n", dp[n]); 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /【NYOJ】/47.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/47.txt -------------------------------------------------------------------------------- /【NYOJ】/477.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main () 5 | { 6 | int t; 7 | scanf ("%d%*c", &t); 8 | while (t--) 9 | { 10 | double a, b, c; 11 | scanf ("%lf %lf %lf%*c", &a, &b, &c); 12 | if (fabs(a+b-c) <= 0.00001) 13 | puts("Yes"); 14 | else 15 | puts("No"); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /【NYOJ】/489.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/489.txt -------------------------------------------------------------------------------- /【NYOJ】/492.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/492.txt -------------------------------------------------------------------------------- /【NYOJ】/509.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/509.txt -------------------------------------------------------------------------------- /【NYOJ】/515.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/515.txt -------------------------------------------------------------------------------- /【NYOJ】/56.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int get(int n,int num) 6 | 7 | { 8 | 9 | if(n==0) return 0; 10 | 11 | else return get(n/num,num)+n/num; 12 | 13 | } 14 | 15 | int main() 16 | 17 | { 18 | 19 | int n; 20 | 21 | cin>>n; 22 | 23 | while(n--) 24 | 25 | { 26 | 27 | int a,b; 28 | 29 | cin>>a>>b; 30 | 31 | cout< 2 | 3 | int main () 4 | { 5 | while (1) 6 | { 7 | int a, b, ans = -1, n; 8 | scanf("%d%*c", &n); 9 | if (0 == n) 10 | break; 11 | for (int i = 0; i < n; i++) 12 | { 13 | scanf ("%d %d%*c", &a, &b); 14 | if (ans < a+b) 15 | ans = a+b; 16 | } 17 | printf ("%d\n", ans); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【NYOJ】/599.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while(t--) 8 | { 9 | int h, ans = 1,c = 0; 10 | scanf ("%d%*c", &h); 11 | if(h > 10) 12 | { 13 | if (0 != (h-10)%5) 14 | c = 1; 15 | ans = 1+(h-10)/5+c; 16 | } 17 | printf ("%d\n", ans); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【NYOJ】/63.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/63.txt -------------------------------------------------------------------------------- /【NYOJ】/64.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int n, m, j; 10 | scanf ("%d %d%*c", &n, &m); 11 | j = (4*n-m)/2; 12 | if (j > n || j < 0 || 1 == (4*n-m)%2) 13 | printf ("No answer\n"); 14 | else 15 | printf ("%d %d\n", j, n-j); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /【NYOJ】/65.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t, i, s[22], ans[21]; 6 | s[1] = s[2] = 1; 7 | for (i = 3; i < 22; i += 2) 8 | { 9 | s[i] = s[i+1] = s[i-1]*i; 10 | } 11 | ans[1] = 1; 12 | for (i = 2; i <= 20; i++) 13 | { 14 | ans[i] = ans[i-1]+s[i]; 15 | } 16 | scanf ("%d%*c", &t); 17 | while(t--) 18 | { 19 | int n; 20 | scanf ("%d%*c", &n); 21 | printf ("%d\n", ans[n]); 22 | } 23 | return 0; 24 | } -------------------------------------------------------------------------------- /【NYOJ】/677.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/677.txt -------------------------------------------------------------------------------- /【NYOJ】/72.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | double a; 6 | while (EOF != scanf ("%lf%*c", &a)) 7 | { 8 | double sum = 0; 9 | sum += a; 10 | for (int i = 1; i < 12; i++) 11 | { 12 | scanf ("%lf%*c", &a); 13 | sum += a; 14 | } 15 | printf ("%.2lf\n", sum/12); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /【NYOJ】/737.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/737.txt -------------------------------------------------------------------------------- /【NYOJ】/74.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | while (1) 6 | { 7 | int a, b, ans = 0, c = 0; 8 | scanf ("%d %d%*c", &a, &b); 9 | if (0 == a && 0 == b) 10 | break; 11 | for (int i = 0; i < 3; i++) 12 | { 13 | if (a%10+b%10+c > 9) 14 | { 15 | ans++; 16 | c = 1; 17 | } 18 | else 19 | c = 0; 20 | a /= 10; 21 | b /= 10; 22 | } 23 | printf ("%d\n", ans); 24 | } 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /【NYOJ】/740.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/740.txt -------------------------------------------------------------------------------- /【NYOJ】/746.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/746.txt -------------------------------------------------------------------------------- /【NYOJ】/760.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/760.txt -------------------------------------------------------------------------------- /【NYOJ】/776.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/776.txt -------------------------------------------------------------------------------- /【NYOJ】/779.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int n, k; 6 | while (EOF != scanf("%d %d%*c", &n, &k)) 7 | { 8 | int ans; 9 | if (n > k) 10 | { 11 | ans = n*2/k; 12 | if (0 != (n*2)%k) 13 | ans++; 14 | } 15 | else 16 | ans = 2; 17 | printf ("%d\n", ans); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【NYOJ】/81.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/81.txt -------------------------------------------------------------------------------- /【NYOJ】/813.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | while (1) 6 | { 7 | int n, k; 8 | bool in = false; 9 | scanf ("%d %d%*c", &n, &k); 10 | if (0 == n && 0 == k) 11 | break; 12 | for (int i = 1;i <= n/2; i++) 13 | { 14 | if (i*(n-i) == k) 15 | { 16 | in = true; 17 | break; 18 | } 19 | } 20 | if (in) 21 | printf ("YES\n"); 22 | else 23 | printf ("NO\n"); 24 | } 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /【NYOJ】/822.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int n; 6 | while (EOF != scanf("%d%*c", &n)) 7 | { 8 | for (int i = 0; i < n; i++) 9 | { 10 | for (int j =0; j < n; j++) 11 | printf ("*"); 12 | printf ("\n"); 13 | } 14 | } 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /【NYOJ】/832.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/832.txt -------------------------------------------------------------------------------- /【NYOJ】/833.txt: -------------------------------------------------------------------------------- 1 | #include 2 | int main () 3 | { 4 | int n; 5 | while (EOF != scanf("%d%*c", &n)) 6 | { 7 | if (2 >= n) 8 | printf ("Hrdv\n"); 9 | else 10 | printf ("Yougth\n"); 11 | } 12 | return 0; 13 | } -------------------------------------------------------------------------------- /【NYOJ】/90.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【NYOJ】/90.txt -------------------------------------------------------------------------------- /【NYOJ】/94.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | int n, k, ans, buf; 10 | scanf ("%d %d%*c", &n, &k); 11 | ans = n; 12 | while (n >= k) 13 | { 14 | ans += n/k; 15 | n = n/k+n%k; 16 | } 17 | printf ("%d\n", ans); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /【NYOJ】/97.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int t; 6 | scanf ("%d%*c", &t); 7 | while (t--) 8 | { 9 | double m, x,y,z; 10 | scanf ("%lf %lf %lf %lf%*c", &m, &x, &y, &z); 11 | printf ("%.2lf\n", ((m*x)/(y-x))*z); 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /【POJ】/1019.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1019.txt -------------------------------------------------------------------------------- /【POJ】/1061.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1061.txt -------------------------------------------------------------------------------- /【POJ】/1077.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1077.txt -------------------------------------------------------------------------------- /【POJ】/1094.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1094.txt -------------------------------------------------------------------------------- /【POJ】/1144.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1144.txt -------------------------------------------------------------------------------- /【POJ】/1276.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1276.txt -------------------------------------------------------------------------------- /【POJ】/1651.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1651.txt -------------------------------------------------------------------------------- /【POJ】/1726.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1726.txt -------------------------------------------------------------------------------- /【POJ】/1830.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/1830.txt -------------------------------------------------------------------------------- /【POJ】/2481.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/2481.txt -------------------------------------------------------------------------------- /【POJ】/2482.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/2482.txt -------------------------------------------------------------------------------- /【POJ】/2528.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/2528.txt -------------------------------------------------------------------------------- /【POJ】/2763.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/2763.txt -------------------------------------------------------------------------------- /【POJ】/2828.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/2828.txt -------------------------------------------------------------------------------- /【POJ】/2886.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/2886.txt -------------------------------------------------------------------------------- /【POJ】/2948.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/2948.txt -------------------------------------------------------------------------------- /【POJ】/3669.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/3669.txt -------------------------------------------------------------------------------- /【POJ】/3734.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【POJ】/3734.txt -------------------------------------------------------------------------------- /【SGU】/131.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【SGU】/131.txt -------------------------------------------------------------------------------- /【SPOJ】/BALNUM.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【SPOJ】/BALNUM.txt -------------------------------------------------------------------------------- /【UVA】/10001.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10001.txt -------------------------------------------------------------------------------- /【UVA】/10020.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10020.txt -------------------------------------------------------------------------------- /【UVA】/10047.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10047.txt -------------------------------------------------------------------------------- /【UVA】/10054.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10054.txt -------------------------------------------------------------------------------- /【UVA】/10098.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | char c[61]; 6 | 7 | int main () 8 | { 9 | #ifdef DSHY 10 | freopen("e:\\1.txt","r",stdin); 11 | #endif 12 | int t; 13 | scanf ("%d%*c", &t); 14 | while(t--) 15 | { 16 | gets(c); 17 | int len = strlen(c); 18 | sort(c,c+len); 19 | puts(c); 20 | while(next_permutation(c, c+len)) 21 | puts(c); 22 | printf ("\n"); 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /【UVA】/10118.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10118.txt -------------------------------------------------------------------------------- /【UVA】/10125.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10125.txt -------------------------------------------------------------------------------- /【UVA】/10129.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10129.txt -------------------------------------------------------------------------------- /【UVA】/10160.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10160.txt -------------------------------------------------------------------------------- /【UVA】/1025.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1025.txt -------------------------------------------------------------------------------- /【UVA】/10375.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10375.txt -------------------------------------------------------------------------------- /【UVA】/10491.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | #ifdef SHY 7 | freopen("e:\\1.txt", "r", stdin); 8 | #endif 9 | double a,b,c; 10 | while(~scanf("%lf %lf %lf%*c", &a, &b, &c)) 11 | { 12 | printf("%.5lf\n", (a*b+b*(b-1))/((a+b-c-1)*(a+b))); 13 | } 14 | return 0; 15 | } -------------------------------------------------------------------------------- /【UVA】/10534.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10534.txt -------------------------------------------------------------------------------- /【UVA】/10618.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10618.txt -------------------------------------------------------------------------------- /【UVA】/10706.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10706.txt -------------------------------------------------------------------------------- /【UVA】/10817.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10817.txt -------------------------------------------------------------------------------- /【UVA】/10895.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10895.txt -------------------------------------------------------------------------------- /【UVA】/10970.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/10970.txt -------------------------------------------------------------------------------- /【UVA】/1099.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1099.txt -------------------------------------------------------------------------------- /【UVA】/11020.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11020.txt -------------------------------------------------------------------------------- /【UVA】/11082.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11082.txt -------------------------------------------------------------------------------- /【UVA】/11107.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11107.txt -------------------------------------------------------------------------------- /【UVA】/11205.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11205.txt -------------------------------------------------------------------------------- /【UVA】/11361.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11361.txt -------------------------------------------------------------------------------- /【UVA】/11375.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11375.txt -------------------------------------------------------------------------------- /【UVA】/1146.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1146.txt -------------------------------------------------------------------------------- /【UVA】/11468.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11468.txt -------------------------------------------------------------------------------- /【UVA】/11732.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11732.txt -------------------------------------------------------------------------------- /【UVA】/11922.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11922.txt -------------------------------------------------------------------------------- /【UVA】/11990.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11990.txt -------------------------------------------------------------------------------- /【UVA】/11992.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/11992.txt -------------------------------------------------------------------------------- /【UVA】/12003.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/12003.txt -------------------------------------------------------------------------------- /【UVA】/12105.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/12105.txt -------------------------------------------------------------------------------- /【UVA】/12169.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/12169.txt -------------------------------------------------------------------------------- /【UVA】/1218.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1218.txt -------------------------------------------------------------------------------- /【UVA】/12219.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/12219.txt -------------------------------------------------------------------------------- /【UVA】/1252.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1252.txt -------------------------------------------------------------------------------- /【UVA】/12661.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/12661.txt -------------------------------------------------------------------------------- /【UVA】/127.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/127.txt -------------------------------------------------------------------------------- /【UVA】/1325.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1325.txt -------------------------------------------------------------------------------- /【UVA】/1330.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1330.txt -------------------------------------------------------------------------------- /【UVA】/1347.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1347.txt -------------------------------------------------------------------------------- /【UVA】/1349.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1349.txt -------------------------------------------------------------------------------- /【UVA】/1366.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1366.txt -------------------------------------------------------------------------------- /【UVA】/1376.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1376.txt -------------------------------------------------------------------------------- /【UVA】/1382.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1382.txt -------------------------------------------------------------------------------- /【UVA】/1394.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1394.txt -------------------------------------------------------------------------------- /【UVA】/1400.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1400.txt -------------------------------------------------------------------------------- /【UVA】/1452.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1452.txt -------------------------------------------------------------------------------- /【UVA】/146.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | char c[61]; 6 | 7 | int main () 8 | { 9 | #ifdef DSHY 10 | freopen("e:\\1.txt","r",stdin); 11 | #endif 12 | while(1) 13 | { 14 | gets(c); 15 | if ('#' == c[0]) 16 | break; 17 | int len = strlen(c); 18 | if(next_permutation(c, c+len)) 19 | puts(c); 20 | else 21 | puts("No Successor"); 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /【UVA】/1479.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1479.txt -------------------------------------------------------------------------------- /【UVA】/1625.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1625.txt -------------------------------------------------------------------------------- /【UVA】/1627.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1627.txt -------------------------------------------------------------------------------- /【UVA】/1629.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1629.txt -------------------------------------------------------------------------------- /【UVA】/1632.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1632.txt -------------------------------------------------------------------------------- /【UVA】/1658.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/1658.txt -------------------------------------------------------------------------------- /【UVA】/196.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/196.txt -------------------------------------------------------------------------------- /【UVA】/208.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/208.txt -------------------------------------------------------------------------------- /【UVA】/242.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/242.txt -------------------------------------------------------------------------------- /【UVA】/310.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/310.txt -------------------------------------------------------------------------------- /【UVA】/321.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/321.txt -------------------------------------------------------------------------------- /【UVA】/704.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/704.txt -------------------------------------------------------------------------------- /【UVA】/753.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【UVA】/753.txt -------------------------------------------------------------------------------- /【WIKI】/1039.txt: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define MAXN 210 4 | #define MAXM 6 5 | int dp[MAXM][MAXN]; 6 | 7 | int main() 8 | { 9 | int n,m; 10 | scanf("%d %d%*c", &n, &m); 11 | dp[0][0] = 1; 12 | for (int i = 1; i <= n; i++) 13 | { 14 | for (int j = 1; j <= m; j++) 15 | { 16 | for (int k = i; k <= n; k++) 17 | dp[j][k] += dp[j-1][k-i]; 18 | } 19 | } 20 | printf("%d\n", dp[m][n]); 21 | return 0; 22 | } -------------------------------------------------------------------------------- /【WIKI】/1155.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【WIKI】/1155.txt -------------------------------------------------------------------------------- /【WIKI】/1214.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【WIKI】/1214.txt -------------------------------------------------------------------------------- /【WIKI】/1220.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【WIKI】/1220.txt -------------------------------------------------------------------------------- /【WIKI】/1297.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【WIKI】/1297.txt -------------------------------------------------------------------------------- /【WIKI】/3115.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【WIKI】/3115.txt -------------------------------------------------------------------------------- /【WIKI】/3116.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【WIKI】/3116.txt -------------------------------------------------------------------------------- /【WIKI】/3117.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【WIKI】/3117.txt -------------------------------------------------------------------------------- /【ZOJ】/1037.txt: -------------------------------------------------------------------------------- 1 | #include 2 | int main () 3 | { 4 | int m, n, j, i; 5 | float d; 6 | 7 | scanf("%d", &j); 8 | 9 | for (i = 1; i <= j; i++) 10 | { 11 | scanf("%d %d", &m, &n); 12 | 13 | if (1 == m%2 && 1 == n%2) 14 | d = 1.41 + m*n -1; 15 | 16 | else 17 | d = m*n; 18 | printf ("Scenario #%d:\n", i); 19 | printf ("%.2f", d); 20 | printf ("\n\n"); 21 | 22 | } 23 | return 0; 24 | } -------------------------------------------------------------------------------- /【ZOJ】/1048.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main (void) 4 | { 5 | int i; 6 | float a[12]; 7 | float b = 0; 8 | int j = 12; 9 | 10 | for (i = 0; i < j; i++) 11 | { 12 | scanf ("%f", &a[i]); 13 | b = a[i] + b; 14 | } 15 | printf ("$%.2f", b *1.0/ 12.0); 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /【ZOJ】/1049 .txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/1049 .txt -------------------------------------------------------------------------------- /【ZOJ】/1301.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/1301.txt -------------------------------------------------------------------------------- /【ZOJ】/1311.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/1311.txt -------------------------------------------------------------------------------- /【ZOJ】/1410.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/1410.txt -------------------------------------------------------------------------------- /【ZOJ】/1462.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/1462.txt -------------------------------------------------------------------------------- /【ZOJ】/1654.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/1654.txt -------------------------------------------------------------------------------- /【ZOJ】/1729.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/1729.txt -------------------------------------------------------------------------------- /【ZOJ】/2112.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/2112.txt -------------------------------------------------------------------------------- /【ZOJ】/2120.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/2120.txt -------------------------------------------------------------------------------- /【ZOJ】/2432.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/2432.txt -------------------------------------------------------------------------------- /【ZOJ】/2468.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/2468.txt -------------------------------------------------------------------------------- /【ZOJ】/2657.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/2657.txt -------------------------------------------------------------------------------- /【ZOJ】/3610.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | #ifdef SHY 6 | freopen("e:\\1.txt", "r", stdin); 7 | #endif 8 | int t; 9 | scanf ("%d%*c", &t); 10 | while(t--) 11 | { 12 | char a[30], ans[30], c[30]; 13 | scanf ("%s %s %s%*c", a,ans,c); 14 | printf ("%s will survive\n", ans); 15 | } 16 | return 0; 17 | } 18 | 19 | -------------------------------------------------------------------------------- /【ZOJ】/3838.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/3838.txt -------------------------------------------------------------------------------- /【ZOJ】/3839.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/3839.txt -------------------------------------------------------------------------------- /【ZOJ】/3865.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/3865.txt -------------------------------------------------------------------------------- /【ZOJ】/3890.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【ZOJ】/3890.txt -------------------------------------------------------------------------------- /【hihocoder】/1014.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1014.txt -------------------------------------------------------------------------------- /【hihocoder】/1015.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1015.txt -------------------------------------------------------------------------------- /【hihocoder】/1032.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1032.txt -------------------------------------------------------------------------------- /【hihocoder】/1044.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1044.txt -------------------------------------------------------------------------------- /【hihocoder】/1050.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1050.txt -------------------------------------------------------------------------------- /【hihocoder】/1055.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1055.txt -------------------------------------------------------------------------------- /【hihocoder】/1067.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1067.txt -------------------------------------------------------------------------------- /【hihocoder】/1096.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1096.txt -------------------------------------------------------------------------------- /【hihocoder】/1159.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1159.txt -------------------------------------------------------------------------------- /【hihocoder】/1233.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【hihocoder】/1233.txt -------------------------------------------------------------------------------- /【论文&&教程】/C++的pb_ds库在OI中的应用.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/C++的pb_ds库在OI中的应用.pdf -------------------------------------------------------------------------------- /【论文&&教程】/CLJ遗产.7z: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/CLJ遗产.7z -------------------------------------------------------------------------------- /【论文&&教程】/OI国家集训队论文.7z: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/OI国家集训队论文.7z -------------------------------------------------------------------------------- /【论文&&教程】/QTREE解法的一些研究.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/QTREE解法的一些研究.pdf -------------------------------------------------------------------------------- /【论文&&教程】/coding-叉姐.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/coding-叉姐.pdf -------------------------------------------------------------------------------- /【论文&&教程】/manacher算法(O(n)求最长子回文串).docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/manacher算法(O(n)求最长子回文串).docx -------------------------------------------------------------------------------- /【论文&&教程】/memset详解.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/memset详解.doc -------------------------------------------------------------------------------- /【论文&&教程】/palindromic tree(回文树).pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/palindromic tree(回文树).pdf -------------------------------------------------------------------------------- /【论文&&教程】/十个利用矩阵乘法解决的经典题目(Maxtrix67).docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/十个利用矩阵乘法解决的经典题目(Maxtrix67).docx -------------------------------------------------------------------------------- /【论文&&教程】/单调队列优化 DP.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/单调队列优化 DP.pdf -------------------------------------------------------------------------------- /【论文&&教程】/博弈之取石子经典游戏.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/博弈之取石子经典游戏.doc -------------------------------------------------------------------------------- /【论文&&教程】/叉姐的魔法数据结构.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/叉姐的魔法数据结构.pdf -------------------------------------------------------------------------------- /【论文&&教程】/可持久化数据结构.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/可持久化数据结构.pdf -------------------------------------------------------------------------------- /【论文&&教程】/后缀数组——处理字符串的有力工具.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/后缀数组——处理字符串的有力工具.pdf -------------------------------------------------------------------------------- /【论文&&教程】/对块状链表的一点研究.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/对块状链表的一点研究.pdf -------------------------------------------------------------------------------- /【论文&&教程】/数与编程.chm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/数与编程.chm -------------------------------------------------------------------------------- /【论文&&教程】/状态压缩.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/状态压缩.doc -------------------------------------------------------------------------------- /【论文&&教程】/用单调性优化动态规划.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/用单调性优化动态规划.doc -------------------------------------------------------------------------------- /【论文&&教程】/电子书/C++Primer+中文第四版(pdf高清完整版).pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/电子书/C++Primer+中文第四版(pdf高清完整版).pdf -------------------------------------------------------------------------------- /【论文&&教程】/电子书/算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析/算法艺术与信息学竞赛习题.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/电子书/算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析/算法艺术与信息学竞赛习题.pdf -------------------------------------------------------------------------------- /【论文&&教程】/电子书/算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析/算法艺术与信息学竞赛学习指导.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/电子书/算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析/算法艺术与信息学竞赛学习指导.pdf -------------------------------------------------------------------------------- /【论文&&教程】/电子书/算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析/算法艺术与信息学竞赛题目完全解析.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/电子书/算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析/算法艺术与信息学竞赛题目完全解析.pdf -------------------------------------------------------------------------------- /【论文&&教程】/电子书/算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析/算法艺术与信息学竞赛（刘汝佳、黄亮 着）.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/电子书/算法艺术与信息学竞赛 刘汝佳等 +学习指导+习题+题目完全解析/算法艺术与信息学竞赛（刘汝佳、黄亮 着）.pdf -------------------------------------------------------------------------------- /【论文&&教程】/算法合集之《浅谈数位类统计问题》.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/算法合集之《浅谈数位类统计问题》.pdf -------------------------------------------------------------------------------- /【论文&&教程】/经典KMP算法(易理解).docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/经典KMP算法(易理解).docx -------------------------------------------------------------------------------- /【论文&&教程】/统计的力量——线段树详细教程.ppt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/统计的力量——线段树详细教程.ppt -------------------------------------------------------------------------------- /【论文&&教程】/背包问题九讲.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/背包问题九讲.pdf -------------------------------------------------------------------------------- /【论文&&教程】/邝斌的ACM模板.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/【论文&&教程】/邝斌的ACM模板.pdf -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/&&的前一个表达式为假时不执行后面的，或 相反/&& ; Before an expression for not performing behind false when.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/&&的前一个表达式为假时不执行后面的，或 相反/&& ; Before an expression for not performing behind false when.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/c4996安全提示解决/C4996 To solve the safety tips.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/c4996安全提示解决/C4996 To solve the safety tips.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/if中不能写成 90小于=a=小于100/Cannot write the 90 less than =a= less than 100 in 'if'.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/if中不能写成 90小于=a=小于100/Cannot write the 90 less than =a= less than 100 in 'if'.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/【各种细节问题】笔记/for循环嵌套使用.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/【各种细节问题】笔记/for循环嵌套使用.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/【各种细节问题】笔记/如何判断一个浮点型数字x的值是否为0.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/【各种细节问题】笔记/如何判断一个浮点型数字x的值是否为0.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/【各种细节问题】笔记/循环中更新部分的变量必须是整型 浮点型是个近似值.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/【各种细节问题】笔记/循环中更新部分的变量必须是整型 浮点型是个近似值.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/一元二次方程用do...while实现/一元二次方程用do...while实现.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/一元二次方程用do...while实现/一元二次方程用do...while实现.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/产生指定范围的随机数/产生指定范围的随机数.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/产生指定范围的随机数/产生指定范围的随机数.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/冒泡排序/冒泡排序.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/冒泡排序/冒泡排序.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/冒泡排序/冒泡排序可自定义长度.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/冒泡排序/冒泡排序可自定义长度.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/函数指针使用/函数指针使用.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/函数指针使用/函数指针使用.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/判断一个数字是否为回文数/判断是否为回文数.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/判断一个数字是否为回文数/判断是否为回文数.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/判断一个数是否为素数/判断一个数是否为素数.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/判断一个数是否为素数/判断一个数是否为素数.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/学生信息管理（分数排序）/学生信息管理（分数排序）.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/学生信息管理（分数排序）/学生信息管理（分数排序）.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/对三个数字排序/三个数字排序.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/对三个数字排序/三个数字排序.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/强制转换为float浮点型/Forcibly converted to floating-point.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/强制转换为float浮点型/Forcibly converted to floating-point.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/材料/data.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/材料/data.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/栈的初始化，出栈，压栈，清空栈，遍历输出/栈的初始化，出栈，压栈，清空栈，遍历输出.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/栈的初始化，出栈，压栈，清空栈，遍历输出/栈的初始化，出栈，压栈，清空栈，遍历输出.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/死机/system halted.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/死机/system halted.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/死机程序c/system halted use ‘C’.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/死机程序c/system halted use ‘C’.c -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/求1到100之间的奇数之和与偶数之和/求1到100之间的奇数之和与偶数之和.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/求1到100之间的奇数之和与偶数之和/求1到100之间的奇数之和与偶数之和.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/求1到100之间的奇数的平均值/Average between 1 to 100 odd.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/求1到100之间的奇数的平均值/Average between 1 to 100 odd.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/求1和100之间的所有奇数的和/Between 1 and 100 of all odd and.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/求1和100之间的所有奇数的和/Between 1 and 100 of all odd and.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/求斐波拉契序列中的各项值/求斐波拉契序列各项值.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/求斐波拉契序列中的各项值/求斐波拉契序列各项值.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/清除上次scanf输入的垃圾数据/The last garbage data input for'scanf'.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/清除上次scanf输入的垃圾数据/The last garbage data input for'scanf'.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/用指针在单独函数中调用主函数完成数值互换/用指针在单独函数中调用主函数完成数值互换.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/用指针在单独函数中调用主函数完成数值互换/用指针在单独函数中调用主函数完成数值互换.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/跨函数使用内存（动态内存）/跨函数使用内存（动态内存）.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/跨函数使用内存（动态内存）/跨函数使用内存（动态内存）.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/输入注意.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/输入注意.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/输出二维数组的值/输出二维数组的值.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/输出二维数组的值/输出二维数组的值.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/通过函数对结构体变量输入输出/通过函数对结构体变量输入输出.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/通过函数对结构体变量输入输出/通过函数对结构体变量输入输出.cpp -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/链表创建，删除，插入，排序，输出/链表创建，删除，插入，排序，输出.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/链表创建，删除，插入，排序，输出/链表创建，删除，插入，排序，输出.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/静态循环队列的出队，入队，创建，是否空满，输出/静态循环队列的出队，入队，创建，是否空满，输出.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/静态循环队列的出队，入队，创建，是否空满，输出/静态循环队列的出队，入队，创建，是否空满，输出.txt -------------------------------------------------------------------------------- /初学的时候C程序源码以及问题解决/龌龊程序/Dirty program.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/初学的时候C程序源码以及问题解决/龌龊程序/Dirty program.cpp -------------------------------------------------------------------------------- /我最初学的算法/C++map,vector/C++map用法.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/C++map,vector/C++map用法.txt -------------------------------------------------------------------------------- /我最初学的算法/C++map,vector/C++vector用法.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/C++map,vector/C++vector用法.txt -------------------------------------------------------------------------------- /我最初学的算法/HDOJ题目分类排序 Bin神的.xls: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/HDOJ题目分类排序 Bin神的.xls -------------------------------------------------------------------------------- /我最初学的算法/《训练指南-习题代码》.rar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/《训练指南-习题代码》.rar -------------------------------------------------------------------------------- /我最初学的算法/《训练指南例题代码》.rar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/《训练指南例题代码》.rar -------------------------------------------------------------------------------- /我最初学的算法/【1我的算法总结ppt】/图的深广度搜索.ppt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【1我的算法总结ppt】/图的深广度搜索.ppt -------------------------------------------------------------------------------- /我最初学的算法/【专题】位运算/位运算不用TEMP交换变量/位运算不用TEMP交换变量.txt: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () 4 | { 5 | int a = 100, b = 54; 6 | a ^= b; 7 | b ^= a; 8 | a ^= b; 9 | printf ("a = %d\nb = %d\n", a, b); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /我最初学的算法/【专题】位运算/位运算枚举子集加状态压缩题/UVA11205.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】位运算/位运算枚举子集加状态压缩题/UVA11205.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-01背包问题/HDU2602.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-01背包问题/HDU2602.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-03多重背包/POJ1276.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-03多重背包/POJ1276.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-04混合背包(多重背包二进制拆分)/HDU2844(完全背包+多重背包).txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-04混合背包(多重背包二进制拆分)/HDU2844(完全背包+多重背包).txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-05二维费用背包/HDU2159(二维完全背包).txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-05二维费用背包/HDU2159(二维完全背包).txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-05二维费用背包/HDU3496(二维0-1背包).txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-05二维费用背包/HDU3496(二维0-1背包).txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-06分组背包/HDU1712(模版，每组最多选一个).txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-06分组背包/HDU1712(模版，每组最多选一个).txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-06分组背包/HDU3033(每组至少选一个).txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-06分组背包/HDU3033(每组至少选一个).txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-06分组背包/HDU3535(上面两种分组背包+不压缩01背包).txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-06分组背包/HDU3535(上面两种分组背包+不压缩01背包).txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-07依赖背包/HDU3449.txt: -------------------------------------------------------------------------------- 1 | http://blog.csdn.net/u012760629/article/details/24841443 -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-LCIS(最长公共上升子序列)/博客.txt: -------------------------------------------------------------------------------- 1 | http://blog.csdn.net/u012760629/article/details/25912971 -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-LCS（最长公共子序列）/博客.txt: -------------------------------------------------------------------------------- 1 | http://blog.csdn.net/u012760629/article/details/25481887 -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-LIS（最长上升子序列）/我的博客.txt: -------------------------------------------------------------------------------- 1 | http://blog.csdn.net/u012760629/article/details/25505805 -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-区间DP/NYOJ737石子归并.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-区间DP/NYOJ737石子归并.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-区间DP/括号匹配.txt: -------------------------------------------------------------------------------- 1 | http://blog.csdn.net/u012760629/article/details/25117005 -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-区间DP/矩阵链乘详解(转载).txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-区间DP/矩阵链乘详解(转载).txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-嵌套矩形/NYOJ16.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】动态规划/DP-嵌套矩形/NYOJ16.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】动态规划/DP-树形DP/HDU1520.txt: -------------------------------------------------------------------------------- 1 | http://blog.csdn.net/u012760629/article/details/27071205 -------------------------------------------------------------------------------- /我最初学的算法/【专题】排序/字母重排/字母重排.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】排序/字母重排/字母重排.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】排序/字母重排/输入输出.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】排序/字母重排/输入输出.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】排序/字母重排/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】排序/字母重排/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】排序/快速排序/快速排序.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】排序/快速排序/快速排序.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/DFS生成1~10中选取n个数的排列/DFS生成1~10中选取n个数的排列.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/DFS生成1~10中选取n个数的排列/DFS生成1~10中选取n个数的排列.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/优先队列优化BFS，并用四维vis/UVA10047.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/优先队列优化BFS，并用四维vis/UVA10047.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/八数码问题BFS+VIS大数组实现/POJ1077八数码问题BFS+VIS大数组实现.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/八数码问题BFS+VIS大数组实现/POJ1077八数码问题BFS+VIS大数组实现.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/八皇后问题/八皇后问题.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/八皇后问题/八皇后问题.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/奇偶剪枝/奇偶剪枝.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/奇偶剪枝/奇偶剪枝.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/有环图的最短路(这里用DFS可以用spfa算法)/UVA100557.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/有环图的最短路(这里用DFS可以用spfa算法)/UVA100557.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/用DFS实现拓扑排序/用DFS实现拓扑排序.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/用DFS实现拓扑排序/用DFS实现拓扑排序.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/马踏棋盘深搜加回溯/图示.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/马踏棋盘深搜加回溯/图示.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/马踏棋盘深搜加回溯/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/马踏棋盘深搜加回溯/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】搜索/马踏棋盘深搜加回溯/马踏棋盘深搜加回溯.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】搜索/马踏棋盘深搜加回溯/马踏棋盘深搜加回溯.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/二维队列应用/uva540.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/二维队列应用/uva540.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/先序创建二叉树，层序遍历输出/先序创建二叉树，层序遍历输出.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/先序创建二叉树，层序遍历输出/先序创建二叉树，层序遍历输出.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/判断一个序列是否可图(Havel-Hakimi定理)/Havel-Hakimi定理.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/判断一个序列是否可图(Havel-Hakimi定理)/Havel-Hakimi定理.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/判断先序输入的树是否为完全二叉树的两种方法/判断先序输入的树是否为完全二叉树的两种方法.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/判断先序输入的树是否为完全二叉树的两种方法/判断先序输入的树是否为完全二叉树的两种方法.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/判断先序输入的树是否为完全二叉树的两种方法/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/判断先序输入的树是否为完全二叉树的两种方法/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/合并两个递增链表后递减输出/合并两个递增链表后递减输出.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/合并两个递增链表后递减输出/合并两个递增链表后递减输出.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/合并两个递增链表后递减输出/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/合并两个递增链表后递减输出/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/图的两种遍历/图.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/图的两种遍历/图.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/图的两种遍历/图的两种遍历.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/图的两种遍历/图的两种遍历.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/寻找字符串最小循环周期/寻找字符串最小循环周期.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/寻找字符串最小循环周期/寻找字符串最小循环周期.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/寻找字符串最小循环周期/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/寻找字符串最小循环周期/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/快速查找链表中间元素/快速查找链表中间元素.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/快速查找链表中间元素/快速查找链表中间元素.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/按访问频率调整链表顺序/按访问频率调整链表顺序.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/按访问频率调整链表顺序/按访问频率调整链表顺序.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/按访问频率调整链表顺序/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/按访问频率调整链表顺序/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/有向图的连通性判断/UVA10129.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/有向图的连通性判断/UVA10129.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/树状数组【更新单点查询区间】/利用树状数组解决几类问题.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/树状数组【更新单点查询区间】/利用树状数组解决几类问题.doc -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/树状数组【更新单点查询区间】/树状数组.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/树状数组【更新单点查询区间】/树状数组.pdf -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/树状数组【更新单点查询区间】/树状数组入门教程.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/树状数组【更新单点查询区间】/树状数组入门教程.pdf -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/根据树的中，后序遍历直接遍历整个树/代码uva548.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/根据树的中，后序遍历直接遍历整个树/代码uva548.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/欧拉回路输出/欧拉回路压栈倒序输出.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/欧拉回路输出/欧拉回路压栈倒序输出.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/约瑟夫问题/约瑟夫问题.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/约瑟夫问题/约瑟夫问题.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/约瑟夫问题/题目1.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/约瑟夫问题/题目1.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/约瑟夫问题/题目2.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/约瑟夫问题/题目2.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/线段树HDU1166/HDU1166.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/线段树HDU1166/HDU1166.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数据结构/魔术师发牌问题/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数据结构/魔术师发牌问题/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/A+B的进位次数/A+B的进位次数.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/A+B的进位次数/A+B的进位次数.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/A+B的进位次数/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/A+B的进位次数/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/RSA随机加密解密/RSA随机加密解密.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/RSA随机加密解密/RSA随机加密解密.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/cantor数表/cantor数表.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/cantor数表/cantor数表.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/cantor数表/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/cantor数表/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/一个椭圆边上的N个点两两相连最多把椭圆分成几块/一个椭圆边上的N个点两两相连最多把椭圆分成几块.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/一个椭圆边上的N个点两两相连最多把椭圆分成几块/一个椭圆边上的N个点两两相连最多把椭圆分成几块.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/一个椭圆边上的N个点两两相连最多把椭圆分成几块/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/一个椭圆边上的N个点两两相连最多把椭圆分成几块/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/分解素因子/分解素因子.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/分解素因子/分解素因子.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/判断坐标系中任意一点是否在三角形内/公式.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/判断坐标系中任意一点是否在三角形内/公式.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/判断坐标系中任意一点是否在三角形内/判断原理.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/判断坐标系中任意一点是否在三角形内/判断原理.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/判断坐标系中任意一点是否在三角形内/判断坐标系中任意一点是否在三角形内.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/判断坐标系中任意一点是否在三角形内/判断坐标系中任意一点是否在三角形内.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/判断坐标系中任意一点是否在三角形内/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/判断坐标系中任意一点是否在三角形内/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/因子和阶乘/因子和阶乘.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/因子和阶乘/因子和阶乘.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/因子和阶乘/题目.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/因子和阶乘/题目.jpg -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/计算a的n次方除以s的余数/计算a的n次方除以s的余数.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/计算a的n次方除以s的余数/计算a的n次方除以s的余数.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/辗转相除法求最大公约数和最小公倍数/最大公约数.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/辗转相除法求最大公约数和最小公倍数/最大公约数.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/辗转相除法求最大公约数和最小公倍数/最小公倍数.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/辗转相除法求最大公约数和最小公倍数/最小公倍数.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/高精度阶乘/hdu1042【10000进制】.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/高精度阶乘/hdu1042【10000进制】.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】数论/高精度阶乘/hdu1042【10进制】.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】数论/高精度阶乘/hdu1042【10进制】.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】贪心/最大连续子序列和/HDU1231(原理版).txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】贪心/最大连续子序列和/HDU1231(原理版).txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】贪心/最大连续子矩阵和/UVA108.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】贪心/最大连续子矩阵和/UVA108.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】贪心/用赫夫曼编码压缩和解压/用赫夫曼编码压缩和解压.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】贪心/用赫夫曼编码压缩和解压/用赫夫曼编码压缩和解压.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】递推/汉诺塔/杭电2064汉诺塔Ⅲ实现.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】递推/汉诺塔/杭电2064汉诺塔Ⅲ实现.txt -------------------------------------------------------------------------------- /我最初学的算法/【专题】递推/汉诺塔/汉诺塔.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/【专题】递推/汉诺塔/汉诺塔.txt -------------------------------------------------------------------------------- /我最初学的算法/图灵教育-算法书.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/图灵教育-算法书.txt -------------------------------------------------------------------------------- /我最初学的算法/我的博客.txt: -------------------------------------------------------------------------------- 1 | dawxy.com -------------------------------------------------------------------------------- /我最初学的算法/算法需要的时间对照表.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我最初学的算法/算法需要的时间对照表.jpg -------------------------------------------------------------------------------- /我的ACM模版.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我的ACM模版.docx -------------------------------------------------------------------------------- /我的各OJ账号.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dawxy/ACM-CODER/94e5f4101cfffb1bb4963956e8fe89d59f9e3299/我的各OJ账号.txt --------------------------------------------------------------------------------