Skip to content

Commit 5beed9e

Browse files
joydipdutta001joydipdutta001
committed
first commit
0 parents  commit 5beed9e

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

43 files changed

+1410
-0
lines changed

‎CourseraAlgorithmicToolbox/1.1 sum of digits.py

+3
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
#Python 3
2+
a,b = input().split()
3+
print(int(a)+int(b))

‎CourseraAlgorithmicToolbox/1.2 max pairwise product.py

+30
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
#Naive approach
2+
def max_prod_naive(arr):
3+
product = 0
4+
for i in range(len(arr)):
5+
for j in range(i+1,len(arr)):
6+
product = max(product,arr[i]*arr[j])
7+
return product
8+
#Fast approach
9+
def max_prod_fast(arr):
10+
p1 = max(arr)
11+
arr.remove(p1)
12+
p2 = max(arr)
13+
return p1*p2
14+
#Stress test
15+
from random import randint
16+
def max_prod_stress(N,M):
17+
while True:
18+
n = randint(2,N)
19+
A = [None]*n
20+
for i in range(n):
21+
A[i] = randint(0,M)
22+
print(A)
23+
result1 = max_prod_naive(A)
24+
result2 = max_prod_fast(A)
25+
if result1==result2:
26+
print('OK')
27+
else:
28+
print('Wrong answer:',result1,result2)
29+
return
30+
max_prod_stress(5,100)

‎CourseraAlgorithmicToolbox/2.1 fibonacci.py

+15
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
# Python3
2+
n = int(input())
3+
4+
if n<=1:
5+
print(n)
6+
quit()
7+
8+
def fibo(n):
9+
a, b = 0, 1
10+
for _ in range(n-1):
11+
c = a + b
12+
b, a = c, b
13+
print(c)
14+
15+
fibo(n)

‎CourseraAlgorithmicToolbox/2.2 lastfibodigit.py

+14
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
# Python3
2+
3+
n = int(input())
4+
if n<=1:
5+
print(n)
6+
def lastdigitfibo(n):
7+
a, b = 0, 1
8+
for _ in range(n-1):
9+
c = a + b
10+
c = c%10
11+
b, a = c, b
12+
print(c)
13+
14+
lastdigitfibo(n)

‎CourseraAlgorithmicToolbox/2.3 gcd.py

+15
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
# Python3
2+
a, b = [int(i) for i in input().split()]
3+
4+
# print(a,b)
5+
def euclid_gcd(a, b):
6+
if b == 0:
7+
print(a)
8+
quit()
9+
c = a%b
10+
euclid_gcd(b, c)
11+
12+
if a>b:
13+
euclid_gcd(a, b)
14+
else:
15+
euclid_gcd(b, a)

‎CourseraAlgorithmicToolbox/2.4 lcm.py

+16
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
# Python3
2+
3+
a, b = [int(i) for i in input().split()]
4+
5+
def euclid_gcd(a, b):
6+
if b == 0:
7+
return a
8+
c = a%b
9+
return euclid_gcd(b, c)
10+
11+
if a>b:
12+
gcd = euclid_gcd(a, b)
13+
else:
14+
gcd = euclid_gcd(b, a)
15+
16+
print(a*b//gcd)

‎CourseraAlgorithmicToolbox/2.5 pisano.py

+41
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
# python3
2+
n, m = [int(i) for i in input().split()]
3+
4+
# if period length of fibo modulo m is l. we need to compute n mod l
5+
if n<=1:
6+
print(n)
7+
quit()
8+
9+
pisano = {2: 3, 3: 8, 4: 6, 5: 20, 6: 24, 7: 16, 8: 12, 9: 24, 10: 60, 11: 10, 12: 24, 13: 28, 14: 48, 15: 40, 16: 24, 17: 36, 18: 24, 19: 18, 20: 60, 21: 16, 22: 30, 23: 48, 24: 24, 25: 100, 26: 84, 27: 72, 28: 48, 29: 14, 30: 120, 31: 30, 32: 48, 33: 40, 34: 36, 35: 80, 36: 24, 37: 76, 38: 18, 39: 56, 40: 60, 41: 40, 42: 48, 43: 88, 44: 30, 45: 120, 46: 48, 47: 32, 48: 24, 49: 112, 50: 300, 51: 72, 52: 84, 53: 108, 54: 72, 55: 20, 56: 48, 57: 72, 58: 42, 59: 58, 60: 120, 61: 60, 62: 30, 63: 48, 64: 96, 65: 140, 66: 120, 67: 136, 68: 36, 69: 48, 70: 240, 71: 70, 72: 24, 73: 148, 74: 228, 75: 200, 76: 18, 77: 80, 78: 168, 79: 78, 80: 120, 81: 216, 82: 120, 83: 168, 84: 48, 85: 180, 86: 264, 87: 56, 88: 60, 89: 44, 90: 120, 91: 112, 92: 48, 93: 120, 94: 96, 95: 180, 96: 48, 97: 196, 98: 336, 99: 120, 100: 300, 101: 50, 102: 72, 103: 208, 104: 84, 105: 80, 106: 108, 107: 72, 108: 72, 109: 108, 110: 60, 111: 152, 112:
10+
48, 113: 76, 114: 72, 115: 240, 116: 42, 117: 168, 118: 174, 119: 144, 120: 120, 121: 110, 122: 60, 123: 40, 124: 30, 125: 500, 126: 48, 127: 256, 128: 192, 129: 88, 130: 420, 131: 130, 132: 120, 133: 144, 134: 408, 135: 360, 136: 36, 137: 276, 138: 48, 139: 46, 140: 240, 141: 32, 142: 210, 143: 140, 144: 24, 145: 140, 146: 444, 147: 112, 148: 228, 149: 148, 150: 600, 151: 50, 152: 36, 153: 72, 154: 240, 155: 60, 156: 168, 157: 316, 158: 78, 159: 216, 160: 240, 161: 48, 162: 216, 163: 328, 164: 120, 165: 40, 166: 168, 167: 336, 168: 48, 169: 364, 170: 180, 171: 72, 172: 264, 173: 348, 174: 168, 175: 400, 176: 120, 177: 232, 178: 132, 179: 178, 180: 120, 181: 90, 182: 336, 183: 120, 184: 48, 185: 380, 186: 120, 187: 180, 188: 96, 189: 144, 190: 180, 191: 190, 192: 96, 193: 388, 194: 588, 195: 280, 196: 336, 197: 396, 198: 120, 199: 22, 200: 300, 201: 136, 202: 150, 203: 112, 204: 72, 205: 40, 206: 624, 207:
11+
48, 208: 168, 209: 90, 210: 240, 211: 42, 212: 108, 213: 280, 214: 72, 215: 440, 216: 72, 217: 240, 218: 108, 219: 296, 220: 60, 221: 252, 222: 456, 223: 448, 224: 48, 225: 600, 226: 228, 227: 456, 228: 72, 229: 114, 230: 240, 231: 80, 232: 84, 233: 52, 234: 168, 235: 160, 236: 174, 237: 312, 238: 144, 239: 238, 240: 120, 241: 240, 242: 330, 243: 648, 244: 60, 245:
12+
560, 246: 120, 247: 252, 248: 60, 249: 168, 250: 1500, 251: 250, 252: 48, 253: 240, 254: 768, 255: 360, 256: 384, 257: 516, 258: 264, 259: 304, 260: 420, 261: 168, 262: 390, 263: 176,
13+
264: 120, 265: 540, 266: 144, 267: 88, 268: 408, 269: 268, 270: 360, 271: 270, 272: 72, 273: 112, 274: 276, 275: 100, 276: 48, 277: 556, 278: 138, 279: 120, 280: 240, 281: 56, 282: 96, 283: 568, 284: 210, 285: 360, 286: 420, 287: 80, 288: 48, 289: 612, 290: 420, 291: 392, 292: 444, 293: 588, 294: 336, 295: 580, 296: 228, 297: 360, 298: 444, 299: 336, 300: 600, 301:
14+
176, 302: 150, 303: 200, 304: 72, 305: 60, 306: 72, 307: 88, 308: 240, 309: 208, 310: 60, 311: 310, 312: 168, 313: 628, 314: 948, 315: 240, 316: 78, 317: 636, 318: 216, 319: 70, 320: 480, 321: 72, 322: 48, 323: 36, 324: 216, 325: 700, 326: 984, 327: 216, 328: 120, 329: 32, 330: 120, 331: 110, 332: 168, 333: 456, 334: 336, 335: 680, 336: 48, 337: 676, 338: 1092, 339: 152, 340: 180, 341: 30, 342: 72, 343: 784, 344: 264, 345: 240, 346: 348, 347: 232, 348: 168, 349: 174, 350: 1200, 351: 504, 352: 240, 353: 236, 354: 696, 355: 140, 356: 132, 357: 144, 358: 534, 359: 358, 360: 120, 361: 342, 362: 90, 363: 440, 364: 336, 365: 740, 366: 120, 367: 736, 368: 48, 369: 120, 370: 1140, 371: 432, 372: 120, 373: 748, 374: 180, 375: 1000, 376: 96, 377: 28, 378: 144, 379: 378, 380: 180, 381: 256, 382: 570, 383: 768, 384: 192, 385: 80, 386: 1164, 387: 264, 388: 588, 389: 388, 390: 840, 391: 144, 392: 336, 393: 520, 394: 396, 395: 780, 396: 120, 397: 796, 398: 66, 399: 144, 400: 600, 401: 200, 402: 408, 403: 420, 404: 150, 405: 1080, 406: 336, 407: 380, 408: 72, 409: 408, 410: 120, 411: 552, 412: 624, 413: 464, 414: 48, 415: 840, 416: 336, 417: 184, 418: 90, 419: 418, 420: 240, 421: 84, 422: 42, 423: 96, 424: 108, 425: 900, 426: 840, 427: 240, 428: 72, 429: 280, 430: 1320, 431: 430, 432: 72, 433: 868, 434: 240, 435: 280, 436: 108, 437: 144, 438: 888, 439: 438, 440: 60, 441: 336, 442: 252, 443: 888, 444: 456, 445: 220, 446: 1344, 447: 296, 448: 96, 449: 448, 450: 600, 451: 40, 452: 228, 453: 200, 454: 456, 455: 560, 456: 72, 457: 916, 458: 114, 459: 72, 460: 240, 461: 46, 462: 240, 463: 928, 464: 168, 465: 120, 466: 156, 467: 936, 468: 168, 469: 272, 470: 480, 471: 632, 472: 348, 473: 440, 474: 312, 475: 900, 476: 144, 477: 216, 478: 714, 479: 478, 480: 240, 481: 532, 482: 240, 483: 48, 484: 330, 485: 980, 486: 648, 487: 976, 488: 60, 489: 328, 490: 1680, 491: 490, 492: 120, 493: 252, 494: 252, 495: 120, 496: 120, 497: 560, 498: 168, 499: 498, 500: 1500, 501: 336, 502: 750, 503: 1008, 504: 48, 505: 100, 506:
15+
240, 507: 728, 508: 768, 509: 254, 510: 360, 511: 592, 512: 768, 513: 72, 514: 516, 515: 1040, 516: 264, 517: 160, 518: 912, 519: 696, 520: 420, 521: 26, 522: 168, 523: 1048, 524: 390, 525: 400, 526: 528, 527: 180, 528: 120, 529: 1104, 530: 540, 531: 696, 532: 144, 533: 280, 534: 264, 535: 360, 536: 408, 537: 712, 538: 804, 539: 560, 540: 360, 541: 90, 542: 270, 543: 360, 544: 144, 545: 540, 546: 336, 547: 1096, 548: 276, 549: 120, 550: 300, 551: 126, 552: 48, 553: 624, 554: 1668, 555: 760, 556: 138, 557: 124, 558: 120, 559: 616, 560: 240, 561: 360, 562: 168, 563: 376, 564: 96, 565: 380, 566: 1704, 567: 432, 568: 420, 569: 568, 570: 360, 571: 570, 572: 420, 573: 760, 574: 240, 575: 1200, 576: 96, 577: 1156, 578: 612, 579: 776, 580: 420, 581: 336, 582: 1176, 583: 540, 584: 444, 585: 840, 586: 588, 587: 1176, 588: 336, 589: 90, 590: 1740, 591: 792, 592: 456, 593: 1188, 594: 360, 595: 720, 596: 444, 597: 88, 598: 336, 599: 598, 600: 600, 601: 600, 602: 528, 603: 408, 604: 150, 605: 220, 606: 600, 607: 1216, 608: 144, 609: 112, 610: 60, 611: 224, 612: 72, 613: 1228, 614: 264, 615: 40, 616: 240, 617: 1236, 618: 624, 619: 206, 620: 60, 621: 144, 622: 930, 623: 176, 624: 168, 625: None, 626: 1884, 627: 360, 628: 948, 629: 684, 630: 240, 631: 630, 632: 156, 633: 168, 634: 636, 635: 1280, 636: 216, 637: 112, 638: 210, 639: 840, 640: 960, 641: 640, 642: 72, 643: 1288, 644: 48, 645: 440, 646: 36, 647: 1296, 648: 216, 649: 290, 650: None, 651: 240, 652: 984, 653: 1308, 654: 216, 655: 260, 656: 120, 657: 888, 658: 96, 659: 658, 660: 120, 661: 220, 662: 330, 663: 504, 664: 168, 665: 720, 666: 456, 667: 336, 668: 336, 669: 448, 670: None, 671: 60, 672: 48, 673: 1348, 674: None, 675: 1800, 676: 1092, 677: 452, 678: 456, 679: 784, 680: 180, 681: 456, 682: 30, 683: 1368, 684: 72, 685: 1380, 686: None, 687: 456, 688: 264, 689:
16+
756, 690: 240, 691: 138, 692: 348, 693: 240, 694: 696, 695: 460, 696: 168, 697: 360, 698: 174, 699: 104, 700: 1200, 701: 700, 702: 504, 703: 684, 704: 480, 705: 160, 706: 708, 707: 400, 708: 696, 709: 118, 710: 420, 711: 312, 712: 132, 713: 240, 714: 144, 715: 140, 716: 534, 717: 952, 718: 1074, 719: 718, 720: 120, 721: 208, 722: 342, 723: 240, 724: 90, 725: 700, 726: 1320, 727: 1456, 728: 336, 729: 1944, 730: None, 731: 792, 732: 120, 733: 1468, 734: None, 735: 560, 736: 48, 737: 680, 738: 120, 739: 738, 740: 1140, 741: 504, 742: 432, 743: 496,
17+
744: 120, 745: 740, 746: None, 747: 168, 748: 180, 749: 144, 750: None, 751: 750, 752: 96, 753: 1000, 754: 84, 755: 100, 756: 144, 757: 1516, 758: 378, 759: 240, 760: 180, 761: 380, 762: 768, 763: 432, 764: 570, 765: 360, 766: 768, 767: 812, 768: 384, 769: 192, 770: 240, 771: 1032, 772: 1164, 773: 1548, 774: 264, 775: 300, 776: 588, 777: 304, 778: 1164, 779: 360, 780: 840, 781: 70, 782: 144, 783: 504, 784: 336, 785: 1580, 786: 1560, 787: 1576, 788: 396, 789: 176, 790: 780, 791: 304, 792: 120, 793: 420, 794: None, 795: 1080, 796: 66, 797: 228, 798: 144, 799: 288, 800: 1200, 801: 264, 802: 600, 803: 740, 804: 408, 805: 240, 806: 420, 807: 536, 808: 300, 809: 202, 810: 1080, 811: 270, 812: 336, 813: 1080, 814: 1140, 815: 1640, 816: 72, 817: 792, 818: 408, 819: 336, 820: 120, 821: 820, 822: 552, 823: 1648, 824: 624, 825: 200, 826: 1392, 827: 1656, 828: 48, 829: 276, 830: 840, 831: 1112, 832: 672, 833: 1008, 834: 552, 835: 1680, 836: 90, 837: 360, 838: 1254, 839: 838, 840: 240, 841: 406, 842: 84, 843: 56, 844: 42, 845: 1820, 846: 96, 847: 880, 848: 216, 849: 568, 850: 900, 851: 912, 852: 840, 853: 1708, 854: 240, 855: 360, 856: 72, 857: 1716, 858: 840, 859: 78, 860: 1320, 861: 80, 862: 1290, 863: 1728, 864: 144, 865: 1740, 866: None, 867: 1224, 868: 240, 869: 390, 870: 840, 871: 952, 872: 108, 873: 1176, 874: 144, 875: None, 876: 888, 877: 1756, 878: 438, 879: 1176, 880: 120, 881: 176, 882: 336, 883: 1768, 884: 252, 885: 1160, 886: 888, 887: 1776, 888:
18+
456, 889: 256, 890: 660, 891: 1080, 892: 1344, 893: 288, 894: 888, 895: 1780, 896: 192, 897: 336, 898: 1344, 899: 210, 900: 600, 901: 108, 902: 120, 903: 176, 904: 228, 905: 180, 906:
19+
600, 907: 1816, 908: 456, 909: 600, 910: 1680, 911: 70, 912: 72, 913: 840, 914: None, 915: 120, 916: 114, 917: 1040, 918: 72, 919: 102, 920: 240, 921: 88, 922: 138, 923: 140, 924: 240, 925: 1900, 926: None, 927: 624, 928: 336, 929: 928, 930: 120, 931: 1008, 932: 156, 933: 1240, 934: 936, 935: 180, 936: 168, 937: 1876, 938: 816, 939: 1256, 940: 480, 941: 470, 942: 1896, 943: 240, 944: 696, 945: 720, 946: 1320, 947: 1896, 948: 312, 949: 1036, 950: 900, 951: 1272, 952: 144, 953: 212, 954: 216, 955: 380, 956: 714, 957: 280, 958: 1434, 959: 1104, 960: 480, 961: 930, 962: 1596, 963: 72, 964: 240, 965: 1940, 966: 48, 967: 176, 968: 660, 969: 72, 970: None, 971: 970, 972: 648, 973: 368, 974: None, 975: 1400, 976: 120, 977: 652, 978: 984, 979: 220, 980: 1680, 981: 216, 982: 1470, 983: 1968, 984: 120, 985: 1980, 986: 252, 987: 32, 988: 252, 989: 528, 990: 120, 991: 198, 992: 240, 993: 440, 994: 1680, 995: 220, 996: 168, 997: 1996, 998: 498, 999: 1368, 1000: 1500}
20+
21+
lesser = n%pisano[m]
22+
if lesser<=1:
23+
print(lesser)
24+
quit()
25+
26+
def fibo(n, m):
27+
a, b = 0, 1
28+
for _ in range(n-1):
29+
c = a + b
30+
b, a = c, b
31+
print(c%m)
32+
33+
fibo(lesser, m)
34+
35+
36+
# for i in range(2,1001)
37+
38+
# pisano[i] = pisano_period(i)
39+
# print(i)
40+
41+
# print(pisano)

‎CourseraAlgorithmicToolbox/2.6 lastdigitsum.py

+27
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
# Python3
2+
# https://stackoverflow.com/questions/38950579/fibonacci-sum-of-large-numbersonly-last-digit-to-be-printed
3+
n = int(input())
4+
5+
if n<=1:
6+
print(n)
7+
quit()
8+
9+
10+
lesser = (n+2)%60
11+
if lesser==1:
12+
print(0)
13+
quit()
14+
elif lesser==0:
15+
print(9)
16+
quit()
17+
def fibo(n):
18+
a,b = 0, 1
19+
for _ in range(2,lesser+1):
20+
c = a+b
21+
c = c%10
22+
b, a = c, b
23+
if c!=0:
24+
print(c-1)
25+
else:
26+
print(9)
27+
fibo(lesser)

‎CourseraAlgorithmicToolbox/2.7 partialsum.py

+33
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
# Python3
2+
m, n = [int(i) for i in input().split()]
3+
4+
if n<=1:
5+
print(n)
6+
quit()
7+
8+
9+
lesser_n = (n+2)%60
10+
lesser_m = (m+1)%60
11+
12+
13+
def fibo(n):
14+
a,b = 0, 1
15+
for i in range(2,n+1):
16+
c = a+b
17+
c = c%10
18+
b, a = c, b
19+
return (c-1)
20+
if lesser_n<=1:
21+
a = lesser_n-1
22+
else:
23+
a = fibo(lesser_n)
24+
if lesser_m<=1:
25+
b = lesser_m-1
26+
else:
27+
b = fibo(lesser_m)
28+
# print(a)
29+
# print(b)
30+
if a>=b:
31+
print(a-b)
32+
else:
33+
print(10+a-b)

‎CourseraAlgorithmicToolbox/2.8 lastdigitsquares.py

+25
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
# python3
2+
# https://math.stackexchange.com/questions/442459/for-the-fibonacci-numbers-show-for-all-n-f-12f-22-dotsf-n2-f-nf-n1
3+
n = int(input())
4+
lesser_n = n%60
5+
lesser_nplus = (n+1)%60
6+
7+
def fibo(n):
8+
a, b = 0, 1
9+
for _ in range(2, n+1):
10+
c = a+b
11+
c = c% 10
12+
b, a = c, b
13+
return c
14+
15+
if lesser_n<=1:
16+
a = lesser_n
17+
else:
18+
a = fibo(lesser_n)
19+
if lesser_nplus<=1:
20+
b = lesser_nplus
21+
else:
22+
b = fibo(lesser_nplus)
23+
24+
25+
print((a*b)%10)

‎CourseraAlgorithmicToolbox/3.1 moneychange.py

+12
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
#Python3
2+
n = int(input())
3+
count = 0
4+
for i in [10, 5, 1]:
5+
if n>=i:
6+
q = n//i
7+
count += q
8+
n = n%i
9+
if n==0:
10+
print(count)
11+
quit()
12+

‎CourseraAlgorithmicToolbox/3.2 maxloot.py

+28
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
# Python3
2+
n, W = [int(i) for i in input().split()]
3+
lst = []
4+
5+
if W == 0:
6+
print(0)
7+
quit()
8+
9+
for _ in range(n):
10+
v, w = [int(i) for i in input().split()]
11+
if v == 0:
12+
continue
13+
lst.append((v, w))
14+
15+
lst.sort(key = lambda x: x[0]/x[1], reverse = True)
16+
17+
total_value = 0
18+
19+
for v,w in lst:
20+
if W==0:
21+
print(total_value)
22+
quit()
23+
amt = min(w, W)
24+
total_value += amt*v/w
25+
W -= amt
26+
27+
print(total_value)
28+

‎CourseraAlgorithmicToolbox/3.3 maxadrevenue.py

+8
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
# python3
2+
n = int(input())
3+
a = [int(i) for i in input().split()]
4+
b = [int(i) for i in input().split()]
5+
a.sort()
6+
b.sort()
7+
ans = sum([a[i]*b[i] for i in range(n)])
8+
print(ans)

‎CourseraAlgorithmicToolbox/3.4 signatures.py

+21
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
# python3
2+
n = int(input())
3+
lst = []
4+
5+
for _ in range(n):
6+
a, b = [int(i) for i in input().split()]
7+
lst.append((a,b))
8+
9+
lst.sort(key = lambda x: x[1])
10+
11+
index = 0
12+
coordinates = []
13+
14+
while index < n:
15+
curr = lst[index]
16+
while index < n-1 and curr[1]>=lst[index+1][0]:
17+
index += 1
18+
coordinates.append(curr[1])
19+
index += 1
20+
print(len(coordinates))
21+
print(' '.join([str(i) for i in coordinates]))

‎CourseraAlgorithmicToolbox/3.5 maxprizes.py

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
# python3
2+
n = int(input())
3+
if n == 1:
4+
print(1)
5+
print(1)
6+
quit()
7+
W = n
8+
prizes = []
9+
for i in range(1, n):
10+
if W>2*i:
11+
prizes.append(i)
12+
W -= i
13+
else:
14+
prizes.append(W)
15+
break
16+
17+
print(len(prizes))
18+
print(' '.join([str(i) for i in prizes]))

‎CourseraAlgorithmicToolbox/3.6 maxsalary.py

+22
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
# python3
2+
n = int(input())
3+
lst = [int(i) for i in input().split()]
4+
5+
6+
def IsGreaterOrEqual(digit, max_digit):
7+
return int(str(digit)+str(max_digit))>=int(str(max_digit)+str(digit))
8+
9+
def largestnumber(lst):
10+
answer = []
11+
12+
while lst!=[]:
13+
max_digit = 0
14+
for digit in lst:
15+
if IsGreaterOrEqual(digit, max_digit):
16+
max_digit = digit
17+
answer.append(max_digit)
18+
lst.remove(max_digit)
19+
20+
return answer
21+
22+
print(''.join([str(i) for i in largestnumber(lst)]))

‎CourseraAlgorithmicToolbox/4.1 binary.py

+24
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
# python3
2+
seq = [int(i) for i in input().split()]
3+
search_seq = [int(i) for i in input().split()]
4+
n = seq[0]
5+
seq = seq[1:]
6+
7+
def binary_search(seq, elt, r):
8+
l = 0
9+
while l<=r:
10+
m = (l+r)//2
11+
if elt > seq[m]:
12+
l = m + 1
13+
elif elt < seq[m]:
14+
r = m - 1
15+
else:
16+
return m
17+
return -1
18+
19+
soln = list()
20+
for i in search_seq[1:]:
21+
ans = binary_search(seq, i, n-1)
22+
soln.append(ans)
23+
print(' '.join([str(i) for i in soln]))
24+

0 commit comments

Comments
 (0)