求大佬帮助:71-1000 奇怪数的完整代码

「已注销」 2019-09-30 10:17:19
奇怪数 1.一个整数,除了自身以外所有因子之和大于这个数本身。 2.除了自身以外所有因子集合的子集,(没有)任何一个子集中元素和(等于)这个数本身。 例如72,首先,因子集[1,2,3,4,6,8,9,12,18,24,36]的和为123>72(第一条件),但是存在因子的一个子集[1,2,3,4,8,12,18,24]的和为72仍然等于72(不满足第二条件),这就说明不是奇怪数。 然后打印出71-1000的所有奇怪数。
...全文
631 12 打赏 收藏 转发到动态 举报
写回复
用AI写文章
12 条回复
切换为时间正序
请发表友善的回复…
发表回复
chuifengde 2019-09-30
  • 打赏
  • 举报
回复
1000以内没有这样的数
Risk_Y 2019-09-30
  • 打赏
  • 举报
回复
这个应该可以了
Risk_Y 2019-09-30
  • 打赏
  • 举报
回复
import math lis1 = {} for n in range(71, 1001): lis = [] for i in range(1, int(math.sqrt(n)) + 1): if n % i == 0: lis.append(i) if i != 1: lis.append(n // i) if sum(lis) > n: lis.sort(reverse=True) dic = {n: lis} lis1.update(dic) for index in lis1: sumns = 0 sumn = 0 lis2 = [] # 声明一个空列表保存相加等于原数的因子 for ind in lis1[index]: if sumn < index: sumns = sumn sumn = sumn + ind lis2.append(ind) # 将因子插入列表 elif sumn > index: sumn = sumns sumn = sumn + ind lis2.pop() # 将上一个因子删除 lis2.append(ind) # 将因子插入列表 else: print(index) print("因子子集和相等的元素:{}" .format(lis2)) break
Man呦 2019-09-30
  • 打赏
  • 举报
回复
引用 7 楼 js1573_q的回复:
[quote=引用 3 楼 Man呦的回复:]那把上面的取个反就行了 [71, 73, 74, 75, 76, 77, 79, 81, 82, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97, 98, 99, 101, 103, 105, 106, 107, 109, 110, 111, 113, 115, 116, 117, 118, 119, 121, 122, 123, 124, 125, 127, 128, 129, 130, 131, 133, 134, 135, 136, 137, 139, 141, 142, 143, 145, 146, 147, 148, 149, 151, 152, 153, 154, 155, 157, 158, 159, 161, 163, 164, 165, 166, 167, 169, 170, 171, 172, 173, 175, 177, 178, 179, 181, 182, 183, 184, 185, 187, 188, 189, 190, 191, 193, 194, 195, 197, 199, 201, 202, 203, 205, 206, 207, 209, 211, 212, 213, 214, 215, 217, 218, 219, 221, 223, 225, 226, 227, 229, 230, 231, 232, 233, 235, 236, 237, 238, 239, 241, 242, 243, 244, 245, 247, 248, 249, 250, 251, 253, 254, 255, 256, 257, 259, 261, 262, 263, 265, 266, 267, 268, 269, 271, 273, 274, 275, 277, 278, 279, 281, 283, 284, 285, 286, 287, 289, 290, 291, 292, 293, 295, 296, 297, 298, 299, 301, 302, 303, 305, 307, 309, 310, 311, 313, 314, 315, 316, 317, 319, 321, 322, 323, 325, 326, 327, 328, 329, 331, 332, 333, 334, 335, 337, 338, 339, 341, 343, 344, 345, 346, 347, 349, 351, 353, 355, 356, 357, 358, 359, 361, 362, 363, 365, 367, 369, 370, 371, 373, 374, 375, 376, 377, 379, 381, 382, 383, 385, 386, 387, 388, 389, 391, 393, 394, 395, 397, 398, 399, 401, 403, 404, 405, 406, 407, 409, 410, 411, 412, 413, 415, 417, 418, 419, 421, 422, 423, 424, 425, 427, 428, 429, 430, 431, 433, 434, 435, 436, 437, 439, 441, 442, 443, 445, 446, 447, 449, 451, 452, 453, 454, 455, 457, 458, 459, 461, 463, 465, 466, 467, 469, 470, 471, 472, 473, 475, 477, 478, 479, 481, 482, 483, 484, 485, 487, 488, 489, 491, 493, 494, 495, 497, 499, 501, 502, 503, 505, 506, 507, 508, 509, 511, 512, 513, 514, 515, 517, 518, 519, 521, 523, 524, 525, 526, 527, 529, 530, 531, 533, 535, 536, 537, 538, 539, 541, 542, 543, 545, 547, 548, 549, 551, 553, 554, 555, 556, 557, 559, 561, 562, 563, 565, 566, 567, 568, 569, 571, 573, 574, 575, 577, 578, 579, 581, 583, 584, 585, 586, 587, 589, 590, 591, 592, 593, 595, 596, 597, 598, 599, 601, 602, 603, 604, 605, 607, 609, 610, 611, 613, 614, 615, 617, 619, 621, 622, 623, 625, 626, 627, 628, 629, 631, 632, 633, 634, 635, 637, 638, 639, 641, 643, 645, 646, 647, 649, 651, 652, 653, 655, 656, 657, 658, 659, 661, 662, 663, 664, 665, 667, 668, 669, 670, 671, 673, 674, 675, 676, 677, 679, 681, 682, 683, 685, 686, 687, 688, 689, 691, 692, 693, 694, 695, 697, 698, 699, 701, 703, 705, 706, 707, 709, 710, 711, 712, 713, 715, 716, 717, 718, 719, 721, 722, 723, 724, 725, 727, 729, 730, 731, 733, 734, 735, 737, 739, 741, 742, 743, 745, 746, 747, 749, 751, 752, 753, 754, 755, 757, 758, 759, 761, 763, 764, 765, 766, 767, 769, 771, 772, 773, 775, 776, 777, 778, 779, 781, 782, 783, 785, 787, 788, 789, 790, 791, 793, 794, 795, 796, 797, 799, 801, 802, 803, 805, 806, 807, 808, 809, 811, 813, 814, 815, 817, 818, 819, 821, 823, 824, 825, 826, 827, 829, 830, 831, 833, 835, 836, 837, 838, 839, 841, 842, 843, 844, 845, 847, 848, 849, 850, 851, 853, 854, 855, 856, 857, 859, 861, 862, 863, 865, 866, 867, 869, 871, 872, 873, 874, 875, 877, 878, 879, 881, 883, 884, 885, 886, 887, 889, 890, 891, 892, 893, 895, 897, 898, 899, 901, 902, 903, 904, 905, 907, 908, 909, 911, 913, 914, 915, 916, 917, 919, 921, 922, 923, 925, 926, 927, 929, 931, 932, 933, 934, 935, 937, 938, 939, 941, 943, 944, 946, 947, 949, 950, 951, 953, 955, 956, 957, 958, 959, 961, 962, 963, 964, 965, 967, 969, 970, 971, 973, 974, 975, 976, 977, 979, 981, 982, 983, 985, 986, 987, 988, 989, 991, 993, 994, 995, 997, 998, 999] num_list = [] def get_composite(alist, num): reli = [] for i in range(0, len(alist)): if 0 == i: reli.append([alist[i]]) else: addli = [] addli.append([alist[i]]) if sum([alist[i]]) == num: num_list.append(num) return for ii in reli: addli.append(ii + [alist[i]]) if sum(ii + [alist[i]]) == num: num_list.append(num) return reli += addli for i in range(71, 1001): demo_list = [] for j in range(1, i): k = i // j if i % j ==0: if k not in demo_list: demo_list.append(k) if j not in demo_list: demo_list.append(j) demo_list = demo_list[1:] if sum(demo_list) > j: get_composite(demo_list, i) sum_list = [i for i in range(71, 1001)] response = list(set(num_list) ^ set(sum_list)) print(response)
谢谢,不过这个好像更不对了,你这求的应该是亏数。奇怪数,是在71-1000中盈数的基础上再找满足第二个条件的数。[/quote] 差集取错了,你把num_list与demo_list取个差集就行,Demo_list是满足条件一的,num_list是在条件一的基础上不满足条件二的,一取就是。
「已注销」 2019-09-30
  • 打赏
  • 举报
回复
引用 6 楼 Risk_Y的回复:
后面现在没时间写,描述有些复杂 等我有时间给你答案
嗯嗯,十分感谢你的帮助。
「已注销」 2019-09-30
  • 打赏
  • 举报
回复
引用 3 楼 Man呦的回复:
那把上面的取个反就行了 [71, 73, 74, 75, 76, 77, 79, 81, 82, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97, 98, 99, 101, 103, 105, 106, 107, 109, 110, 111, 113, 115, 116, 117, 118, 119, 121, 122, 123, 124, 125, 127, 128, 129, 130, 131, 133, 134, 135, 136, 137, 139, 141, 142, 143, 145, 146, 147, 148, 149, 151, 152, 153, 154, 155, 157, 158, 159, 161, 163, 164, 165, 166, 167, 169, 170, 171, 172, 173, 175, 177, 178, 179, 181, 182, 183, 184, 185, 187, 188, 189, 190, 191, 193, 194, 195, 197, 199, 201, 202, 203, 205, 206, 207, 209, 211, 212, 213, 214, 215, 217, 218, 219, 221, 223, 225, 226, 227, 229, 230, 231, 232, 233, 235, 236, 237, 238, 239, 241, 242, 243, 244, 245, 247, 248, 249, 250, 251, 253, 254, 255, 256, 257, 259, 261, 262, 263, 265, 266, 267, 268, 269, 271, 273, 274, 275, 277, 278, 279, 281, 283, 284, 285, 286, 287, 289, 290, 291, 292, 293, 295, 296, 297, 298, 299, 301, 302, 303, 305, 307, 309, 310, 311, 313, 314, 315, 316, 317, 319, 321, 322, 323, 325, 326, 327, 328, 329, 331, 332, 333, 334, 335, 337, 338, 339, 341, 343, 344, 345, 346, 347, 349, 351, 353, 355, 356, 357, 358, 359, 361, 362, 363, 365, 367, 369, 370, 371, 373, 374, 375, 376, 377, 379, 381, 382, 383, 385, 386, 387, 388, 389, 391, 393, 394, 395, 397, 398, 399, 401, 403, 404, 405, 406, 407, 409, 410, 411, 412, 413, 415, 417, 418, 419, 421, 422, 423, 424, 425, 427, 428, 429, 430, 431, 433, 434, 435, 436, 437, 439, 441, 442, 443, 445, 446, 447, 449, 451, 452, 453, 454, 455, 457, 458, 459, 461, 463, 465, 466, 467, 469, 470, 471, 472, 473, 475, 477, 478, 479, 481, 482, 483, 484, 485, 487, 488, 489, 491, 493, 494, 495, 497, 499, 501, 502, 503, 505, 506, 507, 508, 509, 511, 512, 513, 514, 515, 517, 518, 519, 521, 523, 524, 525, 526, 527, 529, 530, 531, 533, 535, 536, 537, 538, 539, 541, 542, 543, 545, 547, 548, 549, 551, 553, 554, 555, 556, 557, 559, 561, 562, 563, 565, 566, 567, 568, 569, 571, 573, 574, 575, 577, 578, 579, 581, 583, 584, 585, 586, 587, 589, 590, 591, 592, 593, 595, 596, 597, 598, 599, 601, 602, 603, 604, 605, 607, 609, 610, 611, 613, 614, 615, 617, 619, 621, 622, 623, 625, 626, 627, 628, 629, 631, 632, 633, 634, 635, 637, 638, 639, 641, 643, 645, 646, 647, 649, 651, 652, 653, 655, 656, 657, 658, 659, 661, 662, 663, 664, 665, 667, 668, 669, 670, 671, 673, 674, 675, 676, 677, 679, 681, 682, 683, 685, 686, 687, 688, 689, 691, 692, 693, 694, 695, 697, 698, 699, 701, 703, 705, 706, 707, 709, 710, 711, 712, 713, 715, 716, 717, 718, 719, 721, 722, 723, 724, 725, 727, 729, 730, 731, 733, 734, 735, 737, 739, 741, 742, 743, 745, 746, 747, 749, 751, 752, 753, 754, 755, 757, 758, 759, 761, 763, 764, 765, 766, 767, 769, 771, 772, 773, 775, 776, 777, 778, 779, 781, 782, 783, 785, 787, 788, 789, 790, 791, 793, 794, 795, 796, 797, 799, 801, 802, 803, 805, 806, 807, 808, 809, 811, 813, 814, 815, 817, 818, 819, 821, 823, 824, 825, 826, 827, 829, 830, 831, 833, 835, 836, 837, 838, 839, 841, 842, 843, 844, 845, 847, 848, 849, 850, 851, 853, 854, 855, 856, 857, 859, 861, 862, 863, 865, 866, 867, 869, 871, 872, 873, 874, 875, 877, 878, 879, 881, 883, 884, 885, 886, 887, 889, 890, 891, 892, 893, 895, 897, 898, 899, 901, 902, 903, 904, 905, 907, 908, 909, 911, 913, 914, 915, 916, 917, 919, 921, 922, 923, 925, 926, 927, 929, 931, 932, 933, 934, 935, 937, 938, 939, 941, 943, 944, 946, 947, 949, 950, 951, 953, 955, 956, 957, 958, 959, 961, 962, 963, 964, 965, 967, 969, 970, 971, 973, 974, 975, 976, 977, 979, 981, 982, 983, 985, 986, 987, 988, 989, 991, 993, 994, 995, 997, 998, 999] num_list = [] def get_composite(alist, num): reli = [] for i in range(0, len(alist)): if 0 == i: reli.append([alist[i]]) else: addli = [] addli.append([alist[i]]) if sum([alist[i]]) == num: num_list.append(num) return for ii in reli: addli.append(ii + [alist[i]]) if sum(ii + [alist[i]]) == num: num_list.append(num) return reli += addli for i in range(71, 1001): demo_list = [] for j in range(1, i): k = i // j if i % j ==0: if k not in demo_list: demo_list.append(k) if j not in demo_list: demo_list.append(j) demo_list = demo_list[1:] if sum(demo_list) > j: get_composite(demo_list, i) sum_list = [i for i in range(71, 1001)] response = list(set(num_list) ^ set(sum_list)) print(response)
谢谢,不过这个好像更不对了,你这求的应该是亏数。奇怪数,是在71-1000中盈数的基础上再找满足第二个条件的数。
Risk_Y 2019-09-30
  • 打赏
  • 举报
回复
后面现在没时间写,描述有些复杂 等我有时间给你答案
「已注销」 2019-09-30
  • 打赏
  • 举报
回复
引用 4 楼 Risk_Y的回复:
import math for n in range(71, 1001): lis = [] for i in range(1, int(math.sqrt(n)) + 1): if n % i == 0: lis.append(i) if i != 1: lis.append(n // i) if sum(lis) > n: print(n, end=" ") 结果: 72 78 80 84 88 90 96 100 102 104 108 112 114 120 126 132 138 140 144 150 156 160 162 168 174 176 180 186 192 196 198 200 204 208 210 216 220 222 224 228 234 240 246 252 256 258 260 264 270 272 276 280 282 288 294 300 304 306 308 312 318 320 324 330 336 340 342 348 350 352 354 360 364 366 368 372 378 380 384 390 392 396 400 402 408 414 416 420 426 432 438 440 444 448 450 456 460 462 464 468 474 476 480 486 490 492 498 500 504 510 516 520 522 528 532 534 540 544 546 550 552 558 560 564 570 572 576 580 582 588 594 600 606 608 612 616 618 620 624 630 636 640 642 644 648 650 654 660 666 672 678 680 684 690 696 700 702 704 708 714 720 726 728 732 736 738 740 744 748 750 756 760 762 768 770 774 780 784 786 792 798 800 804 810 812 816 820 822 828 832 834 836 840 846 852 858 860 864 868 870 876 880 882 888 894 896 900 906 910 912 918 920 924 928 930 936 940 942 945 948 952 954 960 966 968 972 978 980 984 990 992 996 1000
你这个求的只是盈数,也只是我的第一条件。奇怪数是在这些数的基础上找出那个满足第二条件的数。这一步我已经解决了。
Risk_Y 2019-09-30
  • 打赏
  • 举报
回复
import math for n in range(71, 1001): lis = [] for i in range(1, int(math.sqrt(n)) + 1): if n % i == 0: lis.append(i) if i != 1: lis.append(n // i) if sum(lis) > n: print(n, end=" ") 结果: 72 78 80 84 88 90 96 100 102 104 108 112 114 120 126 132 138 140 144 150 156 160 162 168 174 176 180 186 192 196 198 200 204 208 210 216 220 222 224 228 234 240 246 252 256 258 260 264 270 272 276 280 282 288 294 300 304 306 308 312 318 320 324 330 336 340 342 348 350 352 354 360 364 366 368 372 378 380 384 390 392 396 400 402 408 414 416 420 426 432 438 440 444 448 450 456 460 462 464 468 474 476 480 486 490 492 498 500 504 510 516 520 522 528 532 534 540 544 546 550 552 558 560 564 570 572 576 580 582 588 594 600 606 608 612 616 618 620 624 630 636 640 642 644 648 650 654 660 666 672 678 680 684 690 696 700 702 704 708 714 720 726 728 732 736 738 740 744 748 750 756 760 762 768 770 774 780 784 786 792 798 800 804 810 812 816 820 822 828 832 834 836 840 846 852 858 860 864 868 870 876 880 882 888 894 896 900 906 910 912 918 920 924 928 930 936 940 942 945 948 952 954 960 966 968 972 978 980 984 990 992 996 1000
Man呦 2019-09-30
  • 打赏
  • 举报
回复
那把上面的取个反就行了 [71, 73, 74, 75, 76, 77, 79, 81, 82, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97, 98, 99, 101, 103, 105, 106, 107, 109, 110, 111, 113, 115, 116, 117, 118, 119, 121, 122, 123, 124, 125, 127, 128, 129, 130, 131, 133, 134, 135, 136, 137, 139, 141, 142, 143, 145, 146, 147, 148, 149, 151, 152, 153, 154, 155, 157, 158, 159, 161, 163, 164, 165, 166, 167, 169, 170, 171, 172, 173, 175, 177, 178, 179, 181, 182, 183, 184, 185, 187, 188, 189, 190, 191, 193, 194, 195, 197, 199, 201, 202, 203, 205, 206, 207, 209, 211, 212, 213, 214, 215, 217, 218, 219, 221, 223, 225, 226, 227, 229, 230, 231, 232, 233, 235, 236, 237, 238, 239, 241, 242, 243, 244, 245, 247, 248, 249, 250, 251, 253, 254, 255, 256, 257, 259, 261, 262, 263, 265, 266, 267, 268, 269, 271, 273, 274, 275, 277, 278, 279, 281, 283, 284, 285, 286, 287, 289, 290, 291, 292, 293, 295, 296, 297, 298, 299, 301, 302, 303, 305, 307, 309, 310, 311, 313, 314, 315, 316, 317, 319, 321, 322, 323, 325, 326, 327, 328, 329, 331, 332, 333, 334, 335, 337, 338, 339, 341, 343, 344, 345, 346, 347, 349, 351, 353, 355, 356, 357, 358, 359, 361, 362, 363, 365, 367, 369, 370, 371, 373, 374, 375, 376, 377, 379, 381, 382, 383, 385, 386, 387, 388, 389, 391, 393, 394, 395, 397, 398, 399, 401, 403, 404, 405, 406, 407, 409, 410, 411, 412, 413, 415, 417, 418, 419, 421, 422, 423, 424, 425, 427, 428, 429, 430, 431, 433, 434, 435, 436, 437, 439, 441, 442, 443, 445, 446, 447, 449, 451, 452, 453, 454, 455, 457, 458, 459, 461, 463, 465, 466, 467, 469, 470, 471, 472, 473, 475, 477, 478, 479, 481, 482, 483, 484, 485, 487, 488, 489, 491, 493, 494, 495, 497, 499, 501, 502, 503, 505, 506, 507, 508, 509, 511, 512, 513, 514, 515, 517, 518, 519, 521, 523, 524, 525, 526, 527, 529, 530, 531, 533, 535, 536, 537, 538, 539, 541, 542, 543, 545, 547, 548, 549, 551, 553, 554, 555, 556, 557, 559, 561, 562, 563, 565, 566, 567, 568, 569, 571, 573, 574, 575, 577, 578, 579, 581, 583, 584, 585, 586, 587, 589, 590, 591, 592, 593, 595, 596, 597, 598, 599, 601, 602, 603, 604, 605, 607, 609, 610, 611, 613, 614, 615, 617, 619, 621, 622, 623, 625, 626, 627, 628, 629, 631, 632, 633, 634, 635, 637, 638, 639, 641, 643, 645, 646, 647, 649, 651, 652, 653, 655, 656, 657, 658, 659, 661, 662, 663, 664, 665, 667, 668, 669, 670, 671, 673, 674, 675, 676, 677, 679, 681, 682, 683, 685, 686, 687, 688, 689, 691, 692, 693, 694, 695, 697, 698, 699, 701, 703, 705, 706, 707, 709, 710, 711, 712, 713, 715, 716, 717, 718, 719, 721, 722, 723, 724, 725, 727, 729, 730, 731, 733, 734, 735, 737, 739, 741, 742, 743, 745, 746, 747, 749, 751, 752, 753, 754, 755, 757, 758, 759, 761, 763, 764, 765, 766, 767, 769, 771, 772, 773, 775, 776, 777, 778, 779, 781, 782, 783, 785, 787, 788, 789, 790, 791, 793, 794, 795, 796, 797, 799, 801, 802, 803, 805, 806, 807, 808, 809, 811, 813, 814, 815, 817, 818, 819, 821, 823, 824, 825, 826, 827, 829, 830, 831, 833, 835, 836, 837, 838, 839, 841, 842, 843, 844, 845, 847, 848, 849, 850, 851, 853, 854, 855, 856, 857, 859, 861, 862, 863, 865, 866, 867, 869, 871, 872, 873, 874, 875, 877, 878, 879, 881, 883, 884, 885, 886, 887, 889, 890, 891, 892, 893, 895, 897, 898, 899, 901, 902, 903, 904, 905, 907, 908, 909, 911, 913, 914, 915, 916, 917, 919, 921, 922, 923, 925, 926, 927, 929, 931, 932, 933, 934, 935, 937, 938, 939, 941, 943, 944, 946, 947, 949, 950, 951, 953, 955, 956, 957, 958, 959, 961, 962, 963, 964, 965, 967, 969, 970, 971, 973, 974, 975, 976, 977, 979, 981, 982, 983, 985, 986, 987, 988, 989, 991, 993, 994, 995, 997, 998, 999] num_list = [] def get_composite(alist, num): reli = [] for i in range(0, len(alist)): if 0 == i: reli.append([alist[i]]) else: addli = [] addli.append([alist[i]]) if sum([alist[i]]) == num: num_list.append(num) return for ii in reli: addli.append(ii + [alist[i]]) if sum(ii + [alist[i]]) == num: num_list.append(num) return reli += addli for i in range(71, 1001): demo_list = [] for j in range(1, i): k = i // j if i % j ==0: if k not in demo_list: demo_list.append(k) if j not in demo_list: demo_list.append(j) demo_list = demo_list[1:] if sum(demo_list) > j: get_composite(demo_list, i) sum_list = [i for i in range(71, 1001)] response = list(set(num_list) ^ set(sum_list)) print(response)
「已注销」 2019-09-30
  • 打赏
  • 举报
回复
引用 1 楼 Man呦的回复:
[72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120, 126, 132, 138, 140, 144, 150, 156, 160, 162, 168, 174, 176, 180, 186, 192, 196, 198, 200, 204, 208, 210, 216, 220, 222, 224, 228, 234, 240, 246, 252, 258, 260, 264, 270, 272, 276, 280, 282, 288, 294, 300, 304, 306, 308, 312, 318, 320, 324, 330, 336, 340, 342, 348, 350, 352, 354, 360, 364, 366, 368, 372, 378, 380, 384, 390, 392, 396, 400, 402, 408, 414, 416, 420, 426, 432, 438, 440, 444, 448, 450, 456, 460, 462, 464, 468, 474, 476, 480, 486, 490, 492, 496, 498, 500, 504, 510, 516, 520, 522, 528, 532, 534, 540, 544, 546, 550, 552, 558, 560, 564, 570, 572, 576, 580, 582, 588, 594, 600, 606, 608, 612, 616, 618, 620, 624, 630, 636, 640, 642, 644, 648, 650, 654, 660, 666, 672, 678, 680, 684, 690, 696, 700, 702, 704, 708, 714]
这个不是,上面的例子中已经写了72不是奇怪数。还有,我不只要答案,我要代码,我想知道怎么写。
Man呦 2019-09-30
  • 打赏
  • 举报
回复
[72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120, 126, 132, 138, 140, 144, 150, 156, 160, 162, 168, 174, 176, 180, 186, 192, 196, 198, 200, 204, 208, 210, 216, 220, 222, 224, 228, 234, 240, 246, 252, 258, 260, 264, 270, 272, 276, 280, 282, 288, 294, 300, 304, 306, 308, 312, 318, 320, 324, 330, 336, 340, 342, 348, 350, 352, 354, 360, 364, 366, 368, 372, 378, 380, 384, 390, 392, 396, 400, 402, 408, 414, 416, 420, 426, 432, 438, 440, 444, 448, 450, 456, 460, 462, 464, 468, 474, 476, 480, 486, 490, 492, 496, 498, 500, 504, 510, 516, 520, 522, 528, 532, 534, 540, 544, 546, 550, 552, 558, 560, 564, 570, 572, 576, 580, 582, 588, 594, 600, 606, 608, 612, 616, 618, 620, 624, 630, 636, 640, 642, 644, 648, 650, 654, 660, 666, 672, 678, 680, 684, 690, 696, 700, 702, 704, 708, 714]

37,721

社区成员

发帖
与我相关
我的任务
社区描述
JavaScript,VBScript,AngleScript,ActionScript,Shell,Perl,Ruby,Lua,Tcl,Scala,MaxScript 等脚本语言交流。
社区管理员
  • 脚本语言(Perl/Python)社区
  • IT.BOB
加入社区
  • 近7日
  • 近30日
  • 至今

试试用AI创作助手写篇文章吧