├── .gitignore ├── README.md ├── acm-icpc ├── 2012 │ ├── Greater_New_York │ │ ├── A.cc │ │ ├── B.cc │ │ ├── D.cc │ │ ├── F.cc │ │ └── X.cc │ └── chang_chun │ │ └── k.cc └── 2013 │ └── world_final │ ├── A │ ├── A.cc │ ├── D.cc │ ├── D.java │ ├── F.cc │ ├── H.cc │ └── J.cc ├── codechef ├── PALIN └── PALIN.cc ├── codeforces ├── 31 │ ├── D │ └── D.cc ├── 226 │ └── E.cc ├── 295 │ ├── A.cc │ └── B.cc ├── 301 │ ├── B.cc │ └── D.cc ├── 312 │ ├── A.cc │ └── B.cc ├── 313 │ ├── A.cc │ └── B.cc ├── 318 │ └── B.cc └── 320 │ ├── A.cc │ ├── B.cc │ ├── C.cc │ ├── D.cc │ └── E.cc ├── hackerrank ├── Bit Manipulation │ ├── 2's complement │ │ └── main.cc │ ├── Changing Bits │ │ └── main.cc │ ├── Manipulative Numbers │ │ └── main.cc │ └── String Transmission │ │ └── main.cc ├── Dynamic Programming │ ├── Candies │ │ └── mainc.cc │ ├── Count Scorecards │ │ └── main.cc │ ├── Interval Selection │ │ └── main.cc │ ├── Lego Blocks │ │ └── main.cc │ ├── Lucky Numbers │ │ └── main.cc │ ├── Stock Maximize │ │ └── main.cc │ └── Vertical Sticks │ │ └── main.cc ├── Graph Theory │ ├── Clique │ │ └── main.cc │ ├── Even Tree │ │ └── main.cc │ ├── Grid Walking │ │ └── main.cc │ └── Problem solving │ │ └── main.cc ├── Machine Learning │ ├── Basic Spell Checker │ │ └── main.cc │ ├── Dota2 Game Prediction │ │ ├── main.cc │ │ └── main.py │ └── From Paragraphs to Sentences │ │ └── main.cc ├── Math │ ├── Equations │ │ └── main.cc │ ├── Permutation game │ │ └── main.cc │ ├── Picking Cards │ │ └── main.cc │ ├── Stars │ │ └── main.cc │ ├── Stone Piles │ │ └── main.cc │ ├── String Reduction │ │ └── main.cc │ └── Subsequence Weighting │ │ └── main.cc ├── Search │ ├── Billboards │ │ └── main.cc │ ├── Coin on the Table │ │ └── main.cc │ ├── Encryption │ │ └── main.cc │ ├── Flowers │ │ └── main.cc │ ├── Median │ │ └── main.cc │ ├── Pairs │ │ └── main.cc │ ├── Task Scheduling │ │ └── main.cc │ └── Triplets │ │ └── main.cc ├── Sorting │ └── Insertion Sort Advanced Analysis │ │ └── main.cc └── Strings │ ├── Fraud Prevention │ └── main.cc │ ├── Square Subsequences │ └── main.cc │ ├── String Similarity │ └── main.cc │ └── Substring Diff │ └── main.cc ├── leetcode ├── Anagrams.cc ├── Balanced Binary Tree.cc ├── Binary Tree Maximum Path Sum.cc ├── Convert Sorted Array to Binary Search Tree.cc ├── Convert Sorted List to Binary Search Tree.cc ├── Count and Say.cc ├── First Missing Positive.cc ├── Insert Interval.cc ├── Interleaving String.cc ├── Jump Game.cc ├── Multiply Strings.cc ├── Path Sum II.cc ├── Path Sum.cc ├── Simplify Path.cc ├── Sort Colors.cc ├── Symmetric Tree.cc ├── Trapping Rain Water.cc ├── Triangle.cc └── Word Ladder.cc ├── poj ├── 1000 │ └── POJ_1000_1997994_AC_0MS_48K.c ├── 1001 │ └── POJ_1001_2054894_AC_0MS_48K.c ├── 1002 │ └── POJ_1002_2143454_AC_247MS_456K.cc ├── 1003 │ └── POJ_1003_2085196_AC_0MS_60K.c ├── 1004 │ └── POJ_1004_2050534_AC_0MS_60K.c ├── 1005 │ └── POJ_1005_2147489_AC_0MS_60K.c ├── 1006 │ └── POJ_1006_2421340_AC_15MS_40K.cpp ├── 1007 │ └── POJ_1007_2160623_AC_15MS_12K.c ├── 1008 │ └── POJ_1008_2574573_AC_0MS_76K.cpp ├── 1009 │ └── POJ_1009_4110862_AC_16MS_460K.cc ├── 1011 │ └── POJ_1011_2246412_AC_0MS_64K.cpp ├── 1012 │ └── POJ_1012_2274752_AC_0MS_60K.cpp ├── 1013 │ └── POJ_1013_2146507_AC_0MS_48K.c ├── 1014 │ ├── POJ_1014_2192329_AC_46MS_1000K.cpp │ └── POJ_1014_2406398_AC_0MS_608K.cpp ├── 1016 │ └── POJ_1016_2421441_AC_342MS_124K.cpp ├── 1017 │ └── POJ_1017_2438634_AC_31MS_120K.cpp ├── 1018 │ └── POJ_1018_2166433_AC_31MS_156K.cpp ├── 1019 │ └── POJ_1019_2072839_AC_0MS_40K.c ├── 1028 │ ├── POJ_1028_2140121_AC_0MS_80K.cpp │ └── POJ_1028_2140518_AC_0MS_56K.cpp ├── 1029 │ └── POJ_1029_4188979_AC_63MS_584K.cc ├── 1032 │ └── POJ_1032_2421595_AC_0MS_40K.cpp ├── 1035 │ └── POJ_1035_2627693_AC_247MS_376K.cpp ├── 1045 │ └── POJ_1045_2438669_AC_0MS_52K.cpp ├── 1046 │ └── POJ_1046_2438679_AC_0MS_48K.cpp ├── 1047 │ └── POJ_1047_2140678_AC_0MS_48K.cpp ├── 1050 │ ├── POJ_1050_2277707_AC_15MS_100K.cpp │ ├── POJ_1050_2277708_AC_15MS_80K.cc │ └── POJ_1050_2277709_AC_0MS_80K.c ├── 1061 │ ├── POJ_1061_2062862_AC_655MS_12K.c │ └── POJ_1061_2230742_AC_671MS_24K.cpp ├── 1063 │ └── POJ_1063_2438716_AC_0MS_24K.cpp ├── 1065 │ └── POJ_1065_5912080_AC_32MS_292K.cpp ├── 1067 │ └── POJ_1067_2049434_AC_0MS_132K.cpp ├── 1068 │ └── POJ_1068_2279340_AC_0MS_44K.c ├── 1079 │ └── POJ_1079_2194715_AC_0MS_72K.cpp ├── 1080 │ ├── POJ_1080_2660672_AC_0MS_348K.cc │ └── POJ_1080_2660706_AC_0MS_232K.cc ├── 1083 │ └── POJ_1083_2204233_AC_0MS_24K.cpp ├── 1087 │ └── POJ_1087_3782684_AC_47MS_4148K.cpp ├── 1088 │ └── POJ_1088_2261151_AC_125MS_336K.cpp ├── 1094 │ ├── POJ_1094_2582453_AC_15MS_80K.cpp │ └── POJ_1094_2582457_AC_15MS_172K.cc ├── 1095 │ └── POJ_1095_2427608_AC_31MS_52K.cpp ├── 1101 │ ├── POJ_1101_2557288_AC_0MS_144K.cpp │ ├── POJ_1101_2557334_AC_0MS_100K.cpp │ └── POJ_1101_2557335_AC_0MS_92K.cpp ├── 1102 │ ├── POJ_1102_2834615_AC_0MS_216K.cc │ └── POJ_1102_2834621_AC_0MS_216K.cc ├── 1113 │ ├── POJ_1113_2500587_AC_0MS_152K.cpp │ ├── POJ_1113_2500593_AC_0MS_152K.cpp │ ├── POJ_1113_2500674_AC_0MS_152K.cpp │ └── POJ_1113_5616597_AC_16MS_172K.cpp ├── 1117 │ └── POJ_1117_3088533_AC_15MS_156K.cpp ├── 1118 │ └── POJ_1118_5359115_AC_1000MS_220K.cpp ├── 1122 │ └── POJ_1122_2413173_AC_15MS_44K.cpp ├── 1125 │ └── POJ_1125_5896548_AC_16MS_248K.cpp ├── 1128 │ ├── POJ_1128_3166456_AC_32MS_224K.cpp │ └── POJ_1128_3243843_AC_0MS_208K.cpp ├── 1132 │ └── POJ_1132_3242247_AC_16MS_300K.cc ├── 1140 │ └── POJ_1140_2192319_AC_0MS_212K.cpp ├── 1141 │ └── POJ_1141_3092395_AC_60MS_316K.cpp ├── 1142 │ └── POJ_1142_2227728_AC_15MS_36K.cpp ├── 1149 │ ├── POJ_1149_3776711_AC_47MS_4128K.cpp │ └── POJ_1149_3776966_AC_47MS_4120K.cpp ├── 1150 │ └── POJ_1150_2734443_AC_0MS_76K.cpp ├── 1151 │ └── POJ_1151_3569137_AC_16MS_240K.cpp ├── 1152 │ ├── POJ_1152_2891093_AC_15MS_164K.cpp │ └── POJ_1152_2891095_AC_0MS_288K.cc ├── 1154 │ └── POJ_1154_2454992_AC_15MS_108K.cpp ├── 1159 │ ├── POJ_1159_2429549_AC_1857MS_40508K.cpp │ ├── POJ_1159_2430080_AC_2074MS_68K.cpp │ ├── POJ_1159_2430100_AC_1700MS_68K.cpp │ └── POJ_1159_2430145_AC_1590MS_68K.cpp ├── 1160 │ └── POJ_1160_6255739_AC_1735MS_3980K.java ├── 1163 │ └── POJ_1163_2150937_AC_15MS_84K.cpp ├── 1166 │ └── POJ_1166_3243835_AC_344MS_3544K.cpp ├── 1171 │ ├── POJ_1171_3650677_AC_250MS_208K.cpp │ ├── POJ_1171_3650834_AC_235MS_208K.cpp │ └── POJ_1171_3650836_AC_344MS_356K.cc ├── 1174 │ └── POJ_1174_3242667_AC_1422MS_2444K.cc ├── 1177 │ └── POJ_1177_3794465_AC_329MS_2884K.cpp ├── 1182 │ └── POJ_1182_2356197_AC_200MS_452K.cpp ├── 1183 │ └── POJ_1183_2082391_AC_15MS_48K.c ├── 1201 │ └── POJ_1201.cc ├── 1207 │ ├── POJ_1207_2188575_AC_31MS_60K.cpp │ └── POJ_1207_2201405_AC_31MS_24K.cpp ├── 1218 │ ├── POJ_1218_2152098_AC_0MS_48K.cpp │ └── POJ_1218_2235451_AC_0MS_32K.cpp ├── 1222 │ └── POJ_1222_2834485_AC_15MS_216K.cc ├── 1230 │ └── POJ_1230_3257944_AC_16MS_288K.cc ├── 1237 │ └── POJ_1237_3784951_AC_0MS_184K.cpp ├── 1247 │ └── POJ_1247_5365787_AC_0MS_752K.cc ├── 1250 │ └── POJ_1250_2513503_AC_0MS_120K.cpp ├── 1252 │ └── POJ_1252_4988949_AC_0MS_396K.cc ├── 1254 │ └── POJ_1254_4988954_AC_0MS_336K.cc ├── 1255 │ └── POJ_1255_4988964_AC_0MS_456K.cc ├── 1256 │ └── POJ_1256_5896773_AC_63MS_196K.cpp ├── 1258 │ └── POJ_1258_2405933_AC_15MS_100K.cc ├── 1273 │ ├── POJ_1273_3092765_AC_15MS_324K.cpp │ ├── POJ_1273_3092798_AC_0MS_468K.cpp │ ├── POJ_1273_3092807_AC_0MS_468K.cpp │ ├── POJ_1273_3092811_AC_0MS_468K.cpp │ ├── POJ_1273_3092816_AC_15MS_468K.cpp │ ├── POJ_1273_3092819_AC_0MS_468K.cpp │ └── POJ_1273_3093146_AC_15MS_620K.cpp ├── 1274 │ └── POJ_1274_5365691_AC_0MS_904K.cc ├── 1279 │ └── POJ_1279_3171823_AC_156MS_432K.cc ├── 1286 │ ├── POJ_1286_2774398_AC_15MS_140K.cpp │ ├── POJ_1286_2774510_AC_0MS_144K.cpp │ └── POJ_1286_2774520_AC_0MS_144K.cpp ├── 1298 │ └── POJ_1298_2264509_AC_0MS_52K.cpp ├── 1306 │ ├── POJ_1306_2339405_AC_0MS_124K.cpp │ ├── POJ_1306_2339409_AC_0MS_124K.cpp │ ├── POJ_1306_2339584_AC_0MS_48K.cpp │ ├── POJ_1306_2339594_AC_0MS_48K.cpp │ └── POJ_1306_2339595_AC_0MS_60K.cc ├── 1308 │ └── POJ_1308_2515098_AC_62MS_1120K.cpp ├── 1316 │ └── POJ_1316_2149257_AC_0MS_80K.c ├── 1323 │ └── POJ_1323_2424150_AC_0MS_44K.cpp ├── 1325 │ └── POJ_1325_5365947_AC_94MS_804K.cc ├── 1326 │ └── POJ_1326_5897103_AC_0MS_240K.cpp ├── 1329 │ └── POJ_1329_3192984_AC_0MS_240K.cc ├── 1330 │ └── POJ_1330_2440419_AC_15MS_100K.cpp ├── 1338 │ └── POJ_1338_2339660_AC_0MS_60K.cc ├── 1348 │ └── POJ_1348_2840677_AC_46MS_168K.cpp ├── 1349 │ ├── POJ_1349_2836184_AC_15MS_196K.cpp │ └── POJ_1349_2836190_AC_0MS_152K.cpp ├── 1350 │ └── POJ_1350_2145144_AC_0MS_44K.c ├── 1351 │ └── POJ_1351_2836845_AC_0MS_148K.cpp ├── 1354 │ ├── POJ_1354_2834859_AC_78MS_216K.cc │ ├── POJ_1354_2834860_AC_93MS_148K.cpp │ ├── POJ_1354_2834890_AC_93MS_72K.cpp │ └── POJ_1354_2834892_AC_31MS_216K.cc ├── 1362 │ └── POJ_1362_3633442_AC_0MS_292K.cc ├── 1363 │ └── POJ_1363_2413322_AC_15MS_48K.cpp ├── 1383 │ └── POJ_1383_2645107_AC_593MS_5424K.cpp ├── 1398 │ └── POJ_1398_4170253_AC_235MS_352K.c ├── 1401 │ ├── POJ_1401_2171254_AC_218MS_12K.cpp │ └── POJ_1401_2231730_AC_125MS_24K.cpp ├── 1405 │ └── POJ_1405_5452041_AC_907MS_5964K.java ├── 1423 │ └── POJ_1423_2220489_AC_0MS_124K.cpp ├── 1450 │ └── POJ_1450_3085468_AC_78MS_216K.cpp ├── 1455 │ └── POJ_1455_2405693_AC_0MS_56K.cc ├── 1456 │ └── POJ_1456_3713249_AC_79MS_384K.cpp ├── 1458 │ └── POJ_1458_2261372_AC_0MS_372K.cpp ├── 1463 │ └── POJ_1463_2554504_AC_203MS_172K.cpp ├── 1468 │ └── POJ_1468_2554804_AC_2781MS_144K.cpp ├── 1470 │ └── POJ_1470_2555221_AC_653MS_120K.cpp ├── 1477 │ └── POJ_1477_2150878_AC_15MS_48K.cpp ├── 1491 │ └── POJ_1491_6136897_AC_0MS_236K.cpp ├── 1496 │ ├── POJ_1496_2262369_AC_0MS_24K.cpp │ └── POJ_1496_2262422_AC_15MS_24K.cpp ├── 1503 │ └── POJ_1503_2140752_AC_0MS_52K.cpp ├── 1504 │ └── POJ_1504_2413979_AC_15MS_40K.cpp ├── 1505 │ └── POJ_1505_4255589_AC_94MS_756K.cc ├── 1506 │ └── POJ_1506_4296674_AC_141MS_316K.cc ├── 1507 │ └── POJ_1507_4260894_AC_63MS_684K.cpp ├── 1508 │ └── POJ_1508_4333264_AC_250MS_404K.cc ├── 1509 │ └── POJ_1509_3304628_AC_0MS_224K.cpp ├── 1511 │ ├── POJ_1511_4258677_AC_2188MS_48204K.cpp │ ├── POJ_1511_4258694_AC_3329MS_55612K.cpp │ └── POJ_1511_4258773_AC_3454MS_51148K.cpp ├── 1517 │ └── POJ_1517_2173077_AC_0MS_52K.cpp ├── 1519 │ └── POJ_1519_2070040_AC_0MS_104K.c ├── 1528 │ └── POJ_1528_2264448_AC_0MS_60K.cpp ├── 1543 │ ├── POJ_1543_2149310_AC_78MS_48K.c │ └── POJ_1543_2149323_AC_78MS_48K.c ├── 1546 │ └── POJ_1546_2187688_AC_0MS_60K.cpp ├── 1547 │ └── POJ_1547_5911896_AC_0MS_3364K.cpp ├── 1552 │ └── POJ_1552_2149280_AC_0MS_48K.c ├── 1562 │ └── POJ_1562_2246399_AC_0MS_76K.cpp ├── 1565 │ └── POJ_1565_2342120_AC_0MS_28K.cc ├── 1573 │ └── POJ_1573_5912176_AC_0MS_256K.cpp ├── 1579 │ ├── POJ_1579_2320202_AC_0MS_80K.cpp │ └── POJ_1579_2320207_AC_15MS_80K.cpp ├── 1595 │ └── POJ_1595_2221960_AC_0MS_24K.cpp ├── 1604 │ ├── POJ_1604_2224542_AC_0MS_72K.cpp │ ├── POJ_1604_2734426_AC_0MS_72K.cpp │ └── POJ_1604_4190828_AC_0MS_324K.cc ├── 1607 │ ├── POJ_1607_2440665_AC_31MS_72K.cpp │ ├── POJ_1607_2440673_AC_15MS_72K.cpp │ ├── POJ_1607_2440685_AC_15MS_72K.cpp │ ├── POJ_1607_2440686_AC_30MS_56K.cc │ └── POJ_1607_2440699_AC_31MS_56K.cc ├── 1611 │ ├── POJ_1611_3712769_AC_16MS_428K.cpp │ ├── POJ_1611_3712790_AC_16MS_428K.cpp │ ├── POJ_1611_5511981_AC_16MS_368K.cpp │ └── POJ_1611_5512005_AC_16MS_1132K.cc ├── 1633 │ ├── POJ_1633_4156921_AC_32MS_1648K.cc │ └── POJ_1633_4156923_AC_16MS_1644K.cc ├── 1634 │ └── POJ_1634_4156759_AC_2938MS_3236K.cc ├── 1635 │ ├── POJ_1635_3915533_AC_79MS_452K.cc │ ├── POJ_1635_3915534_AC_79MS_452K.cc │ └── POJ_1635_3915537_AC_0MS_376K.cc ├── 1636 │ └── POJ_1636_4155804_AC_79MS_628K.cpp ├── 1637 │ └── POJ_1637_4156798_AC_32MS_432K.cc ├── 1656 │ └── POJ_1656_2386898_AC_0MS_44K.cpp ├── 1657 │ └── POJ_1657_2370842_AC_0MS_68K.cpp ├── 1658 │ ├── POJ_1658_2146765_AC_0MS_48K.c │ └── POJ_1658_2146767_AC_0MS_48K.c ├── 1659 │ └── POJ_1659_3036066_AC_0MS_152K.cpp ├── 1661 │ └── POJ_1661_3036666_AC_15MS_184K.cpp ├── 1663 │ └── POJ_1663_2146807_AC_78MS_8K.c ├── 1664 │ ├── POJ_1664_2189991_AC_0MS_60K.cpp │ ├── POJ_1664_2189997_AC_0MS_60K.cpp │ ├── POJ_1664_2189999_AC_0MS_60K.cpp │ └── POJ_1664_2402836_AC_0MS_56K.cpp ├── 1665 │ └── POJ_1665_2148894_AC_0MS_60K.c ├── 1674 │ ├── POJ_1674_2246421_AC_765MS_60K.cpp │ └── POJ_1674_2262533_AC_62MS_164K.cc ├── 1690 │ └── POJ_1690_2620011_AC_0MS_168K.cc ├── 1693 │ └── POJ_1693_3023671_AC_203MS_4304K.cpp ├── 1696 │ ├── POJ_1696_2624969_AC_0MS_168K.cc │ └── POJ_1696_2624977_AC_0MS_80K.cpp ├── 1699 │ └── POJ_1699_3188602_AC_31MS_164K.cpp ├── 1700 │ └── POJ_1700_2725079_AC_0MS_76K.cpp ├── 1701 │ └── POJ_1701_2680100_AC_0MS_112K.cpp ├── 1702 │ └── POJ_1702_3186063_AC_15MS_148K.cpp ├── 1703 │ ├── POJ_1703_2475244_AC_265MS_904K.cpp │ └── POJ_1703_2475262_AC_546MS_964K.cc ├── 1704 │ ├── POJ_1704_3187130_AC_0MS_148K.cpp │ └── POJ_1704_3257971_AC_0MS_292K.cc ├── 1715 │ ├── POJ_1715_3193832_AC_0MS_220K.cc │ └── POJ_1715_3193834_AC_0MS_148K.cpp ├── 1730 │ └── POJ_1730_2407610_AC_0MS_56K.cpp ├── 1731 │ └── POJ_1731_2861365_AC_30MS_200K.cc ├── 1737 │ └── POJ_1737_3229549_AC_79MS_336K.cpp ├── 1743 │ └── POJ_1743_2847561_AC_796MS_928K.cc ├── 1745 │ ├── POJ_1745_2265238_AC_887MS_60K.cpp │ ├── POJ_1745_2265239_AC_75MS_60K.cpp │ └── POJ_1745_2265268_AC_512MS_60K.cpp ├── 1775 │ ├── POJ_1775_2232482_AC_46MS_28K.cpp │ ├── POJ_1775_2232493_AC_31MS_28K.cpp │ ├── POJ_1775_2232510_AC_46MS_28K.cpp │ └── POJ_1775_2232512_AC_31MS_28K.cpp ├── 1797 │ ├── POJ_1797_2478791_AC_421MS_4048K.cpp │ └── POJ_1797_2478901_AC_234MS_1256K.cpp ├── 1799 │ └── POJ_1799_2405576_AC_31MS_80K.cc ├── 1811 │ ├── POJ_1811_3845946_AC_954MS_204K.cpp │ ├── POJ_1811_3850922_AC_1032MS_204K.cpp │ ├── POJ_1811_3976226_AC_1422MS_204K.cpp │ ├── POJ_1811_3976230_AC_1407MS_204K.cpp │ └── POJ_1811_3976231_AC_719MS_316K.cc ├── 1812 │ ├── POJ_1812_3652664_AC_32MS_340K.cc │ └── POJ_1812_3652685_AC_32MS_344K.cc ├── 1818 │ └── POJ_1818_5451914_AC_110MS_700K.cc ├── 1828 │ └── POJ_1828_2935378_AC_171MS_472K.cpp ├── 1833 │ └── POJ_1833_2519512_AC_250MS_120K.cpp ├── 1835 │ ├── POJ_1835_5505230_AC_172MS_132K.cpp │ └── POJ_1835_5505337_AC_172MS_132K.cpp ├── 1840 │ └── POJ_1840_5959820_AC_532MS_1480K.cpp ├── 1844 │ └── POJ_1844_2246406_AC_0MS_32K.cpp ├── 1845 │ └── POJ_1845_5705207_AC_0MS_264K.cpp ├── 1850 │ ├── POJ_1850_2262421_AC_264MS_24K.cpp │ ├── POJ_1850_2262449_AC_45MS_24K.cpp │ └── POJ_1850_2501129_AC_0MS_188K.cc ├── 1860 │ └── POJ_1860_2690561_AC_0MS_96K.cpp ├── 1862 │ └── POJ_1862_2442656_AC_15MS_60K.cc ├── 1870 │ └── POJ_1870_2753516_AC_93MS_88K.cpp ├── 1894 │ └── POJ_1894_5711026_AC_32MS_208K.cpp ├── 1896 │ └── POJ_1896_5711022_AC_422MS_160K.cpp ├── 1899 │ └── POJ_1899_5711017_AC_63MS_228K.cpp ├── 1904 │ └── POJ_1904_4655919_AC_7391MS_22868K.cpp ├── 1906 │ └── POJ_1906_3192904_AC_31MS_224K.cc ├── 1915 │ ├── POJ_1915_2267578_AC_203MS_492K.c │ ├── POJ_1915_2267594_AC_250MS_456K.c │ └── POJ_1915_2267622_AC_0MS_60K.c ├── 1922 │ └── POJ_1922_2264343_AC_0MS_60K.cpp ├── 1923 │ └── POJ_1923_2800560_AC_0MS_1236K.cpp ├── 1926 │ └── POJ_1926_2625068_AC_15MS_212K.cpp ├── 1928 │ └── POJ_1928_2623687_AC_15MS_212K.cc ├── 1936 │ └── POJ_1936_2166006_AC_0MS_204K.c ├── 1944 │ └── POJ_1944_3035713_AC_419MS_232K.c ├── 1945 │ ├── POJ_1945_5769151_AC_625MS_14104K.cpp │ └── POJ_1945_5769194_AC_579MS_14104K.cpp ├── 1947 │ ├── POJ_1947_3032960_AC_0MS_544K.cc │ └── POJ_1947_3032996_AC_0MS_544K.cc ├── 1948 │ ├── POJ_1948_3030853_AC_947MS_5236K.cpp │ ├── POJ_1948_3031596_AC_245MS_3524K.cpp │ └── POJ_1948_3031597_AC_106MS_3576K.cc ├── 1949 │ └── POJ_1949_3030158_AC_296MS_3880K.cpp ├── 1950 │ └── POJ_1950_3030400_AC_186MS_148K.cpp ├── 1951 │ └── POJ_1951_3030114_AC_0MS_144K.cpp ├── 1952 │ ├── POJ_1952_3028085_AC_154MS_528K.cpp │ └── POJ_1952_3028092_AC_46MS_592K.cc ├── 1953 │ └── POJ_1953_2861170_AC_0MS_64K.cpp ├── 1961 │ ├── POJ_1961_5493039_AC_188MS_6516K.cpp │ ├── POJ_1961_5493066_AC_141MS_6516K.cpp │ ├── POJ_1961_5497111_AC_391MS_6516K.cpp │ ├── POJ_1961_5497142_AC_172MS_6516K.cpp │ └── POJ_1961_5497188_AC_157MS_6516K.cpp ├── 1969 │ └── POJ_1969_2219975_AC_0MS_24K.cpp ├── 1978 │ └── POJ_1978_2675924_AC_0MS_72K.cpp ├── 1979 │ └── POJ_1979_2896064_AC_15MS_972K.cc ├── 1984 │ └── POJ_1984_6257241_AC_172MS_1792K.cpp ├── 1988 │ ├── POJ_1988_2475912_AC_370MS_23684K.cc │ └── POJ_1988_2476058_AC_324MS_8016K.cc ├── 1989 │ └── POJ_1989_4338661_AC_157MS_836K.cc ├── 1990 │ └── POJ_1990_4339137_AC_172MS_2524K.cc ├── 1991 │ ├── POJ_1991_4349229_AC_110MS_8392K.cc │ └── POJ_1991_4349230_AC_94MS_8392K.cc ├── 1992 │ └── POJ_1992_3044250_AC_93MS_5544K.cpp ├── 1993 │ └── POJ_1993_3044287_AC_31MS_420K.cpp ├── 1995 │ └── POJ_1995_3044203_AC_109MS_148K.cpp ├── 1999 │ ├── POJ_1999_3047009_AC_984MS_4728K.cc │ └── POJ_1999_3047016_AC_640MS_1788K.cc ├── 2000 │ ├── POJ_2000_2146836_AC_15MS_48K.c │ └── POJ_2000_2202200_AC_0MS_24K.cpp ├── 2001 │ └── POJ_2001_3803464_AC_0MS_504K.cpp ├── 2002 │ └── POJ_2002_3811190_AC_735MS_636K.cc ├── 2003 │ └── POJ_2003_3887645_AC_329MS_732K.cc ├── 2004 │ └── POJ_2004_3837277_AC_282MS_4892K.cc ├── 2005 │ └── POJ_2005_3885671_AC_47MS_328K.cc ├── 2007 │ └── POJ_2007_3812511_AC_16MS_316K.cc ├── 2008 │ └── POJ_2008_5561900_AC_297MS_272K.cpp ├── 2010 │ └── POJ_2010_5564583_AC_235MS_2552K.cpp ├── 2011 │ └── POJ_2011_3887985_AC_0MS_400K.cc ├── 2013 │ ├── POJ_2013_2156514_AC_0MS_8K.c │ └── POJ_2013_2156583_AC_0MS_8K.c ├── 2014 │ └── POJ_2014_3891292_AC_0MS_312K.cc ├── 2015 │ └── POJ_2015_3891634_AC_0MS_256K.cpp ├── 2017 │ └── POJ_2017_2146682_AC_0MS_48K.c ├── 2019 │ └── POJ_2019_5522609_AC_313MS_1388K.cpp ├── 2021 │ └── POJ_2021_2682896_AC_0MS_112K.cpp ├── 2027 │ └── POJ_2027_2146698_AC_0MS_48K.c ├── 2028 │ ├── POJ_2028_2156816_AC_15MS_12K.c │ └── POJ_2028_2156830_AC_15MS_12K.c ├── 2033 │ └── POJ_2033_2206329_AC_0MS_24K.cpp ├── 2034 │ └── POJ_2034_3895335_AC_750MS_632K.cpp ├── 2035 │ └── POJ_2035_3895925_AC_0MS_468K.cc ├── 2036 │ └── POJ_2036_3895816_AC_204MS_636K.cc ├── 2037 │ └── POJ_2037_3901726_AC_1985MS_212K.cpp ├── 2038 │ └── POJ_2038_3895464_AC_0MS_208K.cpp ├── 2039 │ └── POJ_2039_2320110_AC_0MS_52K.cpp ├── 2040 │ └── POJ_2040_3899280_AC_16MS_1120K.cc ├── 2041 │ ├── POJ_2041_2889466_AC_15MS_120K.cpp │ ├── POJ_2041_2889490_AC_0MS_120K.cpp │ ├── POJ_2041_2889494_AC_0MS_120K.cpp │ └── POJ_2041_2889510_AC_0MS_120K.cpp ├── 2042 │ └── POJ_2042_2132054_AC_390MS_64K.c ├── 2043 │ ├── POJ_2043_5710888_AC_829MS_232K.cpp │ ├── POJ_2043_5710935_AC_829MS_228K.cpp │ ├── POJ_2043_5710940_AC_813MS_196K.cpp │ ├── POJ_2043_5710941_AC_375MS_684K.cc │ └── POJ_2043_5710951_AC_375MS_688K.cc ├── 2045 │ ├── POJ_2045_2139936_AC_0MS_44K.c │ ├── POJ_2045_2139944_AC_0MS_44K.c │ ├── POJ_2045_2139945_AC_0MS_44K.c │ ├── POJ_2045_2139950_AC_0MS_44K.c │ └── POJ_2045_2148356_AC_0MS_44K.c ├── 2051 │ ├── POJ_2051_2365117_AC_15MS_72K.cpp │ ├── POJ_2051_2365121_AC_15MS_72K.cpp │ └── POJ_2051_2365122_AC_0MS_48K.cc ├── 2065 │ └── POJ_2065_3145501_AC_32MS_216K.cpp ├── 2070 │ └── POJ_2070_2146732_AC_0MS_60K.c ├── 2078 │ └── POJ_2078_2702607_AC_15MS_168K.cc ├── 2080 │ └── POJ_2080_2652670_AC_125MS_168K.cc ├── 2081 │ ├── POJ_2081_2652537_AC_937MS_13484K.cc │ └── POJ_2081_2652547_AC_0MS_3308K.cc ├── 2083 │ ├── POJ_2083_2203939_AC_187MS_1016K.cpp │ ├── POJ_2083_2203967_AC_140MS_752K.cpp │ ├── POJ_2083_2204001_AC_125MS_568K.cpp │ └── POJ_2083_2204096_AC_140MS_568K.cpp ├── 2084 │ └── POJ_2084_2662386_AC_31MS_192K.cc ├── 2085 │ ├── POJ_2085_2655102_AC_78MS_124K.cpp │ ├── POJ_2085_2659598_AC_78MS_240K.cc │ ├── POJ_2085_2667755_AC_109MS_124K.cpp │ ├── POJ_2085_2667761_AC_109MS_216K.cc │ ├── POJ_2085_2667764_AC_78MS_216K.cc │ ├── POJ_2085_2667838_AC_109MS_72K.cpp │ ├── POJ_2085_2667842_AC_62MS_168K.cc │ ├── POJ_2085_2667849_AC_93MS_72K.c │ ├── POJ_2085_2667851_AC_78MS_172K.c │ ├── POJ_2085_2667869_AC_93MS_72K.cpp │ ├── POJ_2085_2667923_AC_93MS_172K.c │ ├── POJ_2085_2667924_AC_93MS_172K.c │ ├── POJ_2085_2667939_AC_78MS_172K.c │ └── POJ_2085_2667941_AC_78MS_168K.cc ├── 2104 │ ├── POJ_2104_2294671_AC_3305MS_10988K.cpp │ └── POJ_2104_2294675_AC_3271MS_11000K.cc ├── 2105 │ └── POJ_2105_5505514_AC_0MS_216K.cpp ├── 2109 │ └── POJ_2109_2246408_AC_0MS_44K.cpp ├── 2110 │ └── POJ_2110_5953020_AC_125MS_520K.cpp ├── 2112 │ ├── POJ_2112_6204795_AC_579MS_640K.cpp │ ├── POJ_2112_6204800_AC_532MS_640K.cpp │ └── POJ_2112_6204879_AC_625MS_716K.cpp ├── 2115 │ ├── POJ_2115_2466313_AC_0MS_120K.cpp │ └── POJ_2115_6509081_AC_16MS_700K.cc ├── 2116 │ └── POJ_2116_4469346_AC_0MS_248K.cpp ├── 2117 │ ├── POJ_2117_4481262_AC_1766MS_3660K.cc │ ├── POJ_2117_4481264_AC_1469MS_3652K.cpp │ ├── POJ_2117_4481281_AC_1469MS_3572K.cpp │ └── POJ_2117_4481292_AC_1469MS_3508K.cpp ├── 2118 │ └── POJ_2118_4506504_AC_1719MS_596K.cc ├── 2119 │ └── POJ_2119_4508579_AC_7438MS_8896K.cc ├── 2121 │ └── POJ_2121_4481499_AC_16MS_300K.cpp ├── 2122 │ └── POJ_2122_4480299_AC_16MS_220K.cpp ├── 2126 │ └── POJ_2126_3240612_AC_63MS_412K.cc ├── 2136 │ └── POJ_2136_2220031_AC_0MS_20K.cpp ├── 2138 │ ├── POJ_2138_5760836_AC_204MS_356K.cpp │ └── POJ_2138_5760837_AC_204MS_356K.cpp ├── 2140 │ ├── POJ_2140_2246417_AC_15MS_32K.cpp │ └── POJ_2140_2948461_AC_0MS_72K.cpp ├── 2141 │ └── POJ_2141_2861109_AC_15MS_68K.cpp ├── 2151 │ └── POJ_2151_3827335_AC_79MS_984K.cc ├── 2153 │ ├── POJ_2153_2265922_AC_515MS_620K.c │ └── POJ_2153_2387759_AC_2500MS_1572K.cpp ├── 2154 │ └── POJ_2154_3190238_AC_1906MS_300K.cpp ├── 2155 │ ├── POJ_2155_2850160_AC_655MS_8900K.cc │ ├── POJ_2155_2850169_AC_515MS_1280K.cc │ └── POJ_2155_2850174_AC_390MS_1188K.cpp ├── 2159 │ └── POJ_2159_5911837_AC_0MS_208K.cpp ├── 2171 │ ├── POJ_2171_3145209_AC_63MS_188K.cpp │ ├── POJ_2171_4983185_AC_47MS_148K.cpp │ ├── POJ_2171_4983368_AC_79MS_252K.cpp │ └── POJ_2171_4988775_AC_63MS_204K.cpp ├── 2174 │ └── POJ_2174_3189075_AC_0MS_268K.cpp ├── 2176 │ └── POJ_2176_3185841_AC_30MS_844K.cc ├── 2181 │ └── POJ_2181_2352632_AC_15MS_60K.cpp ├── 2182 │ └── POJ_2182_4392555_AC_219MS_484K.cc ├── 2183 │ └── POJ_2183_5953142_AC_0MS_4160K.cpp ├── 2184 │ └── POJ_2184_5355051_AC_32MS_1180K.cpp ├── 2185 │ ├── POJ_2185_5357979_AC_141MS_1124K.cpp │ └── POJ_2185_5752487_AC_94MS_1504K.cc ├── 2186 │ └── POJ_2186_3152190_AC_500MS_7728K.cpp ├── 2187 │ ├── POJ_2187_2535731_AC_357MS_580K.cc │ ├── POJ_2187_2535744_AC_372MS_580K.cc │ ├── POJ_2187_2537952_AC_155MS_580K.cc │ ├── POJ_2187_2537954_AC_107MS_516K.cpp │ ├── POJ_2187_2537956_AC_91MS_516K.cpp │ ├── POJ_2187_2541822_AC_91MS_516K.cpp │ ├── POJ_2187_2542256_AC_91MS_536K.cpp │ └── POJ_2187_2542266_AC_91MS_536K.cpp ├── 2188 │ └── POJ_2188_5358168_AC_0MS_244K.cpp ├── 2189 │ └── POJ_2189_5358052_AC_0MS_212K.cpp ├── 2190 │ └── POJ_2190_2274823_AC_0MS_60K.cpp ├── 2192 │ ├── POJ_2192_2393034_AC_734MS_48K.cpp │ ├── POJ_2192_2393071_AC_859MS_48K.cpp │ ├── POJ_2192_2393113_AC_78MS_48K.cpp │ └── POJ_2192_2393138_AC_62MS_48K.cpp ├── 2196 │ └── POJ_2196_2264064_AC_0MS_56K.cpp ├── 2229 │ └── POJ_2229_2377993_AC_215MS_3888K.cpp ├── 2231 │ ├── POJ_2231_6145924_AC_2579MS_7920K.java │ ├── POJ_2231_6145947_AC_2360MS_6776K.java │ ├── POJ_2231_6146076_AC_1735MS_4448K.java │ ├── POJ_2231_6146730_AC_2407MS_6796K.java │ └── POJ_2231_6146747_AC_2407MS_6804K.java ├── 2232 │ └── POJ_2232_3826539_AC_0MS_312K.cc ├── 2234 │ └── POJ_2234_3187069_AC_0MS_148K.cpp ├── 2239 │ └── POJ_2239_5365850_AC_32MS_1104K.cc ├── 2242 │ └── POJ_2242_2246405_AC_0MS_32K.cpp ├── 2245 │ └── POJ_2245_2275794_AC_0MS_60K.cpp ├── 2247 │ ├── POJ_2247_2427868_AC_62MS_564K.cpp │ └── POJ_2247_2427871_AC_15MS_92K.cpp ├── 2249 │ ├── POJ_2249_2173826_AC_0MS_36K.cpp │ └── POJ_2249_2212022_AC_0MS_36K.cpp ├── 2253 │ └── POJ_2253_2491396_AC_0MS_144K.cpp ├── 2255 │ └── POJ_2255_6146197_AC_141MS_3316K.java ├── 2262 │ └── POJ_2262_2246407_AC_265MS_3940K.cpp ├── 2265 │ └── POJ_2265_2246423_AC_0MS_32K.cpp ├── 2275 │ ├── POJ_2275_3184037_AC_0MS_152K.cpp │ └── POJ_2275_3184042_AC_15MS_152K.cpp ├── 2282 │ ├── POJ_2282_2499287_AC_0MS_184K.cc │ ├── POJ_2282_2499328_AC_0MS_188K.cc │ └── POJ_2282_2499333_AC_0MS_188K.cc ├── 2299 │ ├── POJ_2299_2763553_AC_312MS_3636K.cpp │ └── POJ_2299_2766057_AC_312MS_3636K.cpp ├── 2301 │ └── POJ_2301_2146102_AC_0MS_48K.c ├── 2316 │ └── POJ_2316_2264034_AC_0MS_40K.cc ├── 2323 │ └── POJ_2323_2734470_AC_0MS_100K.cpp ├── 2325 │ ├── POJ_2325_2134129_AC_93MS_52K.c │ └── POJ_2325_2735057_AC_78MS_80K.cpp ├── 2328 │ ├── POJ_2328_2202639_AC_15MS_24K.cpp │ └── POJ_2328_2202641_AC_0MS_24K.cpp ├── 2346 │ └── POJ_2346_2187094_AC_15MS_60K.cpp ├── 2350 │ ├── POJ_2350_2149174_AC_0MS_60K.c │ ├── POJ_2350_2202811_AC_0MS_36K.cpp │ └── POJ_2350_2202821_AC_0MS_36K.cpp ├── 2352 │ └── POJ_2352_2719175_AC_120MS_256K.cpp ├── 2362 │ └── POJ_2362_3343467_AC_110MS_184K.c ├── 2363 │ └── POJ_2363_2246442_AC_15MS_24K.cpp ├── 2372 │ └── POJ_2372_3149691_AC_0MS_192K.cpp ├── 2373 │ └── POJ_2373_4324849_AC_922MS_32704K.cpp ├── 2374 │ ├── POJ_2374_4331189_AC_1266MS_11860K.cc │ └── POJ_2374_4331229_AC_1422MS_11856K.cc ├── 2375 │ └── POJ_2375_4325202_AC_219MS_5156K.cpp ├── 2376 │ └── POJ_2376_4316454_AC_94MS_512K.cc ├── 2377 │ └── POJ_2377_2370418_AC_123MS_2032K.cpp ├── 2378 │ └── POJ_2378_4316539_AC_219MS_24312K.cc ├── 2385 │ └── POJ_2385_5552456_AC_0MS_264K.cpp ├── 2386 │ └── POJ_2386_2246403_AC_0MS_228K.cpp ├── 2388 │ ├── POJ_2388_2339726_AC_185MS_228K.cc │ └── POJ_2388_2339749_AC_45MS_3976K.cc ├── 2389 │ └── POJ_2389_2143676_AC_0MS_44K.c ├── 2390 │ └── POJ_2390_2146744_AC_0MS_60K.c ├── 2394 │ └── POJ_2394_2898403_AC_0MS_252K.cc ├── 2396 │ ├── POJ_2396_4474100_AC_532MS_1476K.cpp │ └── POJ_2396_4474112_AC_625MS_1476K.cpp ├── 2397 │ └── POJ_2397_4455225_AC_32MS_628K.cc ├── 2398 │ └── POJ_2398_4455296_AC_32MS_500K.cc ├── 2400 │ └── POJ_2400_4472801_AC_172MS_304K.cpp ├── 2402 │ └── POJ_2402_2199452_AC_0MS_24K.cpp ├── 2406 │ └── POJ_2406_2929140_AC_125MS_4968K.cpp ├── 2407 │ ├── POJ_2407_2227059_AC_15MS_40K.cpp │ ├── POJ_2407_2227085_AC_0MS_52K.cpp │ └── POJ_2407_2227098_AC_0MS_40K.cpp ├── 2410 │ └── POJ_2410_2676284_AC_0MS_72K.cpp ├── 2411 │ └── POJ_2411_4007867_AC_0MS_632K.cc ├── 2413 │ └── POJ_2413_6639968_AC_1516MS_5688K.java ├── 2418 │ └── POJ_2418_2419549_AC_5312MS_360K.cpp ├── 2421 │ ├── POJ_2421_2413800_AC_45MS_160K.cpp │ ├── POJ_2421_2413875_AC_15MS_160K.cpp │ ├── POJ_2421_2413885_AC_30MS_100K.cpp │ ├── POJ_2421_2413887_AC_90MS_120K.cc │ └── POJ_2421_2413890_AC_45MS_100K.cpp ├── 2431 │ ├── POJ_2431_2788492_AC_30MS_200K.cpp │ ├── POJ_2431_2788499_AC_30MS_200K.cpp │ ├── POJ_2431_2788507_AC_30MS_200K.cpp │ └── POJ_2431_2788653_AC_45MS_248K.cpp ├── 2434 │ └── POJ_2434_3619822_AC_0MS_292K.cc ├── 2447 │ └── POJ_2447_4120402_AC_282MS_316K.cc ├── 2449 │ └── POJ_2449_4120212_AC_329MS_6800K.cc ├── 2452 │ └── POJ_2452_4116643_AC_2188MS_14032K.cc ├── 2453 │ ├── POJ_2453_2271900_AC_15MS_76K.cpp │ └── POJ_2453_4112026_AC_16MS_312K.cc ├── 2456 │ └── POJ_2456_5677915_AC_125MS_548K.cpp ├── 2457 │ └── POJ_2457_5678045_AC_63MS_1268K.cpp ├── 2458 │ └── POJ_2458_6230448_AC_16MS_3820K.cpp ├── 2459 │ └── POJ_2459_5678361_AC_16MS_252K.cpp ├── 2465 │ ├── POJ_2465_2749385_AC_93MS_168K.cpp │ ├── POJ_2465_2750923_AC_0MS_168K.cpp │ └── POJ_2465_2750968_AC_15MS_156K.cpp ├── 2478 │ ├── POJ_2478_2428754_AC_437MS_15700K.cpp │ └── POJ_2478_2429000_AC_343MS_15712K.cc ├── 2479 │ └── POJ_2479_5896978_AC_422MS_828K.cpp ├── 2484 │ └── POJ_2484_3732774_AC_0MS_180K.cpp ├── 2485 │ ├── POJ_2485_2370692_AC_93MS_464K.cpp │ └── POJ_2485_2370739_AC_250MS_444K.cc ├── 2487 │ └── POJ_2487_2861201_AC_62MS_72K.cpp ├── 2492 │ └── POJ_2492_AC.cc ├── 2497 │ └── POJ_2497_2264017_AC_187MS_176K.cc ├── 2498 │ └── POJ_2498_2436173_AC_156MS_40K.cpp ├── 2503 │ └── POJ_2503_2387271_AC_1671MS_20736K.cpp ├── 2506 │ └── POJ_2506_2160544_AC_15MS_256K.c ├── 2509 │ └── POJ_2509_2248514_AC_0MS_24K.cpp ├── 2513 │ ├── POJ_2513_3087254_AC_965MS_65352K.cc │ ├── POJ_2513_3087295_AC_467MS_59092K.cpp │ ├── POJ_2513_3087297_AC_513MS_59160K.cc │ └── POJ_2513_3087301_AC_420MS_59092K.cpp ├── 2521 │ └── POJ_2521_2148295_AC_0MS_48K.c ├── 2524 │ ├── POJ_2524_2402578_AC_296MS_432K.cpp │ ├── POJ_2524_2402645_AC_187MS_236K.cpp │ ├── POJ_2524_2402664_AC_328MS_232K.cpp │ ├── POJ_2524_2402701_AC_171MS_236K.cpp │ └── POJ_2524_2402704_AC_515MS_248K.cc ├── 2528 │ └── POJ_2528_5521519_AC_79MS_1420K.cpp ├── 2533 │ ├── POJ_2533_2342252_AC_30MS_68K.cpp │ └── POJ_2533_2342261_AC_45MS_64K.cpp ├── 2538 │ └── POJ_2538_2275563_AC_0MS_52K.cpp ├── 2546 │ └── POJ_2546_2357776_AC_0MS_88K.cpp ├── 2549 │ ├── POJ_2549_2663375_AC_31MS_124K.cpp │ └── POJ_2549_2663395_AC_31MS_120K.cpp ├── 2551 │ └── POJ_2551_2069903_AC_0MS_12K.c ├── 2552 │ ├── POJ_2552_3257667_AC_157MS_1840K.cc │ └── POJ_2552_3257989_AC_188MS_1840K.cc ├── 2559 │ ├── POJ_2559_2595455_AC_93MS_1640K.cpp │ └── POJ_2559_2595457_AC_93MS_468K.cpp ├── 2562 │ └── POJ_2562_2145563_AC_0MS_44K.c ├── 2572 │ ├── POJ_2572_2212589_AC_0MS_56K.cpp │ ├── POJ_2572_2212673_AC_0MS_56K.cpp │ ├── POJ_2572_2212713_AC_0MS_56K.cpp │ ├── POJ_2572_2212816_AC_0MS_56K.cpp │ └── POJ_2572_2212818_AC_15MS_56K.cpp ├── 2575 │ └── POJ_2575_2234951_AC_0MS_40K.cpp ├── 2578 │ └── POJ_2578_2146857_AC_0MS_48K.c ├── 2583 │ └── POJ_2583_2246418_AC_0MS_24K.cpp ├── 2590 │ └── POJ_2590_2271436_AC_15MS_64K.cpp ├── 2591 │ └── POJ_2591_2179276_AC_608MS_39204K.cpp ├── 2593 │ └── POJ_2593_5911847_AC_188MS_1404K.cpp ├── 2601 │ ├── POJ_2601_6141130_AC_1188MS_5920K.java │ └── POJ_2601_6141132_AC_1235MS_5908K.java ├── 2602 │ ├── POJ_2602_2251181_AC_1077MS_960K.cpp │ └── POJ_2602_2251186_AC_858MS_960K.cpp ├── 2606 │ └── POJ_2606_5358992_AC_47MS_220K.cpp ├── 2608 │ └── POJ_2608_2156301_AC_0MS_12K.c ├── 2618 │ └── POJ_2618_2979076_AC_0MS_160K.cpp ├── 2619 │ ├── POJ_2619_2974295_AC_0MS_88K.cpp │ └── POJ_2619_2974300_AC_0MS_88K.cpp ├── 2620 │ └── POJ_2620_2973638_AC_186MS_9572K.cc ├── 2622 │ ├── POJ_2622_2977551_AC_31MS_892K.cpp │ └── POJ_2622_2977560_AC_93MS_956K.cc ├── 2623 │ └── POJ_2623_2973192_AC_170MS_1064K.cpp ├── 2624 │ └── POJ_2624_2276864_AC_0MS_72K.cpp ├── 2625 │ ├── POJ_2625_4359935_AC_0MS_468K.cc │ └── POJ_2625_4359944_AC_0MS_464K.cc ├── 2626 │ └── POJ_2626_4349566_AC_32MS_1484K.cc ├── 2627 │ └── POJ_2627_4349845_AC_329MS_16180K.cc ├── 2628 │ ├── POJ_2628_4350745_AC_32MS_452K.cc │ └── POJ_2628_4350751_AC_32MS_452K.cc ├── 2629 │ └── POJ_2629_4349421_AC_0MS_436K.cc ├── 2630 │ ├── POJ_2630_4362776_AC_0MS_456K.cc │ ├── POJ_2630_4362782_AC_0MS_460K.cc │ └── POJ_2630_4362784_AC_0MS_300K.cpp ├── 2631 │ └── POJ_2631_4350289_AC_219MS_16404K.cc ├── 2636 │ └── POJ_2636_2148395_AC_0MS_48K.c ├── 2646 │ └── POJ_2646_3085530_AC_15MS_168K.cpp ├── 2647 │ └── POJ_2647_3085618_AC_1124MS_26260K.cpp ├── 2649 │ └── POJ_2649_3085548_AC_0MS_148K.cpp ├── 2656 │ └── POJ_2656_2156345_AC_0MS_12K.c ├── 2661 │ └── POJ_2661_2193236_AC_296MS_80K.cpp ├── 2663 │ ├── POJ_2663_2159450_AC_0MS_12K.c │ └── POJ_2663_2159819_AC_0MS_32K.c ├── 2664 │ └── POJ_2664_2156204_AC_93MS_12K.c ├── 2665 │ └── POJ_2665_2148334_AC_15MS_48K.c ├── 2675 │ └── POJ_2675_3586747_AC_63MS_408K.cc ├── 2689 │ └── POJ_2689_2466672_AC_15MS_1312K.cc ├── 2704 │ └── POJ_2704_4376233_AC_0MS_376K.cpp ├── 2705 │ └── POJ_2705_4376816_AC_0MS_252K.cpp ├── 2706 │ └── POJ_2706_4377618_AC_32MS_276K.cpp ├── 2707 │ └── POJ_2707_2146587_AC_0MS_48K.c ├── 2708 │ └── POJ_2708_4378226_AC_0MS_384K.cpp ├── 2709 │ └── POJ_2709_4376429_AC_0MS_236K.cpp ├── 2710 │ └── POJ_2710_4376327_AC_0MS_324K.cpp ├── 2711 │ └── POJ_2711_4381371_AC_188MS_8428K.cc ├── 2712 │ └── POJ_2712_4376932_AC_0MS_236K.cpp ├── 2718 │ ├── POJ_2718_2729103_AC_359MS_92K.cpp │ └── POJ_2718_2729218_AC_0MS_80K.cpp ├── 2719 │ ├── POJ_2719_2263995_AC_15MS_40K.cc │ └── POJ_2719_2263996_AC_0MS_60K.cpp ├── 2726 │ └── POJ_2726_2792072_AC_78MS_228K.cpp ├── 2739 │ └── POJ_2739_2247721_AC_0MS_32K.cpp ├── 2744 │ └── POJ_2744_3244400_AC_16MS_276K.cpp ├── 2748 │ └── POJ_2748_3844659_AC_1250MS_4120K.cpp ├── 2749 │ └── POJ_2749_5747257_AC_1485MS_7684K.cpp ├── 2752 │ └── POJ_2752_3847988_AC_157MS_2672K.cpp ├── 2756 │ └── POJ_2756_2929767_AC_31MS_1368K.cc ├── 2758 │ ├── POJ_2758_4684720_AC_1297MS_4316K.cpp │ ├── POJ_2758_4684763_AC_4375MS_7524K.cpp │ ├── POJ_2758_4684769_AC_4375MS_7524K.cpp │ ├── POJ_2758_4684770_AC_3907MS_7524K.cpp │ ├── POJ_2758_4684775_AC_2219MS_7524K.cpp │ └── POJ_2758_4684789_AC_2188MS_7524K.cpp ├── 2761 │ ├── POJ_2761_2935190_AC_2543MS_5052K.cc │ └── POJ_2761_2935192_AC_1995MS_4952K.cpp ├── 2762 │ └── POJ_2762_4685407_AC_375MS_776K.cpp ├── 2763 │ ├── POJ_2763_2929477_AC_2229MS_40464K.cpp │ ├── POJ_2763_2929499_AC_1966MS_36904K.cpp │ └── POJ_2763_2929501_AC_2685MS_36816K.cc ├── 2764 │ └── POJ_2764_3621084_AC_16MS_1116K.cc ├── 2769 │ └── POJ_2769_3257494_AC_469MS_1452K.cc ├── 2773 │ └── POJ_2773_4005997_AC_141MS_4224K.cc ├── 2774 │ ├── POJ_2774_3712578_AC_1860MS_19008K.cpp │ └── POJ_2774_3712606_AC_1766MS_19624K.cpp ├── 2777 │ └── POJ_2777_5362037_AC_375MS_4316K.cpp ├── 2780 │ └── POJ_2780_5359053_AC_1875MS_16044K.cpp ├── 2782 │ └── POJ_2782_3183962_AC_30MS_472K.cpp ├── 2785 │ └── POJ_2785_3183942_AC_5170MS_49180K.cpp ├── 2791 │ ├── POJ_2791_3148506_AC_907MS_372K.cpp │ └── POJ_2791_3148539_AC_2079MS_376K.cpp ├── 2792 │ ├── POJ_2792_3684977_AC_188MS_880K.cpp │ └── POJ_2792_3685122_AC_172MS_880K.cpp ├── 2794 │ └── POJ_2794_3163340_AC_79MS_11492K.cpp ├── 2796 │ ├── POJ_2796_2861316_AC_335MS_3196K.cpp │ └── POJ_2796_2861326_AC_1036MS_3324K.cc ├── 2823 │ ├── POJ_2823_2281126_AC_4935MS_7892K.cpp │ ├── POJ_2823_2594947_AC_5357MS_11820K.cpp │ ├── POJ_2823_2594983_AC_5091MS_11820K.cpp │ ├── POJ_2823_2997713_AC_4387MS_4028K.cpp │ └── POJ_2823_2997720_AC_5575MS_4096K.cc ├── 2840 │ └── POJ_2840_2212368_AC_0MS_24K.cpp ├── 2845 │ └── POJ_2845_6141210_AC_188MS_3772K.java ├── 2853 │ └── POJ_2853_2247655_AC_0MS_28K.cpp ├── 2871 │ └── POJ_2871_2276788_AC_0MS_72K.cpp ├── 2876 │ └── POJ_2876_2276770_AC_78MS_76K.cpp ├── 2886 │ ├── POJ_2886_2774152_AC_2217MS_14304K.cpp │ └── POJ_2886_2774188_AC_2107MS_14304K.cpp ├── 2887 │ └── POJ_2887_2754802_AC_213MS_1064K.cpp ├── 2892 │ └── POJ_2892_2753909_AC_217MS_2340K.cpp ├── 2893 │ └── POJ_2893_2766909_AC_1374MS_8488K.cpp ├── 2895 │ └── POJ_2895_2251023_AC_0MS_-12K.cpp ├── 2907 │ └── POJ_2907_2246424_AC_0MS_32K.cpp ├── 2909 │ └── POJ_2909_2228713_AC_0MS_152K.cpp ├── 2922 │ └── POJ_2922_2388228_AC_1937MS_280K.cpp ├── 2924 │ └── POJ_2924_2246413_AC_0MS_24K.cpp ├── 2942 │ └── POJ_2942_4183288_AC_1813MS_2292K.cc ├── 2943 │ └── POJ_2943_3117192_AC_437MS_644K.cpp ├── 2945 │ └── POJ_2945_2386755_AC_1421MS_1640K.cpp ├── 2948 │ ├── POJ_2948_3118566_AC_281MS_3684K.cpp │ └── POJ_2948_3118567_AC_265MS_3684K.cpp ├── 2949 │ ├── POJ_2949_3121274_AC_1499MS_7312K.cpp │ └── POJ_2949_3124582_AC_4984MS_408K.cpp ├── 2959 │ └── POJ_2959_2250970_AC_0MS_0K.cpp ├── 2961 │ └── POJ_2961_2247795_AC_0MS_36K.cpp ├── 2965 │ ├── POJ_2965_2790726_AC_105MS_72K.cpp │ └── POJ_2965_2790730_AC_0MS_72K.cpp ├── 2967 │ ├── POJ_2967_2469884_AC_2886MS_4032K.cpp │ ├── POJ_2967_2469885_AC_2870MS_4032K.cpp │ ├── POJ_2967_2470060_AC_1887MS_4032K.cpp │ ├── POJ_2967_2470110_AC_1856MS_4032K.cpp │ └── POJ_2967_2470160_AC_1918MS_4032K.cpp ├── 2969 │ └── POJ_2969_2790629_AC_0MS_76K.cpp ├── 2970 │ ├── POJ_2970_2789108_AC_3618MS_2824K.cpp │ └── POJ_2970_2789118_AC_2899MS_2824K.cpp ├── 2973 │ └── POJ_2973_2236090_AC_15MS_32K.cpp ├── 2975 │ └── POJ_2975_3077514_AC_46MS_220K.cc ├── 2983 │ └── POJ_2983_3837515_AC_750MS_2668K.cc ├── 2985 │ └── POJ_2985_4138940_AC_1000MS_2656K.cc ├── 2992 │ ├── POJ_2992_2888264_AC_234MS_236K.cpp │ ├── POJ_2992_2888266_AC_296MS_364K.cc │ └── POJ_2992_2888270_AC_234MS_236K.cpp ├── 3006 │ ├── POJ_3006_2465761_AC_0MS_1140K.cc │ └── POJ_3006_2465774_AC_45MS_1052K.cpp ├── 3007 │ └── POJ_3007_6177794_AC_110MS_212K.cpp ├── 3014 │ ├── POJ_3014_2403456_AC_3889MS_31632K.cc │ └── POJ_3014_2429733_AC_1183MS_60K.cpp ├── 3028 │ └── POJ_3028_4045132_AC_704MS_12176K.cc ├── 3029 │ └── POJ_3029_3370011_AC_969MS_312K.cc ├── 3030 │ └── POJ_3030_2244160_AC_0MS_24K.cpp ├── 3032 │ └── POJ_3032_2246427_AC_0MS_24K.cpp ├── 3034 │ └── POJ_3034_3358803_AC_516MS_500K.cc ├── 3035 │ └── POJ_3035_3369465_AC_125MS_1528K.cc ├── 3036 │ └── POJ_3036_3357985_AC_16MS_296K.cpp ├── 3041 │ └── POJ_3041_5444061_AC_32MS_1012K.cpp ├── 3042 │ └── POJ_3042_5453748_AC_110MS_18088K.cpp ├── 3044 │ ├── POJ_3044_6226730_AC_1547MS_9976K.java │ ├── POJ_3044_6226764_AC_1485MS_9972K.java │ ├── POJ_3044_6226817_AC_1422MS_5756K.java │ └── POJ_3044_6226833_AC_1329MS_5616K.java ├── 3045 │ └── POJ_3045_6239566_AC_79MS_1084K.cpp ├── 3046 │ └── POJ_3046_6230795_AC_79MS_208K.cpp ├── 3048 │ └── POJ_3048_2547830_AC_0MS_220K.cpp ├── 3050 │ ├── POJ_3050_2277750_AC_30MS_3956K.cc │ ├── POJ_3050_2277781_AC_60MS_1016K.cc │ ├── POJ_3050_2277783_AC_45MS_1040K.cpp │ └── POJ_3050_2277784_AC_30MS_1040K.c ├── 3055 │ └── POJ_3055_3112056_AC_0MS_364K.cc ├── 3060 │ ├── POJ_3060_2667952_AC_390MS_4928K.cc │ ├── POJ_3060_2667984_AC_390MS_4924K.cc │ ├── POJ_3060_2667991_AC_406MS_4132K.cc │ └── POJ_3060_2667993_AC_187MS_4064K.cpp ├── 3061 │ ├── POJ_3061_2464921_AC_31MS_472K.cpp │ ├── POJ_3061_2464962_AC_46MS_524K.cpp │ └── POJ_3061_2464965_AC_109MS_564K.cc ├── 3062 │ └── POJ_3062_3257706_AC_0MS_276K.cc ├── 3067 │ └── POJ_3067_3584536_AC_454MS_2800K.cpp ├── 3070 │ ├── POJ_3070_2277892_AC_15MS_120K.c │ ├── POJ_3070_2277898_AC_46MS_60K.c │ ├── POJ_3070_2282806_AC_0MS_60K.cpp │ ├── POJ_3070_2282809_AC_15MS_40K.c │ ├── POJ_3070_2282810_AC_0MS_40K.c │ └── POJ_3070_2282815_AC_0MS_60K.c ├── 3077 │ └── POJ_3077_2245157_AC_0MS_24K.cpp ├── 3078 │ └── POJ_3078_3041832_AC_0MS_236K.cpp ├── 3080 │ └── POJ_3080_3041892_AC_15MS_152K.cpp ├── 3085 │ └── POJ_3085_2244883_AC_0MS_24K.cpp ├── 3086 │ └── POJ_3086_2193600_AC_0MS_60K.cpp ├── 3090 │ ├── POJ_3090_2193539_AC_171MS_64K.cpp │ ├── POJ_3090_2267694_AC_421MS_76K.c │ ├── POJ_3090_2267728_AC_15MS_80K.c │ └── POJ_3090_2267731_AC_0MS_80K.cpp ├── 3094 │ └── POJ_3094_2212109_AC_0MS_20K.cpp ├── 3095 │ └── POJ_3095_4425249_AC_0MS_448K.cc ├── 3096 │ └── POJ_3096_4392880_AC_0MS_512K.cc ├── 3098 │ └── POJ_3098_4423593_AC_0MS_460K.cc ├── 3099 │ └── POJ_3099_4424044_AC_79MS_556K.cc ├── 3100 │ └── POJ_3100_2149214_AC_0MS_60K.c ├── 3104 │ ├── POJ_3104_2791348_AC_824MS_548K.cpp │ ├── POJ_3104_2791369_AC_872MS_548K.cpp │ └── POJ_3104_2791373_AC_777MS_548K.cpp ├── 3114 │ └── POJ_3114_3145813_AC_235MS_2172K.cpp ├── 3117 │ └── POJ_3117_2147183_AC_0MS_48K.c ├── 3122 │ ├── POJ_3122_5461350_AC_32MS_244K.cpp │ ├── POJ_3122_5461405_AC_32MS_244K.cpp │ └── POJ_3122_5461425_AC_32MS_244K.cpp ├── 3126 │ ├── POJ_3126_2277280_AC_0MS_136K.cpp │ ├── POJ_3126_2277285_AC_30MS_144K.cpp │ ├── POJ_3126_2277318_AC_15MS_136K.cpp │ ├── POJ_3126_2277670_AC_15MS_80K.cpp │ ├── POJ_3126_2277671_AC_15MS_80K.cpp │ ├── POJ_3126_2277672_AC_30MS_80K.cpp │ ├── POJ_3126_2277673_AC_30MS_80K.cpp │ ├── POJ_3126_2277710_AC_30MS_60K.c │ └── POJ_3126_2277714_AC_15MS_60K.cc ├── 3134 │ ├── POJ_3134_5767734_AC_1360MS_260K.cpp │ ├── POJ_3134_5767788_AC_1016MS_252K.cpp │ ├── POJ_3134_5767801_AC_1438MS_252K.cpp │ └── POJ_3134_5767805_AC_1422MS_252K.cpp ├── 3138 │ └── POJ_3138_2805291_AC_15MS_72K.cpp ├── 3140 │ └── POJ_3140_2809434_AC_406MS_5592K.cpp ├── 3145 │ ├── POJ_3145_2832879_AC_5828MS_3060K.cpp │ ├── POJ_3145_2832891_AC_7812MS_3060K.cpp │ ├── POJ_3145_2832907_AC_5812MS_3060K.cpp │ ├── POJ_3145_2832912_AC_1734MS_3156K.cpp │ └── POJ_3145_2832940_AC_5765MS_2928K.cc ├── 3146 │ └── POJ_3146_2809122_AC_0MS_72K.cpp ├── 3154 │ └── POJ_3154_3199822_AC_0MS_168K.cpp ├── 3157 │ └── POJ_3157_3199914_AC_0MS_164K.cpp ├── 3158 │ └── POJ_3158_3201508_AC_0MS_152K.cpp ├── 3159 │ └── POJ_3159_4330678_AC_1500MS_5504K.cpp ├── 3167 │ └── POJ_3167_4374941_AC_407MS_14236K.cpp ├── 3168 │ └── POJ_3168_4372281_AC_469MS_1484K.cpp ├── 3169 │ └── POJ_3169_4371131_AC_16MS_416K.cpp ├── 3170 │ └── POJ_3170_4369623_AC_485MS_14864K.cpp ├── 3171 │ └── POJ_3171_4370867_AC_235MS_5076K.cpp ├── 3172 │ └── POJ_3172_4368528_AC_563MS_1796K.cpp ├── 3173 │ └── POJ_3173_2244808_AC_0MS_24K.cpp ├── 3174 │ └── POJ_3174_2147457_AC_218MS_60K.c ├── 3175 │ ├── POJ_3175_3025702_AC_46MS_172K.cpp │ └── POJ_3175_3025706_AC_31MS_172K.cpp ├── 3176 │ └── POJ_3176_2244640_AC_0MS_520K.cpp ├── 3177 │ ├── POJ_3177_4186135_AC_0MS_432K.cc │ ├── POJ_3177_4480395_AC_0MS_348K.cpp │ ├── POJ_3177_4480454_AC_0MS_348K.cpp │ └── POJ_3177_7054738_AC_0MS_300K.cpp ├── 3180 │ └── POJ_3180_3151815_AC_750MS_32876K.cpp ├── 3183 │ └── POJ_3183_5604331_AC_485MS_664K.cpp ├── 3184 │ ├── POJ_3184_5604849_AC_329MS_1036K.cpp │ ├── POJ_3184_5605009_AC_563MS_336K.cpp │ ├── POJ_3184_5605015_AC_610MS_336K.cpp │ ├── POJ_3184_5605027_AC_797MS_336K.cpp │ └── POJ_3184_5605031_AC_782MS_260K.cpp ├── 3185 │ └── POJ_3185_5604473_AC_422MS_6388K.cpp ├── 3186 │ └── POJ_3186_2377337_AC_140MS_13780K.cpp ├── 3187 │ └── POJ_3187_5746514_AC_391MS_240K.cpp ├── 3191 │ └── POJ_3191_5744765_AC_47MS_240K.cpp ├── 3192 │ └── POJ_3192_5745091_AC_625MS_248K.cpp ├── 3193 │ └── POJ_3193_5745695_AC_313MS_260K.cpp ├── 3194 │ └── POJ_3194_3139424_AC_0MS_372K.cc ├── 3195 │ └── POJ_3195_3140188_AC_16MS_204K.cpp ├── 3196 │ └── POJ_3196_3140457_AC_0MS_188K.cpp ├── 3197 │ └── POJ_3197_3139567_AC_0MS_188K.cpp ├── 3199 │ └── POJ_3199_2488790_AC_0MS_120K.cpp ├── 3206 │ └── POJ_3206_3652715_AC_3532MS_46224K.java ├── 3210 │ └── POJ_3210_2244361_AC_0MS_24K.cpp ├── 3219 │ ├── POJ_3219_2150375_AC_15MS_48K.c │ ├── POJ_3219_2150453_AC_0MS_48K.c │ ├── POJ_3219_2150458_AC_0MS_48K.c │ ├── POJ_3219_2150503_AC_0MS_48K.c │ ├── POJ_3219_2150518_AC_15MS_48K.c │ ├── POJ_3219_2150528_AC_0MS_48K.c │ ├── POJ_3219_2150572_AC_0MS_48K.cpp │ └── POJ_3219_2463247_AC_0MS_72K.cpp ├── 3224 │ ├── POJ_3224_2246464_AC_0MS_24K.cpp │ └── POJ_3224_2785172_AC_0MS_168K.cc ├── 3250 │ └── POJ_3250_2545925_AC_107MS_1392K.cpp ├── 3252 │ └── POJ_3252_3856693_AC_0MS_212K.cpp ├── 3253 │ └── POJ_3253_2546478_AC_30MS_276K.cpp ├── 3255 │ ├── POJ_3255_2987161_AC_139MS_2932K.cpp │ └── POJ_3255_2987164_AC_108MS_2932K.cpp ├── 3256 │ └── POJ_3256_2552109_AC_46MS_172K.cpp ├── 3258 │ └── POJ_3258_2496954_AC_123MS_316K.cpp ├── 3259 │ ├── POJ_3259_2685745_AC_265MS_112K.cpp │ ├── POJ_3259_2685753_AC_265MS_112K.cpp │ ├── POJ_3259_2685787_AC_170MS_116K.cpp │ └── POJ_3259_2685816_AC_139MS_112K.cpp ├── 3261 │ ├── POJ_3261_2857941_AC_187MS_696K.cpp │ └── POJ_3261_2858059_AC_171MS_696K.cpp ├── 3262 │ └── POJ_3262_4106779_AC_157MS_1104K.cc ├── 3263 │ └── POJ_3263_4105991_AC_47MS_492K.cc ├── 3264 │ ├── POJ_3264_2485428_AC_1588MS_12660K.cpp │ └── POJ_3264_2485433_AC_1571MS_12660K.cpp ├── 3265 │ └── POJ_3265_4110645_AC_0MS_792K.cc ├── 3267 │ └── POJ_3267_6044270_AC_110MS_21692K.cpp ├── 3268 │ └── POJ_3268_2474174_AC_30MS_344K.cpp ├── 3270 │ └── POJ_3270_5760632_AC_32MS_776K.cc ├── 3272 │ └── POJ_3272_3954381_AC_47MS_572K.cpp ├── 3273 │ └── POJ_3273_2410773_AC_76MS_436K.cpp ├── 3274 │ └── POJ_3274_3936655_AC_1235MS_5860K.cpp ├── 3275 │ └── POJ_3275_3936960_AC_125MS_4636K.cpp ├── 3276 │ └── POJ_3276_3938501_AC_1922MS_240K.cpp ├── 3277 │ ├── POJ_3277_3847126_AC_141MS_1768K.cpp │ └── POJ_3277_3847137_AC_141MS_1756K.cpp ├── 3278 │ ├── POJ_3278_2364132_AC_15MS_700K.cc │ ├── POJ_3278_2364165_AC_0MS_700K.cc │ ├── POJ_3278_2364167_AC_45MS_724K.cpp │ ├── POJ_3278_2364173_AC_30MS_7492K.cpp │ ├── POJ_3278_2364183_AC_75MS_7492K.cpp │ ├── POJ_3278_2364188_AC_45MS_7100K.cpp │ ├── POJ_3278_2364198_AC_60MS_7100K.cpp │ ├── POJ_3278_2364202_AC_30MS_700K.cc │ └── POJ_3278_2364430_AC_0MS_404K.cc ├── 3279 │ ├── POJ_3279_3846541_AC_469MS_224K.cpp │ └── POJ_3279_3846545_AC_485MS_224K.cpp ├── 3280 │ └── POJ_3280_5469225_AC_188MS_15936K.cpp ├── 3286 │ └── POJ_3286_2497167_AC_250MS_316K.cc ├── 3292 │ └── POJ_3292_2912090_AC_62MS_11984K.cc ├── 3294 │ ├── POJ_3294_3712468_AC_1094MS_11264K.cpp │ ├── POJ_3294_3712472_AC_1454MS_11368K.cc │ └── POJ_3294_3712504_AC_1110MS_11264K.cpp ├── 3295 │ └── POJ_3295_3372990_AC_0MS_288K.cc ├── 3297 │ └── POJ_3297_2912293_AC_31MS_564K.cpp ├── 3298 │ └── POJ_3298_2972709_AC_78MS_408K.cpp ├── 3299 │ └── POJ_3299_3372996_AC_16MS_312K.cc ├── 3300 │ └── POJ_3300_2912160_AC_0MS_76K.cpp ├── 3302 │ └── POJ_3302_2417986_AC_0MS_40K.cpp ├── 3303 │ └── POJ_3303_3373003_AC_563MS_376K.cc ├── 3304 │ └── POJ_3304_2477781_AC_78MS_188K.cc ├── 3305 │ └── POJ_3305_3373071_AC_16MS_292K.cpp ├── 3306 │ └── POJ_3306_3373083_AC_422MS_220K.cpp ├── 3307 │ ├── POJ_3307_2418999_AC_718MS_7872K.cpp │ ├── POJ_3307_2419022_AC_234MS_588K.cpp │ ├── POJ_3307_2419029_AC_140MS_564K.cpp │ └── POJ_3307_2887507_AC_140MS_712K.cc ├── 3308 │ └── POJ_3308_3794757_AC_32MS_336K.cpp ├── 3310 │ ├── POJ_3310_2442963_AC_0MS_96K.cc │ ├── POJ_3310_2442964_AC_0MS_96K.cc │ ├── POJ_3310_2442966_AC_0MS_92K.cc │ └── POJ_3310_2443093_AC_0MS_48K.cc ├── 3312 │ └── POJ_3312_2436936_AC_0MS_52K.cpp ├── 3316 │ └── POJ_3316_2437991_AC_62MS_1072K.cpp ├── 3320 │ ├── POJ_3320_2452953_AC_654MS_620K.cpp │ ├── POJ_3320_2453072_AC_374MS_1764K.cpp │ ├── POJ_3320_2453113_AC_358MS_1336K.cpp │ ├── POJ_3320_2582518_AC_278MS_1868K.cc │ └── POJ_3320_2582521_AC_108MS_1796K.cpp ├── 3321 │ ├── POJ_3321_2645786_AC_1011MS_21356K.cpp │ ├── POJ_3321_2645791_AC_980MS_17548K.cc │ ├── POJ_3321_2645864_AC_794MS_6944K.cc │ ├── POJ_3321_2645905_AC_779MS_7632K.cc │ └── POJ_3321_2692487_AC_418MS_7228K.cpp ├── 3325 │ └── POJ_3325_2461111_AC_0MS_84K.cpp ├── 3326 │ └── POJ_3326_3795994_AC_32MS_228K.cpp ├── 3328 │ ├── POJ_3328_2781287_AC_685MS_444K.cc │ └── POJ_3328_2781428_AC_716MS_424K.cc ├── 3331 │ └── POJ_3331_2485189_AC_0MS_128K.cpp ├── 3332 │ └── POJ_3332_2682696_AC_0MS_84K.cpp ├── 3335 │ └── POJ_3335_3056397_AC_15MS_96K.cpp ├── 3337 │ └── POJ_3337_3056438_AC_0MS_172K.cpp ├── 3338 │ └── POJ_3338_2501192_AC_0MS_188K.cc ├── 3339 │ ├── POJ_3339_2507855_AC_0MS_192K.cc │ └── POJ_3339_2507976_AC_0MS_192K.cc ├── 3340 │ └── POJ_3340_2509605_AC_0MS_184K.cc ├── 3342 │ ├── POJ_3342_2512835_AC_31MS_368K.cpp │ └── POJ_3342_2516189_AC_31MS_188K.cpp ├── 3346 │ └── POJ_3346_3622408_AC_32MS_2540K.cc ├── 3347 │ ├── POJ_3347_2505201_AC_0MS_192K.cc │ ├── POJ_3347_2511141_AC_0MS_188K.cc │ ├── POJ_3347_2511150_AC_0MS_188K.cc │ ├── POJ_3347_2511154_AC_0MS_188K.cc │ └── POJ_3347_2511157_AC_0MS_128K.cpp ├── 3348 │ └── POJ_3348_2581353_AC_0MS_124K.cpp ├── 3350 │ └── POJ_3350_3164327_AC_829MS_39868K.cpp ├── 3355 │ └── POJ_3355_2570822_AC_156MS_992K.cpp ├── 3356 │ ├── POJ_3356_2578077_AC_15MS_76K.cpp │ ├── POJ_3356_2578086_AC_15MS_176K.c │ ├── POJ_3356_2578088_AC_15MS_76K.c │ ├── POJ_3356_2578190_AC_15MS_76K.c │ └── POJ_3356_2578196_AC_15MS_76K.cpp ├── 3358 │ └── POJ_3358_3373006_AC_16MS_288K.cc ├── 3361 │ ├── POJ_3361_2574276_AC_0MS_92K.cpp │ └── POJ_3361_2574873_AC_0MS_228K.cpp ├── 3363 │ └── POJ_3363_2590628_AC_375MS_88K.cpp ├── 3364 │ └── POJ_3364_2591636_AC_0MS_72K.cpp ├── 3365 │ └── POJ_3365_2591128_AC_31MS_88K.cpp ├── 3366 │ └── POJ_3366_3877787_AC_0MS_448K.cc ├── 3367 │ └── POJ_3367_3877698_AC_485MS_596K.cpp ├── 3368 │ ├── POJ_3368_2592458_AC_421MS_9040K.cpp │ └── POJ_3368_2610487_AC_734MS_5088K.cc ├── 3369 │ └── POJ_3369_3881710_AC_0MS_324K.cc ├── 3370 │ └── POJ_3370_3856115_AC_766MS_596K.cpp ├── 3372 │ └── POJ_3372_2703393_AC_0MS_72K.cpp ├── 3374 │ ├── POJ_3374_2705325_AC_530MS_59844K.cpp │ └── POJ_3374_2707966_AC_249MS_29968K.cpp ├── 3378 │ └── POJ_3378_2766035_AC_296MS_1836K.cpp ├── 3380 │ └── POJ_3380_2697586_AC_184MS_924K.cpp ├── 3385 │ └── POJ_3385_2694686_AC_255MS_468K.cpp ├── 3386 │ └── POJ_3386_2694224_AC_0MS_72K.cpp ├── 3388 │ └── POJ_3388_2696680_AC_1007MS_360K.cc ├── 3390 │ └── POJ_3390_2728453_AC_15MS_164K.cpp ├── 3395 │ └── POJ_3395_3730441_AC_47MS_16188K.cpp ├── 3398 │ └── POJ_3398_3719773_AC_0MS_3960K.cpp ├── 3399 │ └── POJ_3399_2731130_AC_0MS_76K.cpp ├── 3401 │ └── POJ_3401_3805442_AC_672MS_824K.cc ├── 3404 │ └── POJ_3404_2724561_AC_0MS_76K.cpp ├── 3406 │ └── POJ_3406_2734352_AC_0MS_72K.cpp ├── 3407 │ └── POJ_3407_2750046_AC_0MS_176K.cpp ├── 3412 │ └── POJ_3412_2763340_AC_0MS_92K.cpp ├── 3413 │ └── POJ_3413_2737174_AC_15MS_92K.cpp ├── 3414 │ └── POJ_3414_2735730_AC_0MS_96K.cpp ├── 3415 │ └── POJ_3415_2935702_AC_781MS_6704K.cc ├── 3416 │ └── POJ_3416_2759455_AC_327MS_3172K.cpp ├── 3417 │ ├── POJ_3417_2797597_AC_1277MS_33880K.cpp │ └── POJ_3417_2797633_AC_1030MS_24496K.cpp ├── 3419 │ ├── POJ_3419_2785493_AC_2435MS_34084K.cc │ ├── POJ_3419_2785502_AC_2451MS_32708K.cc │ ├── POJ_3419_2785517_AC_1873MS_28780K.cc │ ├── POJ_3419_2785524_AC_1873MS_28780K.cc │ ├── POJ_3419_2785528_AC_1889MS_28780K.cc │ └── POJ_3419_2785530_AC_1108MS_28688K.cpp ├── 3421 │ ├── POJ_3421_2756515_AC_31MS_76K.cpp │ ├── POJ_3421_2765896_AC_31MS_80K.cpp │ ├── POJ_3421_2765898_AC_31MS_80K.cpp │ ├── POJ_3421_2765901_AC_31MS_172K.cc │ ├── POJ_3421_2765906_AC_46MS_172K.cc │ ├── POJ_3421_2765907_AC_31MS_80K.cpp │ ├── POJ_3421_2765909_AC_31MS_80K.cpp │ ├── POJ_3421_2765913_AC_15MS_80K.cpp │ └── POJ_3421_2765914_AC_31MS_172K.cc ├── 3423 │ └── POJ_3423_2813269_AC_0MS_88K.cpp ├── 3424 │ ├── POJ_3424_2817178_AC_1497MS_13912K.cpp │ └── POJ_3424_2817179_AC_530MS_13712K.cc ├── 3427 │ └── POJ_3427_2835643_AC_0MS_216K.cc ├── 3431 │ └── POJ_3431_2833479_AC_296MS_856K.cc ├── 3432 │ └── POJ_3432_2830648_AC_171MS_368K.cc ├── 3434 │ ├── POJ_3434_2830440_AC_2030MS_308K.cpp │ ├── POJ_3434_2830447_AC_1139MS_384K.cc │ ├── POJ_3434_2830472_AC_1186MS_336K.cc │ ├── POJ_3434_2846732_AC_1311MS_384K.cc │ └── POJ_3434_2846735_AC_1311MS_384K.cc ├── 3435 │ └── POJ_3435_3373007_AC_32MS_296K.cc ├── 3437 │ └── POJ_3437_3425987_AC_422MS_1164K.cc ├── 3438 │ └── POJ_3438_3426015_AC_172MS_300K.cc ├── 3439 │ └── POJ_3439_2854385_AC_732MS_120K.cpp ├── 3440 │ └── POJ_3440_3804632_AC_172MS_408K.cc ├── 3441 │ └── POJ_3441_3464438_AC_157MS_344K.cc ├── 3443 │ ├── POJ_3443_3805355_AC_2704MS_320K.cc │ ├── POJ_3443_3805478_AC_907MS_320K.cc │ └── POJ_3443_3805500_AC_907MS_320K.cc ├── 3444 │ └── POJ_3444_2852834_AC_265MS_104K.cpp ├── 3445 │ └── POJ_3445_3437603_AC_282MS_464K.cc ├── 3448 │ ├── POJ_3448_3057947_AC_0MS_148K.cpp │ ├── POJ_3448_3226827_AC_0MS_184K.cpp │ └── POJ_3448_3227129_AC_0MS_280K.cc ├── 3450 │ └── POJ_3450_2891298_AC_734MS_200K.cc ├── 3451 │ └── POJ_3451_3114098_AC_1437MS_8984K.cpp ├── 3452 │ └── POJ_3452_3058077_AC_312MS_4060K.cpp ├── 3454 │ └── POJ_3454_3140761_AC_282MS_2892K.cpp ├── 3455 │ └── POJ_3455_3110368_AC_0MS_152K.cpp ├── 3456 │ ├── POJ_3456_2880925_AC_531MS_1056K.cpp │ ├── POJ_3456_2887309_AC_546MS_1056K.cpp │ ├── POJ_3456_2887310_AC_203MS_1180K.cc │ ├── POJ_3456_2888157_AC_421MS_4112K.cc │ ├── POJ_3456_2888159_AC_93MS_2228K.cc │ ├── POJ_3456_2888161_AC_203MS_2108K.cpp │ └── POJ_3456_2888169_AC_312MS_5940K.cpp ├── 3458 │ └── POJ_3458_2880475_AC_0MS_64K.cpp ├── 3459 │ └── POJ_3459_2884230_AC_31MS_424K.cc ├── 3460 │ ├── POJ_3460_3112002_AC_5859MS_56872K.cc │ └── POJ_3460_3112006_AC_10562MS_9948K.cc ├── 3461 │ └── POJ_3461_2880345_AC_828MS_8996K.cpp ├── 3462 │ └── POJ_3462_2881564_AC_0MS_200K.cc ├── 3463 │ └── POJ_3463_2886750_AC_46MS_472K.cpp ├── 3465 │ ├── POJ_3465_2948249_AC_622MS_2760K.cpp │ ├── POJ_3465_2948251_AC_590MS_1948K.cpp │ ├── POJ_3465_2948252_AC_717MS_2044K.cc │ ├── POJ_3465_2948257_AC_526MS_1428K.cpp │ ├── POJ_3465_2948364_AC_338MS_1260K.cpp │ └── POJ_3465_2977043_AC_573MS_1352K.c ├── 3468 │ ├── POJ_3468_2945319_AC_1717MS_6644K.cpp │ ├── POJ_3468_2945321_AC_1686MS_6628K.cpp │ └── POJ_3468_2945322_AC_2030MS_6720K.cc ├── 3471 │ ├── POJ_3471_3012265_AC_62MS_172K.cpp │ ├── POJ_3471_3012271_AC_62MS_344K.cc │ ├── POJ_3471_3012281_AC_46MS_272K.cc │ ├── POJ_3471_3012283_AC_78MS_172K.cpp │ └── POJ_3471_3030066_AC_625MS_164K.cpp ├── 3480 │ └── POJ_3480_3070618_AC_0MS_148K.cpp ├── 3481 │ └── POJ_3481_3059129_AC_234MS_200K.cpp ├── 3483 │ └── POJ_3483_3103306_AC_46MS_496K.cc ├── 3484 │ └── POJ_3484_3103522_AC_15MS_432K.cc ├── 3485 │ └── POJ_3485_3103713_AC_46MS_388K.cc ├── 3486 │ └── POJ_3486_3059269_AC_125MS_4112K.cpp ├── 3487 │ └── POJ_3487_3103969_AC_0MS_672K.cpp ├── 3488 │ └── POJ_3488_3084273_AC_0MS_296K.cpp ├── 3489 │ ├── POJ_3489_3068692_AC_15MS_148K.cpp │ └── POJ_3489_3075883_AC_15MS_216K.cc ├── 3492 │ ├── POJ_3492_3070915_AC_2482MS_49124K.cc │ └── POJ_3492_3070918_AC_3952MS_49048K.cpp ├── 3493 │ └── POJ_3493_3071291_AC_0MS_216K.cc ├── 3494 │ ├── POJ_3494_3071276_AC_639MS_16004K.cpp │ ├── POJ_3494_3071277_AC_671MS_4140K.cpp │ ├── POJ_3494_3071284_AC_624MS_172K.cpp │ └── POJ_3494_3071285_AC_1968MS_240K.cc ├── 3497 │ └── POJ_3497_3073155_AC_328MS_560K.cc ├── 3498 │ ├── POJ_3498_3100604_AC_6640MS_1084K.cc │ ├── POJ_3498_4379530_AC_7891MS_392K.cc │ └── POJ_3498_4379533_AC_3704MS_1164K.cc ├── 3499 │ └── POJ_3499_3073152_AC_250MS_220K.cc ├── 3501 │ ├── POJ_3501_3074929_AC_1406MS_32128K.cc │ └── POJ_3501_3074933_AC_1421MS_32128K.cc ├── 3503 │ ├── POJ_3503_3084265_AC_1484MS_7688K.cc │ ├── POJ_3503_3084267_AC_1453MS_7688K.cc │ ├── POJ_3503_3084270_AC_1484MS_7804K.cc │ ├── POJ_3503_3084272_AC_1421MS_7664K.cpp │ └── POJ_3503_3092457_AC_1468MS_7624K.cpp ├── 3504 │ ├── POJ_3504_3073134_AC_703MS_5148K.cc │ ├── POJ_3504_3073137_AC_921MS_15756K.cpp │ ├── POJ_3504_3073157_AC_906MS_15756K.cpp │ ├── POJ_3504_3074219_AC_530MS_6100K.cc │ ├── POJ_3504_3074220_AC_718MS_11224K.cpp │ ├── POJ_3504_3074230_AC_671MS_11224K.cpp │ ├── POJ_3504_3074231_AC_530MS_6100K.cc │ ├── POJ_3504_3074264_AC_561MS_6100K.cc │ └── POJ_3504_3074267_AC_515MS_6100K.cc ├── 3505 │ └── POJ_3505_3073253_AC_0MS_100K.cpp ├── 3507 │ └── POJ_3507_3105655_AC_15MS_220K.cc ├── 3508 │ └── POJ_3508_3105741_AC_718MS_1192K.cc ├── 3509 │ └── POJ_3509_3105484_AC_187MS_23700K.cpp ├── 3510 │ └── POJ_3510_3107178_AC_0MS_212K.cc ├── 3511 │ └── POJ_3511_3105363_AC_78MS_7980K.cpp ├── 3512 │ ├── POJ_3512_3105593_AC_4453MS_7988K.cc │ └── POJ_3512_5359069_AC_2000MS_244K.cpp ├── 3513 │ ├── POJ_3513_3111292_AC_109MS_18620K.cpp │ ├── POJ_3513_3111293_AC_46MS_14768K.cc │ └── POJ_3513_3111303_AC_46MS_3336K.cc ├── 3514 │ └── POJ_3514_3111038_AC_1109MS_7820K.cc ├── 3516 │ ├── POJ_3516_3140232_AC_1375MS_383884K.cpp │ ├── POJ_3516_3140237_AC_1329MS_383884K.cpp │ ├── POJ_3516_3140241_AC_1391MS_383984K.cc │ ├── POJ_3516_3140245_AC_1407MS_383948K.cpp │ └── POJ_3516_3145470_AC_1407MS_383948K.cpp ├── 3517 │ ├── POJ_3517_3161875_AC_16MS_312K.cc │ └── POJ_3517_3161880_AC_16MS_188K.cpp ├── 3518 │ └── POJ_3518_3161894_AC_16MS_1860K.cpp ├── 3519 │ └── POJ_3519_3161810_AC_16MS_408K.cc ├── 3522 │ ├── POJ_3522_3161528_AC_4141MS_256K.cpp │ ├── POJ_3522_3161562_AC_1641MS_284K.cpp │ ├── POJ_3522_3161568_AC_829MS_284K.cpp │ └── POJ_3522_3161586_AC_844MS_404K.cc ├── 3523 │ └── POJ_3523_3171718_AC_5296MS_39572K.cc ├── 3524 │ └── POJ_3524_3161897_AC_32MS_300K.cpp ├── 3525 │ ├── POJ_3525_3170567_AC_156MS_228K.cpp │ └── POJ_3525_3170574_AC_187MS_228K.cpp ├── 3526 │ └── POJ_3526_3168401_AC_79MS_268K.cpp ├── 3530 │ └── POJ_3530_3180995_AC_530MS_148K.cpp ├── 3533 │ ├── POJ_3533_3855400_AC_79MS_204K.cpp │ ├── POJ_3533_3855556_AC_16MS_204K.cpp │ └── POJ_3533_3855565_AC_16MS_312K.cc ├── 3534 │ └── POJ_3534_3182200_AC_1338MS_6464K.cpp ├── 3535 │ ├── POJ_3535_3208506_AC_172MS_3472K.cpp │ └── POJ_3535_3208521_AC_204MS_12292K.cpp ├── 3536 │ └── POJ_3536_3213859_AC_63MS_180K.cpp ├── 3537 │ └── POJ_3537_3206077_AC_469MS_148K.cpp ├── 3538 │ └── POJ_3538_3213711_AC_313MS_576K.cc ├── 3539 │ ├── POJ_3539_3208008_AC_438MS_1424K.cpp │ └── POJ_3539_3221163_AC_297MS_1500K.cc ├── 3541 │ ├── POJ_3541_3213008_AC_7610MS_328K.cc │ ├── POJ_3541_3213013_AC_7766MS_332K.cc │ ├── POJ_3541_3214037_AC_8313MS_260K.cpp │ ├── POJ_3541_3214062_AC_4969MS_260K.cpp │ └── POJ_3541_3214135_AC_8313MS_252K.cpp ├── 3542 │ ├── POJ_3542_3220319_AC_4438MS_532K.cc │ ├── POJ_3542_3220334_AC_4532MS_532K.cc │ ├── POJ_3542_3220340_AC_4360MS_548K.cc │ ├── POJ_3542_3220851_AC_1047MS_1496K.cc │ ├── POJ_3542_3220860_AC_1047MS_1520K.cc │ ├── POJ_3542_3220873_AC_1219MS_1424K.cpp │ ├── POJ_3542_3221118_AC_1125MS_1368K.cpp │ └── POJ_3542_3221120_AC_1047MS_1460K.cc ├── 3543 │ └── POJ_3543_3213921_AC_47MS_180K.cpp ├── 3544 │ └── POJ_3544_3208104_AC_172MS_292K.cpp ├── 3546 │ ├── POJ_3546_3222304_AC_32MS_288K.cc │ ├── POJ_3546_3222307_AC_16MS_180K.cpp │ └── POJ_3546_3222316_AC_0MS_176K.cpp ├── 3548 │ └── POJ_3548_3246492_AC_32MS_300K.cc ├── 3550 │ └── POJ_3550_3222393_AC_16MS_180K.cpp ├── 3552 │ └── POJ_3552_3246515_AC_32MS_372K.cc ├── 3553 │ └── POJ_3553_3222129_AC_860MS_2288K.cc ├── 3554 │ └── POJ_3554_3218667_AC_1563MS_4664K.cpp ├── 3555 │ └── POJ_3555_3240295_AC_0MS_304K.cc ├── 3557 │ └── POJ_3557_3229194_AC_47MS_200K.cpp ├── 3558 │ └── POJ_3558_3229206_AC_79MS_200K.cpp ├── 3559 │ └── POJ_3559_3245832_AC_7829MS_15876K.cpp ├── 3561 │ ├── POJ_3561_3232377_AC_172MS_184K.cpp │ └── POJ_3561_3232434_AC_125MS_184K.cpp ├── 3562 │ ├── POJ_3562_3227035_AC_32MS_612K.cpp │ ├── POJ_3562_3227038_AC_16MS_612K.cpp │ ├── POJ_3562_3227045_AC_32MS_716K.cc │ └── POJ_3562_3227137_AC_63MS_612K.cpp ├── 3566 │ └── POJ_3566_3340585_AC_0MS_292K.cc ├── 3572 │ └── POJ_3572_3649585_AC_47MS_428K.cc ├── 3576 │ ├── POJ_3576_3919943_AC_1797MS_22148K.cc │ ├── POJ_3576_3919991_AC_1719MS_22148K.cc │ └── POJ_3576_3919994_AC_1719MS_23036K.cpp ├── 3579 │ └── POJ_3579_4098207_AC_1000MS_580K.cc ├── 3580 │ └── POJ_3580_4245359_AC_985MS_5816K.cc ├── 3581 │ ├── POJ_3581_3306999_AC_516MS_1772K.cpp │ ├── POJ_3581_3307017_AC_157MS_1748K.cpp │ ├── POJ_3581_3307028_AC_469MS_1772K.cpp │ ├── POJ_3581_3307035_AC_454MS_1772K.cpp │ ├── POJ_3581_3307043_AC_485MS_1772K.cpp │ ├── POJ_3581_3307068_AC_485MS_1772K.cpp │ └── POJ_3581_3307077_AC_516MS_1876K.cc ├── 3585 │ └── POJ_3585_3385664_AC_454MS_14568K.cpp ├── 3587 │ └── POJ_3587_3385643_AC_610MS_324K.cc ├── 3588 │ └── POJ_3588_3415968_AC_2204MS_2280K.cc ├── 3589 │ └── POJ_3589_3385666_AC_0MS_180K.cpp ├── 3590 │ └── POJ_3590_3384859_AC_63MS_188K.cpp ├── 3592 │ └── POJ_3592_3383877_AC_16MS_452K.cpp ├── 3593 │ └── POJ_3593_3394070_AC_469MS_2552K.cpp ├── 3594 │ ├── POJ_3594_3407896_AC_516MS_4856K.cpp │ ├── POJ_3594_3407898_AC_563MS_4748K.cc │ └── POJ_3594_3407901_AC_1000MS_4748K.cc ├── 3597 │ └── POJ_3597_3407825_AC_266MS_268K.cpp ├── 3598 │ ├── POJ_3598_3404301_AC_2454MS_8764K.cpp │ └── POJ_3598_3404308_AC_2469MS_8476K.cc ├── 3600 │ └── POJ_3600_3407853_AC_32MS_184K.cpp ├── 3601 │ └── POJ_3601_3690760_AC_0MS_796K.cpp ├── 3602 │ └── POJ_3602_3415946_AC_0MS_336K.cc ├── 3604 │ ├── POJ_3604_3634517_AC_1422MS_59048K.cc │ └── POJ_3604_3634532_AC_1391MS_39460K.cc ├── 3605 │ └── POJ_3605_3635107_AC_47MS_468K.cc ├── 3606 │ └── POJ_3606_3662610_AC_32MS_316K.cpp ├── 3607 │ └── POJ_3607_3693923_AC_188MS_12164K.cpp ├── 3609 │ └── POJ_3609_3691351_AC_0MS_204K.cpp ├── 3612 │ └── POJ_3612_3573072_AC_219MS_604K.cpp ├── 3613 │ ├── POJ_3613_3597650_AC_63MS_1188K.cc │ └── POJ_3613_3597654_AC_47MS_1188K.cc ├── 3614 │ └── POJ_3614_3577460_AC_47MS_276K.cpp ├── 3615 │ └── POJ_3615_3576916_AC_532MS_516K.cpp ├── 3616 │ └── POJ_3616_3575310_AC_0MS_228K.cpp ├── 3617 │ └── POJ_3617_3577221_AC_0MS_212K.cpp ├── 3618 │ └── POJ_3618_3573075_AC_110MS_408K.cpp ├── 3619 │ └── POJ_3619_3573077_AC_32MS_208K.cpp ├── 3620 │ └── POJ_3620_3573078_AC_16MS_384K.cpp ├── 3621 │ ├── POJ_3621_3631416_AC_172MS_1816K.cpp │ ├── POJ_3621_3631425_AC_344MS_2272K.cpp │ └── POJ_3621_3631428_AC_188MS_1816K.cpp ├── 3622 │ └── POJ_3622_3633311_AC_1829MS_35472K.cc ├── 3623 │ └── POJ_3623_3623049_AC_2219MS_320K.cc ├── 3624 │ └── POJ_3624_3623026_AC_282MS_340K.cc ├── 3625 │ └── POJ_3625_3622965_AC_782MS_8172K.cc ├── 3626 │ └── POJ_3626_3622882_AC_94MS_4300K.cc ├── 3627 │ └── POJ_3627_3622613_AC_63MS_372K.cc ├── 3628 │ └── POJ_3628_3622639_AC_172MS_288K.cc ├── 3629 │ └── POJ_3629_3622517_AC_79MS_4412K.cc ├── 3630 │ └── POJ_3630_3614919_AC_141MS_1188K.cc ├── 3631 │ └── POJ_3631_3615306_AC_188MS_404K.cc ├── 3632 │ └── POJ_3632_3614976_AC_0MS_180K.cpp ├── 3633 │ ├── POJ_3633_3660970_AC_407MS_5060K.cc │ └── POJ_3633_3660987_AC_344MS_4312K.cpp ├── 3635 │ └── POJ_3635_3614995_AC_407MS_2704K.cpp ├── 3636 │ └── POJ_3636_3615005_AC_172MS_600K.cpp ├── 3637 │ └── POJ_3637_3615011_AC_125MS_252K.cpp ├── 3638 │ └── POJ_3638_3615017_AC_344MS_2456K.cpp ├── 3639 │ └── POJ_3639_3661159_AC_32MS_204K.cpp ├── 3640 │ └── POJ_3640_3644020_AC_157MS_420K.cpp ├── 3641 │ └── POJ_3641_3644040_AC_16MS_180K.cpp ├── 3642 │ └── POJ_3642_3649195_AC_610MS_1196K.cc ├── 3643 │ └── POJ_3643_6202097_AC_141MS_180K.cpp ├── 3644 │ └── POJ_3644_3643961_AC_0MS_348K.cc ├── 3645 │ └── POJ_3645_3644037_AC_0MS_196K.cpp ├── 3646 │ └── POJ_3646_3644046_AC_47MS_276K.cpp ├── 3649 │ └── POJ_3649_3680505_AC_0MS_188K.cpp ├── 3650 │ └── POJ_3650_3679425_AC_0MS_220K.cpp ├── 3652 │ └── POJ_3652_3679341_AC_32MS_180K.cpp ├── 3653 │ └── POJ_3653_3672631_AC_16MS_236K.cpp ├── 3654 │ └── POJ_3654_3671764_AC_0MS_200K.cpp ├── 3656 │ └── POJ_3656_3671523_AC_0MS_176K.cpp ├── 3657 │ └── POJ_3657_3787864_AC_672MS_5964K.cc ├── 3658 │ └── POJ_3658_3711002_AC_844MS_2680K.cpp ├── 3659 │ └── POJ_3659_3709899_AC_157MS_4032K.cpp ├── 3660 │ └── POJ_3660_3708623_AC_16MS_272K.cpp ├── 3661 │ └── POJ_3661_3708788_AC_79MS_40180K.cpp ├── 3662 │ └── POJ_3662_3708034_AC_79MS_488K.cpp ├── 3663 │ └── POJ_3663_3707252_AC_94MS_4096K.cpp ├── 3664 │ └── POJ_3664_3707241_AC_141MS_772K.cpp ├── 3665 │ └── POJ_3665_3707234_AC_47MS_188K.cpp ├── 3666 │ └── POJ_3666_3782889_AC_172MS_31712K.cpp ├── 3667 │ ├── POJ_3667_3754783_AC_641MS_3368K.cc │ └── POJ_3667_3754787_AC_594MS_3880K.cpp ├── 3668 │ └── POJ_3668_3754081_AC_32MS_616K.cc ├── 3669 │ └── POJ_3669_3753898_AC_79MS_948K.cpp ├── 3670 │ └── POJ_3670_3753678_AC_32MS_660K.cpp ├── 3671 │ └── POJ_3671_3753710_AC_63MS_660K.cpp ├── 3672 │ └── POJ_3672_3782905_AC_47MS_180K.cpp ├── 3673 │ └── POJ_3673_3782919_AC_0MS_180K.cpp ├── 3674 │ └── POJ_3674_3768143_AC_657MS_204K.cpp ├── 3678 │ └── POJ_3678_3782274_AC_188MS_588K.cpp ├── 3681 │ └── POJ_3681_3767545_AC_422MS_356K.cpp ├── 3682 │ └── POJ_3682_4360455_AC_0MS_504K.cc ├── 3685 │ ├── POJ_3685_4036939_AC_1047MS_312K.cc │ └── POJ_3685_4036940_AC_1047MS_312K.cc ├── 3687 │ └── POJ_3687_3997651_AC_47MS_732K.cc ├── 3688 │ └── POJ_3688_4005098_AC_2297MS_504K.cc ├── 3694 │ ├── POJ_3694_4187233_AC_2579MS_12512K.cc │ ├── POJ_3694_4187265_AC_2516MS_12512K.cc │ └── POJ_3694_4187275_AC_2500MS_12512K.cc ├── 3695 │ ├── POJ_3695_4170843_AC_1547MS_364K.cc │ └── POJ_3695_4170857_AC_1657MS_428K.cc ├── 3696 │ └── POJ_3696_4169276_AC_313MS_4544K.cc ├── 3697 │ ├── POJ_3697_4170974_AC_1875MS_15356K.cc │ ├── POJ_3697_5942827_AC_2125MS_15496K.cpp │ └── POJ_3697_5942842_AC_1438MS_13528K.cpp ├── 3700 │ ├── POJ_3700_6043936_AC_1141MS_248K.cpp │ └── POJ_3700_6043945_AC_1110MS_164K.cpp ├── 3716 │ └── POJ_3716_4668969_AC_0MS_248K.cpp ├── 3724 │ └── POJ_3724_4917315_AC_2172MS_4640K.cpp ├── 3725 │ ├── POJ_3725_4983667_AC_891MS_220K.cpp │ ├── POJ_3725_4983928_AC_907MS_220K.cpp │ ├── POJ_3725_4983964_AC_344MS_204K.cpp │ ├── POJ_3725_4983967_AC_594MS_204K.cpp │ ├── POJ_3725_4983976_AC_563MS_204K.cpp │ ├── POJ_3725_4988779_AC_47MS_204K.cpp │ ├── POJ_3725_4988846_AC_32MS_400K.cc │ ├── POJ_3725_4988892_AC_32MS_388K.cc │ ├── POJ_3725_4988905_AC_32MS_388K.cc │ └── POJ_3725_4988929_AC_32MS_316K.cc ├── 3726 │ └── POJ_3726_4983997_AC_2375MS_1388K.cc ├── 3728 │ ├── POJ_3728_4982206_AC_1329MS_8500K.cpp │ ├── POJ_3728_4982215_AC_1454MS_8724K.cc │ └── POJ_3728_4982255_AC_1313MS_8140K.cpp ├── 3734 │ └── POJ_3734_5373593_AC_0MS_136K.cpp ├── 3735 │ └── POJ_3735_5374043_AC_94MS_532K.cpp ├── 3736 │ └── POJ_3736_5374222_AC_16MS_216K.cpp ├── 3737 │ └── POJ_3737_5373589_AC_0MS_164K.cpp ├── 3739 │ └── POJ_3739_5373564_AC_282MS_11832K.cpp ├── 3748 │ └── POJ_3748_6318590_AC_0MS_164K.c └── README.md ├── topcoder ├── plugin │ ├── CodeProcessor.jar │ ├── ExampleBuilder.jar │ ├── FileEdit.jar │ ├── template.cc │ └── template.java └── srm │ └── 566 │ ├── PenguinEmperor.cpp │ ├── PenguinEmperor.html │ ├── PenguinSledding.class │ ├── PenguinSledding.cpp │ ├── PenguinSledding.html │ └── PenguinSledding.java └── util ├── README.md ├── array └── index_array.cc ├── math └── Geometry.cc ├── string ├── KMPMatcher.cc └── util.cc └── tree ├── segment.cc └── trie.cc /.gitignore: -------------------------------------------------------------------------------- 1 | # Compiled Object files 2 | *.slo 3 | *.lo 4 | *.o 5 | 6 | # Compiled Dynamic libraries 7 | *.so 8 | *.dylib 9 | 10 | # Compiled Static libraries 11 | *.lai 12 | *.la 13 | *.a 14 | 15 | # plain text 16 | *.txt 17 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | Nova 2 | ========= 3 | 4 | solutions of algorithm contest 5 | -------------------------------------------------------------------------------- /acm-icpc/2012/Greater_New_York/A.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | using namespace std; 7 | #define MAXN 100000 8 | long long cache[MAXN] = {0}; 9 | 10 | long long calculate(long long n) { 11 | long long result = n; 12 | while (n != 1) { 13 | if (n % 2 ==0) n = n >> 1; 14 | else n = n * 3 + 1; 15 | result = max(result, n); 16 | } 17 | return result; 18 | } 19 | int main() { 20 | int tests; 21 | int id, n; 22 | 23 | scanf("%d", &tests); 24 | 25 | for (int test = 1; test <= tests; test ++) { 26 | scanf("%d%d", &id, &n); 27 | printf("%d %lld\n", id, calculate(n)); 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /acm-icpc/2012/Greater_New_York/B.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | char buffer[10100]; 6 | int main() { 7 | int n, id; 8 | int base; 9 | scanf("%d", &n); 10 | while (n --) { 11 | scanf("%d%d%s", &id, &base, buffer); 12 | base --; 13 | int result = 0; 14 | for (int i = 0; buffer[i]; i ++) { 15 | result = result + buffer[i] - '0'; 16 | result %= base; 17 | } 18 | printf("%d %d\n", id, result); 19 | } 20 | } -------------------------------------------------------------------------------- /acm-icpc/2012/Greater_New_York/X.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | int main() { 6 | char buffer[100]; 7 | int m; 8 | scanf("%d", &m); 9 | while (m --) { 10 | int id; 11 | scanf("%d", &id); 12 | gets(buffer); 13 | gets(buffer); 14 | int n; 15 | scanf("%d", &n); 16 | int pos = 0; 17 | printf("%d ", id); 18 | int len = strlen(buffer); 19 | while (n --) { 20 | scanf("%d", &id); 21 | pos = (pos + id + 3 * len) % len; 22 | printf("%c", buffer[pos]); 23 | 24 | } 25 | printf("\n"); 26 | } 27 | return 0; 28 | } -------------------------------------------------------------------------------- /acm-icpc/2012/chang_chun/k.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | double sum(long long x, long long y) { 5 | return pow(1.0 * y, x * 1.0 + 1) / ( y - 1); 6 | } 7 | bool solve(long long n, long long k, long long &x, long long &y) { 8 | if (k <= 1) return false; 9 | x = (long long)(log(1.0 * n * (k - 1) + 1)) - 1; 10 | if (fabs(sum(x, k) - n) > fabs(sum(x + 1, k))) 11 | } 12 | int main() { 13 | long long n; 14 | while (cin >> n) { 15 | long long x,y; 16 | long long tpx, tpy; 17 | for (int i = 1; i <= n / i; i ++) { 18 | if (n % i == 0) { 19 | if (i > 1) { 20 | tpx = (long long)(log(1.0 * n * ())) 21 | } 22 | } 23 | } 24 | } 25 | return 0; 26 | } -------------------------------------------------------------------------------- /acm-icpc/2013/world_final/A: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wangyongliang/nova/86b00b1a12f1cc6291635f31a33e791f6fb19d1a/acm-icpc/2013/world_final/A -------------------------------------------------------------------------------- /acm-icpc/2013/world_final/J.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | #define inf 1e-6 4 | typedef pair Point; 5 | 6 | double cross(Point a, Point b, Point c) { 7 | return (b.first - a.first) * (c.second - a.second) - (c.first - a.first) * (b.second - a.second); 8 | } 9 | bool cut(Point a, Point b, double r, Point &result) { 10 | if (fabs(a.first - b.first) < inf) { 11 | if (r * r > a.first * a.first) { 12 | result.first = a.first; 13 | result.second = sqrt(r * r - a.first * a.first); 14 | return true; 15 | } else return false; 16 | } else { 17 | 18 | } 19 | } 20 | int main() { 21 | return 0; 22 | } -------------------------------------------------------------------------------- /codechef/PALIN: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wangyongliang/nova/86b00b1a12f1cc6291635f31a33e791f6fb19d1a/codechef/PALIN -------------------------------------------------------------------------------- /codeforces/295/B.cc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wangyongliang/nova/86b00b1a12f1cc6291635f31a33e791f6fb19d1a/codeforces/295/B.cc -------------------------------------------------------------------------------- /codeforces/301/D.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | using namespace std; 13 | #define MAXN 200000 14 | int main() { 15 | for (int i = 2; i 4 | * 5 | * Distributed under terms of the MIT license. 6 | */ 7 | 8 | #include 9 | #include 10 | 11 | using namespace std; 12 | int main() { 13 | int a, b, c,d; 14 | while (cin >> a >> b >> c >> d) { 15 | if (a == 0) { 16 | printf("0.0\n"); 17 | } else if (b == 0) { 18 | printf("0.0\n"); 19 | } else { 20 | double p = 1.0 * a / b; 21 | double q = 1.0 * c / d; 22 | printf("%.9lf\n", p / (1 - (1 - p) * (1 -q))); 23 | } 24 | } 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /codeforces/313/A.cc: -------------------------------------------------------------------------------- 1 | /* 2 | * A.cc 3 | * Copyright (C) 2013 yongliangwang 4 | * 5 | * Distributed under terms of the MIT license. 6 | */ 7 | 8 | #include 9 | using namespace std; 10 | 11 | int main() { 12 | long long n; 13 | while (cin >> n) { 14 | if (n >= 0) { 15 | cout << n << endl; 16 | } else { 17 | n = -n; 18 | n = min(n/10, n / 100 * 10 + n % 10); 19 | n = -n; 20 | cout << n << endl; 21 | } 22 | } 23 | return 0; 24 | } 25 | 26 | 27 | 28 | -------------------------------------------------------------------------------- /codeforces/313/B.cc: -------------------------------------------------------------------------------- 1 | /* 2 | * B.cc 3 | * Copyright (C) 2013 yongliangwang 4 | * 5 | * Distributed under terms of the MIT license. 6 | */ 7 | 8 | #include 9 | #include 10 | using namespace std; 11 | 12 | #define MAXN 1000000 13 | char buffer[MAXN]; 14 | int count[MAXN] = {0}; 15 | int main() { 16 | 17 | while (scanf("%s", buffer + 1) != EOF) { 18 | for (int i = 1; buffer[i]; i ++) { 19 | count[i] = count[i - 1]; 20 | if (i && buffer[i] == buffer[i - 1]) count[i] ++; 21 | } 22 | 23 | int q; 24 | scanf("%d", &q); 25 | while (q --) { 26 | int l, r; 27 | scanf("%d%d",&l,&r); 28 | cout << count[r] - count[l] << endl; 29 | } 30 | } 31 | return 0; 32 | } 33 | 34 | -------------------------------------------------------------------------------- /codeforces/318/B.cc: -------------------------------------------------------------------------------- 1 | /* 2 | * B.cc 3 | * Copyright (C) 2013 yongliangwang 4 | * 5 | * Distributed under terms of the MIT license. 6 | */ 7 | 8 | 9 | 10 | 11 | 12 | -------------------------------------------------------------------------------- /hackerrank/Search/Flowers/main.cc: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | 13 | using namespace std; 14 | int main() { 15 | // freopen("data.txt", "r", stdin); 16 | int n, k; 17 | int a[200]; 18 | cin >> n >> k; 19 | for (int i = 0; i < n; i ++) 20 | cin >> a[i]; 21 | sort(a, a + n); 22 | long long sum = 0LL; 23 | for (int i = n - 1; i >= 0; i -= k) { 24 | for (int j = 0; j < k && i - j >= 0; j ++) { 25 | sum += a[i - j] * ((n - 1- i) / k + 1); 26 | } 27 | } 28 | cout << sum << endl; 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /leetcode/Balanced Binary Tree.cc: -------------------------------------------------------------------------------- 1 | /** 2 | * Definition for binary tree 3 | * struct TreeNode { 4 | * int val; 5 | * TreeNode *left; 6 | * TreeNode *right; 7 | * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 | * }; 9 | */ 10 | class Solution { 11 | public: 12 | bool isBalanced(TreeNode *root) { 13 | if (root == NULL) 14 | return true; 15 | bool result = isBalanced(root->left) && isBalanced(root->right); 16 | int left_depth = root->left == NULL? 0: root->left->val; 17 | int right_depth = root->right == NULL? 0 : root->right->val; 18 | result = result & (abs(left_depth - right_depth) <= 1); 19 | root->val = max(left_depth, right_depth) + 1; 20 | return result; 21 | } 22 | }; -------------------------------------------------------------------------------- /leetcode/Convert Sorted List to Binary Search Tree.cc: -------------------------------------------------------------------------------- 1 | /** 2 | * Definition for singly-linked list. 3 | * struct ListNode { 4 | * int val; 5 | * ListNode *next; 6 | * ListNode(int x) : val(x), next(NULL) {} 7 | * }; 8 | */ 9 | /** 10 | * Definition for binary tree 11 | * struct TreeNode { 12 | * int val; 13 | * TreeNode *left; 14 | * TreeNode *right; 15 | * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 16 | * }; 17 | */ 18 | class Solution { 19 | public: 20 | TreeNode *sortedListToBST(ListNode *head) { 21 | // Start typing your C/C++ solution below 22 | // DO NOT write int main() function 23 | 24 | } 25 | }; -------------------------------------------------------------------------------- /leetcode/Count and Say.cc: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | string countAndSay(int n) { 4 | vector> 5 | } 6 | }; -------------------------------------------------------------------------------- /leetcode/First Missing Positive.cc: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int firstMissingPositive(int A[], int n) { 4 | for (int i = 0; i < n; i ++) { 5 | while (A[i] > 0 && A[i] <= n && A[i] != i + 1) { 6 | if (A[A[i] - 1] != A[i]) 7 | swap(A[i], A[A[i] - 1]); 8 | else 9 | break; 10 | } 11 | } 12 | for (int i = 0; i < n; i ++) { 13 | if (A[i] != i + 1) 14 | return i + 1; 15 | } 16 | return n + 1; 17 | } 18 | }; -------------------------------------------------------------------------------- /leetcode/Jump Game.cc: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool canJump(int A[], int n) { 4 | int position = A[0]; 5 | for (int i = 0; i < n && i <= position; i ++) { 6 | position = max(position, A[i] + i); 7 | } 8 | return position >= n - 1; 9 | } 10 | }; -------------------------------------------------------------------------------- /leetcode/Path Sum.cc: -------------------------------------------------------------------------------- 1 | /** 2 | * Definition for binary tree 3 | * struct TreeNode { 4 | * int val; 5 | * TreeNode *left; 6 | * TreeNode *right; 7 | * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 | * }; 9 | */ 10 | class Solution { 11 | public: 12 | bool hasPathSum(TreeNode *root, int sum) { 13 | // Start typing your C/C++ solution below 14 | // DO NOT write int main() function 15 | if (root == NULL) 16 | return false; 17 | sum -= root->val; 18 | if (sum == 0 && (root->left == NULL && root->right == NULL)) 19 | return true; 20 | return hasPathSum(root->left, sum) || 21 | hasPathSum(root->right, sum); 22 | } 23 | }; -------------------------------------------------------------------------------- /leetcode/Sort Colors.cc: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | void sortColors(int A[], int n) { 4 | // Start typing your C/C++ solution below 5 | // DO NOT write int main() function 6 | int a[3] = {0}; 7 | for (int i = 0; i < n; i ++) 8 | a[A[i]] ++; 9 | int j = 0; 10 | for (int i = 0; i < 3; i ++) { 11 | while (a[i]) { 12 | A[j ++] = i; 13 | a[i] --; 14 | } 15 | } 16 | } 17 | }; -------------------------------------------------------------------------------- /leetcode/Trapping Rain Water.cc: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int trap(int A[], int n) { 4 | stack stack_; 5 | int result = 0; 6 | int height; 7 | int diff; 8 | for (int i = 0; i < n; i ++) { 9 | while (stack_.size() > 0 && A[stack_.top()] <= A[i]) { 10 | height = A[stack_.top()]; 11 | stack_.pop(); 12 | if (stack_.size() > 0) { 13 | diff = min(A[stack_.top()], A[i]) - height; 14 | result += (i - stack_.top() - 1) * diff; 15 | } 16 | } 17 | stack_.push(i); 18 | } 19 | return result; 20 | } 21 | }; 22 | -------------------------------------------------------------------------------- /leetcode/Triangle.cc: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int minimumTotal(vector > &triangle) { 4 | 5 | for (int i = 1; i < triangle.size(); i ++) { 6 | for (int j = 0; j < triangle[i].size(); j ++) { 7 | int num = INT_MAX; 8 | if (j < triangle[i - 1].size()) 9 | num = min(num, triangle[i][j] + triangle[i - 1][j]); 10 | if (j > 0) 11 | num = min(num, triangle[i][j] + triangle[i - 1][j - 1]); 12 | triangle[i][j] = num; 13 | } 14 | } 15 | int result = INT_MAX; 16 | for (int i = 0; i < triangle[triangle.size() - 1].size(); i ++) { 17 | result = min(result, triangle[triangle.size() - 1][i]); 18 | } 19 | return result; 20 | } 21 | }; -------------------------------------------------------------------------------- /poj/1000/POJ_1000_1997994_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | // Author: wangyongliang.wyl@gmail.com (Wang Yongliang) 2 | // github: https://github.com/wangyongliang 3 | 4 | #include 5 | void main() { 6 | int a, b; 7 | while (EOF != scanf("%d %d", &a, &b)) { 8 | printf("%d", a + b); 9 | } 10 | } -------------------------------------------------------------------------------- /poj/1003/POJ_1003_2085196_AC_0MS_60K.c: -------------------------------------------------------------------------------- 1 | // Author: wangyongliang.wyl@gmail.com (Wang Yongliang) 2 | // github: https://github.com/wangyongliang 3 | 4 | #include 5 | void main() { 6 | float n, sum, i; 7 | while (scanf("%f", &n) && n != 0.00) { 8 | i = 2; 9 | sum = 0; 10 | while (sum < n) { 11 | sum += 1 / i; 12 | i++; 13 | } 14 | printf("%.0f card(s)\n", i - 2); 15 | } 16 | } -------------------------------------------------------------------------------- /poj/1004/POJ_1004_2050534_AC_0MS_60K.c: -------------------------------------------------------------------------------- 1 | // Author: wangyongliang.wyl@gmail.com (Wang Yongliang) 2 | // github: https://github.com/wangyongliang 3 | 4 | #include 5 | 6 | void main() { 7 | float n, sum = 0.0; 8 | int i; 9 | for (i = 0; i < 12; i++) { 10 | scanf("%f", &n); 11 | sum += n; 12 | } 13 | sum = sum / 12.0; 14 | printf("$%.2f", sum); 15 | } -------------------------------------------------------------------------------- /poj/1006/POJ_1006_2421340_AC_15MS_40K.cpp: -------------------------------------------------------------------------------- 1 | // Author: wangyongliang.wyl@gmail.com (Wang Yongliang) 2 | // github: https://github.com/wangyongliang 3 | 4 | #include 5 | int main() { 6 | int p, e, i, d, a, t = 0; 7 | while (1) { 8 | scanf("%d%d%d%d", &p, &e, &i, &d); 9 | if (p == -1 && e == -1 && i == -1 && d == -1) 10 | break; 11 | a = (5544 * p + 14421 * e + 1288 * i - d + 21252) % 21252; 12 | if (!a) 13 | a = 21252; 14 | printf("Case %d: the next triple peak occurs in %d days.\n", ++t, a); 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /poj/1007/POJ_1007_2160623_AC_15MS_12K.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int m, n, i, j, k, sum[100], temp; 5 | char ca[100][51]; 6 | while (scanf("%d %d", &m, &n) != EOF) { 7 | for (i = 0; i < n; i++) { 8 | sum[i] = 0; 9 | scanf("%s", ca[i]); 10 | for (j = 0; j < m - 1; j++) 11 | for (k = j + 1; k < m; k++) if (ca[i][j] > ca[i][k])sum[i]++; 12 | } 13 | for (i = 0; i < n; i++) { 14 | k = 0; temp = 2000; 15 | for (j = 0; j < n; j++) 16 | if (sum[j] < temp) { 17 | temp = sum[j]; 18 | k = j; 19 | } 20 | sum[k] = 2001; 21 | printf("%s\n", ca[k]); 22 | } 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /poj/1012/POJ_1012_2274752_AC_0MS_60K.cpp: -------------------------------------------------------------------------------- 1 | // Author: wangyongliang.wyl@gmail.com (Wang Yongliang) 2 | // github: https://github.com/wangyongliang 3 | 4 | #include 5 | 6 | long a[15] = {0, 2, 7, 5, 30, 169, 441, 1872, 7632, 1740, 93313, 459901, 1358657, 2504881, 134827720}; 7 | int main() { 8 | int i; 9 | while (scanf("%d", &i) && i) { 10 | printf("%ld\n", a[i]); 11 | } 12 | return 0; 13 | } -------------------------------------------------------------------------------- /poj/1045/POJ_1045_2438669_AC_0MS_52K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() { 4 | double vs, vr, r, c, w; 5 | int n; 6 | scanf("%lf%lf%lf%d", &vs, &r, &c, &n); 7 | while (n--) { 8 | scanf("%lf", &w); 9 | printf("%.3lf\n", (r * c * w * vs) / sqrt(1 + r * r * c * c * w * w)); 10 | } 11 | return 0; 12 | } -------------------------------------------------------------------------------- /poj/1061/POJ_1061_2062862_AC_655MS_12K.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | unsigned long x, y, m, n, l; 4 | while (scanf ("%ld %ld %ld %ld %ld", &x, &y, &m, &n, &l) != EOF) { 5 | if (m > n) { 6 | m = m - n; 7 | x = (y - x + l) % l; 8 | } else { 9 | m = n - m; 10 | x = (x - y + l) % l; 11 | } 12 | n = x / m; 13 | x = x % m; 14 | y = x; 15 | while (1) { 16 | if (y == 0) { 17 | printf ("%d\n", n); 18 | break; 19 | } 20 | n += (y + l) / m; 21 | y = (y + l) % m; 22 | if (y == x) { 23 | printf ("Impossible\n"); 24 | break; 25 | } 26 | } 27 | } 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /poj/1061/POJ_1061_2230742_AC_671MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | unsigned long x, y, m, n, l; 4 | while (scanf ("%ld %ld %ld %ld %ld", &x, &y, &m, &n, &l) != EOF) { 5 | if (m > n) { 6 | m = m - n; 7 | x = (y - x + l) % l; 8 | } else { 9 | m = n - m; 10 | x = (x - y + l) % l; 11 | } 12 | n = x / m; 13 | x = x % m; 14 | y = x; 15 | while (1) { 16 | if (y == 0) { 17 | printf ("%d\n", n); 18 | break; 19 | } 20 | n += (y + l) / m; 21 | y = (y + l) % m; 22 | if (y == x) { 23 | printf ("Impossible\n"); 24 | break; 25 | } 26 | } 27 | } 28 | return 0; 29 | } -------------------------------------------------------------------------------- /poj/1063/POJ_1063_2438716_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | /* 4 | 如果是奇数，那么一定是‘YES’ 5 | 如果是偶数，则统计在奇数位上和偶数位上白棋的个数，如果他们相差小于2，那么也一定是'YES' 6 | */ 7 | int main() { 8 | int n; 9 | scanf("%d", &n); 10 | while (n--) { 11 | int m, s[101], i; 12 | int ji = 0, ou = 0; 13 | scanf("%d", &m); 14 | if (m % 2) { 15 | for (i = 1; i <= m; i++)scanf("%d", &s[i]); 16 | printf("YES\n"); 17 | } else { 18 | for (i = 1; i <= m; i++) { 19 | scanf("%d", &s[i]); 20 | if (!s[i] && i % 2)ji++; 21 | if (!s[i] && !(i % 2))ou++; 22 | } 23 | if (abs(ji - ou) < 2)printf("YES\n"); 24 | else printf("NO\n"); 25 | } 26 | } 27 | return 0; 28 | } -------------------------------------------------------------------------------- /poj/1067/POJ_1067_2049434_AC_0MS_132K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | double alpha = (1.0 + sqrt(5.0)) / 2.0; 7 | double beta = (3.0 + sqrt(5.0)) / 2.0; 8 | int big, small, n, temp1, temp2; 9 | while (cin >> big >> small) { 10 | if (big < small) 11 | swap(big, small); 12 | n = ceil(big / beta); 13 | temp1 = alpha * n; 14 | temp2 = beta * n; 15 | if (small == temp1 && big == temp2) 16 | cout << 0 << endl; 17 | else cout << 1 << endl; 18 | } 19 | return 0; 20 | } 21 | 22 | -------------------------------------------------------------------------------- /poj/1079/POJ_1079_2194715_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() { 4 | double eps, div, eps1, eps2, n, m, i, j; 5 | int k; 6 | // int i,j,n,m; 7 | while (scanf("%lf%lf", &n, &m) != EOF) { 8 | eps = 100; 9 | div = n / m; 10 | for (i = 1; i <= m; i++) { 11 | j = i * div; 12 | k = (int)j; 13 | k++; 14 | eps1 = k / i; 15 | eps2 = (k - 1) / i; 16 | if (fabs(div - eps1) > fabs(div - eps2)) 17 | k--; 18 | if (fabs(div - k / i) < eps) { 19 | eps = fabs(div - k / i); 20 | printf("%d/%.0lf\n", k, i); 21 | } 22 | // if(fab(eps)<=0.0000000000002) 23 | } 24 | printf("\n"); 25 | } 26 | } -------------------------------------------------------------------------------- /poj/1083/POJ_1083_2204233_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() { 3 | int a[401], i, j, n, k, temp; 4 | scanf("%d", &n); 5 | 6 | while (n--) { 7 | for (i = 0; i < 401; i++)a[i] = 0; 8 | scanf("%d", &k); 9 | while (k--) { 10 | scanf("%d%d", &i, &j); 11 | if (i == j) continue; 12 | if (i > j) { 13 | temp = i; 14 | i = j; 15 | j = temp; 16 | } 17 | i -= !(i % 2); 18 | j += j % 2; 19 | for (temp = i; temp <= j; temp++) a[temp]++; 20 | } 21 | for (i = 0, temp = 0; i < 401; i++) { 22 | temp = a[i] > temp ? a[i] : temp; 23 | } 24 | printf("%d\n", temp * 10); 25 | } 26 | } -------------------------------------------------------------------------------- /poj/1152/POJ_1152_2891093_AC_15MS_164K.cpp: -------------------------------------------------------------------------------- 1 | //freopen("in.txt","r",stdin); 2 | //freopen("out.txt","w",stdout); 3 | 4 | #include 5 | int flag[356]; 6 | int main() 7 | { 8 | char s[100000]; 9 | int i,j; 10 | for(j=10,i='A';i<='Z';i++,j++) flag[i]=j; 11 | for(i='a';i<='z';i++,j++) flag[i]=j; 12 | for(i='0';i<='9';i++) flag[i]=i-'0'; 13 | __int64 sum; 14 | int max; 15 | while(scanf("%s",s)!=EOF) 16 | { 17 | sum=0; 18 | max=2; 19 | for(i=0;s[i];i++) sum+=flag[s[i]],max=max 5 | int flag[356]; 6 | int main() 7 | { 8 | char s[100000]; 9 | int i,j; 10 | for(j=10,i='A';i<='Z';i++,j++) flag[i]=j; 11 | for(i='a';i<='z';i++,j++) flag[i]=j; 12 | for(i='0';i<='9';i++) flag[i]=i-'0'; 13 | __int64 sum; 14 | int max; 15 | while(scanf("%s",s)!=EOF) 16 | { 17 | sum=0; 18 | max=2; 19 | for(i=0;s[i];i++) sum+=flag[s[i]],max=max 2 | #include 3 | 4 | char str[5010]; 5 | short dp[5010][5010]={0}; 6 | 7 | short minimum(short a,short b) 8 | { 9 | return a0;i--) 19 | for(j=0;j<=n;j++) 20 | { 21 | if(i>=j) continue; 22 | if(str[i]==str[j]) 23 | dp[i][j]=dp[i+1][j-1]; 24 | else 25 | dp[i][j]=minimum(dp[i+1][j],dp[i][j-1])+1; 26 | } 27 | printf("%d\n",dp[1][n]); 28 | } 29 | } 30 | -------------------------------------------------------------------------------- /poj/1159/POJ_1159_2430080_AC_2074MS_68K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | //pku 3181 4 | char str[5010]; 5 | short dp[2][5010]={0}; 6 | 7 | short minimum(short a,short b) 8 | { 9 | return a0;i--) 19 | for(j=0;j<=n;j++) 20 | { 21 | if(i>=j) continue; 22 | if(str[i]==str[j]) 23 | dp[i%2][j]=dp[(i+1)%2][j-1]; 24 | else 25 | dp[i%2][j]=minimum(dp[(i+1)%2][j],dp[i%2][j-1])+1; 26 | } 27 | printf("%d\n",dp[1][n]); 28 | } 29 | } -------------------------------------------------------------------------------- /poj/1159/POJ_1159_2430100_AC_1700MS_68K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | //pku 3181 4 | char str[5010]; 5 | short dp[2][5010]={0}; 6 | 7 | short minimum(short a,short b) 8 | { 9 | return a0;i--,flag=1-flag) 20 | for(j=0;j<=n;j++) 21 | { 22 | if(i>=j) continue; 23 | if(str[i]==str[j]) 24 | dp[flag][j]=dp[1-flag][j-1]; 25 | else 26 | dp[flag][j]=minimum(dp[1-flag][j],dp[flag][j-1])+1; 27 | } 28 | printf("%d\n",dp[1-flag][n]); 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /poj/1159/POJ_1159_2430145_AC_1590MS_68K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | //pku 3181 4 | char str[5010]; 5 | short dp[2][5010]={0}; 6 | 7 | 8 | void main() 9 | { 10 | int n,i,j,flag; 11 | while(scanf("%d",&n)!=EOF) 12 | { 13 | flag=0; 14 | scanf("%s",str+1); 15 | for(i=n;i>0;i--,flag=1-flag) 16 | for(j=0;j<=n;j++) 17 | { 18 | if(i>=j) continue; 19 | if(str[i]==str[j]) 20 | dp[flag][j]=dp[1-flag][j-1]; 21 | else 22 | { 23 | if(dp[1-flag][j]>dp[flag][j-1]) 24 | dp[flag][j]=dp[flag][j-1]+1; 25 | else dp[flag][j]=dp[1-flag][j]+1; 26 | } 27 | } 28 | printf("%d\n",dp[1-flag][n]); 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /poj/1163/POJ_1163_2150937_AC_15MS_84K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int a[100][100],i,j,n; 5 | while(scanf("%d",&n)!=EOF) 6 | { 7 | for(i = 0; i=0;i--) 12 | { 13 | for(j=0;j<=i;j++) 14 | { 15 | if(a[i+1][j]>a[i+1][j+1])a[i][j]+=a[i+1][j]; 16 | else a[i][j]+=a[i+1][j+1]; 17 | } 18 | } 19 | printf("%d\n",a[0][0]); 20 | } 21 | } -------------------------------------------------------------------------------- /poj/1183/POJ_1183_2082391_AC_15MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | unsigned long a,i; 5 | scanf("%ld",&a); 6 | for(i=a;;i--)if((a*a+1)%i==0)break; 7 | printf("%ld\n",2*a+(a*a+1)/i+i); 8 | } 9 | -------------------------------------------------------------------------------- /poj/1207/POJ_1207_2188575_AC_31MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int ma(int n) 3 | { 4 | int j=0; 5 | while(n!=1) 6 | { 7 | if(n%2==0) 8 | n/=2; 9 | else 10 | n=n*3+1; 11 | j++; 12 | } 13 | return j; 14 | } 15 | void main() 16 | { 17 | int i,j,n,max,l; 18 | while(scanf("%d %d",&i,&j)!=EOF) 19 | { 20 | max=0; 21 | if(il?max:l; 27 | } 28 | printf("%d %d %d\n",i,j,max+1); 29 | } 30 | else 31 | { 32 | for(n=j;n<=i;n++) 33 | { 34 | l=ma(n); 35 | max=max>l?max:l; 36 | } 37 | printf("%d %d %d\n",i,j,max+1); 38 | } 39 | } 40 | } -------------------------------------------------------------------------------- /poj/1207/POJ_1207_2201405_AC_31MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main(){ 3 | long i,j,k,n,counter,max; 4 | while(scanf("%ld %ld",&i,&j)!=EOF) 5 | { 6 | 7 | printf("%ld %ld ",i,j); 8 | if(i>j) {n=i;i=j;j=n;} 9 | max=0; 10 | 11 | for(k=i;k<=j;k++) 12 | {counter=1; 13 | n=k; 14 | while(n!=1) 15 | { 16 | if(n%2) {n=3*n+1;counter++;} 17 | else {n=n/2;counter++;} 18 | } 19 | if(max 2 | void main() 3 | { 4 | int a[101],i,j,k,n; 5 | scanf("%d",&n); 6 | while(n--) 7 | { 8 | scanf("%d",&k); 9 | for(i=0;i<=k;i++)a[i]=1; 10 | for(i=2;i<=k;i++) 11 | { 12 | for(j=i;j<=k;j+=i) 13 | a[j]=1-a[j]; 14 | } 15 | for(i=1,j=0;i<=k;i++) 16 | if(a[i])j++; 17 | printf("%d\n",j); 18 | } 19 | } -------------------------------------------------------------------------------- /poj/1218/POJ_1218_2235451_AC_0MS_32K.cpp: -------------------------------------------------------------------------------- 1 | #include//只有平方数字最后才是打开的，所以只要计算有多少个平方数字就可以了 2 | #include 3 | int main() 4 | { 5 | int n,m; 6 | scanf("%d",&n); 7 | while(n--) 8 | { 9 | scanf("%d",&m); 10 | printf("%d\n",(int)sqrt(m)); 11 | } 12 | return 0; 13 | } -------------------------------------------------------------------------------- /poj/1298/POJ_1298_2264509_AC_0MS_52K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | char s[]=("VWXYZABCDEFGHIJKLMNOPQRSTU"); 4 | int main() 5 | { 6 | char c[100]; 7 | int i; 8 | while(1) 9 | { 10 | gets(c); 11 | if(strcmp(c,"START")==0||strcmp(c,"END")==0) continue; 12 | else if(strcmp(c,"ENDOFINPUT")==0) break; 13 | else 14 | { 15 | for(i=0;c[i];i++) 16 | { 17 | if(c[i]>='A'&&c[i]<='Z') 18 | printf("%c",s[c[i]-'A']); 19 | else printf("%c",c[i]); 20 | } 21 | printf("\n"); 22 | } 23 | } 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /poj/1306/POJ_1306_2339409_AC_0MS_124K.cpp: -------------------------------------------------------------------------------- 1 | //pku 1455 2 | #include 3 | __int64 a[101][101]; 4 | __int64 combine(__int64 n,__int64 m) 5 | { 6 | if(m>n||m<0|n<0)return 0; 7 | if(!a[n][m]) 8 | { 9 | if(n==m||m==0) a[n][m]=1; 10 | else 11 | { 12 | if(!a[n-1][m]) a[n-1][m]=combine(n-1,m); 13 | if(!a[n-1][m-1]) a[n-1][m-1]=combine(n-1,m-1); 14 | a[n][m]=a[n-1][m]+a[n-1][m-1]; 15 | } 16 | } 17 | return a[n][m]; 18 | } 19 | int main() 20 | { 21 | __int64 n,m; 22 | for(n=0;n<101;n++) 23 | for(m=0;m<101;m++) a[n][m]=0; 24 | while(scanf("%I64d%I64d",&n,&m)&&(n||m)) 25 | { 26 | printf("%I64d things taken %I64d at a time is %I64d exactly.\n",n,m,combine(n,m)); 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /poj/1316/POJ_1316_2149257_AC_0MS_80K.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | int jisuan(int n) 5 | { 6 | char s[5],i,sum=0; 7 | itoa(n,s,10); 8 | for(i=0;s[i];i++) 9 | sum+=s[i]-'0'; 10 | return n+sum; 11 | } 12 | void main() 13 | { 14 | int a[10001]={0},i,j; 15 | for(i=1;i<=10000;i++) 16 | { 17 | j=jisuan(i); 18 | if(j<=10000) 19 | a[j]=1; 20 | } 21 | for(i=1;i<=10000;i++) 22 | { 23 | if(!a[i]) 24 | printf("%d\n",i); 25 | } 26 | } -------------------------------------------------------------------------------- /poj/1351/POJ_1351_2836845_AC_0MS_148K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | __int64 ans[]={0,0,0,8,64,360,1776,8216,36640,159624,684240,2898296,12164608,50687208,209961648, 5 | 865509848,3553389280}; 6 | int n; 7 | while(scanf("%d",&n)&&n!=-1) 8 | { 9 | printf("%d: %I64d\n",n,ans[n]); 10 | } 11 | return 0; 12 | } -------------------------------------------------------------------------------- /poj/1354/POJ_1354_2834859_AC_78MS_216K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #define big 100000000 3 | typedef __int64 int64; 4 | int64 ans[50]; 5 | void f(int n) 6 | { 7 | int i; 8 | for(i=0;i<50;i++) ans[i]*=n; 9 | for(i=0;i<50;i++) ans[i+1]+=ans[i]/big,ans[i]%=big; 10 | } 11 | int main() 12 | { 13 | int n; 14 | int i; 15 | while(scanf("%d",&n)&&n!=-1) 16 | { 17 | printf("N=%d:\n",n); 18 | for(i=0;i<100;i++) ans[i]=0; 19 | ans[0]=2; 20 | n--; 21 | while(n>1) 22 | { 23 | f(n); 24 | n--; 25 | } 26 | for(i=49;i>=0&&!ans[i];i--); 27 | printf("%I64d",ans[i]); 28 | for(i--;i>=0;i--) 29 | { 30 | printf("%08I64d",ans[i]); 31 | } 32 | printf("\n"); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /poj/1354/POJ_1354_2834860_AC_93MS_148K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define big 100000000 3 | typedef __int64 int64; 4 | int64 ans[50]; 5 | void f(int n) 6 | { 7 | int i; 8 | for(i=0;i<50;i++) ans[i]*=n; 9 | for(i=0;i<50;i++) ans[i+1]+=ans[i]/big,ans[i]%=big; 10 | } 11 | int main() 12 | { 13 | int n; 14 | int i; 15 | while(scanf("%d",&n)&&n!=-1) 16 | { 17 | printf("N=%d:\n",n); 18 | for(i=0;i<100;i++) ans[i]=0; 19 | ans[0]=2; 20 | n--; 21 | while(n>1) 22 | { 23 | f(n); 24 | n--; 25 | } 26 | for(i=49;i>=0&&!ans[i];i--); 27 | printf("%I64d",ans[i]); 28 | for(i--;i>=0;i--) 29 | { 30 | printf("%08I64d",ans[i]); 31 | } 32 | printf("\n"); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /poj/1354/POJ_1354_2834890_AC_93MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define big 10000000000000000 3 | typedef __int64 int64; 4 | int64 ans[25]; 5 | void f(int n) 6 | { 7 | int i; 8 | for(i=0;i<25;i++) ans[i]*=n; 9 | for(i=0;i<25;i++) ans[i+1]+=ans[i]/big,ans[i]%=big; 10 | } 11 | int main() 12 | { 13 | int n; 14 | int i; 15 | while(scanf("%d",&n)&&n!=-1) 16 | { 17 | printf("N=%d:\n",n); 18 | for(i=0;i<24;i++) ans[i]=0; 19 | ans[0]=2; 20 | n--; 21 | while(n>1) 22 | { 23 | f(n); 24 | n--; 25 | } 26 | for(i=24;i>=0&&!ans[i];i--); 27 | printf("%I64d",ans[i]); 28 | for(i--;i>=0;i--) 29 | { 30 | printf("%016I64d",ans[i]); 31 | } 32 | printf("\n"); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /poj/1354/POJ_1354_2834892_AC_31MS_216K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #define big 10000000000000000LL 3 | typedef __int64 int64; 4 | int64 ans[25]; 5 | void f(int n) 6 | { 7 | int i; 8 | for(i=0;i<25;i++) ans[i]*=n; 9 | for(i=0;i<25;i++) ans[i+1]+=ans[i]/big,ans[i]%=big; 10 | } 11 | int main() 12 | { 13 | int n; 14 | int i; 15 | while(scanf("%d",&n)&&n!=-1) 16 | { 17 | printf("N=%d:\n",n); 18 | for(i=0;i<24;i++) ans[i]=0; 19 | ans[0]=2; 20 | n--; 21 | while(n>1) 22 | { 23 | f(n); 24 | n--; 25 | } 26 | for(i=24;i>=0&&!ans[i];i--); 27 | printf("%I64d",ans[i]); 28 | for(i--;i>=0;i--) 29 | { 30 | printf("%016I64d",ans[i]); 31 | } 32 | printf("\n"); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /poj/1362/POJ_1362_3633442_AC_0MS_292K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int a[100]; 3 | int main() 4 | { 5 | __int64 n,i,j,k; 6 | int t; 7 | scanf("%d",&t); 8 | while(t--) 9 | { 10 | scanf("%I64d",&n); 11 | j=1; 12 | k=0; 13 | for(i=1;(j<=0;k--) 34 | { 35 | if(i) printf(","); 36 | i++;printf("%d",a[k]-1); 37 | } 38 | printf("]\n"); 39 | } 40 | return 0; 41 | } -------------------------------------------------------------------------------- /poj/1398/POJ_1398_4170253_AC_235MS_352K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main(void) 3 | { 4 | int g[101][101]; 5 | int t,n,k; 6 | int i,j,l; 7 | scanf("%d",&t); 8 | while(t-->0) 9 | { 10 | scanf("%d %d",&n,&k); 11 | for(i=0;i=0;i--) 19 | for(l=0;l 2 | void main() 3 | { 4 | long n,t,sum; 5 | scanf("%ld",&t); 6 | while(t--) 7 | { 8 | scanf("%ld",&n); 9 | sum=0; 10 | while(n) 11 | { 12 | n/=5; 13 | sum+=n; 14 | } 15 | printf("%ld\n",sum); 16 | } 17 | } -------------------------------------------------------------------------------- /poj/1401/POJ_1401_2231730_AC_125MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | long n,t,sum; 5 | scanf("%ld",&t); 6 | while(t--) 7 | { 8 | scanf("%ld",&n); 9 | sum=0; 10 | while(n) 11 | { 12 | n/=5; 13 | sum+=n; 14 | } 15 | printf("%ld\n",sum); 16 | } 17 | } -------------------------------------------------------------------------------- /poj/1405/POJ_1405_5452041_AC_907MS_5964K.java: -------------------------------------------------------------------------------- 1 | import java.io.*; 2 | import java.util.*; 3 | import java.math.*; 4 | 5 | public class Main { 6 | 7 | public static void main ( String[] args ) throws Exception { 8 | Scanner cin = new Scanner( System.in ); 9 | int n; 10 | BigInteger now; 11 | 12 | while ( cin.hasNext() ){ 13 | n = cin.nextInt(); 14 | now = BigInteger.ONE; 15 | while ( ( n -- ) != 0 ){ 16 | System.out.println( now.add( BigInteger.ONE ).toString() ); 17 | now = now.multiply( now.add( BigInteger.ONE ) ); 18 | } 19 | } 20 | } 21 | 22 | } 23 | -------------------------------------------------------------------------------- /poj/1423/POJ_1423_2220489_AC_0MS_124K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | const double e = 2.7182818284590452354, pi = 3.141592653589793239; 9 | int n; 10 | double a; 11 | long double sum=0; 12 | 13 | 14 | int arr[100]; 15 | cin>>n; 16 | 17 | for (int i=0;i<=n-1;++i) 18 | { 19 | cin>>a; 20 | if(a==1) 21 | arr[i]=1; 22 | else 23 | arr[i]=.5*log10(2*a*pi)+a*log10(a/e)+1; 24 | 25 | } 26 | for (int j=0;j<=n-1;++j) 27 | cout< 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int a, i = 1; 9 | int m, n; 10 | float sum = 0; 11 | 12 | cin >> a; 13 | while(cin >> m >> n) 14 | { 15 | if(m % 2 == 1 && n % 2 == 1) 16 | sum = m * n + sqrt(2.0) - 1; 17 | else 18 | sum = m * n; 19 | printf("Scenario #%d:\n", i++); 20 | printf("%.2f\n\n", sum); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /poj/1455/POJ_1455_2405693_AC_0MS_56K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,t; 5 | scanf("%d",&t); 6 | while(t--) 7 | { 8 | scanf("%d",&n); 9 | printf("%d\n",(n/2)*((n-1)/2)); 10 | } 11 | return 0; 12 | } -------------------------------------------------------------------------------- /poj/1458/POJ_1458_2261372_AC_0MS_372K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int Max(int a,int b) 4 | { 5 | return a>b?a:b; 6 | } 7 | void main(){ 8 | char s1[300],s2[300]; 9 | int i,j,len1,len2,d[300][300]={0}; 10 | while(scanf("%s %s",s1,s2)!=EOF) 11 | { 12 | d[0][0]=0; 13 | len1=strlen(s1); 14 | len2=strlen(s2); 15 | for(i=1;i<=len1;i++) 16 | for(j=1;j<=len2;j++) 17 | { 18 | if(s1[i-1]==s2[j-1]) 19 | d[i][j]=d[i-1][j-1]+1; 20 | else 21 | { 22 | d[i][j]=Max(d[i-1][j],d[i][j-1]); 23 | } 24 | } 25 | 26 | printf("%d\n",d[i-1][j-1]); 27 | } 28 | } -------------------------------------------------------------------------------- /poj/1468/POJ_1468_2554804_AC_2781MS_144K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define maxn 5009 3 | int a[maxn][4]; 4 | bool jud(int i,int j) 5 | { 6 | if((a[j][0]>=a[i][0]&&a[j][1]<=a[i][1])&&(a[j][2]>=a[i][2]&&a[j][3]<=a[i][3])) return 1; 7 | else return 0; 8 | } 9 | int main() 10 | { 11 | int n; 12 | int i,j,ans; 13 | while(scanf("%d",&n)!=EOF) 14 | { 15 | for(i=0;i 2 | void main() 3 | { 4 | int a[60],i,j,sum,n,k; 5 | k=0; 6 | while(scanf("%d",&n)&&n) 7 | { 8 | k++; 9 | sum=0; 10 | for(i=0;isum) 19 | j+=a[i]-sum; 20 | } 21 | printf("Set #%d\nThe minimum number of moves is %d.\n\n",k,j); 22 | } 23 | } -------------------------------------------------------------------------------- /poj/1496/POJ_1496_2262422_AC_15MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | long com(int x,int y) 4 | { 5 | if(x==y||y==0) return 1; 6 | else return com(x-1,y)+com(x-1,y-1); 7 | } 8 | int main() 9 | { 10 | char s[13]; 11 | long n; 12 | int i,j; 13 | while(scanf("%s",s)!=EOF) 14 | { 15 | for(i=0;s[i+1];i++) 16 | { 17 | if(s[i]>=s[i+1]) break; 18 | } 19 | if(s[i+1]) printf("0\n"); 20 | else 21 | { 22 | i=strlen(s); 23 | for(--i,n=0;i;i--) 24 | n+=com(26,i); 25 | for(i=0;s[i];i++) 26 | { 27 | if(i==0)j='a'; 28 | else j=s[i-1]+1; 29 | for(;j 2 | #include 3 | void main() 4 | { 5 | char s[120][120]; 6 | int a[120],i=0,k,j; 7 | while(1) 8 | { 9 | gets(s[i]); 10 | if(strlen(s[i])==1&&s[i][0]=='0') 11 | break; 12 | i++; 13 | } 14 | for(j=0;j<120;j++) 15 | a[j]=0; 16 | for(i--;i>=0;i--) 17 | { 18 | for(j=119,k=strlen(s[i])-1;k>=0;k--,j--) 19 | a[j]+=s[i][k]-'0'; 20 | } 21 | for(j=119;j>=0;j--) 22 | { 23 | a[j-1]+=a[j]/10; 24 | a[j]%=10; 25 | } 26 | for(j=0;a[j]==0;j++); 27 | for(;j<120;j++) 28 | printf("%d",a[j]); 29 | printf("\n"); 30 | 31 | } -------------------------------------------------------------------------------- /poj/1504/POJ_1504_2413979_AC_15MS_40K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int re(int n) 3 | { 4 | int m=0; 5 | for(;n;) 6 | { 7 | m=n%10+m*10; 8 | n/=10; 9 | } 10 | return m; 11 | } 12 | int main() 13 | { 14 | int n,m,sum,t; 15 | scanf("%d",&t); 16 | while(t--) 17 | { 18 | scanf("%d%d",&n,&m); 19 | n=re(n); 20 | m=re(m); 21 | printf("%d\n",re(n+m)); 22 | } 23 | return 0; 24 | 25 | } -------------------------------------------------------------------------------- /poj/1517/POJ_1517_2173077_AC_0MS_52K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | cout<<"n e"< 2 | void main() 3 | { 4 | int i,sum; 5 | char s[100000]; 6 | while(scanf("%s",s)) 7 | { 8 | sum=0; 9 | if(s[0]=='0') 10 | break; 11 | else 12 | { 13 | for(i=0;s[i];i++) 14 | { 15 | sum+=s[i]-'0'; 16 | } 17 | sum%=9; 18 | if(sum!=0) 19 | printf("%d\n",sum); 20 | else 21 | printf("9\n"); 22 | } 23 | } 24 | } -------------------------------------------------------------------------------- /poj/1528/POJ_1528_2264448_AC_0MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i,n,sum; 5 | printf("PERFECTION OUTPUT\n"); 6 | while(scanf("%d",&n)&&n) 7 | { 8 | if(n==1) 9 | { 10 | printf(" 1 DEFICIENT\n"); 11 | continue; 12 | } 13 | sum=1; 14 | for(i=2;i*i 2 | 3 | int main ( void ) 4 | { 5 | int i , j , k , num ; 6 | int number ; 7 | 8 | scanf ( "%i" , &number ) ; 9 | 10 | for ( num = 1 ; num <= number ; ++num ) 11 | for ( i = 2 ; i < num ; ++i ) 12 | for ( j = i ; j < num ; ++j ) 13 | for ( k = j ; k < num ; ++k ) 14 | if ( num * num * num == i * i * i + j * j * j + k * k * k ) 15 | printf ( "Cube = %i, Triple = (%i,%i,%i)\n" , num , i , j , k ) ; 16 | 17 | 18 | return 0 ; 19 | } -------------------------------------------------------------------------------- /poj/1543/POJ_1543_2149323_AC_78MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main ( void ) 3 | { 4 | int i , j , k , num ; 5 | int number ; 6 | 7 | scanf ( "%i" , &number ) ; 8 | 9 | for ( num = 1 ; num <= number ; ++num ) 10 | for ( i = 2 ;i * i * i<=num*num*num; ++i ) 11 | for ( j = i ; i * i * i + j * j * j<=num*num*num; ++j ) 12 | for ( k = j ; i * i * i + j * j * j + k * k * k<=num*num*num; ++k ) 13 | if ( num * num * num == i * i * i + j * j * j + k * k * k ) 14 | printf ( "Cube = %i, Triple = (%i,%i,%i)\n" , num , i , j , k ) ; 15 | 16 | 17 | return 0 ; 18 | } -------------------------------------------------------------------------------- /poj/1552/POJ_1552_2149280_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int a[20],i,j,k,l; 5 | while(1) 6 | { 7 | i=0; 8 | while(1) 9 | { 10 | scanf("%d",&k); 11 | if(k==-1)goto lin; 12 | else if(k==0)break; 13 | else a[i++]=k; 14 | 15 | } 16 | for(j=0,k=0;j 2 | #include 3 | int main() 4 | { 5 | char s[100]; 6 | int i; 7 | long n,m; 8 | while(1) 9 | { 10 | gets(s); 11 | if(strlen(s)==1&&s[0]=='0')break; 12 | else 13 | { 14 | m=2; 15 | n=0; 16 | for(i=strlen(s)-1;i>=0;m*=2,i--) 17 | n+=(m-1)*(s[i]-'0'); 18 | } 19 | printf("%ld\n",n); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /poj/1595/POJ_1595_2221960_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a[200]={1},i,j,n,c,k,flag=0; 5 | a[1]=2; 6 | for(i=3,n=2;i<1100;i++) 7 | { 8 | for(j=1;a[j]*a[j]<=i;j++) 9 | { 10 | if(i%a[j]==0) break; 11 | } 12 | if(i%a[j]) a[n++]=i; 13 | } 14 | while(scanf("%d%d",&n,&c)!=EOF) 15 | { 16 | 17 | for(i=0;a[i]<=n;i++); 18 | if(i&1) 19 | { 20 | j=(i-1)/2-c+1; 21 | k=(i-1)/2+c-1; 22 | } 23 | else 24 | { 25 | j=i/2-c; 26 | k=i/2+c-1; 27 | } 28 | if(j<0)j=0; 29 | if(k>i-1)k=i-1; 30 | printf("%d %d:",n,c); 31 | for(i=j;i<=k;i++) 32 | printf(" %d",a[i]); 33 | printf("\n"); 34 | flag++; 35 | printf("\n"); 36 | } 37 | return 0; 38 | } 39 | -------------------------------------------------------------------------------- /poj/1604/POJ_1604_2224542_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n; 5 | int i,j,sum,k; 6 | while(scanf("%d",&n)!=EOF) 7 | { 8 | sum=n; 9 | for(i=0;sum;) 10 | { 11 | i+=sum/5; 12 | sum/=5; 13 | } 14 | for(sum=j=1;j<=n;j++) 15 | { 16 | k=j; 17 | if(k%2==0&&i) 18 | { 19 | while(k%2==0&&i) 20 | { 21 | k/=2; 22 | i--; 23 | } 24 | } 25 | while(k%5==0) k/=5; 26 | sum*=k; 27 | sum%=10; 28 | } 29 | printf("%5d -> %d\n",n,sum); 30 | } 31 | return 0; 32 | } -------------------------------------------------------------------------------- /poj/1604/POJ_1604_2734426_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int b[10]= {1, 1, 2, 6, 4, 2, 2, 4, 2, 8}; 3 | int a[10]={1, 1, 2, 6, 4, 4, 4, 8, 4, 6}; 4 | int f(int n) 5 | { 6 | int i,j; 7 | if(n<10) return b[n]; 8 | i=f(n/5)*a[n%10]*6; 9 | i%=10; 10 | j=n/5; 11 | if(j%4==0) j=4; 12 | else j=j%4; 13 | for(;j;j--) 14 | { 15 | if(i==2) i=6; 16 | else if (i==6) i=8; 17 | else i/=2; 18 | } 19 | return i; 20 | } 21 | int main() 22 | { 23 | int n; 24 | while(scanf("%d",&n)!=EOF) 25 | { 26 | printf("%5d -> %d\n",n,f(n)); 27 | } 28 | return 0; 29 | } -------------------------------------------------------------------------------- /poj/1607/POJ_1607_2440665_AC_31MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | double l; 5 | int n,i,j; 6 | printf("Cards Overhang\n"); 7 | while(scanf("%d",&n)!=EOF) 8 | { 9 | 10 | if(n==1) printf(" 1 0.500\n"); 11 | else 12 | { 13 | i=2; 14 | j=2; 15 | l=0.5; 16 | for(;i<=n;i++) 17 | { 18 | l+=0.5/i; 19 | } 20 | printf("%5d %9.3lf\n",n,l); 21 | } 22 | } 23 | return 0; 24 | } -------------------------------------------------------------------------------- /poj/1607/POJ_1607_2440673_AC_15MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | double l; 5 | int n,i; 6 | printf("Cards Overhang\n"); 7 | while(scanf("%d",&n)!=EOF) 8 | { 9 | l=0; 10 | for(i=1;i<=n;i++) 11 | { 12 | l+=0.5/i; 13 | } 14 | printf("%5d %9.3lf\n",n,l); 15 | 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /poj/1607/POJ_1607_2440685_AC_15MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | double l; 5 | int n,i; 6 | printf("Cards Overhang\n"); 7 | while(scanf("%d",&n)!=EOF) 8 | { 9 | l=0; 10 | for(i=1;i<=n;i++) 11 | { 12 | l+=0.5/i; 13 | } 14 | printf("%5d %9.3lf\n",n,l); 15 | 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /poj/1607/POJ_1607_2440686_AC_30MS_56K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | double l; 5 | int n,i; 6 | printf("Cards Overhang\n"); 7 | while(scanf("%d",&n)!=EOF) 8 | { 9 | l=0; 10 | for(i=1;i<=n;i++) 11 | { 12 | l+=0.5/i; 13 | } 14 | printf("%5d %9.3lf\n",n,l); 15 | 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /poj/1607/POJ_1607_2440699_AC_31MS_56K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | {double l;int n,i;printf("Cards Overhang\n");while(scanf("%d",&n)!=EOF){l=0;for(i=1;i<=n;i++){l+=0.5/i;}printf("%5d %9.3lf\n",n,l);}return 0;} -------------------------------------------------------------------------------- /poj/1635/POJ_1635_3915537_AC_0MS_376K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int h[9999]; 4 | char s[9999],t[9999],*p; 5 | int hash(int j) 6 | { 7 | int sum=h[j+5000]; 8 | while (*p && *p++=='0') 9 | sum=(sum+h[j]*hash(j+1)) % 19001; 10 | return ((sum*sum) % 19001); 11 | } 12 | int main() 13 | { 14 | int i,n; 15 | scanf("%d",&n); 16 | for(i=0;i<9999;i++) 17 | h[i]=rand()%19001; 18 | while (n--) 19 | { 20 | scanf("%s%s",s,t); 21 | p=s; 22 | i=hash(0); 23 | p=t; 24 | printf("%s\n",i==hash(0)?"same":"different"); 25 | //可以多次hash，避免冲突 26 | } 27 | return 0; 28 | } -------------------------------------------------------------------------------- /poj/1656/POJ_1656_2386898_AC_0MS_44K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a[101][101]={0},i,j; 5 | int x,y,l,n,sum; 6 | char str[20]; 7 | scanf("%d",&n); 8 | while(n--) 9 | { 10 | scanf("%s %d %d %d",str,&x,&y,&l); 11 | if(str[0]=='B') 12 | { 13 | for(i=x;i 2 | void main() 3 | { 4 | long i,j,k,l,n; 5 | scanf("%d",&n); 6 | while(n--) 7 | { 8 | scanf("%ld %ld %ld %ld",&i,&j,&k,&l); 9 | if(i+l==j+k) 10 | printf("%ld %ld %ld %ld %ld\n",i,j,k,l,j+l-i); 11 | else 12 | printf("%ld %ld %ld %ld %ld\n",i,j,k,l,j/i*l); 13 | } 14 | } -------------------------------------------------------------------------------- /poj/1658/POJ_1658_2146767_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int i,j,k,l,n; 5 | scanf("%d",&n); 6 | while(n--) 7 | { 8 | scanf("%d %d %d %d",&i,&j,&k,&l); 9 | if(i+l==j+k) 10 | printf("%d %d %d %d %d\n",i,j,k,l,j+l-i); 11 | else 12 | printf("%d %d %d %d %d\n",i,j,k,l,j/i*l); 13 | } 14 | } -------------------------------------------------------------------------------- /poj/1663/POJ_1663_2146807_AC_78MS_8K.c: -------------------------------------------------------------------------------- 1 | #include 2 | int find(int n) 3 | { 4 | int i,k=0; 5 | if(n==0) 6 | return 0; 7 | for(i=1;i<=n;i++) 8 | { 9 | if(i&1) 10 | k++; 11 | else 12 | k+=3; 13 | } 14 | return k; 15 | } 16 | void main() 17 | { 18 | int x,y,n; 19 | scanf("%d",&n); 20 | while(n--) 21 | { 22 | scanf("%d %d",&x,&y); 23 | if(x==y) 24 | printf("%d\n",find(x)); 25 | else if(x-y==2)printf("%d\n",find(y)+2); 26 | else printf("No Number\n"); 27 | } 28 | } -------------------------------------------------------------------------------- /poj/1664/POJ_1664_2189997_AC_0MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int sum; 3 | void find(int m,int n,int k) 4 | { 5 | int i; 6 | if(m==0) 7 | sum++; 8 | else 9 | { 10 | for(i=n;i>0;i--) 11 | { 12 | if(i>m) 13 | continue; 14 | else 15 | find(m-i,i,++k); 16 | } 17 | } 18 | } 19 | void main() 20 | { 21 | int n,t,m,i; 22 | scanf("%d",&t); 23 | while(t--) 24 | { 25 | sum=0; 26 | scanf("%d %d",&n,&m); 27 | find(n,m,0); 28 | printf("%d\n",sum); 29 | } 30 | } -------------------------------------------------------------------------------- /poj/1664/POJ_1664_2189999_AC_0MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int sum; 3 | void find(int m,int n) 4 | { 5 | int i; 6 | if(m==0) 7 | sum++; 8 | else 9 | { 10 | for(i=n;i>0;i--) 11 | { 12 | if(i>m) 13 | continue; 14 | else 15 | find(m-i,i); 16 | } 17 | } 18 | } 19 | void main() 20 | { 21 | int n,t,m,i; 22 | scanf("%d",&t); 23 | while(t--) 24 | { 25 | sum=0; 26 | scanf("%d %d",&n,&m); 27 | find(n,m); 28 | printf("%d\n",sum); 29 | } 30 | } -------------------------------------------------------------------------------- /poj/1664/POJ_1664_2402836_AC_0MS_56K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | int f(int x,int y){ 5 | if(x>t; 16 | for(i=1;i<=t;i++){ 17 | cin>>x>>y; 18 | cout< 2 | void main(){ 3 | int i=1; 4 | float p=3.1415927; 5 | int b; 6 | float a,d,e,c; 7 | scanf ("%f %d %f",&a,&b,&c); 8 | while (b!=0){ 9 | d=a*b*p/5280/12; 10 | e=a*b/c*p*3600/5280/12; 11 | printf("Trip #%d: %.2f %.2f\n",i,d,e); 12 | i++; 13 | scanf("%f %d %f",&a,&b,&c); 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /poj/1674/POJ_1674_2246421_AC_765MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int n, a[10005], i, cas, j; 5 | scanf("%d",&cas); 6 | while(cas--) 7 | { 8 | int sum = 0; 9 | scanf("%d",&n); 10 | for(i = 1;i <= n;i++) 11 | scanf("%d",&a[i]); 12 | for(i = 1;i <= n;i++) 13 | { 14 | if(a[i]!=i) 15 | for(j = i + 1;j<=n;j++) 16 | if(a[j]==i) 17 | { 18 | a[j]=a[i];a[i]=i; 19 | sum++; 20 | break; 21 | } 22 | } 23 | printf("%d\n",sum); 24 | } 25 | } 26 | 27 | -------------------------------------------------------------------------------- /poj/1674/POJ_1674_2262533_AC_62MS_164K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int arr[10001]; 6 | 7 | int main() 8 | { 9 | int N; 10 | scanf("%d",&N); 11 | while(N--){ 12 | int n; 13 | scanf("%d",&n); 14 | for(int i=1;i<=n;i++){ 15 | scanf("%d",&arr[i]); 16 | } 17 | int cnt=0; 18 | for(int i=1;i<=n;i++){ 19 | while(arr[i]!=i){ 20 | swap(arr[i],arr[arr[i]]); 21 | cnt++; 22 | } 23 | } 24 | printf("%d\n",cnt); 25 | } 26 | } 27 | 28 | -------------------------------------------------------------------------------- /poj/1704/POJ_1704_3187130_AC_0MS_148K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int a[1100]; 7 | int n,i,j,k; 8 | int ans; 9 | int t; 10 | scanf("%d",&t); 11 | while(t--) 12 | { 13 | scanf("%d",&n); 14 | for(i=0;i 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int a[1100]; 7 | int n,i,j,k; 8 | int ans; 9 | int t; 10 | scanf("%d",&t); 11 | while(t--) 12 | { 13 | scanf("%d",&n); 14 | for(i=0;i 2 | #include 3 | #include 4 | using namespace std; 5 | int main() 6 | { 7 | char s[200]; 8 | char s1[200],s2[200]; 9 | int n; 10 | while(scanf("%s",s)!=EOF) 11 | { 12 | n=strlen(s); 13 | sort(s,s+n); 14 | strcpy(s1,s); 15 | printf("%s\n",s); 16 | strcpy(s2,s); 17 | next_permutation(s,s+n); 18 | while(strcmp(s1,s)!=0) 19 | { 20 | if(strcmp(s,s2)!=0) printf("%s\n",s); 21 | strcpy(s2,s); 22 | next_permutation(s,s+n); 23 | } 24 | } 25 | return 0; 26 | } -------------------------------------------------------------------------------- /poj/1745/POJ_1745_2265268_AC_512MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a[105],n,i,j,k,mod,b[105]; 5 | while(scanf("%d%d",&n,&k)!=EOF) 6 | { 7 | for(i=0;ii&&!a[mod]) 20 | b[mod]=1; 21 | a[mod]=1; 22 | mod=((i-j)%k+k)%k; 23 | if(mod>i&&!a[mod]) 24 | b[mod]=1; 25 | a[mod]=1; 26 | } 27 | if(b[i]) b[i]=0; 28 | } 29 | } 30 | if(a[0]) printf("Divisible\n"); 31 | else printf("Not divisible\n"); 32 | } 33 | return 0; 34 | } -------------------------------------------------------------------------------- /poj/1799/POJ_1799_2405576_AC_31MS_80K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define pi 3.141592653 4 | 5 | int main() 6 | { 7 | double angel,R,r; 8 | int n,t,i=1; 9 | scanf("%d",&t); 10 | while(i<=t) 11 | { 12 | scanf("%lf%d",&R,&n); 13 | angel=pi/n; 14 | angel=sin(angel); 15 | printf("Scenario #%d:\n%.3lf\n",i,angel*R/(1+angel)); 16 | if(i!=t) printf("\n"); 17 | i++; 18 | } 19 | return 0; 20 | } 21 | 22 | -------------------------------------------------------------------------------- /poj/1833/POJ_1833_2519512_AC_250MS_120K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main(void) 7 | { 8 | int t, n, k, i; 9 | int data[1024]; 10 | 11 | scanf("%d", &t); 12 | while (t--) 13 | { 14 | scanf("%d%d", &n, &k); 15 | for (i = 0 ; i < n ; i++) 16 | scanf("%d", data + i); 17 | while (next_permutation(data, data + n), --k); 18 | for (i = 0 ; i < n ; i++) 19 | printf("%d%c", data[i], i == n - 1 ? '\n' : ' '); 20 | } 21 | 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /poj/1844/POJ_1844_2246406_AC_0MS_32K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int n,i,sum; 6 | while(scanf("%d",&n)!=EOF) 7 | { 8 | i=(sqrt(1+8*n)-1)/2; 9 | sum=(i+1)*i/2; 10 | while(sum 2 | #include 3 | long com(int x,int y) 4 | { 5 | if(x==y||y==0) return 1; 6 | else return com(x-1,y)+com(x-1,y-1); 7 | } 8 | int main() 9 | { 10 | char s[13]; 11 | long n; 12 | int i,j; 13 | while(scanf("%s",s)!=EOF) 14 | { 15 | for(i=0;s[i+1];i++) 16 | { 17 | if(s[i]>=s[i+1]) break; 18 | } 19 | if(s[i+1]) printf("0\n"); 20 | else 21 | { 22 | i=strlen(s); 23 | for(--i,n=0;i;i--) 24 | n+=com(26,i); 25 | for(i=0;s[i];i++) 26 | { 27 | if(i==0)j='a'; 28 | else j=s[i-1]+1; 29 | for(;j 2 | #include 3 | #include 4 | int cmp(const void *n,const void *m) 5 | { 6 | return *(int *)m-*(int *)n; 7 | } 8 | int main() 9 | { 10 | int a[100]; 11 | int i,j,k; 12 | scanf("%d",&k); 13 | for(i=0;i 2 | #define lenth 16200 3 | int main() 4 | { 5 | int n,speed,time,i,sum; 6 | while(scanf("%d",&n)&&n) 7 | 8 | { 9 | sum=1000000; 10 | for(i=0;itime?time:sum; 18 | } 19 | } 20 | printf("%d\n",sum); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /poj/1936/POJ_1936_2166006_AC_0MS_204K.c: -------------------------------------------------------------------------------- 1 | #include 2 | #define N 100000 3 | 4 | int main() 5 | { 6 | char s[N], t[N]; 7 | int i, index; 8 | 9 | while (EOF != scanf("%s%s", s, t)) 10 | { 11 | index = 0; 12 | for (i = 0; t[i] != '\0'; i++) 13 | { 14 | if (s[index] == t[i]) 15 | { 16 | index++; 17 | if (s[index] == '\0') 18 | { 19 | printf("Yes\n"); 20 | break; 21 | } 22 | } 23 | } 24 | if (t[i] == '\0') 25 | printf("No\n"); 26 | } 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /poj/1953/POJ_1953_2861170_AC_0MS_64K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int ans[]={0,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711, 3 | 28657,46368,75025,121393,196418,317811,514229,832040,1346269,2178309, 4 | 3524578,5702887,9227465,14930352,24157817,39088169,63245986,102334155,165580141, 5 | 267914296,433494437,701408733,1134903170,1836311903,2971215073}; 6 | int main() 7 | { 8 | int t=1; 9 | int i,n; 10 | scanf("%d",&t); 11 | for(i=1;i<=t;i++) 12 | { 13 | scanf("%d",&n); 14 | printf("Scenario #%d:\n%d\n\n",i,ans[n]); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /poj/1969/POJ_1969_2219975_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int n,sum,i,k; 5 | while(scanf("%d",&n)!=EOF) 6 | { 7 | k=n; 8 | for(i=1;i*(i+1)/2<=n;i++); 9 | sum=i*(i-1)/2; 10 | n-=sum; 11 | if(n) 12 | { 13 | if(i&1) printf("TERM %d IS %d/%d\n",k,i+1-n,n); 14 | else n=i-n+1,printf("TERM %d IS %d/%d\n",k,i+1-n,n); 15 | } 16 | else 17 | { 18 | if(i&1) printf("TERM %d IS %d/%d\n",k,i-1,1); 19 | else n=i-n+1,printf("TERM %d IS %d/%d\n",k,1,i-1); 20 | } 21 | } 22 | } -------------------------------------------------------------------------------- /poj/1978/POJ_1978_2675924_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int a[60],n,p,c; 3 | void f() 4 | { 5 | int b[60],i,j; 6 | for(j=i=0;j 2 | using namespace std; 3 | #define maxn 1000000 4 | int flag[maxn]; 5 | int a[maxn]; 6 | int main() 7 | { 8 | int n,i,j,k; 9 | while(scanf("%d%d",&n,&k)!=EOF) 10 | { 11 | for(i=0;i 2 | char a[1000+100][1000+100]; 3 | int dp[1100][1100]; 4 | int main() 5 | { 6 | int r,s,i,j; 7 | int t; 8 | scanf("%d",&t); 9 | while(t--) 10 | { 11 | scanf("%d%d",&r,&s); 12 | for(i=0;i 2 | int m; 3 | int f(int a,int b) 4 | { 5 | __int64 mod; 6 | if(b==0) return 1; 7 | else if(b==1) return a%m; 8 | else 9 | { 10 | mod=f(a,b/2); 11 | mod*=mod; 12 | mod%=m; 13 | if(b%2==1) return (mod*a)%m; 14 | else return mod; 15 | } 16 | } 17 | int main() 18 | { 19 | int t,h,a,b; 20 | int ans; 21 | scanf("%d",&t); 22 | while(t--) 23 | { 24 | ans=0; 25 | scanf("%d%d",&m,&h); 26 | while(h--) 27 | { 28 | scanf("%d%d",&a,&b); 29 | ans+=f(a,b); 30 | ans%=m; 31 | } 32 | printf("%d\n",ans); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /poj/2000/POJ_2000_2146836_AC_15MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int i,j,k; 5 | while(scanf("%d",&j)&&j) 6 | { 7 | k=0; 8 | for(i=1;i*(i+1)/2<=j;i++) 9 | { 10 | k+=i*i; 11 | } 12 | k-i*i; 13 | k+=(j-i*(i-1)/2)*i;; 14 | printf("%d %d\n",j,k); 15 | } 16 | } -------------------------------------------------------------------------------- /poj/2000/POJ_2000_2202200_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int n,i,j,sum,m; 5 | // scanf("%d",&n); 6 | // while(n) 7 | // { 8 | while(scanf("%d",&m)) 9 | { 10 | if(!m) 11 | { 12 | // n--; 13 | // if(n) 14 | // printf("\n"); 15 | break; 16 | } 17 | else 18 | { 19 | sum=0; 20 | for(i=1;i*(i+1)/2<=m;i++) 21 | { 22 | sum+=i*i; 23 | } 24 | i--; 25 | sum+=(m-(i+1)*i/2)*(i+1); 26 | printf("%d %d\n",m,sum); 27 | } 28 | } 29 | // } 30 | } -------------------------------------------------------------------------------- /poj/2007/POJ_2007_3812511_AC_16MS_316K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | struct node 5 | { 6 | int x,y; 7 | }a[100]; 8 | int cross(const node x,const node y) 9 | { 10 | int dx1,dy1,dx2,dy2; 11 | dx1=x.x-a[0].x; 12 | dy1=x.y-a[0].y; 13 | dx2=y.x-a[0].x; 14 | dy2=y.y-a[0].y; 15 | return dx1*dy2-dx2*dy1; 16 | } 17 | bool cmp(const node &x,const node &y) 18 | { 19 | return cross(x,y)>0; 20 | } 21 | int main() 22 | { 23 | int n=0; 24 | while(scanf("%d%d",&a[n].x,&a[n].y)!=EOF) n++; 25 | sort(a+1,a+n,cmp); 26 | int i; 27 | for(i=0;i 2 | void main() 3 | { 4 | char s[15][51]; 5 | int n,a[15],j,i,l,k=0; 6 | scanf("%d",&n); 7 | while(n) 8 | { 9 | k++; 10 | for(j=i=0,l=n-1;i 2 | void main() 3 | { 4 | char s[15][51]; 5 | int n,a[15],j,i,l,k=0; 6 | scanf("%d",&n); 7 | while(n) 8 | { 9 | k++; 10 | for(j=i=0,l=n-1;i 2 | int main() 3 | { 4 | int max; 5 | int xx=0,yy=0; 6 | int tpx,tpy; 7 | int x,y; 8 | while(scanf("%d",&max)&&max) 9 | { 10 | tpx=max; 11 | tpy=0; 12 | xx=yy=0; 13 | while(scanf("%d%d",&x,&y)) 14 | { 15 | if(x==-1) break; 16 | if(x<=tpx) 17 | { 18 | tpx-=x; 19 | tpy=tpy 2 | void main() 3 | 4 | { 5 | int n,i,j,sum,k; 6 | while(1) 7 | { 8 | scanf("%d",&n); 9 | if(n==-1)break; 10 | else 11 | { 12 | sum=0; 13 | k=0; 14 | while(n--) 15 | { 16 | scanf("%d %d",&i,&j); 17 | sum+=(j-k)*i; 18 | k=j; 19 | } 20 | printf("%d miles\n",sum); 21 | } 22 | } 23 | } -------------------------------------------------------------------------------- /poj/2027/POJ_2027_2146698_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int i,j,n; 5 | scanf("%d",&n); 6 | while(n--) 7 | { 8 | scanf("%d %d",&i,&j); 9 | if(i 2 | void main() 3 | { 4 | int a[101],i,m,n,k,j; 5 | while(scanf("%d %d",&n,&m)&&(m||n)) 6 | { 7 | for(i=0;i<101;i++)a[i]=0; 8 | while(n--) 9 | { 10 | scanf("%d",&k); 11 | { 12 | for(i=0;i=m?j:0); 24 | } 25 | } -------------------------------------------------------------------------------- /poj/2028/POJ_2028_2156830_AC_15MS_12K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int a[101],i,m,n,k,j; 5 | for(i=0;i<101;i++)a[i]=0; 6 | while(scanf("%d %d",&n,&m)&&(m||n)) 7 | { 8 | while(n--) 9 | { 10 | scanf("%d",&k); 11 | { 12 | for(i=0;i=m?j:0); 29 | } 30 | } -------------------------------------------------------------------------------- /poj/2033/POJ_2033_2206329_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char s[5050]; 5 | int i; 6 | long a,b,c,temp; 7 | while(1) 8 | { 9 | scanf("%s",s); 10 | if(s[0]=='0') 11 | break; 12 | else 13 | { 14 | c=a=b=1; 15 | 16 | for(i=1;s[i];i++) 17 | { 18 | if(s[i]=='0') c=b; 19 | else 20 | { 21 | if((s[i-1]-'0')*10+s[i]-'0'>=10&&(s[i-1]-'0')*10+s[i]-'0'<=26&&s[i+1]!='0') 22 | c=a+b; 23 | else 24 | { 25 | c=b; 26 | } 27 | a=b; 28 | b=c; 29 | } 30 | } 31 | } 32 | printf("%ld\n",c); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /poj/2039/POJ_2039_2320110_AC_0MS_52K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int col; 7 | int i,j; 8 | while(cin>>col&&col) 9 | { 10 | char a[207]; 11 | cin>>a;//gets(a) get a wa but cin>>a gets AC Why?? 12 | int len=strlen(a); 13 | int row=len/col; 14 | for(i=0;i 2 | #include 3 | int sum; 4 | long a[256],n; 5 | void find(int n,int k,int j) 6 | { 7 | int i; 8 | if(n==0||k==0) 9 | { 10 | if(n==0) 11 | { 12 | sum++; 13 | return; 14 | } 15 | else 16 | return; 17 | } 18 | else 19 | { 20 | i=(int)sqrt(n)-1>j?j:(int)sqrt(n)-1; 21 | for(;i>=0;i--) 22 | { 23 | if(a[i]*k 2 | void main() 3 | { 4 | float i,j,k,flag; 5 | while(1) 6 | { 7 | scanf("%f %f %f",&i,&j,&k); 8 | if(!i&&!j&&!k) 9 | break; 10 | else 11 | { 12 | flag=0; 13 | if(i<=4.5&&j>=150&&k>=200) 14 | {printf("Wide Receiver "); 15 | flag=1; 16 | } 17 | if(i<=6.0&&j>=300&&k>=500){ 18 | printf("Lineman "); 19 | flag=1;} 20 | if(i<=5.0&&j>=200&&k>=300){ 21 | printf("Quarterback "); 22 | flag=1;} 23 | if(flag==0) 24 | printf("No positions "); 25 | printf("\n"); 26 | } 27 | } 28 | } -------------------------------------------------------------------------------- /poj/2081/POJ_2081_2652537_AC_937MS_13484K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | set mp; 5 | int a[500009]; 6 | int main() 7 | { 8 | int i,j; 9 | a[0]=0; 10 | mp.clear(); 11 | mp.insert(0); 12 | for(i=1;i<=500000;i++) 13 | { 14 | j=a[i-1]-i; 15 | if(j>0) 16 | { 17 | if(mp.find(j)==mp.end()) 18 | { 19 | a[i]=j; 20 | mp.insert(j); 21 | } 22 | else 23 | { 24 | a[i]=a[i-1]+i; 25 | mp.insert(a[i]); 26 | } 27 | } 28 | else 29 | { 30 | a[i]=a[i-1]+i; 31 | mp.insert(a[i]); 32 | } 33 | } 34 | while(scanf("%d",&i)&&i!=-1) 35 | { 36 | printf("%d\n",a[i]); 37 | } 38 | return 0; 39 | } 40 | -------------------------------------------------------------------------------- /poj/2081/POJ_2081_2652547_AC_0MS_3308K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | bool flag[3012600]={0}; 3 | int a[500009]; 4 | int main() 5 | { 6 | int i,j; 7 | a[0]=0; 8 | flag[0]=1; 9 | for(i=1;i<=500000;i++) 10 | { 11 | j=a[i-1]-i; 12 | if(j>0) 13 | { 14 | if(!flag[j]) 15 | { 16 | a[i]=j; 17 | flag[j]=1; 18 | } 19 | else 20 | { 21 | a[i]=a[i-1]+i; 22 | flag[a[i]]=1; 23 | } 24 | } 25 | else 26 | { 27 | a[i]=a[i-1]+i; 28 | flag[a[i]]=1; 29 | } 30 | } 31 | while(scanf("%d",&i)&&i!=-1) 32 | { 33 | printf("%d\n",a[i]); 34 | } 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /poj/2083/POJ_2083_2204001_AC_125MS_568K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | char a[740][740]; 4 | void print(int x,int y,int n) 5 | { 6 | long i; 7 | if(n==1) a[x][y]='X'; 8 | else 9 | { 10 | i=pow(3,n-2); 11 | print(x,y,n-1); 12 | print(x+2*i,y,n-1); 13 | print(x+i,y+i,n-1); 14 | print(x,y+2*i,n-1); 15 | print(x+2*i,y+2*i,n-1); 16 | } 17 | } 18 | void main() 19 | { 20 | int n,i,j; 21 | print(0,0,7); 22 | while(scanf("%d",&n)!=EOF&&n!=-1) 23 | { 24 | for(i=0;i 2 | #include 3 | char a[740][740]; 4 | void print(int x,int y,int n) 5 | { 6 | long i; 7 | if(n==1) a[x][y]='X'; 8 | else 9 | { 10 | i=pow(3,n-2); 11 | print(x,y,n-1); 12 | print(x+2*i,y,n-1); 13 | print(x+i,y+i,n-1); 14 | print(x,y+2*i,n-1); 15 | print(x+2*i,y+2*i,n-1); 16 | } 17 | } 18 | void main() 19 | { 20 | int n,i,j; 21 | print(0,0,7); 22 | while(scanf("%d",&n)!=EOF&&n!=-1) 23 | { 24 | for(i=0;i 2 | typedef __int64 int64; 3 | int main() 4 | { 5 | int64 n,m,sum; 6 | int i,j,k; 7 | while(scanf("%I64d%I64d",&n,&m)!=EOF) 8 | { 9 | if(n==-1&&m==-1) break ; 10 | k=1; 11 | for(i=1;i<=n;i++) 12 | { 13 | sum=(n-i)*(n-i-1)/2; 14 | if(sum>=m) 15 | { 16 | printf("%d ",i); 17 | } 18 | else 19 | { 20 | m=m-sum+i; 21 | printf("%d ",m); 22 | break; 23 | } 24 | } 25 | for(j=n;j>=i;j--) 26 | { 27 | if(j==m) continue; 28 | printf("%d ",j); 29 | } 30 | printf("\n"); 31 | } 32 | return 0; 33 | } 34 | 35 | 36 | -------------------------------------------------------------------------------- /poj/2085/POJ_2085_2667842_AC_62MS_168K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | typedef __int64 int64; 3 | int main() 4 | { 5 | int64 n,m,sum; 6 | int i,j,k; 7 | while(scanf("%I64d%I64d",&n,&m)!=EOF) 8 | { 9 | if(n==-1&&m==-1) break ; 10 | k=1; 11 | for(i=1;i<=n;i++) 12 | { 13 | sum=(n-i)*(n-i-1)/2; 14 | if(sum>=m) 15 | { 16 | printf("%d ",i); 17 | } 18 | else 19 | { 20 | m=m-sum+i; 21 | printf("%d ",m); 22 | break; 23 | } 24 | } 25 | for(j=n;j>=i;j--) 26 | { 27 | if(j==m) continue; 28 | printf("%d ",j); 29 | } 30 | printf("\n"); 31 | } 32 | return 0; 33 | } 34 | 35 | 36 | -------------------------------------------------------------------------------- /poj/2085/POJ_2085_2667849_AC_93MS_72K.c: -------------------------------------------------------------------------------- 1 | #include 2 | typedef __int64 int64; 3 | void main() 4 | { 5 | int64 n,m,sum; 6 | int i,j,k; 7 | while(scanf("%I64d%I64d",&n,&m)!=EOF) 8 | { 9 | if(n==-1&&m==-1) break ; 10 | k=1; 11 | for(i=1;i<=n;i++) 12 | { 13 | sum=(n-i)*(n-i-1)/2; 14 | if(sum>=m) 15 | { 16 | printf("%d ",i); 17 | } 18 | else 19 | { 20 | m=m-sum+i; 21 | printf("%d ",m); 22 | break; 23 | } 24 | } 25 | for(j=n;j>=i;j--) 26 | { 27 | if(j==m) continue; 28 | printf("%d ",j); 29 | } 30 | printf("\n"); 31 | } 32 | 33 | } 34 | 35 | 36 | -------------------------------------------------------------------------------- /poj/2085/POJ_2085_2667851_AC_78MS_172K.c: -------------------------------------------------------------------------------- 1 | #include 2 | typedef __int64 int64; 3 | void main() 4 | { 5 | int64 n,m,sum; 6 | int i,j,k; 7 | while(scanf("%I64d%I64d",&n,&m)!=EOF) 8 | { 9 | if(n==-1&&m==-1) break ; 10 | k=1; 11 | for(i=1;i<=n;i++) 12 | { 13 | sum=(n-i)*(n-i-1)/2; 14 | if(sum>=m) 15 | { 16 | printf("%d ",i); 17 | } 18 | else 19 | { 20 | m=m-sum+i; 21 | printf("%d ",m); 22 | break; 23 | } 24 | } 25 | for(j=n;j>=i;j--) 26 | { 27 | if(j==m) continue; 28 | printf("%d ",j); 29 | } 30 | printf("\n"); 31 | } 32 | 33 | } 34 | 35 | 36 | -------------------------------------------------------------------------------- /poj/2085/POJ_2085_2667869_AC_93MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | typedef __int64 int64; 3 | int main() 4 | { 5 | unsigned long n,m,sum; 6 | int i,j,k; 7 | while(scanf("%u%u",&n,&m)!=EOF) 8 | { 9 | if(n==-1&&m==-1) break ; 10 | k=1; 11 | for(i=1;i<=n;i++) 12 | { 13 | sum=(n-i)*(n-i-1)/2; 14 | if(sum>=m) 15 | { 16 | printf("%d ",i); 17 | } 18 | else 19 | { 20 | m=m-sum+i; 21 | printf("%d ",m); 22 | break; 23 | } 24 | } 25 | for(j=n;j>=i;j--) 26 | { 27 | if(j==m) continue; 28 | printf("%d ",j); 29 | } 30 | printf("\n"); 31 | } 32 | return 0; 33 | } 34 | 35 | -------------------------------------------------------------------------------- /poj/2085/POJ_2085_2667923_AC_93MS_172K.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | unsigned long n,m,sum; 5 | int i,j,k; 6 | while(scanf("%u%u",&n,&m)!=EOF) 7 | { 8 | if(n==-1&&m==-1) break ; 9 | k=1; 10 | for(i=1;i<=n;i++) 11 | { 12 | sum=(n-i)*(n-i-1)/2; 13 | if(sum>=m) 14 | { 15 | printf("%d ",i); 16 | } 17 | else 18 | { 19 | m=m-sum+i; 20 | printf("%d ",m); 21 | break; 22 | } 23 | } 24 | for(j=n;j>=i;j--) 25 | { 26 | if(j==m) continue; 27 | printf("%d ",j); 28 | } 29 | printf("\n"); 30 | } 31 | return 0; 32 | } 33 | 34 | 35 | -------------------------------------------------------------------------------- /poj/2085/POJ_2085_2667924_AC_93MS_172K.c: -------------------------------------------------------------------------------- 1 | #include 2 | typedef __int64 int64; 3 | int main() 4 | { 5 | unsigned long n,m,sum; 6 | int i,j,k; 7 | while(scanf("%u%u",&n,&m)!=EOF) 8 | { 9 | if(n==-1&&m==-1) break ; 10 | k=1; 11 | for(i=1;i<=n;i++) 12 | { 13 | sum=(n-i)*(n-i-1)/2; 14 | if(sum>=m) 15 | { 16 | printf("%d ",i); 17 | } 18 | else 19 | { 20 | m=m-sum+i; 21 | printf("%d ",m); 22 | break; 23 | } 24 | } 25 | for(j=n;j>=i;j--) 26 | { 27 | if(j==m) continue; 28 | printf("%d ",j); 29 | } 30 | printf("\n"); 31 | } 32 | return 0; 33 | } 34 | 35 | 36 | -------------------------------------------------------------------------------- /poj/2105/POJ_2105_5505514_AC_0MS_216K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | string str; 8 | cin>>t; 9 | bool flag; 10 | int i,j; 11 | while(t--) 12 | { 13 | cin>>str; 14 | flag=1; 15 | for(i=7;i 2 | #include 3 | int main() 4 | { 5 | double p; 6 | int n; 7 | while(scanf("%d%lf",&n,&p)!=EOF) 8 | { 9 | printf("%.0lf\n",pow(p,1.0/n)); 10 | } 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /poj/2126/POJ_2126_3240612_AC_63MS_412K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int a,b,c,n; 8 | while(cin>>n) 9 | { 10 | if(n<2) 11 | { 12 | while(n>=0) 13 | { 14 | n--; 15 | cin>>a; 16 | } 17 | cout<<"YES"<>a>>b>>c; 22 | if(b*b>=4*a*c) 23 | cout<<"NO"<=0) 30 | { 31 | n--; 32 | cin>>a; 33 | } 34 | cout<<"NO"< 2 | void main() 3 | { 4 | int a[26]={0},i,j=4,max; 5 | char s[80]; 6 | while(j--) 7 | { 8 | gets(s); 9 | for(i=0;s[i];i++) 10 | { 11 | if(s[i]>='A'&&s[i]<='Z') 12 | a[s[i]-'A']++; 13 | } 14 | } 15 | for(max=a[0],i=0;i<26;i++) max=max>a[i]?max:a[i]; 16 | for(;max>0;max--) 17 | { 18 | if(a[0]==max) printf("*"),a[0]--; 19 | else printf(" "); 20 | for(i=1;i<26;i++) 21 | { 22 | if(a[i]==max) printf(" *"),a[i]--; 23 | else printf(" "); 24 | } 25 | printf("\n"); 26 | } 27 | printf("A"); 28 | for(i='B';i<='Z';i++) 29 | printf(" %c",i); 30 | printf("\n"); 31 | } -------------------------------------------------------------------------------- /poj/2140/POJ_2140_2246417_AC_15MS_32K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | long n,m,sum,i,k; 6 | double x1,x2; 7 | while(scanf("%ld",&n)!=EOF) 8 | { 9 | x1=(sqrt(8*n+1)-1)/2; 10 | i=(long)x1; 11 | n*=2; 12 | for(m=1,sum=0;m<=i;m++) 13 | { 14 | if(n%m==0) 15 | { 16 | k=n/m; 17 | if((m%2==1&&k%2==0)||(m%2==0&&k%2==1)) sum++; 18 | } 19 | } 20 | printf("%ld\n",sum); 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /poj/2140/POJ_2140_2948461_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n; 5 | int i; 6 | int j; 7 | int cnt; 8 | while(scanf("%d",&n)!=EOF) 9 | { 10 | cnt=0; 11 | n*=2; 12 | for(i=1;i*i<=n;i++) 13 | { 14 | if(n%i==0) 15 | { 16 | j=n/i-i+1; 17 | if(j%2==0) cnt++; 18 | } 19 | } 20 | printf("%d\n",cnt); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /poj/2141/POJ_2141_2861109_AC_15MS_68K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char s[30]; 5 | int i; 6 | char ss[10000]; 7 | while(scanf("%s",s)!=EOF) 8 | { 9 | gets(ss); 10 | gets(ss); 11 | for(i=0;ss[i];i++) 12 | { 13 | if(ss[i]>='a'&&ss[i]<='z') ss[i]=s[ss[i]-'a']; 14 | else if(ss[i]>='A'&&ss[i]<='Z') ss[i]=s[ss[i]-'A']+'A'-'a'; 15 | } 16 | printf("%s\n",ss); 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /poj/2181/POJ_2181_2352632_AC_15MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i,n,temp,j; 5 | long sum1,sum2; 6 | while(scanf("%d",&n)!=EOF) 7 | { 8 | scanf("%d",&j); 9 | sum1=j; 10 | for(i=1;isum1;i++) 11 | { 12 | scanf("%d",&j); 13 | sum1=j; 14 | } 15 | if(isum2?sum1-j:sum2; 22 | sum1=temp+j>sum1?temp+j:sum1; 23 | } 24 | printf("%ld\n",sum1>sum2?sum1:sum2); 25 | } 26 | return 0; 27 | } -------------------------------------------------------------------------------- /poj/2183/POJ_2183_5953142_AC_0MS_4160K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | #define maxn 1001000 4 | int flag[maxn]; 5 | int main() 6 | { 7 | int n; 8 | int i; 9 | while(cin>>n) 10 | { 11 | for(i=0;i 2 | using namespace std; 3 | int n,sum=0; 4 | int a[1000],b[1000]; 5 | int main(){ 6 | scanf("%d",&n); 7 | for(int i=0;ii){ 13 | b[j]=b[j-1]; 14 | j--; 15 | } 16 | } 17 | printf("%d\n",sum); 18 | system("pause"); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /poj/2190/POJ_2190_2274823_AC_0MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char isbn[11]; 5 | int n=0,i,x,y; 6 | scanf("%s",isbn); 7 | if(isbn[9]=='X') n=10; 8 | else if(isbn[9]=='?') n=0,x=1; 9 | else n=isbn[9]-'0'; 10 | for(i=10;i>1;i--) 11 | { 12 | if(isbn[10-i]=='?') {x=i;continue;} 13 | n+=(isbn[10-i]-'0')*i; 14 | } 15 | y=10-(n-1)%11; 16 | while(1) 17 | { 18 | if(y%x==0||y/x>10) break; 19 | y+=11; 20 | } 21 | if(y/x<10&&y/x>=0) printf("%d\n",y/x); 22 | else if(y==10&&x==1) printf("X\n"); 23 | else printf("-1\n"); 24 | return 0; 25 | } -------------------------------------------------------------------------------- /poj/2196/POJ_2196_2264064_AC_0MS_56K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i,sum1,sum2,sum3,j; 5 | for(i=2992;i<10000;i++) 6 | { 7 | j=i; 8 | sum1=sum2=sum3=0; 9 | while(j) 10 | { 11 | sum1+=j%10; 12 | j/=10; 13 | } 14 | j=i; 15 | while(j) 16 | { 17 | sum2+=j%12; 18 | j/=12; 19 | } 20 | j=i; 21 | while(j) 22 | { 23 | sum3+=j%16; 24 | j/=16; 25 | } 26 | if(sum1==sum2&&sum2==sum3) printf("%d\n",i); 27 | } 28 | return 0; 29 | } -------------------------------------------------------------------------------- /poj/2229/POJ_2229_2377993_AC_215MS_3888K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int n,a[1000010]; 3 | int main() 4 | { 5 | int i; 6 | a[1]=1; 7 | a[2]=2; 8 | for(i=3;i<=1000002;i++) 9 | { 10 | if(i%2) a[i]=a[i-1]; 11 | else a[i]=(a[i-2]+a[i/2])%1000000000; 12 | } 13 | while(scanf("%d",&n)!=EOF) 14 | { 15 | printf("%d\n",a[n]); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /poj/2232/POJ_2232_3826539_AC_0MS_312K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int cnt[3]; 5 | char s[10]; 6 | int i,j,n; 7 | while(scanf("%d",&n)!=EOF) 8 | { 9 | cnt[0]=cnt[1]=cnt[2]=0; 10 | for(i=0;i 2 | int main() 3 | { 4 | int i,j,n; 5 | while(scanf("%d",&n)!=EOF) 6 | 7 | { 8 | int ans=0; 9 | for(i=0;i 2 | #include 3 | #define pi 3.141592653589793 4 | int main() 5 | { 6 | double a,b,c; 7 | double x1,x2,x3,y1,y2,y3; 8 | double sinA,cosA,r; 9 | while(scanf("%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3)!=EOF) 10 | { 11 | a=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); 12 | b=sqrt((x3-x2)*(x3-x2)+(y3-y2)*(y3-y2)); 13 | c=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3)); 14 | cosA=(b*b+c*c-a*a)/(2*b*c); 15 | sinA=sqrt(1-cosA*cosA); 16 | r=a/sinA; 17 | printf("%.2lf\n",pi*r); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /poj/2245/POJ_2245_2275794_AC_0MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int a[14],b[14],n; 3 | void dfs(int deep,int x) 4 | { 5 | int i,flag=0; 6 | if(deep==6) 7 | { 8 | for(i=0;!b[i];i++); 9 | printf("%d",a[i]); 10 | for(i++;i 2 | void main() 3 | { double sum; 4 | unsigned long i,n,k; 5 | scanf("%ld %ld",&n,&k); 6 | while(n!=0) 7 | { 8 | sum=1; 9 | if(k>n/2) k=n-k; 10 | for( i=1;i<=k;i++) 11 | { sum=sum/i; 12 | sum=sum*(n-i+1); 13 | } 14 | printf("%.0f\n",sum); 15 | scanf("%ld %ld",&n,&k); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /poj/2249/POJ_2249_2212022_AC_0MS_36K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | long gcd(long n,long m) 3 | { 4 | long k; 5 | if(nn/2)k=n-k; 28 | for(sum=max=i=1;i<=k;i++) 29 | { 30 | sum*=n--; 31 | max*=i; 32 | l=gcd(sum,max); 33 | sum/=l; 34 | max/=l; 35 | } 36 | sum/=max; 37 | printf("%.0lf\n",sum); 38 | } 39 | } -------------------------------------------------------------------------------- /poj/2262/POJ_2262_2246407_AC_265MS_3940K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int a[1000006]={0}; 3 | void init() 4 | { 5 | int i,j; 6 | for(i=2;i<1000006;i++) 7 | { 8 | if(!a[i]) 9 | { 10 | for(j=i*2;j<1000006;j+=i) a[j]=1; 11 | } 12 | } 13 | } 14 | int main() 15 | { 16 | int n,i; 17 | init(); 18 | while(scanf("%d",&n)&&n) 19 | { 20 | for(i=3;i<=n/2;i++) 21 | { 22 | if(!a[i]&&!a[n-i]) 23 | { 24 | printf("%d = %d + %d\n",n,i,n-i); 25 | break; 26 | } 27 | } 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /poj/2301/POJ_2301_2146102_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | long i,j,n; 5 | scanf("%d",&n); 6 | while(n--) 7 | { 8 | scanf("%ld %ld",&i,&j); 9 | if(((i+j)&1)||i 2 | int main() 3 | { 4 | char s[11],c[11]; 5 | int i; 6 | scanf("%s",s); 7 | while(scanf("%s",c)!=EOF) 8 | { 9 | for(i=0;c[i];i++) 10 | { 11 | s[i]=(s[i]+c[i]-'0'-'0')%10+'0'; 12 | } 13 | } 14 | puts(s); 15 | return 0; 16 | } -------------------------------------------------------------------------------- /poj/2323/POJ_2323_2734470_AC_0MS_100K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | __int64 a[19][19*18/2]={0}; 3 | int main() 4 | { 5 | int i,j; 6 | int k; 7 | a[1][0]=1; 8 | for(i=1;i<18;i++) 9 | { 10 | for(j=0;j<=i*(i-1)/2;j++) 11 | { 12 | for(k=0;k<=i;k++) a[i+1][j+k]+=a[i][j]; 13 | } 14 | } 15 | while(scanf("%d%d",&i,&j)&&(i+j)) 16 | { 17 | printf("%I64d\n",a[i][j]); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /poj/2328/POJ_2328_2202639_AC_15MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | int n,a[11],i,flag; 6 | char s[15]; 7 | memset(a,1,11*sizeof(int)); 8 | while(scanf("%d",&n)&&n) 9 | { 10 | flag=1; 11 | 12 | scanf("%*s%s",s); 13 | if(s[strlen(s)-1]=='h') 14 | { 15 | // for(i=1;i 2 | #include 3 | void main() 4 | { 5 | int n,a[11],i,flag; 6 | char s[15]; 7 | for(i=0;i<11;i++)a[i]=1; 8 | while(scanf("%d",&n)&&n) 9 | { 10 | flag=1; 11 | 12 | scanf("%*s%s",s); 13 | if(s[strlen(s)-1]=='h') 14 | { 15 | 16 | for(i=n;i<11;i++) 17 | a[i]=0; 18 | } 19 | else if(s[strlen(s)-1]=='w') 20 | { 21 | for(i=1;i<=n;i++) 22 | a[i]=0; 23 | } 24 | else 25 | { 26 | if(!a[n]) 27 | printf("Stan is dishonest\n"); 28 | else 29 | printf("Stan may be honest\n"); 30 | for(i=0;i<11;i++)a[i]=1; 31 | } 32 | } 33 | } -------------------------------------------------------------------------------- /poj/2346/POJ_2346_2187094_AC_15MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include"stdio.h" 2 | main() 3 | { 4 | int i; 5 | scanf("%d",&i); 6 | if(i==2) printf("10"); 7 | if(i==4) printf("670"); 8 | if(i==6) printf("55252"); 9 | if(i==8) printf("4816030"); 10 | if(i==10) printf("432457640"); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /poj/2350/POJ_2350_2149174_AC_0MS_60K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int a[1000],n,i; 5 | float j,k; 6 | float sum; 7 | scanf("%d",&n); 8 | while(n--) 9 | { 10 | sum=0; 11 | scanf("%f",&j); 12 | for(i=0;isum)k++; 22 | } 23 | sum=k*100/j; 24 | printf("%.3f%c\n",sum,'%'); 25 | } 26 | 27 | } -------------------------------------------------------------------------------- /poj/2350/POJ_2350_2202811_AC_0MS_36K.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | void main(){ 4 | int n,stu,i,score[1001],per; 5 | float ave; 6 | scanf("%d",&n); 7 | while(n--) 8 | { 9 | ave=0.0; 10 | per=0; 11 | scanf("%d",&stu); 12 | for(i=0;iave) per++; 20 | printf("%.3f%%\n",1.0*per*100/stu); 21 | } 22 | 23 | 24 | } -------------------------------------------------------------------------------- /poj/2350/POJ_2350_2202821_AC_0MS_36K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int a[1000],n,i,k; 5 | float j; 6 | float sum; 7 | scanf("%d",&n); 8 | while(n--) 9 | { 10 | sum=0; 11 | scanf("%f",&j); 12 | for(i=0;isum)k++; 22 | } 23 | sum=k*100/j; 24 | printf("%.3f%c\n",sum,'%'); 25 | } 26 | 27 | } -------------------------------------------------------------------------------- /poj/2352/POJ_2352_2719175_AC_120MS_256K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int a[32002]; 4 | int level[15000]; 5 | int N; 6 | int lowbit(int n) 7 | { 8 | return n & (-n); 9 | } 10 | 11 | int Sum(int n) 12 | { 13 | int result = 0; 14 | while(n != 0) 15 | { 16 | result += a[n]; 17 | n -= lowbit(n); 18 | } 19 | return result; 20 | } 21 | 22 | void Update(int n) 23 | { 24 | while(n <= 32001) 25 | { 26 | a[n]++; 27 | n += lowbit(n); 28 | } 29 | } 30 | 31 | int main(void) 32 | { 33 | int x, y, i; 34 | scanf("%d", &N); 35 | i = N; 36 | while(i--) 37 | { 38 | scanf("%d%d", &x, &y); 39 | level[Sum(x+1)]++; 40 | Update(x+1); 41 | } 42 | 43 | for(i = 0; i < N; ++i) 44 | printf("%d\n", level[i]); 45 | } 46 | 47 | -------------------------------------------------------------------------------- /poj/2363/POJ_2363_2246442_AC_15MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int t,n,i,a,b,c,j,sum; 5 | scanf("%d",&t); 6 | while(t--) 7 | { 8 | sum=100000000; 9 | scanf("%d",&n); 10 | for(i=1;i*i*i<=n;i++) 11 | { 12 | if(n%i==0) 13 | { 14 | for(j=1;j*j<=n/i;j++) 15 | { 16 | a=n/i; 17 | if(a%j==0) 18 | { 19 | a=n/i/j; 20 | sum=2*a*i+2*i*j+2*a*j 2 | #include 3 | #include 4 | #define MAXN 10000 5 | using namespace std; 6 | int main() 7 | { 8 | 9 | long int milk[MAXN], N; 10 | long int result; 11 | int i; 12 | while(cin>>N) 13 | { 14 | for(i=0;i>milk[i]; 16 | result=N/2; 17 | nth_element(milk, milk + result, milk + N); 18 | cout< 4 | int a[1000011]={0}; 5 | int main() 6 | { 7 | int i,n,j; 8 | while(scanf("%d",&n)!=EOF){ 9 | for(i=0;i<1000011;i++) a[i]=0; 10 | for(i=1;ii) {j++;break;} 20 | else i-=a[j]; 21 | } 22 | } 23 | printf("%d\n",j-1); 24 | } 25 | return 0; 26 | } -------------------------------------------------------------------------------- /poj/2390/POJ_2390_2146744_AC_0MS_60K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | double i,j,k; 5 | while(scanf("%lf %lf %lf",&i,&j,&k)!=EOF) 6 | { 7 | while(k--) 8 | { 9 | j*=(100+i)/100; 10 | } 11 | printf("%d\n",(int)j); 12 | } 13 | } -------------------------------------------------------------------------------- /poj/2406/POJ_2406_2929140_AC_125MS_4968K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | char str[1000000]; 3 | int next[1000000]; 4 | #include 5 | void main() 6 | { 7 | 8 | int len; int i,j; 9 | while(1) 10 | { 11 | scanf("%s",str); 12 | if(str[0]=='.') return; 13 | len=strlen(str); 14 | i=0, j=-1; 15 | next[0] = -1; 16 | while(i=0&&str[i]==str[j])) 19 | { 20 | i++; 21 | j++; 22 | next[i]=j; 23 | } 24 | else 25 | j=next[j]; 26 | } 27 | i-=j; 28 | if(len%i==0)i=len/i; else i=1; 29 | printf("%d\n",i); 30 | } 31 | } -------------------------------------------------------------------------------- /poj/2407/POJ_2407_2227085_AC_0MS_52K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int a[3510]; 4 | void init() 5 | { 6 | int i,j,k; 7 | for(a[0]=2,k=1,i=3;i*i<=1010000000;i++) 8 | { 9 | for(j=0;a[j]*a[j]<=i;j++) 10 | { 11 | if(i%a[j]==0) break; 12 | } 13 | if(a[j]*a[j]>i) a[k++]=i; 14 | } 15 | } 16 | int main() 17 | { 18 | long n,i,sum,j; 19 | init(); 20 | while(scanf("%ld",&n)&&n) 21 | { 22 | sum=1; 23 | for(i=0;n!=1&&a[i]*a[i]<=n;i++) 24 | { 25 | if(n%a[i]==0) 26 | { 27 | for(j=0;n%a[i]==0;n/=a[i],j++); 28 | sum*=a[i]-1; 29 | sum*=pow(a[i],j-1); 30 | } 31 | } 32 | if(n!=1) sum*=n-1; 33 | printf("%ld\n",sum); 34 | } 35 | return 0; 36 | } -------------------------------------------------------------------------------- /poj/2407/POJ_2407_2227098_AC_0MS_40K.cpp: -------------------------------------------------------------------------------- 1 | #include //1238 2 | #include 3 | int main() 4 | { 5 | long n,i,j,sum; 6 | while(scanf("%ld",&n)&&n) 7 | { 8 | sum=1; 9 | if(n%2==0) 10 | { 11 | for(j=0;n%2==0;n/=2,j++); 12 | sum*=pow(2,j-1); 13 | } 14 | for(i=3;i*i 2 | #include 3 | int main() 4 | { 5 | int n,i,k,a,b; 6 | char s[32]; 7 | while(scanf("%d",&n)&&n) 8 | { 9 | i=k=0; 10 | a=n%2; 11 | if(a) k++; 12 | n/=2; 13 | i++; 14 | while(1) 15 | { 16 | b=n%2; 17 | n/=2; 18 | i++; 19 | if(b) k++; 20 | if(!b&&k) 21 | { 22 | 23 | n=n*2+1; 24 | n*=pow(2,i-1); 25 | n+=pow(2,k-1)-1; 26 | break; 27 | } 28 | } 29 | printf("%d\n",n); 30 | } 31 | return 0; 32 | } -------------------------------------------------------------------------------- /poj/2453/POJ_2453_4112026_AC_16MS_312K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n; 5 | int a[100]; 6 | int i; 7 | while(scanf("%d",&n)&&n) 8 | { 9 | for(i=0;i<100;i++) a[i]=0; 10 | for(i=0;n;i++,n/=2) a[i]=n%2; 11 | int k=0; 12 | for(i=0;;i++) 13 | { 14 | if(a[i]) 15 | { 16 | k++; 17 | if(a[i+1]==0) 18 | { 19 | a[i]=0; 20 | a[i+1]=1; 21 | break; 22 | } 23 | } 24 | a[i]=0; 25 | } 26 | k--; 27 | for(i=0;k;i++,k--) a[i]=1; 28 | int ans=0; 29 | for(i=99;i>=0;i--) ans=ans*2+a[i]; 30 | printf("%d\n",ans); 31 | } 32 | return 0; 33 | } -------------------------------------------------------------------------------- /poj/2478/POJ_2478_2428754_AC_437MS_15700K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define max 1000019 3 | __int64 a[max]={0},b[max]={0}; 4 | void init() 5 | { 6 | int i,j,k,l; 7 | b[1]=0; 8 | for(i=2;i 2 | #define max 1000019 3 | __int64 a[max]={0}, b[max]={0}; 4 | void init() 5 | { 6 | int i,j,k,l; 7 | b[1]=0; 8 | for(i=2;i 2 | int main() 3 | { 4 | int n; 5 | while(scanf("%d",&n)&&n) 6 | { 7 | if(n==1||n==2) printf("Alice\n"); 8 | else printf("Bob\n"); 9 | } 10 | return 0; 11 | } -------------------------------------------------------------------------------- /poj/2487/POJ_2487_2861201_AC_62MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int a[10000]; 5 | int main() 6 | { 7 | int t; 8 | int i,n,m; 9 | scanf("%d",&t); 10 | for(int j=1;j<=t;j++) 11 | { 12 | scanf("%d%d",&m,&n); 13 | for(i=0;i=0&&m>0;i--) 16 | { 17 | m-=a[i]; 18 | } 19 | printf("Scenario #%d:\n",j); 20 | if(i==-1&&m>0) printf("impossible\n"); 21 | else printf("%d\n",n-i-1); 22 | printf("\n"); 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /poj/2498/POJ_2498_2436173_AC_156MS_40K.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | int a[3]={9,3,7}; 5 | int main() 6 | { 7 | char s[20]; 8 | int i,j,n,sum,t,num=1,k; 9 | scanf("%d",&t); 10 | 11 | while(num<=t) 12 | { 13 | sum=0; 14 | scanf("%s",s); 15 | for(i=strlen(s)-1,k=0;i>=0;i--,k++) 16 | { 17 | if(s[i]=='?') j=k; 18 | else 19 | { 20 | sum+=(s[i]-'0')*a[k%3]; 21 | } 22 | } 23 | sum%=10; 24 | for(i=0;i<10;i++) 25 | { 26 | if((a[j%3]*i+sum)%10==0) break; 27 | } 28 | printf("Scenario #%d:\n",num); 29 | for(j=0;s[j];j++) 30 | { 31 | if(s[j]=='?') printf("%d",i); 32 | else printf("%c",s[j]); 33 | } 34 | printf("\n\n"); 35 | num++; 36 | } 37 | return 0; 38 | } -------------------------------------------------------------------------------- /poj/2509/POJ_2509_2248514_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,k,sum,t; 5 | while(scanf("%d%d",&n,&k)!=EOF) 6 | { 7 | sum=n; 8 | while(n/k) 9 | { 10 | sum+=n/k; 11 | n=n/k+n%k; 12 | } 13 | printf("%d\n",sum); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /poj/2521/POJ_2521_2148295_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int i,j,k,l; 5 | while(1) 6 | { 7 | scanf("%d %d %d %d",&i,&j,&k,&l); 8 | if(i||j||k||l) 9 | { 10 | j-=k; 11 | j-=i; 12 | printf("%d\n",-j); 13 | } 14 | else 15 | break; 16 | } 17 | } -------------------------------------------------------------------------------- /poj/2533/POJ_2533_2342252_AC_30MS_68K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define M 1002 3 | int a[M],f[M]; 4 | 5 | int main() 6 | { 7 | int n,i,j,max; 8 | while(scanf("%d",&n)!=EOF) 9 | { 10 | for(i=0;ia[j]) && (maxmax) 24 | max=f[i]; 25 | printf("%d\n",max); 26 | } 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /poj/2533/POJ_2533_2342261_AC_45MS_64K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int a[1005],b[1005]; 5 | int i,j,n,min; 6 | while(scanf("%d",&n)!=EOF) 7 | { 8 | for(i=0;ib[min]?j:min; 22 | } 23 | } 24 | } 25 | if(min!=-1) 26 | b[i]=b[min]+1; 27 | else b[i]=1; 28 | } 29 | for(j=b[0],i=0;ib[i]?j:b[i]; 30 | printf("%d\n",j); 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /poj/2546/POJ_2546_2357776_AC_0MS_88K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | int main() 5 | { 6 | double x1,y1,a,x2,y2,b,c,s,A,B,area; 7 | while(cin>>x1>>y1>>a>>x2>>y2>>b) 8 | { 9 | if(a=a+b){area=0;goto out;}//外离或相切 12 | if(c<=a-b){area=3.1415926*b*b;goto out;}//内含 13 | A=acos((b*b+c*c-a*a)/2/b/c);//相交 14 | B=acos((a*a+c*c-b*b)/2/a/c); 15 | s=(a+b+c)/2; 16 | s=sqrt(s*(s-a)*(s-b)*(s-c)); 17 | area=a*a*B+b*b*A-2*s; 18 | out: area=floor(area*1000+0.5)/1000;//加上这一句 19 | cout< 2 | void main() 3 | { 4 | int n,mod=0,k=0,flag; 5 | while(scanf("%d",&n)!=EOF) 6 | { 7 | for(flag=1;flag<=n;flag*=10) 8 | { 9 | mod+=flag; 10 | k++; 11 | } 12 | mod%=n; 13 | while(1) 14 | { 15 | if(mod==0) 16 | break; 17 | else 18 | { 19 | flag%=n; 20 | mod+=flag; 21 | mod%=n; 22 | flag*=10; 23 | k++; 24 | } 25 | } 26 | printf("%d\n",k); 27 | k=0; 28 | mod=0; 29 | 30 | } 31 | } -------------------------------------------------------------------------------- /poj/2572/POJ_2572_2212589_AC_0MS_56K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | char s[30]; 6 | int a[10],b[10]; 7 | int i,j,n,m; 8 | while(1) 9 | { 10 | gets(s); 11 | if(!strcmp(s,"0+0=0")) 12 | { 13 | printf("True\n"); 14 | break; 15 | } 16 | for(i=0;i<10;i++)a[i]=b[i]=0; 17 | for(i=0;s[i]!='+';i++) a[i]=s[i]-'0'; 18 | for(j=0,i++;s[i]!='=';i++) b[j++]=s[i]-'0'; 19 | for(n=0,j=1,i++;s[i];i++) 20 | { 21 | n+=(s[i]-'0')*j; 22 | j*=10; 23 | } 24 | for(i=0;i<10;i++) b[i]+=a[i]; 25 | for(i=0;i<10;i++) b[i+1]+=b[i]/10,b[i]%=10; 26 | for(i=m=0,j=1;i<10;i++) 27 | { 28 | m+=j*b[i]; 29 | j*=10; 30 | } 31 | if(n==m) printf("True\n"); 32 | else printf("False\n"); 33 | } 34 | } -------------------------------------------------------------------------------- /poj/2572/POJ_2572_2212713_AC_0MS_56K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | char s[30]; 6 | int i,j,n,m,k; 7 | while(1) 8 | { 9 | gets(s); 10 | if(!strcmp(s,"0+0=0")) 11 | { 12 | printf("True\n"); 13 | break; 14 | } 15 | for(m=0,j=1,i=0;s[i]!='+';i++) 16 | { 17 | m+=(s[i]-'0')*j; 18 | j*=10; 19 | } 20 | for(k=0,j=1,i++;s[i]!='=';i++) 21 | { 22 | k+=(s[i]-'0')*j; 23 | j*=10; 24 | } 25 | for(n=0,j=1,i++;s[i];i++) 26 | { 27 | n+=(s[i]-'0')*j; 28 | j*=10; 29 | } 30 | if(n==m+k) printf("True\n"); 31 | else printf("False\n"); 32 | } 33 | } -------------------------------------------------------------------------------- /poj/2572/POJ_2572_2212816_AC_0MS_56K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | char s[30],c; 6 | int i,j=1,k,a[3]; 7 | k=a[0]=0; 8 | while(1) 9 | { 10 | c=getchar(); 11 | if(c=='+'||c=='=') k++,j=1,a[k]=0; 12 | else if(c==10) 13 | { 14 | if(a[0]+a[1]==a[2]) printf("True\n"); 15 | else printf("False\n"); 16 | if(!a[0]&&!a[1]&&!a[2])break; 17 | k=a[0]=0; 18 | j=1; 19 | } 20 | else 21 | { 22 | a[k]+=(c-'0')*j; 23 | j*=10; 24 | } 25 | } 26 | } -------------------------------------------------------------------------------- /poj/2572/POJ_2572_2212818_AC_15MS_56K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | char c; 6 | int i,j=1,k,a[3]; 7 | k=a[0]=0; 8 | while(1) 9 | { 10 | c=getchar(); 11 | if(c=='+'||c=='=') k++,j=1,a[k]=0; 12 | else if(c==10) 13 | { 14 | if(a[0]+a[1]==a[2]) printf("True\n"); 15 | else printf("False\n"); 16 | if(!a[0]&&!a[1]&&!a[2])break; 17 | k=a[0]=0; 18 | j=1; 19 | } 20 | else 21 | { 22 | a[k]+=(c-'0')*j; 23 | j*=10; 24 | } 25 | } 26 | } -------------------------------------------------------------------------------- /poj/2575/POJ_2575_2234951_AC_0MS_40K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int a[3610]={0}; 4 | int main() 5 | { 6 | int n,i,j,k; 7 | while(scanf("%d",&n)!=EOF){ 8 | scanf("%d",&i); 9 | for(k=1;k 2 | void main() 3 | { 4 | int a[3],i; 5 | while(scanf("%d %d %d",&a[0],&a[1],&a[2])!=EOF) 6 | { 7 | for(i=0;i<3;i++) 8 | { 9 | if(a[i]<168) 10 | break; 11 | } 12 | if(i==3) 13 | printf("NO CRASH\n"); 14 | else 15 | printf("CRASH %d\n",a[i]); 16 | } 17 | } -------------------------------------------------------------------------------- /poj/2583/POJ_2583_2246418_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a,b,c,x1,x2; 5 | while(scanf("%d %d %d",&c,&x1,&x2)!=EOF) 6 | { 7 | a=(x2-2*x1+c)/2; 8 | b=x1-c-a; 9 | printf("%d %d %d\n",a*9+3*b+c,a*16+4*b+c,a*25+5*b+c); 10 | } 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /poj/2590/POJ_2590_2271436_AC_15MS_64K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | long x,y,n,k; 6 | double i; 7 | scanf("%ld",&k); 8 | while(k--) 9 | { 10 | scanf("%ld%ld",&x,&y); 11 | x=y-x; 12 | if(x==0) 13 | { 14 | printf("0\n"); 15 | continue; 16 | } 17 | i=x; 18 | n=(long)sqrt(i)+1; 19 | while(n*(n+1)>x) n--; 20 | x=x-n*(n+1); 21 | if(x>n+1) printf("%ld\n",2*n+2); 22 | else if(x==0) printf("%ld\n",n*2); 23 | else 24 | printf("%ld\n",2*n+1); 25 | 26 | } 27 | return 0; 28 | } -------------------------------------------------------------------------------- /poj/2602/POJ_2602_2251181_AC_1077MS_960K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | char a[1000000]; 6 | char tmp; 7 | int i,j,n; 8 | scanf("%d",&n); 9 | for(i=0;i'9') 16 | { 17 | a[j]-=10; 18 | a[j-1]++; 19 | j--; 20 | } 21 | } 22 | for(i=0;i 2 | 3 | int main() 4 | { 5 | char a[1000000]; 6 | char tmp; 7 | int i,j,n; 8 | scanf("%d",&n); 9 | for(i=0;i'9') 16 | { 17 | a[j]-=10; 18 | a[j-1]++; 19 | j--; 20 | } 21 | } 22 | a[n]='\0'; 23 | puts(a); 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /poj/2608/POJ_2608_2156301_AC_0MS_12K.c: -------------------------------------------------------------------------------- 1 | #include 2 | int a[26]={0,1,2,3,0,1,2,0,0,2,2,4,5,5,0,1,2,6,2,3,0,1,0,2,0,2}; 3 | void main() 4 | { 5 | char s[21]; 6 | int i; 7 | while(scanf("%s",s)!=EOF) 8 | { 9 | if(a[s[0]-'A'])printf("%d",a[s[0]-'A']); 10 | for(i=1;s[i];i++) 11 | 12 | { 13 | if(a[s[i]-'A']) 14 | { 15 | // if(s[i-1]==s[i])printf("%d",a[s[i]-'A']); 16 | if(a[s[i]-'A']!=a[s[i-1]-'A'])printf("%d",a[s[i]-'A']); 17 | } 18 | } 19 | printf("\n"); 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /poj/2623/POJ_2623_2973192_AC_170MS_1064K.cpp: -------------------------------------------------------------------------------- 1 | //http://acm.pku.edu.cn/JudgeOnline/searchproblem?field=source&key=Ural+Collegiate+Programming+Contest+1998 2 | #include 3 | #include 4 | using namespace std; 5 | int a[ 250000]; 6 | int main() 7 | { 8 | double ans; 9 | int n,i,j; 10 | while(scanf("%d",&n)!=EOF) 11 | { 12 | for(i=1;i<=n;i++) scanf("%d",&a[i]); 13 | sort(a+1,a+n+1); 14 | if(n%2==0) printf("%.1lf\n",(double)((double)a[n/2]+(double)a[n/2+1])/2.0); 15 | else printf("%.1lf\n",(double)a[(n+1)/2]); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /poj/2624/POJ_2624_2276864_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | double a[4][2],x2,x3; 5 | int i,x1; 6 | while(scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&a[0][0],&a[0][1],&a[1][0],&a[1][1],&a[2][0],&a[2][1],&a[3][0],&a[3][1],&a[4][0],&a[4][1])!=EOF) 7 | { 8 | for(x2=x3=i=0;i<4;i++) 9 | { 10 | for(x1=i+1;x1<4;x1++) if(a[i][0]==a[x1][0]) x2=i; 11 | } 12 | x1=(int)x2; 13 | for(x2=x3=i=0;i<4;i++) x2+=a[i][0],x3+=a[i][1]; 14 | printf("%.3lf %.3lf\n",x2-a[x1][0]*3,x3-a[x1][1]*3); 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /poj/2636/POJ_2636_2148395_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int i,sum,j,k,n; 5 | scanf("%d",&n); 6 | while(n--) 7 | { 8 | scanf("%d",&j); 9 | sum=1-j; 10 | while(j--) 11 | { 12 | scanf("%d",&k); 13 | sum+=k; 14 | } 15 | printf("%d\n",sum); 16 | } 17 | } -------------------------------------------------------------------------------- /poj/2646/POJ_2646_3085530_AC_15MS_168K.cpp: -------------------------------------------------------------------------------- 1 | #include "stdio.h" 2 | int main(void) 3 | { 4 | double sum,ave,a[1010],s1,s2; 5 | int n,i,temp; 6 | while(scanf("%d",&n)==1&&n) 7 | { 8 | sum=0; 9 | for(i=0;iave) 17 | s1+=a[i]-ave; 18 | else 19 | s2+=ave-a[i]; 20 | } 21 | sum=s1 2 | int main(){ 3 | while(1) { 4 | int i, n; 5 | int maxday, maxvalue = -1; 6 | scanf("%d", &n); 7 | if (n == 0) break; 8 | for (i = 1; i <= n; i++) { 9 | int a, b; 10 | scanf("%d%d", &a, &b); 11 | if (a + b > maxvalue) { 12 | maxvalue = a + b; 13 | maxday = i; 14 | } 15 | } 16 | if (maxvalue <= 8) printf("0\n"); 17 | else printf("%d\n", maxday); 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /poj/2661/POJ_2661_2193236_AC_296MS_80K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | double sum,n,j; 6 | int m; 7 | double i; 8 | while(scanf("%d",&m)&&m) 9 | { 10 | m=(m-1960)/10; 11 | n=4*pow(2,m); 12 | sum=0; 13 | n=n*log(2.0); 14 | for(i=1;sum<=n;i++) 15 | { 16 | sum+=log(i); 17 | } 18 | printf("%.0lf\n",i-2); 19 | } 20 | } -------------------------------------------------------------------------------- /poj/2663/POJ_2663_2159450_AC_0MS_12K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int n; 5 | while(scanf("%d",&n)&&n!=-1) 6 | { 7 | if(n==0)printf("1\n"); 8 | else if(n==2)printf("3\n"); 9 | else if(n==4)printf("11\n"); 10 | else if(n==6)printf("41\n"); 11 | else if(n==8)printf("153\n"); 12 | else if(n==10)printf("571\n"); 13 | else if(n==12)printf("2131\n"); 14 | else if(n==14)printf("7953\n"); 15 | else if(n==16)printf("29681\n"); 16 | else if(n==18)printf("110771\n"); 17 | else if(n==20)printf("413403\n"); 18 | else if(n==22)printf("1542841\n"); 19 | else if(n==24)printf("5757961\n"); 20 | else if(n==26)printf("21489003\n"); 21 | else if(n==28)printf("80198051\n"); 22 | else if(n==30)printf("299303201\n"); 23 | else printf("0\n"); 24 | } 25 | } -------------------------------------------------------------------------------- /poj/2664/POJ_2664_2156204_AC_93MS_12K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int k,m,c,r,i,j,counter,t,flag; 5 | int chosen[101],cata[101]; 6 | scanf("%d",&k); 7 | while(k) 8 | { 9 | scanf("%d",&m); 10 | flag=1; 11 | for(i=0;i 2 | void main() 3 | { 4 | int i,j,k,l,sum,flag; 5 | while(1) 6 | { 7 | scanf("%d %d",&i,&j); 8 | if(i||j) 9 | { 10 | sum=0; 11 | flag=0; 12 | while(j--) 13 | { 14 | scanf("%d %d",&k,&l); 15 | sum+=k-flag; 16 | flag=l+1; 17 | } 18 | sum+=i-flag+1; 19 | printf("%d\n",sum); 20 | } 21 | else 22 | break; 23 | } 24 | } -------------------------------------------------------------------------------- /poj/2675/POJ_2675_3586747_AC_63MS_408K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | struct node 5 | { 6 | int x,y; 7 | double z; 8 | }a[1000000]; 9 | bool cmp(const node &x,const node &y) 10 | { 11 | return x.z>y.z; 12 | } 13 | int main() 14 | { 15 | int n,i; 16 | while(scanf("%d",&n)!=EOF) 17 | { 18 | for(i=0;i 2 | #include 3 | using namespace std; 4 | int a[15],n,g; 5 | int main() 6 | { 7 | int n,i,j; 8 | while(scanf("%d",&n)&&n){ 9 | for(i=0;i 2 | int main() 3 | { 4 | int n,k,i; 5 | char s[10]; 6 | while(1) 7 | { 8 | scanf("%s",s); 9 | if(s[0]=='0')break; 10 | for(i=0,n=0;s[i];i++) 11 | { 12 | n=n*9+(s[i]>'4'?s[i]-'0'-1:s[i]-'0'); 13 | } 14 | printf("%s: %d\n",s,n); 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /poj/2719/POJ_2719_2263996_AC_0MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,k,i; 5 | char s[10]; 6 | while(1) 7 | { 8 | scanf("%s",s); 9 | if(s[0]=='0')break; 10 | for(i=0,n=0;s[i];i++) 11 | { 12 | n=n*9+(s[i]>'4'?s[i]-'0'-1:s[i]-'0'); 13 | } 14 | printf("%s: %d\n",s,n); 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /poj/2726/POJ_2726_2792072_AC_78MS_228K.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | using namespace std; 5 | struct node 6 | { 7 | int x,y; 8 | }a[10010]; 9 | bool cmp(const node &t1,const node &t2) 10 | { 11 | if(t1.x==t2.x) return t1.ya[i].y) ans++,min=a[i].y; 27 | } 28 | printf("%d\n",ans); 29 | } 30 | return 0; 31 | } -------------------------------------------------------------------------------- /poj/2739/POJ_2739_2247721_AC_0MS_32K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int a[1229]; 3 | void init() 4 | { 5 | int i,j,k; 6 | for(a[0]=2,k=1,i=3;i<10000;i++) 7 | { 8 | for(j=0;a[j]*a[j]<=i;j++) 9 | { 10 | if(i%a[j]==0) break; 11 | } 12 | if(a[j]*a[j]>i) a[k++]=i; 13 | } 14 | } 15 | int main() 16 | { 17 | int n,i,j,sum,sumi; 18 | init(); 19 | while(scanf("%d",&n)&&n) 20 | { 21 | sumi=0; 22 | for(i=0;i<1229&&i<=n;i++) 23 | { 24 | for(sum=0,j=i;j<1229&&sum<=n;j++) 25 | { 26 | sum+=a[j]; 27 | if(sum==n) sumi++; 28 | } 29 | } 30 | printf("%d\n",sumi); 31 | } 32 | return 0; 33 | } -------------------------------------------------------------------------------- /poj/2748/POJ_2748_3844659_AC_1250MS_4120K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int f[1000000]; 3 | int mod=100000; 4 | int main() 5 | { 6 | int n,i,j; 7 | f[1]=1; 8 | f[2]=2; 9 | for(i=3;i<1000000;i++) 10 | { 11 | f[i]=(f[i-1]*3-f[i-2]+mod)%mod; 12 | } 13 | scanf("%d",&i); 14 | while(i--) 15 | { 16 | scanf("%d",&n); 17 | n%=750000; 18 | if(n==0) n=750000; 19 | printf("%d\n",f[n]); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /poj/2840/POJ_2840_2212368_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int n,m,k; 5 | scanf("%d",&k); 6 | while(k--) 7 | { 8 | scanf("%d:%d",&n,&m); 9 | if(m) printf("0\n"); 10 | else 11 | printf("%d\n",(n+12)%24?(n+12)%24:24); 12 | } 13 | } -------------------------------------------------------------------------------- /poj/2853/POJ_2853_2247655_AC_0MS_28K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | long m,sum,i,k,t,j,n; 6 | double x1,x2; 7 | scanf("%d",&t); 8 | while(t--) 9 | { 10 | scanf("%d%ld",&j,&n); 11 | x2=n; 12 | x1=(sqrt(8*x2+1)-1)/2; 13 | i=(long)x1; 14 | n*=2; 15 | for(m=1,sum=0;m<=i;m++) 16 | { 17 | if(n%m==0) 18 | { 19 | k=n/m; 20 | if((m%2^k%2==0)==0) sum++; 21 | } 22 | } 23 | printf("%d %ld\n",j,sum-1); 24 | } 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /poj/2871/POJ_2871_2276788_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | float x,y; 5 | scanf("%f",&x); 6 | while(scanf("%f",&y)&&y!=999) 7 | { 8 | printf("%.2f\n",y-x); 9 | x=y; 10 | } 11 | printf("End of Output\n"); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /poj/2876/POJ_2876_2276770_AC_78MS_76K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void fenxing(long y,int flag) 4 | { 5 | int i; 6 | if(flag==0) 7 | { 8 | for(i=0;i 2 | #include 3 | int a[32769]; 4 | void init() 5 | { 6 | int i,j,k=1; 7 | for(i=0;i<32769;i++) a[i]=1; 8 | a[1]=0; 9 | for(i=2;i<=32769;i++) 10 | { 11 | if(a[i]) 12 | { 13 | for(j=i+i;j<=32769;j+=i) a[j]=0; 14 | } 15 | } 16 | } 17 | int main() 18 | { 19 | int i,count,n; 20 | init(); 21 | while(scanf("%d",&n)&&n) 22 | { 23 | for(i=3,count=0;i<=n/2;i+=2) 24 | { 25 | if(a[i]&&a[n-i]) count++; 26 | } 27 | printf("%d\n",count); 28 | } 29 | return 0; 30 | } -------------------------------------------------------------------------------- /poj/2924/POJ_2924_2246413_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int k,i; 5 | __int64 n,m,sum; 6 | scanf("%d",&k); 7 | for(i=1;i<=k;i++) 8 | { 9 | scanf("%I64d%I64d",&n,&m); 10 | sum=n+m; 11 | n=n>m?n-m:m-n; 12 | n++; 13 | if(n%2==0) n/=2; 14 | else sum/=2; 15 | sum*=n; 16 | printf("Scenario #%d:\n%I64d\n\n",i,sum); 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /poj/2945/POJ_2945_2386755_AC_1421MS_1640K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | string name[20000]; 8 | int out[20001]; 9 | int main() 10 | { 11 | int n,m,c; 12 | string str; 13 | map mp; 14 | while(cin >> n >> m && m+n){ 15 | mp.clear(); 16 | c = 0; 17 | for(int i = 0; i < n; i++){ 18 | cin >> str; 19 | if(mp[str] == 0) 20 | name[c++] = str; 21 | mp[str]++; 22 | } 23 | memset(out,0,sizeof(out)); 24 | for(i = 0; i < c; i++){ 25 | out[mp[name[i]]]++; 26 | } 27 | for(i = 1; i <= n; i++) 28 | cout << out[i] << endl; 29 | } 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /poj/2959/POJ_2959_2250970_AC_0MS_0K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | double m,r,d,s; 6 | int t; 7 | scanf("%d",&t); 8 | while(t--) 9 | { 10 | scanf("%lf%lf%lf",&d,&r,&s); 11 | m=3.1415926/asin((s+r)/(d-r))-0.5; 12 | printf("%.0f\n",m); 13 | 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /poj/2965/POJ_2965_2790726_AC_105MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | bool flag[4][4]={0}; 3 | char s[5][5]; 4 | void f(int i,int j) 5 | { 6 | int k; 7 | for(k=0;k<4;k++) flag[i][k]=1-flag[i][k]; 8 | for(k=0;k<4;k++) 9 | { 10 | if(k!=i) flag[k][j]=1-flag[k][j]; 11 | } 12 | } 13 | int main() 14 | { 15 | int i,j; 16 | for(i=0;i<4;i++) scanf("%s",s[i]); 17 | for(i=0;i<4;i++) 18 | { 19 | for(j=0;j<4;j++) 20 | { 21 | if(s[i][j]=='+') f(i,j); 22 | } 23 | } 24 | int cnt=0; 25 | for(i=0;i<4;i++) 26 | { 27 | for(j=0;j<4;j++) cnt+=flag[i][j]; 28 | } 29 | printf("%d\n",cnt); 30 | for(i=0;i<4;i++) 31 | { 32 | for(j=0;j<4;j++) 33 | { 34 | if(flag[i][j]) printf("%d %d\n",i+1,j+1); 35 | } 36 | } 37 | return 0; 38 | } -------------------------------------------------------------------------------- /poj/2965/POJ_2965_2790730_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | bool flag[4][4]={0}; 3 | char s[5][5]; 4 | void f(int i,int j) 5 | { 6 | int k; 7 | for(k=0;k<4;k++) flag[i][k]=1-flag[i][k]; 8 | for(k=0;k<4;k++) 9 | { 10 | if(k!=i) flag[k][j]=1-flag[k][j]; 11 | } 12 | } 13 | int main() 14 | { 15 | int i,j; 16 | for(i=0;i<4;i++) scanf("%s",s[i]); 17 | for(i=0;i<4;i++) 18 | { 19 | for(j=0;j<4;j++) 20 | { 21 | if(s[i][j]=='+') f(i,j); 22 | } 23 | } 24 | int cnt=0; 25 | for(i=0;i<4;i++) 26 | { 27 | for(j=0;j<4;j++) cnt+=flag[i][j]; 28 | } 29 | printf("%d\n",cnt); 30 | for(i=0;i<4;i++) 31 | { 32 | for(j=0;j<4;j++) 33 | { 34 | if(flag[i][j]) printf("%d %d\n",i+1,j+1); 35 | } 36 | } 37 | return 0; 38 | } -------------------------------------------------------------------------------- /poj/2975/POJ_2975_3077514_AC_46MS_220K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int a[1010]; 3 | int main() 4 | { 5 | int n,m,i,j,ans; 6 | while(scanf("%d",&n)&&n) 7 | { 8 | ans=0; 9 | for(i=0;i>=1; 22 | i++; 23 | } 24 | j=i-1; 25 | ans=0; 26 | for(i=0;i 2 | #define max 1000009 3 | bool a[max]={0}; 4 | void init() 5 | { 6 | long i,j; 7 | a[0]=a[1]=1; 8 | for(i=2;i*i 2 | #define max 1000009 3 | bool a[max]={0}; 4 | void init() 5 | { 6 | long i,j; 7 | a[0]=a[1]=1; 8 | for(i=2;i*i 2 | #define M 1000000007 3 | int a[4501][4501],i,j,n,m; 4 | int f(int n,int m) 5 | { 6 | if(m > n)return f( n , n ); 7 | if(n==0||n==1||m==1) return 1; 8 | if(a[n][m]) return a[n][m]; 9 | else 10 | { 11 | a[n][m] = f( n - m , m ) + f(n , m - 1 ); 12 | if(a[n][m] > M) a[n][m] -= M; 13 | return a[n][m]; 14 | } 15 | } 16 | int main() 17 | { 18 | memset(a,sizeof(a),0); 19 | while(scanf("%d%d",&m,&n)!=EOF) 20 | printf("%d\n", f( n, m ) ); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /poj/3014/POJ_3014_2429733_AC_1183MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | const int MAX_NUM = 4500; 3 | const int MODULAR = 1000000007; 4 | int count[MAX_NUM+2]; 5 | int main() 6 | { 7 | int nPlate, nCake; 8 | scanf("%d %d", &nPlate, &nCake); 9 | int plate, cake; 10 | count[nCake] = 1; 11 | for (plate = nPlate; plate > 1; --plate) 12 | { 13 | for (cake = nCake; cake >= plate; --cake) 14 | { 15 | count[cake-plate] += count[cake]; 16 | if ( count[cake-plate] > MODULAR ) 17 | count[cake-plate] %= MODULAR; 18 | } 19 | } 20 | int ans=0; 21 | for (cake = 0; cake <= nCake; ++cake) 22 | ans = (ans + count[cake]) % MODULAR; 23 | printf("%d\n", ans); 24 | return 0; 25 | } -------------------------------------------------------------------------------- /poj/3030/POJ_3030_2244160_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,m,l,t; 5 | scanf("%d",&t); 6 | while(t--) 7 | { 8 | scanf("%d%d%d",&n,&m,&l); 9 | if(n>m-l) printf("do not advertise\n"); 10 | else if(n 3 | int main() 4 | { 5 | int a[13],b[13]; 6 | int n,i,j,k,l; 7 | scanf("%d",&n); 8 | while(n--) 9 | { 10 | j=0; 11 | scanf("%d",&k); 12 | for(i=0;i 2 | #define maxn 20009 3 | int a[maxn]={0}; 4 | void init() 5 | { 6 | int i,j,t; 7 | t=1; 8 | a[1]=t++; 9 | for(i=2;ia[max]) max=j; 29 | } 30 | printf("%d\n",max); 31 | } 32 | return 0; 33 | } -------------------------------------------------------------------------------- /poj/3060/POJ_3060_2667991_AC_406MS_4132K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int b[1010][1010]={0}; 3 | int f1[1010]={0},f2[1010]={0}; 4 | int main() 5 | { 6 | int i,j,k,n,d,t; 7 | int ans; 8 | scanf("%d",&t); 9 | while(t--) 10 | { 11 | scanf("%d%d",&d,&n); 12 | for(i=0;ik) ans=k; 28 | b[i][j]=0; 29 | if(i==d-1) f2[j]=0; 30 | } 31 | f1[i]=0; 32 | } 33 | printf("%d\n",ans); 34 | } 35 | return 0; 36 | } 37 | 38 | -------------------------------------------------------------------------------- /poj/3060/POJ_3060_2667993_AC_187MS_4064K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int b[1010][1010]={0}; 3 | int f1[1010]={0},f2[1010]={0}; 4 | int main() 5 | { 6 | int i,j,k,n,d,t; 7 | int ans; 8 | scanf("%d",&t); 9 | while(t--) 10 | { 11 | scanf("%d%d",&d,&n); 12 | for(i=0;ik) ans=k; 28 | b[i][j]=0; 29 | if(i==d-1) f2[j]=0; 30 | } 31 | f1[i]=0; 32 | } 33 | printf("%d\n",ans); 34 | } 35 | return 0; 36 | } 37 | 38 | -------------------------------------------------------------------------------- /poj/3062/POJ_3062_3257706_AC_0MS_276K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char s[100]; 5 | while(gets(s)) 6 | { 7 | puts(s); 8 | } 9 | } -------------------------------------------------------------------------------- /poj/3070/POJ_3070_2277892_AC_15MS_120K.c: -------------------------------------------------------------------------------- 1 | #include 2 | int a[15002]; 3 | void init() 4 | { 5 | int i; 6 | a[0]=0; 7 | a[1]=1; 8 | for(i=2;i<=15001;i++) 9 | { 10 | a[i]=(a[i-1]+a[i-2])%10000; 11 | } 12 | } 13 | int main() 14 | { 15 | __int64 l; 16 | init(); 17 | while(scanf("%I64d",&l)&&l!=-1) 18 | { 19 | l%=15000; 20 | printf("%d\n",a[l]); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /poj/3070/POJ_3070_2277898_AC_46MS_60K.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | __int64 l; 5 | int i,j,temp; 6 | // init(); 7 | while(scanf("%I64d",&l)&&l!=-1) 8 | { 9 | l%=15000; 10 | if(l==0) printf("0\n"); 11 | else if(l==1) printf("1\n"); 12 | else 13 | { 14 | i=0; 15 | j=1; 16 | while(--l) 17 | { 18 | temp=i+j; 19 | temp%=10000; 20 | i=j; 21 | j=temp; 22 | } 23 | printf("%d\n",j); 24 | } 25 | } 26 | return 0; 27 | } -------------------------------------------------------------------------------- /poj/3077/POJ_3077_2245157_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | long n,i,j; 5 | scanf("%d",&j); 6 | while(j--) 7 | { 8 | scanf("%ld",&n); 9 | for(i=10;i=5*i/10) n+=i; 12 | n-=n%i; 13 | } 14 | printf("%ld\n",n); 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /poj/3085/POJ_3085_2244883_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,a[4]={25,10,5,1},i,money; 5 | scanf("%d",&n); 6 | for(i=1;i<=n;i++) 7 | { 8 | scanf("%d",&money); 9 | printf("%d %d QUARTER(S),",i,money/a[0]); 10 | money%=a[0]; 11 | printf(" %d DIME(S),",money/a[1]); 12 | money%=a[1]; 13 | printf(" %d NICKEL(S),",money/a[2]); 14 | money%=a[2]; 15 | printf(" %d PENNY(S)\n",money); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /poj/3086/POJ_3086_2193600_AC_0MS_60K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int t,k=0,i,n,sum,sun; 5 | scanf("%d",&t); 6 | while(k 2 | int a[1000]; 3 | int gcd(int x,int y) 4 | { 5 | int m; 6 | if(x 2 | #include 3 | int a[12]={2,3,5,7,11,13,17,19,23,29,31,37}; 4 | int oula(int n) 5 | { 6 | int i,sum=1,k; 7 | for(i=0;i<12&&n!=1;i++) 8 | { 9 | if(n%a[i]==0) 10 | { 11 | k=0; 12 | while(n%a[i]==0) 13 | { 14 | 15 | n/=a[i]; 16 | k++; 17 | } 18 | sum*=(a[i]-1)*pow(a[i],k-1); 19 | } 20 | } 21 | if(n!=1) sum*=(n-1); 22 | return sum*2; 23 | } 24 | int main() 25 | { 26 | int c,i,n,sum,j; 27 | scanf("%d",&c); 28 | for(i=1;i<=c;i++) 29 | { 30 | scanf("%d",&n); 31 | sum=3; 32 | for(j=2;j<=n;j++) 33 | sum+=oula(j); 34 | printf("%d %d %d\n",i,n,sum); 35 | } 36 | return 0; 37 | } -------------------------------------------------------------------------------- /poj/3090/POJ_3090_2267728_AC_15MS_80K.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int a[12]={2,3,5,7,11,13,17,19,23,29,31,37}; 4 | int b[1001]; 5 | int oula(int n) 6 | { 7 | int i,sum=1,k; 8 | for(i=0;i<12&&n!=1;i++) 9 | { 10 | if(n%a[i]==0) 11 | { 12 | k=0; 13 | while(n%a[i]==0) 14 | { 15 | 16 | n/=a[i]; 17 | k++; 18 | } 19 | sum*=(a[i]-1)*pow(a[i],k-1); 20 | } 21 | } 22 | if(n!=1) sum*=(n-1); 23 | return sum*2; 24 | } 25 | int main() 26 | { 27 | int c,i,n; 28 | for(i=2,b[1]=3;i<=1000;i++) 29 | { 30 | b[i]=b[i-1]+oula(i); 31 | } 32 | scanf("%d",&c); 33 | for(i=1;i<=c;i++) 34 | { 35 | scanf("%d",&n); 36 | printf("%d %d %d\n",i,n,b[n]);; 37 | } 38 | return 0; 39 | } -------------------------------------------------------------------------------- /poj/3090/POJ_3090_2267731_AC_0MS_80K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int a[12]={2,3,5,7,11,13,17,19,23,29,31,37}; 4 | int b[1001]; 5 | int oula(int n) 6 | { 7 | int i,sum=1,k; 8 | for(i=0;i<12&&n!=1;i++) 9 | { 10 | if(n%a[i]==0) 11 | { 12 | k=0; 13 | while(n%a[i]==0) 14 | { 15 | 16 | n/=a[i]; 17 | k++; 18 | } 19 | sum*=(a[i]-1)*pow(a[i],k-1); 20 | } 21 | } 22 | if(n!=1) sum*=(n-1); 23 | return sum*2; 24 | } 25 | int main() 26 | { 27 | int c,i,n; 28 | for(i=2,b[1]=3;i<=1000;i++) 29 | { 30 | b[i]=b[i-1]+oula(i); 31 | } 32 | scanf("%d",&c); 33 | for(i=1;i<=c;i++) 34 | { 35 | scanf("%d",&n); 36 | printf("%d %d %d\n",i,n,b[n]);; 37 | } 38 | return 0; 39 | } -------------------------------------------------------------------------------- /poj/3094/POJ_3094_2212109_AC_0MS_20K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char s[256]; 5 | int i; 6 | long sum; 7 | while(1) 8 | { 9 | gets(s); 10 | if(s[0]=='#') break; 11 | else 12 | { 13 | for(sum=i=0;s[i];i++) 14 | { 15 | if(s[i]>='A'&&s[i]<='Z') 16 | { 17 | sum+=(s[i]-'A'+1)*(i+1); 18 | } 19 | } 20 | printf("%ld\n",sum); 21 | } 22 | } 23 | } -------------------------------------------------------------------------------- /poj/3100/POJ_3100_2149214_AC_0MS_60K.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | long n,max,i; 6 | double diff,maxdiff; 7 | int j; 8 | while(scanf("%ld %d",&n,&j)) 9 | { 10 | if(n==0&&j==0) 11 | break; 12 | else if(n==0&&j!=0) 13 | printf("0\n"); 14 | else 15 | { 16 | if(j==1) 17 | printf("%ld\n",n); 18 | else 19 | { 20 | for(i=1;pow(i,j)<=n;i++); 21 | max=pow(i,j)-n>n-pow(i-1,j)?i-1:i; 22 | printf("%ld\n",max); 23 | } 24 | } 25 | } 26 | } -------------------------------------------------------------------------------- /poj/3117/POJ_3117_2147183_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int t,n,i,j; 5 | while(1) 6 | { 7 | scanf("%d %d",&t,&n); 8 | if(!t)break; 9 | j=3*n; 10 | while(t--) 11 | { 12 | scanf("%*s %d",&i); 13 | j-=i; 14 | } 15 | printf("%d\n",j); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /poj/3138/POJ_3138_2805291_AC_15MS_72K.cpp: -------------------------------------------------------------------------------- 1 | 2 | //pku 1468 1470 的其他方法 3 | 4 | //pku 2559,3250 的共同点 5 | 6 | //pku1690--pku1697 7 | #include 8 | int main() 9 | { 10 | int a[110],flag[110]; 11 | int s,t,m,i,j,k,l; 12 | int ans; 13 | int p=1; 14 | while(scanf("%d%d%d",&s,&t,&m)&&(s+m+t)) 15 | { 16 | ans=0; 17 | for(i=1;i<=s;i++) a[i]=flag[i]=0; 18 | for(i=0;i=m) flag[j]=1; 27 | } 28 | for(i=1;i<=s;i++) ans+=a[i]+flag[i]; 29 | printf("Case %d: %d\n",p++,ans); 30 | } 31 | return 0; 32 | } -------------------------------------------------------------------------------- /poj/3146/POJ_3146_2809122_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int a,p,t=1; 6 | char s[100]; 7 | __int64 ans; 8 | while(scanf("%d%d",&p,&a)&&(a+p)) 9 | { 10 | if(p<0) p=-p; 11 | ans=1; 12 | while(a) 13 | { 14 | ans*=(a%p+1); 15 | a/=p; 16 | ans%=10000; 17 | } 18 | printf("Case %d: %04I64d\n",t++,ans); 19 | } 20 | return 0; 21 | } -------------------------------------------------------------------------------- /poj/3173/POJ_3173_2244808_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,s,a[20],i,j; 5 | while(scanf("%d%d",&n,&s)!=EOF) 6 | { 7 | for(i=1,a[0]=s;i 2 | void main() 3 | { 4 | int a[770][2],i,j,k,n,l,b[770][3]; 5 | scanf("%d",&n); 6 | i=0; 7 | j=n; 8 | while(j--) 9 | { 10 | scanf("%d %d",&a[i][0],&a[i][1]); 11 | i++; 12 | } 13 | for(i=0,l=0;i 2 | int a[360][360]; 3 | int main() 4 | { 5 | int n,i,j; 6 | scanf("%d",&n); 7 | for(i=0;i=0;i--) 15 | { 16 | for(j=0;j<=i;j++) 17 | { 18 | a[i][j]=a[i+1][j]>a[i+1][j+1]?a[i][j]+a[i+1][j]:a[i+1][j+1]+a[i][j]; 19 | } 20 | } 21 | printf("%d\n",a[0][0]); 22 | return 0; 23 | } -------------------------------------------------------------------------------- /poj/3186/POJ_3186_2377337_AC_140MS_13780K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define MAX 2001 4 | int f[2001][2001]={0}; 5 | int main() 6 | { 7 | 8 | int n ; 9 | int a[MAX]; 10 | scanf("%d",&n) ; 11 | int i; 12 | for ( i = 1 ; i <= n ; i ++ ) 13 | scanf("%d",&a[ i ]); 14 | int j ; 15 | for ( i = n; i >= 1 ; i -- ) 16 | for ( j = i ; j <= n ; j ++ ) 17 | { 18 | f[i][j]= f[i+1][j]+a[i]*(n-j+i); 19 | if ( f[ i ] [ j - 1 ] + a[ j ] * ( n - j + i ) > f[ i ][ j ] ) 20 | f[i][j] = f[ i ] [ j - 1 ] + a[ j ] * ( n - j + i ) ; 21 | } 22 | printf("%d\n",f [ 1 ] [ n ]); 23 | return 0; 24 | } -------------------------------------------------------------------------------- /poj/3196/POJ_3196_3140457_AC_0MS_188K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int abs(int x) 3 | { 4 | return x>0?x:-x; 5 | } 6 | int main() 7 | { 8 | int n,m,p; 9 | while(scanf("%d%d%d",&n,&m,&p)&&(n+m+p)) 10 | { 11 | if(n==p) 12 | { 13 | printf("0\n"); 14 | continue; 15 | } 16 | if(m==0) printf("No accounting tablet\n"); 17 | else 18 | { 19 | n=abs(n-p); 20 | if(n%m) printf("No accounting tablet\n"); 21 | else 22 | { 23 | n/=m; 24 | printf("%d\n",n/3+(n%3!=0)); 25 | } 26 | } 27 | } 28 | return 0; 29 | } -------------------------------------------------------------------------------- /poj/3210/POJ_3210_2244361_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n; 5 | while(scanf("%d",&n)&&n) 6 | { 7 | if(n&1)printf("%d\n",n-1); 8 | else if(n==1) printf("0\n"); 9 | else printf("No Solution!\n"); 10 | } 11 | return 0; 12 | } -------------------------------------------------------------------------------- /poj/3219/POJ_3219_2150453_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | long n,k,sum,j; 5 | while(scanf("%ld %ld",&n,&k)!=EOF) 6 | { 7 | sum=0; 8 | j=n; 9 | while(j!=0) 10 | { 11 | sum+=j/2; 12 | j/=2; 13 | } 14 | j=k; 15 | while(j!=0) 16 | { 17 | sum-=j/2; 18 | j/=2; 19 | } 20 | j=n-k; 21 | while(j!=0) 22 | { 23 | sum-=j/2; 24 | j/=2; 25 | } 26 | if(sum>0) 27 | printf("0\n"); 28 | else 29 | printf("1\n"); 30 | } 31 | } -------------------------------------------------------------------------------- /poj/3219/POJ_3219_2150458_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | long n,k,j; 5 | int sum; 6 | while(scanf("%ld %ld",&n,&k)!=EOF) 7 | { 8 | sum=0; 9 | j=n; 10 | while(j!=0) 11 | { 12 | sum+=j/2; 13 | j/=2; 14 | } 15 | j=k; 16 | while(j!=0) 17 | { 18 | sum-=j/2; 19 | j/=2; 20 | } 21 | j=n-k; 22 | while(j!=0) 23 | { 24 | sum-=j/2; 25 | j/=2; 26 | } 27 | if(sum>0) 28 | printf("0\n"); 29 | else 30 | printf("1\n"); 31 | } 32 | } -------------------------------------------------------------------------------- /poj/3219/POJ_3219_2150503_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | long n,k,j; 5 | int sum; 6 | while(scanf("%ld %ld",&n,&k)!=EOF) 7 | { 8 | sum=0; 9 | j=n-k; 10 | while(n||j||k) 11 | { 12 | sum=sum+n/2-j/2-k/2; 13 | n/=2; 14 | k/=2; 15 | j/=2; 16 | } 17 | if(sum>0) 18 | printf("0\n"); 19 | else 20 | printf("1\n"); 21 | } 22 | } -------------------------------------------------------------------------------- /poj/3219/POJ_3219_2150518_AC_15MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | long n,k; 5 | int sum; 6 | while(scanf("%ld %ld",&n,&k)!=EOF) 7 | { 8 | sum=0; 9 | while(n||k) 10 | { 11 | sum=sum+n/2-(n-k)/2-k/2; 12 | n/=2; 13 | k/=2; 14 | } 15 | if(sum>0) 16 | printf("0\n"); 17 | else 18 | printf("1\n"); 19 | } 20 | } -------------------------------------------------------------------------------- /poj/3219/POJ_3219_2150528_AC_0MS_48K.c: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | long n,k; 5 | int sum; 6 | while(scanf("%ld %ld",&n,&k)!=EOF) 7 | { 8 | sum=0; 9 | while(n||k) 10 | { 11 | sum=sum+n/2-(n-k)/2-k/2; 12 | n/=2; 13 | k/=2; 14 | } 15 | if(sum>0) 16 | printf("0\n"); 17 | else 18 | printf("1\n"); 19 | } 20 | } -------------------------------------------------------------------------------- /poj/3219/POJ_3219_2150572_AC_0MS_48K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | long n,k; 5 | int sum; 6 | while(scanf("%ld %ld",&n,&k)!=EOF) 7 | { 8 | sum=0; 9 | while(n||k) 10 | { 11 | sum=sum+n/2-(n-k)/2-k/2; 12 | n/=2; 13 | k/=2; 14 | } 15 | if(sum>0) 16 | printf("0\n"); 17 | else 18 | printf("1\n"); 19 | } 20 | } -------------------------------------------------------------------------------- /poj/3219/POJ_3219_2463247_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int n,k; 5 | int sum; 6 | while(scanf("%ld %ld",&n,&k)!=EOF) 7 | { 8 | sum=0; 9 | while(n||k) 10 | { 11 | sum=sum+n/2-(n-k)/2-k/2; 12 | n=n>>1; 13 | k=k>>1; 14 | } 15 | if(sum>0) 16 | printf("0\n"); 17 | else 18 | printf("1\n"); 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /poj/3224/POJ_3224_2246464_AC_0MS_24K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,i,j,sum=0,sum1,c,k; 5 | scanf("%d",&n); 6 | for(i=0;isum?sum=sum1,k=i:sum=sum; 16 | } 17 | printf("%d\n",k+1); 18 | return 0; 19 | } -------------------------------------------------------------------------------- /poj/3224/POJ_3224_2785172_AC_0MS_168K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a[110]; 5 | int n,i,j; 6 | int k; 7 | while(scanf("%d",&n)!=EOF) 8 | { 9 | for(i=0;i=3) a[i]++; 16 | } 17 | } 18 | k=0; 19 | for(i=0;ia[k]) k=i; 20 | printf("%d\n",k+1); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /poj/3250/POJ_3250_2545925_AC_107MS_1392K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define maxn 80009 3 | __int64 a[maxn][2]; 4 | int main() 5 | { 6 | int n,i,j,head; 7 | __int64 sum; 8 | while(scanf("%d",&n)!=EOF) 9 | { 10 | sum=head=0; 11 | for(i=0;i0&&a[head][0]>=a[head-1][0]) 16 | { 17 | sum+=a[head][1]-a[head-1][1]-1; 18 | a[head-1][0]=a[head][0]; 19 | a[head-1][1]=a[head][1]; 20 | head--; 21 | } 22 | head++; 23 | } 24 | head--; 25 | for(i=0;i 2 | #include 3 | using namespace std; 4 | struct node 5 | { 6 | int x,y; 7 | }a[1000000]; 8 | bool cmp(const node &x,const node &y) 9 | { 10 | return x.x*y.y0;i*=10) 13 | { 14 | if(a%10)s+=i*(a/10); 15 | else 16 | { 17 | s+=i*((a/10)-1); 18 | s+=m%(i*10)+1; 19 | } 20 | a/=10; 21 | } 22 | return s; 23 | } 24 | int main() 25 | { 26 | long long m,n; 27 | cin>>m>>n; 28 | while(m>=0) 29 | { 30 | m=zeros(m-1); 31 | n=zeros(n); 32 | cout<>m>>n; 34 | } 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /poj/3300/POJ_3300_2912160_AC_0MS_76K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | double ans[100]; 7 | int a[100],aa,b[100],bb; 8 | while(scanf("%d",&aa)&&aa) 9 | { 10 | scanf("%d",&bb); 11 | for(int i=0;imin) min=ans[i+1]/ans[i]; 32 | } 33 | printf("%.2lf\n",min); 34 | } 35 | return 0; 36 | } -------------------------------------------------------------------------------- /poj/3302/POJ_3302_2417986_AC_0MS_40K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | char s[110],ss[110]; 6 | int i,j,t; 7 | scanf("%d",&t); 8 | while(t--) 9 | { 10 | scanf("%s%s",s,ss); 11 | for(j=i=0;s[i];i++) 12 | { 13 | if(s[i]==ss[j]) j++; 14 | } 15 | if(j=0;i--) 19 | { 20 | if(s[i]==ss[j]&&j>=0) j++; 21 | } 22 | if(j>=strlen(ss)) printf("YES\n"); 23 | else printf("NO\n"); 24 | } 25 | else printf("YES\n"); 26 | } 27 | return 0; 28 | } -------------------------------------------------------------------------------- /poj/3307/POJ_3307_2418999_AC_718MS_7872K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | __int64 a[1000009]; 3 | int f[4]={6,4,3,2}; 4 | int c[4]={2,3,5,7}; 5 | int main() 6 | { 7 | int i,j,n,min,t; 8 | for(i=1;i<=10;i++) a[i]=i; 9 | for(;i<1000009;i++) 10 | { 11 | min=0; 12 | for(j=0;j<4;j++) 13 | { 14 | if(a[f[min]]*c[min]>a[f[j]]*c[j]) min=j; 15 | } 16 | a[i]=a[f[min]]*c[min]; 17 | f[min]++; 18 | for(j=0;j<4;j++) 19 | { 20 | if(a[f[j]]*c[j]==a[f[min]-1]*c[min]) f[j]++; 21 | } 22 | } 23 | scanf("%d",&t); 24 | while(t--) 25 | { 26 | scanf("%d",&n); 27 | printf("%I64d\n",a[n]); 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /poj/3307/POJ_3307_2419022_AC_234MS_588K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | __int64 a[70000]; 3 | int f[4]={6,4,3,2}; 4 | int c[4]={2,3,5,7}; 5 | int main() 6 | { 7 | int i,j,n,min,t; 8 | for(i=1;i<=10;i++) a[i]=i; 9 | for(;i<70000;i++) 10 | { 11 | min=0; 12 | for(j=0;j<4;j++) 13 | { 14 | if(a[f[min]]*c[min]>a[f[j]]*c[j]) min=j; 15 | } 16 | a[i]=a[f[min]]*c[min]; 17 | f[min]++; 18 | for(j=0;j<4;j++) 19 | { 20 | if(a[f[j]]*c[j]==a[f[min]-1]*c[min]) f[j]++; 21 | } 22 | } 23 | scanf("%d",&t); 24 | while(t--) 25 | { 26 | scanf("%d",&n); 27 | printf("%I64d\n",a[n]); 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /poj/3307/POJ_3307_2419029_AC_140MS_564K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | __int64 a[66666]; 3 | int f[4]={6,4,3,2}; 4 | int c[4]={2,3,5,7}; 5 | int main() 6 | { 7 | int i,j,n,min,t; 8 | for(i=1;i<=10;i++) a[i]=i; 9 | for(;i<66666;i++) 10 | { 11 | min=0; 12 | for(j=0;j<4;j++) 13 | { 14 | if(a[f[min]]*c[min]>a[f[j]]*c[j]) min=j; 15 | } 16 | a[i]=a[f[min]]*c[min]; 17 | f[min]++; 18 | for(j=0;j<4;j++) 19 | { 20 | if(a[f[j]]*c[j]==a[f[min]-1]*c[min]) f[j]++; 21 | } 22 | } 23 | scanf("%d",&t); 24 | while(t--) 25 | { 26 | scanf("%d",&n); 27 | printf("%I64d\n",a[n]); 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /poj/3307/POJ_3307_2887507_AC_140MS_712K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | __int64 a[66666]; 3 | int f[4]={6,4,3,2}; 4 | int c[4]={2,3,5,7}; 5 | int main() 6 | { 7 | int i,j,n,min,t; 8 | for(i=1;i<=10;i++) a[i]=i; 9 | for(;i<66666;i++) 10 | { 11 | min=0; 12 | for(j=0;j<4;j++) 13 | { 14 | if(a[f[min]]*c[min]>a[f[j]]*c[j]) min=j; 15 | } 16 | a[i]=a[f[min]]*c[min]; 17 | f[min]++; 18 | for(j=0;j<4;j++) 19 | { 20 | if(a[f[j]]*c[j]==a[f[min]-1]*c[min]) f[j]++; 21 | } 22 | } 23 | scanf("%d",&t); 24 | while(t--) 25 | { 26 | scanf("%d",&n); 27 | printf("%I64d\n",a[n]); 28 | } 29 | return 0; 30 | } 31 | 32 | -------------------------------------------------------------------------------- /poj/3325/POJ_3325_2461111_AC_0MS_84K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int cmp(const void *n,const void *m) 4 | { 5 | return *(int *)n-*(int *)m; 6 | } 7 | int main() 8 | { 9 | int n,i,j; 10 | int a[1009]; 11 | double av; 12 | while(scanf("%d",&n)&&n) 13 | { 14 | for(i=0;i 2 | #include 3 | int Max(int a,int b) 4 | { 5 | return a>b?a:b; 6 | } 7 | void main(){ 8 | char s1[1010],s2[1010]; 9 | int i,j,len1,len2,d[2][1010]={0}; 10 | int flag; 11 | while(scanf("%d%s%d%s",&len1,s1,&len2,s2)!=EOF) 12 | { 13 | for(i=0;i<=len2;i++) d[1][i]=d[0][i]=0; 14 | flag=1; 15 | for(i=1;i<=len1;i++) 16 | { for(j=1;j<=len2;j++) 17 | { 18 | if(s1[i-1]==s2[j-1]) 19 | d[flag][j]=d[1-flag][j-1]+1; 20 | else 21 | { 22 | d[flag][j]=Max(d[1-flag][j],d[flag][j-1]); 23 | } 24 | } 25 | flag=1-flag; 26 | } 27 | 28 | printf("%d\n",len2-d[1-flag][j-1]); 29 | } 30 | } 31 | 32 | 33 | -------------------------------------------------------------------------------- /poj/3356/POJ_3356_2578086_AC_15MS_176K.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int Max(int a,int b) 4 | { 5 | return a>b?a:b; 6 | } 7 | void main(){ 8 | char s1[1010],s2[1010]; 9 | int i,j,len1,len2,d[2][1010]={0}; 10 | int flag; 11 | while(scanf("%d%s%d%s",&len1,s1,&len2,s2)!=EOF) 12 | { 13 | for(i=0;i<=len2;i++) d[1][i]=d[0][i]=0; 14 | flag=1; 15 | for(i=1;i<=len1;i++) 16 | { for(j=1;j<=len2;j++) 17 | { 18 | if(s1[i-1]==s2[j-1]) 19 | d[flag][j]=d[1-flag][j-1]+1; 20 | else 21 | { 22 | d[flag][j]=Max(d[1-flag][j],d[flag][j-1]); 23 | } 24 | } 25 | flag=1-flag; 26 | } 27 | 28 | printf("%d\n",len2-d[1-flag][j-1]); 29 | } 30 | } 31 | 32 | 33 | -------------------------------------------------------------------------------- /poj/3356/POJ_3356_2578088_AC_15MS_76K.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int Max(int a,int b) 4 | { 5 | return a>b?a:b; 6 | } 7 | void main(){ 8 | char s1[1010],s2[1010]; 9 | int i,j,len1,len2,d[2][1010]={0}; 10 | int flag; 11 | while(scanf("%d%s%d%s",&len1,s1,&len2,s2)!=EOF) 12 | { 13 | for(i=0;i<=len2;i++) d[1][i]=d[0][i]=0; 14 | flag=1; 15 | for(i=1;i<=len1;i++) 16 | { for(j=1;j<=len2;j++) 17 | { 18 | if(s1[i-1]==s2[j-1]) 19 | d[flag][j]=d[1-flag][j-1]+1; 20 | else 21 | { 22 | d[flag][j]=Max(d[1-flag][j],d[flag][j-1]); 23 | } 24 | } 25 | flag=1-flag; 26 | } 27 | 28 | printf("%d\n",len2-d[1-flag][j-1]); 29 | } 30 | } 31 | 32 | 33 | -------------------------------------------------------------------------------- /poj/3364/POJ_3364_2591636_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | long f(int n,int m) 3 | { 4 | if(n<8||m<8) return 0; 5 | int i,j; 6 | i=(n-8)/2+1; 7 | j=(m-8)/2+1; 8 | return i*j; 9 | } 10 | int main() 11 | { 12 | int n,m,c; 13 | int a1,b1,a2,b2; 14 | __int64 ans; 15 | while(1) 16 | { 17 | scanf("%d%d%d",&n,&m,&c); 18 | if(n==0&&m==0&&c==0) break; 19 | if(n<8||m<8) printf("0\n"); 20 | else 21 | { 22 | if(c==0) 23 | { 24 | ans=f(n-1,m)+f(n,m-1); 25 | printf("%I64d\n",ans); 26 | } 27 | else printf("%ld\n",f(n,m)+f(n-1,m-1)); 28 | } 29 | } 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /poj/3365/POJ_3365_2591128_AC_31MS_88K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | int main() 6 | { 7 | double a,b; 8 | double pi,ans,ans2,ans1; 9 | double x,y; 10 | pi=acos(-1); 11 | while(scanf("%lf%lf",&a,&b)&&(a+b)) 12 | { 13 | if(a>b) swap(a,b); 14 | ans=ans1=ans2=-1; 15 | if(b>(1+pi)*a) 16 | { 17 | ans=pi*a*a*a/4.0; 18 | } 19 | x=2*b/3.0; 20 | if(x 2 | using namespace std; 3 | 4 | int a[110000]; 5 | int flag[100100]; 6 | int main() 7 | { 8 | int c,m,n,i; 9 | while(scanf("%d%d",&n,&m)&&(n+m)) 10 | { 11 | for(i=0;i=0) break; 21 | else flag[sum]=i+1; 22 | } 23 | for(int j=flag[sum];j<=i;j++) 24 | { 25 | printf("%d ",j+1); 26 | } 27 | printf("\n"); 28 | int tp; 29 | for(i++;i 2 | void main() 3 | { 4 | __int64 a,b; 5 | while(scanf("%I64d",&a)!=EOF) 6 | { 7 | b=a-1; 8 | if((b^a)==(b+a)) 9 | printf("YES\n"); 10 | else printf("NO\n"); 11 | } 12 | } -------------------------------------------------------------------------------- /poj/3385/POJ_3385_2694686_AC_255MS_468K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int a[100010]; 3 | int main() 4 | { 5 | int n,d,j,i; 6 | int ans; 7 | while(scanf("%d%d",&n,&d)!=EOF) 8 | { 9 | ans=0; 10 | for(i=0;id) 19 | { 20 | if((a[i]-d)%(d-1)) ans+=(a[i]-d)/(d-1)+1; 21 | else ans+=(a[i]-d)/(d-1); 22 | } 23 | } 24 | printf("%d\n",ans); 25 | } 26 | return 0; 27 | } -------------------------------------------------------------------------------- /poj/3386/POJ_3386_2694224_AC_0MS_72K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int A,a,B,b,P; 5 | int temp; 6 | while(scanf("%d%d%d%d%d",&A,&a,&B,&b,&P)!=EOF) 7 | { 8 | if(A>B) 9 | { 10 | temp=A; 11 | A=B; 12 | B=temp; 13 | temp=a; 14 | a=b; 15 | b=temp; 16 | } 17 | if(B>P) 18 | { 19 | printf("No\n"); 20 | continue ; 21 | } 22 | if(b>=A) printf("Yes\n"); 23 | else 24 | { 25 | if(A+B<=P) printf("Yes\n"); 26 | else printf("No\n"); 27 | } 28 | } 29 | return 0; 30 | } -------------------------------------------------------------------------------- /poj/3390/POJ_3390_2728453_AC_15MS_164K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int a[11000]; 3 | int ans[11000]; 4 | int main() 5 | { 6 | int n,m,t; 7 | int i,j,sum; 8 | int min,temp; 9 | scanf("%d",&t); 10 | while(t--) 11 | { 12 | scanf("%d%d",&m,&n); 13 | for(i=0;im) break; 18 | ans[i]=(m-sum-i)*(m-sum-i); 19 | } 20 | for(;i=0;j--) 24 | { 25 | sum+=a[j]; 26 | if(sum+i-j>m) break; 27 | temp=ans[j-1]+(m-sum-i+j)*(m-sum-i+j); 28 | min=min>temp?temp:min; 29 | } 30 | ans[i]=min; 31 | } 32 | printf("%d\n",ans[n-1]); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /poj/3412/POJ_3412_2763340_AC_0MS_92K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | double a[110]; 4 | int main() 5 | { 6 | int n,i; 7 | double x,y,x1,y1; 8 | while(scanf("%d",&n)!=EOF) 9 | { 10 | for(i=0;i1) break; 17 | else x=asin(y1); 18 | } 19 | if(i 11 | int main() 12 | { 13 | int n,m; 14 | int max; 15 | int a,temp,i; 16 | while(scanf("%d%d",&n,&m)!=EOF) 17 | { 18 | max=0; 19 | for(i=0;i 2 | #include 3 | char s[10000]; 4 | int main() 5 | { 6 | int t; 7 | int i,j; 8 | scanf("%d",&t); 9 | while(t--) 10 | { 11 | scanf("%s",s); 12 | int n=strlen(s); 13 | int cnt=1; 14 | for(i=1;i<=n;i++) 15 | { 16 | if(s[i]==s[i-1]) cnt++; 17 | else 18 | { 19 | printf("%d%c",cnt,s[i-1]); 20 | cnt=1; 21 | } 22 | } 23 | printf("\n"); 24 | } 25 | return 0; 26 | } -------------------------------------------------------------------------------- /poj/3456/POJ_3456_2880925_AC_531MS_1056K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define maxn 2010000 3 | bool flag[maxn]; 4 | int main() 5 | { 6 | int t; 7 | int a[10]; 8 | int i,j; 9 | scanf("%d",&t); 10 | int cnt,max; 11 | while(t--) 12 | { 13 | for(i=0;i<1000010;i++) flag[i]=0; 14 | for(i=0;i<4;i++) 15 | { 16 | scanf("%d",&a[i]); 17 | } 18 | flag[0]=1; 19 | cnt=0; 20 | max=-1; 21 | for(i=0;i<=1000000;i++) 22 | { 23 | if(flag[i]) 24 | { 25 | for(j=0;j<4;j++) 26 | { 27 | flag[i+a[j]]=1; 28 | } 29 | } 30 | else 31 | { 32 | cnt++; 33 | max=i; 34 | } 35 | } 36 | if(cnt>maxn/4) max=-1; 37 | printf("%d\n%d\n",cnt,max); 38 | } 39 | return 0; 40 | } -------------------------------------------------------------------------------- /poj/3456/POJ_3456_2887309_AC_546MS_1056K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define maxn 2010000 3 | bool flag[maxn]; 4 | int main() 5 | { 6 | int t; 7 | int a[10]; 8 | int i,j; 9 | scanf("%d",&t); 10 | int cnt,max; 11 | while(t--) 12 | { 13 | for(i=0;i<1000010;i++) flag[i]=0; 14 | for(i=0;i<4;i++) 15 | { 16 | scanf("%d",&a[i]); 17 | } 18 | flag[0]=1; 19 | cnt=0; 20 | max=-1; 21 | for(i=0;i<=1000000;i++) 22 | { 23 | if(flag[i]) 24 | { 25 | for(j=0;j<4;j++) 26 | { 27 | flag[i+a[j]]=1; 28 | } 29 | } 30 | else 31 | { 32 | cnt++; 33 | max=i; 34 | } 35 | } 36 | if(cnt>maxn/4) max=-1; 37 | printf("%d\n%d\n",cnt,max); 38 | } 39 | return 0; 40 | } 41 | -------------------------------------------------------------------------------- /poj/3456/POJ_3456_2887310_AC_203MS_1180K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #define maxn 2010000 3 | bool flag[maxn]; 4 | int main() 5 | { 6 | int t; 7 | int a[10]; 8 | int i,j; 9 | scanf("%d",&t); 10 | int cnt,max; 11 | while(t--) 12 | { 13 | for(i=0;i<1000010;i++) flag[i]=0; 14 | for(i=0;i<4;i++) 15 | { 16 | scanf("%d",&a[i]); 17 | } 18 | flag[0]=1; 19 | cnt=0; 20 | max=-1; 21 | for(i=0;i<=1000000;i++) 22 | { 23 | if(flag[i]) 24 | { 25 | for(j=0;j<4;j++) 26 | { 27 | flag[i+a[j]]=1; 28 | } 29 | } 30 | else 31 | { 32 | cnt++; 33 | max=i; 34 | } 35 | } 36 | if(cnt>maxn/4) max=-1; 37 | printf("%d\n%d\n",cnt,max); 38 | } 39 | return 0; 40 | } 41 | -------------------------------------------------------------------------------- /poj/3458/POJ_3458_2880475_AC_0MS_64K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char s1[110],s2[110],s3[110]; 5 | int i,j,t; 6 | scanf("%d",&t); 7 | while(t--) 8 | { 9 | scanf("%s%s%s",s1,s2,s3); 10 | for(i=0,j=0;s2[j]&&s1[i];j++) 11 | { 12 | if(s2[j]==s1[i]||s3[j]==s1[i]||s2[j]=='*') i++; 13 | } 14 | if(s1[i]=='\0') printf("win\n"); 15 | else printf("lose\n"); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /poj/3480/POJ_3480_3070618_AC_0MS_148K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int ans,cnt,i,n,x; 5 | int t; 6 | scanf("%d",&t); 7 | while(t--) 8 | { 9 | scanf("%d",&n); 10 | cnt=ans=0; 11 | for(i=0;i1) cnt++; 15 | ans^=x; 16 | } 17 | if(cnt==1) printf("John\n"); 18 | else if(cnt==0) 19 | { 20 | if(n%2) printf("Brother\n"); 21 | else printf("John\n"); 22 | } 23 | else 24 | { 25 | if(ans==0) printf("Brother\n"); 26 | else printf("John\n"); 27 | } 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /poj/3486/POJ_3486_3059269_AC_125MS_4112K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define maxn 1000+10 3 | int a[maxn][maxn]; 4 | int ans[maxn]; 5 | int main() 6 | { 7 | int c,n,i,j,k; 8 | while(scanf("%d",&c)!=EOF) 9 | { 10 | scanf("%d",&n); 11 | for(i=1;i<=n;i++) 12 | { 13 | for(j=i;j<=n;j++) scanf("%d",&a[i][j]); 14 | } 15 | for(i=1;i<=n;i++) ans[i]=1000000; 16 | for(i=1;i<=n;i++) 17 | { 18 | for(j=i;j<=n;j++) 19 | { 20 | if(ans[j]>ans[i-1]+c+a[i][j]) ans[j]=ans[i-1]+c+a[i][j]; 21 | } 22 | } 23 | printf("%d\n",ans[n]); 24 | } 25 | return 0; 26 | } -------------------------------------------------------------------------------- /poj/3489/POJ_3489_3068692_AC_15MS_148K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int gcd(int n,int m) 3 | { 4 | int r=n%m; 5 | while(r) 6 | { 7 | n=m; 8 | m=r; 9 | r=n%m; 10 | } 11 | return m; 12 | } 13 | int main() 14 | { 15 | int n,x,k,i,m; 16 | int ans; 17 | while(scanf("%d%d%d",&n,&x,&k)!=EOF) 18 | { 19 | if(n==0) printf("No\n"); 20 | else 21 | { 22 | scanf("%d",&ans); 23 | for(i=1;i 2 | int gcd(int n,int m) 3 | { 4 | int r=n%m; 5 | while(r) 6 | { 7 | n=m; 8 | m=r; 9 | r=n%m; 10 | } 11 | return m; 12 | } 13 | int main() 14 | { 15 | int n,x,k,i,m; 16 | int ans; 17 | while(scanf("%d%d%d",&n,&x,&k)!=EOF) 18 | { 19 | if(n==0) printf("No\n"); 20 | else 21 | { 22 | scanf("%d",&ans); 23 | for(i=1;i 2 | int main() 3 | { 4 | int a[20][20]; 5 | __int64 ans; 6 | int n,m,i,j; 7 | while(scanf("%d%d",&n,&m)!=EOF) 8 | { 9 | ans=0; 10 | for(i=0;i0) ans+=a[i][j]*a[i][j-1]; 16 | if(i&&a[i-1][j]*a[i][j]>0) ans+=a[i][j]*a[i-1][j]; 17 | } 18 | } 19 | printf("%I64d\n",ans); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /poj/3507/POJ_3507_3105655_AC_15MS_220K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int a[10]; 7 | int i,j,k; 8 | while(1) 9 | { 10 | k=0; 11 | for(i=0;i<6;i++) 12 | { 13 | scanf("%d",&a[i]); 14 | k+=a[i]; 15 | } 16 | sort(a,a+6); 17 | if(a[5]) 18 | { 19 | k-=a[0]+a[5]; 20 | if(k%4==3) printf("%d.75\n",k/4); 21 | else if(k%4==2) printf("%d.5\n",k/4); 22 | else if(k%4==1) printf("%d.25\n",k/4); 23 | else printf("%d\n",k/4); 24 | } 25 | else break; 26 | } 27 | return 0; 28 | } -------------------------------------------------------------------------------- /poj/3517/POJ_3517_3161875_AC_16MS_312K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,m,k; 5 | int s,i; 6 | while(scanf("%d%d%d",&n,&m,&k)&&(n+m+k)) 7 | { 8 | s=0; 9 | for(i=2;i<=n;i++) 10 | { 11 | s=(s+m)%i; 12 | } 13 | s++; 14 | m%=n; 15 | if(m==0) m=n; 16 | s=s+(k-m); 17 | s=(s%n+n)%n; 18 | if(!s) s=n; 19 | printf("%d\n",s); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /poj/3517/POJ_3517_3161880_AC_16MS_188K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,m,k; 5 | int s,i; 6 | while(scanf("%d%d%d",&n,&m,&k)&&(n+m+k)) 7 | { 8 | for(s=0,i=2;i<=n;i++) s=(s+m)%i; 9 | s++; 10 | m%=n; 11 | if(m==0) m=n; 12 | s=s+(k-m); 13 | s=(s%n+n)%n; 14 | if(!s) s=n; 15 | printf("%d\n",s); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /poj/3536/POJ_3536_3213859_AC_63MS_180K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int ans; 5 | int i,j,k,a,b,c; 6 | int ans1,ans2,ans3; 7 | int n; 8 | while(scanf("%d",&n)!=EOF) 9 | { 10 | ans=2*n+2+2*n; 11 | ans1=n; 12 | ans2=ans3=1; 13 | for(i=1;i*i*i<=n;i++) 14 | { 15 | if(n%i==0) 16 | { 17 | a=i; 18 | for(j=i;j*i*j<=n;j++) 19 | { 20 | b=i*j; 21 | if(n%b==0) 22 | { 23 | c=n/b; 24 | b=j; 25 | k=2*a*b+2*a*c+2*b*c; 26 | if(k 2 | int main() 3 | { 4 | int a,b,n; 5 | int tp1,tp2,tp; 6 | while(scanf("%d%d",&a,&b)!=EOF) 7 | { 8 | if(a==0&&b==0) 9 | { 10 | printf("Impossible\n"); 11 | continue; 12 | } 13 | for(n=1;;n++) 14 | { 15 | if(n%2==0) 16 | { 17 | tp=n/2; 18 | tp*=n; 19 | if(tp>a||tp>b) break; 20 | } 21 | else 22 | { 23 | tp1=(n/2+1)*(n/2+1)+(n/2)*(n/2); 24 | tp2=(n/2+1)*(n/2)*2; 25 | if((tp1<=a&&tp2<=b)||(tp1<=b&&tp2<=a)) continue; 26 | else break; 27 | } 28 | } 29 | printf("%d\n",n-1); 30 | } 31 | return 0; 32 | } -------------------------------------------------------------------------------- /poj/3552/POJ_3552_3246515_AC_32MS_372K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int n, m; 5 | void solve() 6 | { 7 | int i, j, k; 8 | scanf( "%d %d" , &n , &m ); 9 | k = n/m; 10 | for( i = 1;i <= k;i++ ) 11 | for( j = 1;j <= m;j++ ) printf("%d " , j ); 12 | n = n%m; 13 | for( i = 0;i < n;i++ ) 14 | printf("%d " , (i*m)/n + 1 ); 15 | printf("\n"); 16 | } 17 | int main() 18 | { 19 | solve(); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /poj/3557/POJ_3557_3229194_AC_47MS_200K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | double ans[21]; 4 | double c[21][21]={0.0}; 5 | int main() 6 | { 7 | int i,j; 8 | for(i=0;i<=20;i++) c[i][i]=1.0,c[i][0]=1.0; 9 | for(i=0;i<=20;i++) 10 | { 11 | for(j=0;j 2 | #include 3 | double ans[21]; 4 | double c[21][21]={0.0}; 5 | int main() 6 | { 7 | int i,j; 8 | for(i=0;i<=20;i++) c[i][i]=1.0,c[i][0]=1.0; 9 | for(i=0;i<=20;i++) 10 | { 11 | for(j=0;j 2 | 3 | int main () { 4 | int n, i, j, k; 5 | char a[2][5]; 6 | scanf ("%d", &n); 7 | for ( i=0; i 2 | unsigned __int64 a[50010],b[50010]; 3 | int main() 4 | { 5 | int n,i,j; 6 | a[2]=1; 7 | b[2]=0; 8 | for(i=3;i<=5000;i++) 9 | { 10 | a[i]=b[i]=0; 11 | for(j=2;j 2 | 3 | int a[128], b[128], k[128]; 4 | int main () { 5 | int n, m, i; 6 | while (scanf ("%d%d", &n, &m)!=EOF) 7 | { 8 | for ( i=0; i 2 | #define maxn 5000010 3 | int a[maxn]={0}; 4 | __int64 ans[maxn]; 5 | __int64 c[32]; 6 | int main() 7 | { 8 | int n,i,j,k; 9 | for(i=2;i 2 | #define maxn 5000010 3 | int a[maxn]={0}; 4 | int ans[maxn]; 5 | int c[32]; 6 | int main() 7 | { 8 | int n,i,j,k; 9 | for(i=2;i 2 | 3 | char S[2010],ln=0; 4 | 5 | void prnt(char a) { 6 | if(ln==80) {printf("\n");ln=0;} 7 | printf("%c",a);ln++; 8 | } 9 | 10 | int main() { 11 | int i,j,N,pi,pj,val; 12 | scanf("%d",&N); 13 | for(i=0;iS[j]) {prnt(S[j]);j--;} 18 | else { 19 | pi=i+1;pj=j-1;val=S[i]; 20 | while( pj-pi>1 && S[pi]==S[pj]) {pi++,pj--;} 21 | if(S[pi] 2 | #include 3 | using namespace std; 4 | //int abs(int x){return x>0?x:-x;}; 5 | bool cmp(const int &x,const int &y) 6 | { 7 | return abs(x)tm) break; 25 | } 26 | printf("%d\n",i); 27 | } 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /poj/3619/POJ_3619_3573077_AC_32MS_208K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int ans, n, r, s, t; 4 | 5 | int main() { 6 | int ct; 7 | scanf ("%d%d", &n, &ct); 8 | while (ct--) { 9 | scanf ("%d%d%d", &r, &s, &t); 10 | ans = (s+t)*(n/(r*s)); 11 | if( n%(r*s)==0 && n!=0) ans -= t; 12 | ans += ((n%(r*s))+r-1)/r; 13 | printf("%d\n",ans); 14 | } 15 | return 0; 16 | } 17 | 18 | 19 | -------------------------------------------------------------------------------- /poj/3623/POJ_3623_3623049_AC_2219MS_320K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | char S[30010],ln=0; 4 | 5 | void prnt(char a) { 6 | if(ln==80) {printf("\n");ln=0;} 7 | printf("%c",a);ln++; 8 | } 9 | 10 | int main() { 11 | int i,j,N,pi,pj,val; 12 | //freopen("bcl.in" ,"r",stdin ); 13 | //freopen("bcl.out","w",stdout); 14 | while(scanf("%d",&N)!=EOF){ 15 | for(i=0;iS[j]) {prnt(S[j]);j--;} 20 | else { 21 | pi=i+1;pj=j-1;val=S[i]; 22 | while( pj-pi>1 && S[pi]==S[pj]) {pi++,pj--;} 23 | if(S[pi] 2 | #include 3 | 4 | int bes[12880], n, m, a, b, i, j; 5 | 6 | int main () { 7 | scanf ("%d%d", &n, &m); 8 | memset (bes, 0, sizeof (bes)); 9 | for (i=0; i=a; j--) 12 | bes[j]>?=bes[j-a]+b; 13 | } 14 | printf ("%d\n", bes[m]); 15 | return 0; 16 | } 17 | 18 | -------------------------------------------------------------------------------- /poj/3627/POJ_3627_3622613_AC_63MS_372K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int a[1000000]; 5 | int main() 6 | { 7 | int n,b,i; 8 | while(scanf("%d%d",&n,&b)!=EOF) 9 | { 10 | for(i=0;i=0&&b>0;i--) b-=a[i]; 13 | printf("%d\n",n-i-1); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /poj/3628/POJ_3628_3622639_AC_172MS_288K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,a[21],b,sum; 5 | int ans,i,j,t; 6 | while(scanf("%d%d",&n,&b)!=EOF) 7 | { 8 | ans=n; 9 | for(i=0;i=b&&sum<=ans) ans=sum; 23 | } 24 | printf("%d\n",ans-b); 25 | } 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /poj/3632/POJ_3632_3614976_AC_0MS_180K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int t,i,j,n,min,ans,tp; 8 | int a[100]; 9 | scanf("%d",&t); 10 | while(t--) 11 | { 12 | scanf("%d",&n); 13 | for(i=0;i 2 | #include 3 | using namespace std; 4 | int a[200010]; 5 | bool cmp(const int &x,const int &y) 6 | { 7 | return x>y; 8 | } 9 | int main() 10 | { 11 | int t,n,i,j,k; 12 | __int64 sum; 13 | scanf("%d",&t); 14 | while(t--) 15 | { 16 | scanf("%d",&n); 17 | for(i=0;i 2 | int p; 3 | int f(int n,int m) 4 | { 5 | __int64 mod; 6 | if(m==0) return 1; 7 | else if(m==1) return n; 8 | else 9 | { 10 | mod=f(n,m/2); 11 | mod*=mod; 12 | mod%=p; 13 | if(m%2==1) mod*=n; 14 | return mod%p; 15 | } 16 | } 17 | int main() 18 | { 19 | int n,i; 20 | while(scanf("%d%d",&p,&n)&&(n+p)) 21 | { 22 | for(i=2;i*i<=p;i++) 23 | { 24 | if(p%i==0) break; 25 | } 26 | if(i*i>p) printf("no\n"); 27 | else{ 28 | if(f(n,p)==n) printf("yes\n"); 29 | else printf("no\n");} 30 | } 31 | return 0; 32 | } 33 | -------------------------------------------------------------------------------- /poj/3645/POJ_3645_3644037_AC_0MS_196K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | double Parse() { 5 | double x, a, b; 6 | if ( scanf("%lf", &x) ) { 7 | return x; 8 | } else { 9 | scanf ("("); 10 | if ( scanf ("%lf", &x)==0 ) return 1000000000; 11 | a = Parse(); 12 | b = Parse(); 13 | scanf (")"); 14 | return x*(a+b) + (1-x)*(a-b); 15 | } 16 | } 17 | 18 | int main () { 19 | while (true) { 20 | double ans = Parse(); 21 | if (ans==1000000000) break; 22 | printf ("%.2lf\n", ans); 23 | } 24 | return 0; 25 | } 26 | 27 | -------------------------------------------------------------------------------- /poj/3652/POJ_3652_3679341_AC_32MS_180K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int cnt[20][2]; 3 | int main() 4 | { 5 | int a,b,c,s; 6 | int i,j; 7 | while(scanf("%d",&a)&&a) 8 | { 9 | scanf("%d%d%d",&b,&c,&s); 10 | for(i=0;i<16;i++) cnt[i][0]=cnt[i][1]=0; 11 | for(i=0;i<=c;i++) 12 | { 13 | for(j=0;j<16;j++) 14 | { 15 | if(s&(1<=0;i--) 21 | { 22 | if(cnt[i][1]==0) printf("0"); 23 | else if(cnt[i][0]==0) printf("1"); 24 | else printf("?"); 25 | } 26 | printf("\n"); 27 | } 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /poj/3656/POJ_3656_3671523_AC_0MS_176K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | char s[1000]; 4 | int main() 5 | { 6 | int cnt,len,id,ix; 7 | int i,j; 8 | int m; 9 | while(gets(s)) 10 | { 11 | if(strcmp(s,"END")==0) break; 12 | cnt=-1; 13 | m=strlen(s); 14 | for(i=0;i=m) x-=j; 22 | if(time>cnt||(time==cnt&&x>len)||(time==cnt&&x==len&&i>id) 23 | ||(time==cnt&&x==len&&id>id&&ix 2 | #include 3 | using namespace std; 4 | struct node 5 | { 6 | int x,y; 7 | int id; 8 | }; 9 | 10 | bool cmp(const node &x,const node &y) 11 | { 12 | if(x.x==y.x) return x.y>y.y; 13 | else return x.x>y.x; 14 | } 15 | node a[100000]; 16 | int main() 17 | { 18 | int n; 19 | int i,j,m; 20 | while(scanf("%d%d",&n,&m)!=EOF) 21 | { 22 | for(i=0;ia[j].y) j=i; 31 | } 32 | printf("%d\n",a[j].id+1); 33 | } 34 | return 0; 35 | } 36 | 37 | -------------------------------------------------------------------------------- /poj/3665/POJ_3665_3707234_AC_47MS_188K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define maxn 10010 3 | int a[maxn]; 4 | int main() 5 | { 6 | int n,t,i,j; 7 | int min; 8 | while(scanf("%d%d",&n,&t)!=EOF) 9 | { 10 | for(i=0;i 2 | int main() 3 | { 4 | int m,t,u,f,d; 5 | int i; 6 | char s[10]; 7 | int j; 8 | scanf("%d%d%d%d%d",&m,&t,&u,&f,&d); 9 | // while(!=EOF) 10 | { 11 | for(i=0;i 2 | int a[20],b[20]; 3 | int ans; 4 | int main() 5 | { 6 | int n,m; 7 | int i,j; 8 | while(scanf("%d%d",&n,&m)!=EOF) 9 | { 10 | for(i=0;i<20;i++) a[i]=b[i]=0; 11 | for(i=0;n;i++) 12 | { 13 | a[i]=n%10; 14 | n/=10; 15 | } 16 | n=m; 17 | for(i=0;n;i++) 18 | { 19 | b[i]=n%10; 20 | n/=10; 21 | } 22 | ans=0; 23 | for(i=0;i<20;i++) 24 | { 25 | for(j=0;j<20;j++) ans+=a[i]*b[j]; 26 | } 27 | printf("%d\n",ans); 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /poj/3688/POJ_3688_4005098_AC_2297MS_504K.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #define maxn 100000+10 3 | bool flag[maxn][2]; 4 | int main() 5 | { 6 | int n,i,m; 7 | while(scanf("%d%d",&n,&m)&&(n+m)) 8 | { 9 | for(i=0;i<=m;i++) flag[i][0]=flag[i][1]=0; 10 | flag[0][0]=1; 11 | for(i=0;i=j;k--) 16 | { 17 | if(flag[k-j][0]) flag[k][1]=1; 18 | if(flag[k-j][1]) flag[k][0]=1; 19 | } 20 | } 21 | int ans=0; 22 | for(i=1;i<=m;i++) 23 | { 24 | if(flag[i][0]^flag[i][1]==1&&flag[i][1]==1) 25 | { 26 | ans++; 27 | // printf("%d\n",i); 28 | } 29 | } 30 | printf("%d\n",ans); 31 | } 32 | return 0; 33 | } -------------------------------------------------------------------------------- /poj/3716/POJ_3716_4668969_AC_0MS_248K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | using namespace std; 12 | int main() 13 | { 14 | int a,b; 15 | int t; 16 | scanf("%d",&t); 17 | while(t--&&scanf("%d%d",&a,&b)!=EOF) 18 | { 19 | printf("%.3lf\n",(a+b+10.0)/7.0); 20 | } 21 | system("pause"); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /poj/3737/POJ_3737_5373589_AC_0MS_164K.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | double pi=acos(-1.0); 4 | 5 | int main() 6 | { 7 | double s; 8 | double h,r; 9 | while(scanf("%lf",&s)!=EOF) 10 | { 11 | double v=s*s/6.0/sqrt(2*s*pi); 12 | h=sqrt(2*s/pi); 13 | r=sqrt(3*v/pi/h); 14 | printf("%.2lf\n%.2lf\n%.2lf\n",v,h,r); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /poj/README.md: -------------------------------------------------------------------------------- 1 | # Information 2 | 1. This folder contains the solutions of more than 800 problems in [POJ](http://poj.org) 3 | -------------------------------------------------------------------------------- /topcoder/plugin/CodeProcessor.jar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wangyongliang/nova/86b00b1a12f1cc6291635f31a33e791f6fb19d1a/topcoder/plugin/CodeProcessor.jar -------------------------------------------------------------------------------- /topcoder/plugin/ExampleBuilder.jar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wangyongliang/nova/86b00b1a12f1cc6291635f31a33e791f6fb19d1a/topcoder/plugin/ExampleBuilder.jar -------------------------------------------------------------------------------- /topcoder/plugin/FileEdit.jar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wangyongliang/nova/86b00b1a12f1cc6291635f31a33e791f6fb19d1a/topcoder/plugin/FileEdit.jar -------------------------------------------------------------------------------- /topcoder/srm/566/PenguinSledding.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wangyongliang/nova/86b00b1a12f1cc6291635f31a33e791f6fb19d1a/topcoder/srm/566/PenguinSledding.class -------------------------------------------------------------------------------- /util/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wangyongliang/nova/86b00b1a12f1cc6291635f31a33e791f6fb19d1a/util/README.md --------------------------------------------------------------------------------