programming_problems.csv

title,description,input_description,output_description,problem_class,problem_score
Problem 1: Shortest path Task,Write a program that uses shortest path and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,100
Problem 2: Hash map Task,Write a program that uses hash map and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,55
Problem 3: Bitmask Task,Write a program that uses bitmask and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,84
Problem 4: Tree Task,Write a program that uses tree and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,78
Problem 5: Hash map Task,Write a program that uses hash map and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,66
Problem 6: Recursion Task,Write a program that uses recursion and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,53
Problem 7: Shortest path Task,Write a program that uses shortest path and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,98
Problem 8: Sorting Task,Write a program that uses sorting and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,56
Problem 9: Network flow Task,Write a program that uses network flow and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,99
Problem 10: Two pointers Task,Write a program that uses two pointers and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,40
Problem 11: Array Task,Write a program that uses array and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,4
Problem 12: Print Task,Write a program that uses print and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,30
Problem 13: Average Task,Write a program that uses average and array to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,10
Problem 14: Queue Task,Write a program that uses queue and two pointers to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,44
Problem 15: Network flow Task,Write a program that uses network flow and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,97
Problem 16: Average Task,Write a program that uses average and array to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,11
Problem 17: Tree Task,Write a program that uses tree and dynamic programming to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,99
Problem 18: Binary search Task,Write a program that uses binary search and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,57
Problem 19: Queue Task,Write a program that uses queue and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,40
Problem 20: Basic math Task,Write a program that uses basic math and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,11
Problem 21: Average Task,Write a program that uses average and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,10
Problem 22: Bitmask Task,Write a program that uses bitmask and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,91
Problem 23: Dynamic programming Task,Write a program that uses dynamic programming and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,77
Problem 24: Shortest path Task,Write a program that uses shortest path and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,93
Problem 25: Sum Task,Write a program that uses sum and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,7
Problem 26: Print Task,Write a program that uses print and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,30
Problem 27: Bitmask Task,Write a program that uses bitmask and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,99
Problem 28: Shortest path Task,Write a program that uses shortest path and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,93
Problem 29: If statement Task,Write a program that uses if statement and array to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,12
Problem 30: Tree Task,Write a program that uses tree and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,95
Problem 31: Sorting Task,Write a program that uses sorting and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,31
Problem 32: Tree Task,Write a program that uses tree and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,91
Problem 33: Sum Task,Write a program that uses sum and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,27
Problem 34: Loop Task,Write a program that uses loop and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,11
Problem 35: Segment tree Task,Write a program that uses segment tree and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,92
Problem 36: Graph Task,Write a program that uses graph and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,99
Problem 37: Count Task,Write a program that uses count and array to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,12
Problem 38: Stack Task,Write a program that uses stack and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,66
Problem 39: Bitmask Task,Write a program that uses bitmask and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,83
Problem 40: Graph Task,Write a program that uses graph and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,81
Problem 41: Greedy Task,Write a program that uses greedy and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,50
Problem 42: Stack Task,Write a program that uses stack and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,61
Problem 43: Print Task,Write a program that uses print and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,10
Problem 44: Sorting Task,Write a program that uses sorting and hash map to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,39
Problem 45: Sum Task,Write a program that uses sum and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,29
Problem 46: Two pointers Task,Write a program that uses two pointers and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,46
Problem 47: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,98
Problem 48: Binary search Task,Write a program that uses binary search and recursion to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,68
Problem 49: Tree Task,Write a program that uses tree and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,88
Problem 50: Dynamic programming Task,Write a program that uses dynamic programming and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,81
Problem 51: Greedy Task,Write a program that uses greedy and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,45
Problem 52: Convert Task,Write a program that uses convert and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,18
Problem 53: Greedy Task,Write a program that uses greedy and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,63
Problem 54: Tree Task,Write a program that uses tree and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,85
Problem 55: Hash map Task,Write a program that uses hash map and stack to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,54
Problem 56: Count Task,Write a program that uses count and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,12
Problem 57: Queue Task,Write a program that uses queue and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,67
Problem 58: Two pointers Task,Write a program that uses two pointers and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,37
Problem 59: Graph Task,Write a program that uses graph and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,90
Problem 60: Bitmask Task,Write a program that uses bitmask and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,94
Problem 61: Array Task,Write a program that uses array and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,3
Problem 62: Convert Task,Write a program that uses convert and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,18
Problem 63: Recursion Task,Write a program that uses recursion and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,61
Problem 64: Stack Task,Write a program that uses stack and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,63
Problem 65: Bitmask Task,Write a program that uses bitmask and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,84
Problem 66: Average Task,Write a program that uses average and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,22
Problem 67: Recursion Task,Write a program that uses recursion and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,34
Problem 68: Dynamic programming Task,Write a program that uses dynamic programming and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,80
Problem 69: Stack Task,Write a program that uses stack and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,41
Problem 70: Loop Task,Write a program that uses loop and average to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,30
Problem 71: Recursion Task,Write a program that uses recursion and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,68
Problem 72: Array Task,Write a program that uses array and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,12
Problem 73: Array Task,Write a program that uses array and convert to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,9
Problem 74: Count Task,Write a program that uses count and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,14
Problem 75: Greedy Task,Write a program that uses greedy and sorting to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,70
Problem 76: Greedy Task,Write a program that uses greedy and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,39
Problem 77: Binary search Task,Write a program that uses binary search and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,62
Problem 78: Average Task,Write a program that uses average and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,7
Problem 79: Bitmask Task,Write a program that uses bitmask and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,99
Problem 80: Recursion Task,Write a program that uses recursion and binary search to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,38
Problem 81: Bitmask Task,Write a program that uses bitmask and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,96
Problem 82: Array Task,Write a program that uses array and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,29
Problem 83: Sorting Task,Write a program that uses sorting and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,42
Problem 84: Stack Task,Write a program that uses stack and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,67
Problem 85: Dynamic programming Task,Write a program that uses dynamic programming and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,94
Problem 86: Average Task,Write a program that uses average and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,17
Problem 87: Array Task,Write a program that uses array and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,17
Problem 88: Recursion Task,Write a program that uses recursion and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,41
Problem 89: Segment tree Task,Write a program that uses segment tree and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,85
Problem 90: Queue Task,Write a program that uses queue and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,32
Problem 91: Dynamic programming Task,Write a program that uses dynamic programming and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,73
Problem 92: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,79
Problem 93: Segment tree Task,Write a program that uses segment tree and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,92
Problem 94: Print Task,Write a program that uses print and array to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,24
Problem 95: Tree Task,Write a program that uses tree and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,78
Problem 96: Shortest path Task,Write a program that uses shortest path and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,95
Problem 97: Print Task,Write a program that uses print and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,13
Problem 98: Basic math Task,Write a program that uses basic math and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,3
Problem 99: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,92
Problem 100: Dynamic programming Task,Write a program that uses dynamic programming and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,86
Problem 101: Segment tree Task,Write a program that uses segment tree and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,80
Problem 102: Two pointers Task,Write a program that uses two pointers and stack to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,39
Problem 103: Tree Task,Write a program that uses tree and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,100
Problem 104: Shortest path Task,Write a program that uses shortest path and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,99
Problem 105: Binary search Task,Write a program that uses binary search and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,59
Problem 106: Two pointers Task,Write a program that uses two pointers and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,58
Problem 107: Array Task,Write a program that uses array and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,2
Problem 108: Basic math Task,Write a program that uses basic math and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,14
Problem 109: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,75
Problem 110: Two pointers Task,Write a program that uses two pointers and stack to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,56
Problem 111: Binary search Task,Write a program that uses binary search and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,67
Problem 112: Two pointers Task,Write a program that uses two pointers and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,61
Problem 113: Stack Task,Write a program that uses stack and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,35
Problem 114: Sum Task,Write a program that uses sum and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,30
Problem 115: Dynamic programming Task,Write a program that uses dynamic programming and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,71
Problem 116: Segment tree Task,Write a program that uses segment tree and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,72
Problem 117: Graph Task,Write a program that uses graph and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,93
Problem 118: Count Task,Write a program that uses count and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,3
Problem 119: Basic math Task,Write a program that uses basic math and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,30
Problem 120: Binary search Task,Write a program that uses binary search and hash map to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,45
Problem 121: Shortest path Task,Write a program that uses shortest path and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,93
Problem 122: Count Task,Write a program that uses count and array to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,22
Problem 123: Network flow Task,Write a program that uses network flow and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,80
Problem 124: Network flow Task,Write a program that uses network flow and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,95
Problem 125: Basic math Task,Write a program that uses basic math and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,23
Problem 126: Loop Task,Write a program that uses loop and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,10
Problem 127: Shortest path Task,Write a program that uses shortest path and dynamic programming to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,79
Problem 128: Hash map Task,Write a program that uses hash map and binary search to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,55
Problem 129: Binary search Task,Write a program that uses binary search and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,64
Problem 130: Binary search Task,Write a program that uses binary search and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,36
Problem 131: Sorting Task,Write a program that uses sorting and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,31
Problem 132: Network flow Task,Write a program that uses network flow and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,92
Problem 133: If statement Task,Write a program that uses if statement and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,4
Problem 134: Binary search Task,Write a program that uses binary search and hash map to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,57
Problem 135: Segment tree Task,Write a program that uses segment tree and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,74
Problem 136: Segment tree Task,Write a program that uses segment tree and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,81
Problem 137: Convert Task,Write a program that uses convert and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,29
Problem 138: Hash map Task,Write a program that uses hash map and binary search to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,39
Problem 139: Queue Task,Write a program that uses queue and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,65
Problem 140: Hash map Task,Write a program that uses hash map and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,45
Problem 141: Binary search Task,Write a program that uses binary search and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,48
Problem 142: Dynamic programming Task,Write a program that uses dynamic programming and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,97
Problem 143: Bitmask Task,Write a program that uses bitmask and dynamic programming to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,83
Problem 144: Hash map Task,Write a program that uses hash map and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,45
Problem 145: Greedy Task,Write a program that uses greedy and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,64
Problem 146: Recursion Task,Write a program that uses recursion and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,50
Problem 147: Stack Task,Write a program that uses stack and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,57
Problem 148: Count Task,Write a program that uses count and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,14
Problem 149: Greedy Task,Write a program that uses greedy and two pointers to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,57
Problem 150: Stack Task,Write a program that uses stack and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,52
Problem 151: Average Task,Write a program that uses average and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,15
Problem 152: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,71
Problem 153: Network flow Task,Write a program that uses network flow and dynamic programming to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,90
Problem 154: Bitmask Task,Write a program that uses bitmask and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,75
Problem 155: Network flow Task,Write a program that uses network flow and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,76
Problem 156: If statement Task,Write a program that uses if statement and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,3
Problem 157: Dynamic programming Task,Write a program that uses dynamic programming and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,76
Problem 158: Two pointers Task,Write a program that uses two pointers and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,45
Problem 159: Bitmask Task,Write a program that uses bitmask and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,91
Problem 160: Queue Task,Write a program that uses queue and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,31
Problem 161: Hash map Task,Write a program that uses hash map and stack to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,54
Problem 162: Array Task,Write a program that uses array and if statement to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,8
Problem 163: Hash map Task,Write a program that uses hash map and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,66
Problem 164: Stack Task,Write a program that uses stack and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,51
Problem 165: Hash map Task,Write a program that uses hash map and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,43
Problem 166: Stack Task,Write a program that uses stack and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,70
Problem 167: Loop Task,Write a program that uses loop and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,6
Problem 168: Hash map Task,Write a program that uses hash map and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,38
Problem 169: Recursion Task,Write a program that uses recursion and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,46
Problem 170: If statement Task,Write a program that uses if statement and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,14
Problem 171: Shortest path Task,Write a program that uses shortest path and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,79
Problem 172: Sum Task,Write a program that uses sum and array to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,19
Problem 173: Shortest path Task,Write a program that uses shortest path and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,86
Problem 174: Network flow Task,Write a program that uses network flow and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,83
Problem 175: Shortest path Task,Write a program that uses shortest path and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,90
Problem 176: If statement Task,Write a program that uses if statement and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,9
Problem 177: Binary search Task,Write a program that uses binary search and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,47
Problem 178: Basic math Task,Write a program that uses basic math and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,16
Problem 179: Hash map Task,Write a program that uses hash map and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,47
Problem 180: Print Task,Write a program that uses print and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,20
Problem 181: Array Task,Write a program that uses array and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,13
Problem 182: Network flow Task,Write a program that uses network flow and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,94
Problem 183: Segment tree Task,Write a program that uses segment tree and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,83
Problem 184: Dynamic programming Task,Write a program that uses dynamic programming and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,87
Problem 185: Stack Task,Write a program that uses stack and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,32
Problem 186: Graph Task,Write a program that uses graph and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,71
Problem 187: Shortest path Task,Write a program that uses shortest path and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,95
Problem 188: Bitmask Task,Write a program that uses bitmask and dynamic programming to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,94
Problem 189: Recursion Task,Write a program that uses recursion and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,46
Problem 190: Graph Task,Write a program that uses graph and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,84
Problem 191: Recursion Task,Write a program that uses recursion and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,70
Problem 192: Recursion Task,Write a program that uses recursion and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,45
Problem 193: Recursion Task,Write a program that uses recursion and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,47
Problem 194: If statement Task,Write a program that uses if statement and array to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,12
Problem 195: Bitmask Task,Write a program that uses bitmask and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,73
Problem 196: Dynamic programming Task,Write a program that uses dynamic programming and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,97
Problem 197: Array Task,Write a program that uses array and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,22
Problem 198: Segment tree Task,Write a program that uses segment tree and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,75
Problem 199: Sum Task,Write a program that uses sum and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,28
Problem 200: Hash map Task,Write a program that uses hash map and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,61
Problem 201: Segment tree Task,Write a program that uses segment tree and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,99
Problem 202: Average Task,Write a program that uses average and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,3
Problem 203: Binary search Task,Write a program that uses binary search and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,38
Problem 204: Convert Task,Write a program that uses convert and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,30
Problem 205: Stack Task,Write a program that uses stack and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,66
Problem 206: Loop Task,Write a program that uses loop and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,17
Problem 207: Network flow Task,Write a program that uses network flow and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,76
Problem 208: Network flow Task,Write a program that uses network flow and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,82
Problem 209: Basic math Task,Write a program that uses basic math and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,23
Problem 210: Two pointers Task,Write a program that uses two pointers and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,41
Problem 211: Bitmask Task,Write a program that uses bitmask and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,85
Problem 212: Two pointers Task,Write a program that uses two pointers and hash map to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,41
Problem 213: Binary search Task,Write a program that uses binary search and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,32
Problem 214: Sorting Task,Write a program that uses sorting and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,59
Problem 215: Array Task,Write a program that uses array and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,28
Problem 216: Count Task,Write a program that uses count and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,14
Problem 217: Bitmask Task,Write a program that uses bitmask and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,87
Problem 218: Recursion Task,Write a program that uses recursion and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,64
Problem 219: Bitmask Task,Write a program that uses bitmask and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,95
Problem 220: Hash map Task,Write a program that uses hash map and sorting to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,56
Problem 221: Shortest path Task,Write a program that uses shortest path and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,79
Problem 222: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,95
Problem 223: Recursion Task,Write a program that uses recursion and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,68
Problem 224: Hash map Task,Write a program that uses hash map and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,36
Problem 225: Greedy Task,Write a program that uses greedy and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,69
Problem 226: Array Task,Write a program that uses array and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,25
Problem 227: Bitmask Task,Write a program that uses bitmask and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,82
Problem 228: Sum Task,Write a program that uses sum and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,5
Problem 229: Basic math Task,Write a program that uses basic math and array to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,4
Problem 230: Tree Task,Write a program that uses tree and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,96
Problem 231: Graph Task,Write a program that uses graph and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,99
Problem 232: Greedy Task,Write a program that uses greedy and sorting to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,49
Problem 233: Loop Task,Write a program that uses loop and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,12
Problem 234: Binary search Task,Write a program that uses binary search and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,39
Problem 235: Convert Task,Write a program that uses convert and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,1
Problem 236: Print Task,Write a program that uses print and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,14
Problem 237: Dynamic programming Task,Write a program that uses dynamic programming and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,72
Problem 238: Sorting Task,Write a program that uses sorting and recursion to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,61
Problem 239: Segment tree Task,Write a program that uses segment tree and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,91
Problem 240: Sum Task,Write a program that uses sum and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,24
Problem 241: Stack Task,Write a program that uses stack and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,37
Problem 242: Queue Task,Write a program that uses queue and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,58
Problem 243: Stack Task,Write a program that uses stack and two pointers to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,36
Problem 244: Average Task,Write a program that uses average and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,29
Problem 245: Binary search Task,Write a program that uses binary search and two pointers to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,49
Problem 246: Shortest path Task,Write a program that uses shortest path and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,96
Problem 247: Sum Task,Write a program that uses sum and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,14
Problem 248: Average Task,Write a program that uses average and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,17
Problem 249: Bitmask Task,Write a program that uses bitmask and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,71
Problem 250: Dynamic programming Task,Write a program that uses dynamic programming and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,80
Problem 251: Bitmask Task,Write a program that uses bitmask and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,85
Problem 252: Tree Task,Write a program that uses tree and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,95
Problem 253: Basic math Task,Write a program that uses basic math and array to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,16
Problem 254: Sum Task,Write a program that uses sum and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,26
Problem 255: If statement Task,Write a program that uses if statement and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,4
Problem 256: Print Task,Write a program that uses print and average to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,17
Problem 257: Count Task,Write a program that uses count and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,24
Problem 258: Convert Task,Write a program that uses convert and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,5
Problem 259: Count Task,Write a program that uses count and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,25
Problem 260: Greedy Task,Write a program that uses greedy and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,35
Problem 261: Recursion Task,Write a program that uses recursion and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,34
Problem 262: Sorting Task,Write a program that uses sorting and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,52
Problem 263: Greedy Task,Write a program that uses greedy and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,52
Problem 264: Average Task,Write a program that uses average and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,23
Problem 265: Recursion Task,Write a program that uses recursion and stack to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,68
Problem 266: Stack Task,Write a program that uses stack and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,68
Problem 267: Bitmask Task,Write a program that uses bitmask and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,87
Problem 268: Recursion Task,Write a program that uses recursion and stack to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,34
Problem 269: If statement Task,Write a program that uses if statement and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,22
Problem 270: Dynamic programming Task,Write a program that uses dynamic programming and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,100
Problem 271: Array Task,Write a program that uses array and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,13
Problem 272: Greedy Task,Write a program that uses greedy and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,51
Problem 273: Two pointers Task,Write a program that uses two pointers and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,65
Problem 274: Graph Task,Write a program that uses graph and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,96
Problem 275: Binary search Task,Write a program that uses binary search and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,34
Problem 276: Convert Task,Write a program that uses convert and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,18
Problem 277: Binary search Task,Write a program that uses binary search and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,63
Problem 278: Sum Task,Write a program that uses sum and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,10
Problem 279: If statement Task,Write a program that uses if statement and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,17
Problem 280: Sum Task,Write a program that uses sum and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,28
Problem 281: Loop Task,Write a program that uses loop and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,20
Problem 282: Queue Task,Write a program that uses queue and two pointers to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,53
Problem 283: Segment tree Task,Write a program that uses segment tree and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,82
Problem 284: Loop Task,Write a program that uses loop and average to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,15
Problem 285: Greedy Task,Write a program that uses greedy and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,65
Problem 286: Average Task,Write a program that uses average and convert to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,20
Problem 287: Tree Task,Write a program that uses tree and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,96
Problem 288: Sum Task,Write a program that uses sum and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,29
Problem 289: Segment tree Task,Write a program that uses segment tree and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,80
Problem 290: If statement Task,Write a program that uses if statement and array to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,29
Problem 291: Print Task,Write a program that uses print and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,21
Problem 292: Basic math Task,Write a program that uses basic math and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,29
Problem 293: Network flow Task,Write a program that uses network flow and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,77
Problem 294: Recursion Task,Write a program that uses recursion and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,42
Problem 295: Binary search Task,Write a program that uses binary search and stack to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,38
Problem 296: Stack Task,Write a program that uses stack and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,40
Problem 297: If statement Task,Write a program that uses if statement and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,13
Problem 298: If statement Task,Write a program that uses if statement and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,4
Problem 299: Array Task,Write a program that uses array and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,22
Problem 300: Queue Task,Write a program that uses queue and stack to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,46
Problem 301: Sorting Task,Write a program that uses sorting and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,33
Problem 302: Two pointers Task,Write a program that uses two pointers and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,39
Problem 303: Segment tree Task,Write a program that uses segment tree and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,74
Problem 304: Convert Task,Write a program that uses convert and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,9
Problem 305: Convert Task,Write a program that uses convert and average to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,15
Problem 306: Bitmask Task,Write a program that uses bitmask and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,92
Problem 307: Count Task,Write a program that uses count and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,6
Problem 308: Segment tree Task,Write a program that uses segment tree and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,72
Problem 309: Array Task,Write a program that uses array and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,18
Problem 310: Two pointers Task,Write a program that uses two pointers and recursion to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,42
Problem 311: Segment tree Task,Write a program that uses segment tree and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,77
Problem 312: If statement Task,Write a program that uses if statement and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,15
Problem 313: Queue Task,Write a program that uses queue and sorting to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,47
Problem 314: Queue Task,Write a program that uses queue and sorting to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,49
Problem 315: Basic math Task,Write a program that uses basic math and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,13
Problem 316: Graph Task,Write a program that uses graph and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,79
Problem 317: Sum Task,Write a program that uses sum and convert to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,29
Problem 318: Shortest path Task,Write a program that uses shortest path and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,96
Problem 319: Segment tree Task,Write a program that uses segment tree and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,77
Problem 320: Shortest path Task,Write a program that uses shortest path and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,77
Problem 321: Tree Task,Write a program that uses tree and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,79
Problem 322: Queue Task,Write a program that uses queue and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,43
Problem 323: Segment tree Task,Write a program that uses segment tree and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,85
Problem 324: Queue Task,Write a program that uses queue and sorting to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,33
Problem 325: Average Task,Write a program that uses average and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,17
Problem 326: Queue Task,Write a program that uses queue and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,63
Problem 327: If statement Task,Write a program that uses if statement and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,21
Problem 328: Network flow Task,Write a program that uses network flow and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,79
Problem 329: Shortest path Task,Write a program that uses shortest path and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,89
Problem 330: Two pointers Task,Write a program that uses two pointers and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,52
Problem 331: Convert Task,Write a program that uses convert and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,18
Problem 332: Greedy Task,Write a program that uses greedy and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,40
Problem 333: Sum Task,Write a program that uses sum and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,30
Problem 334: Segment tree Task,Write a program that uses segment tree and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,82
Problem 335: Recursion Task,Write a program that uses recursion and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,43
Problem 336: Tree Task,Write a program that uses tree and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,88
Problem 337: Graph Task,Write a program that uses graph and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,78
Problem 338: Segment tree Task,Write a program that uses segment tree and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,77
Problem 339: Tree Task,Write a program that uses tree and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,73
Problem 340: Dynamic programming Task,Write a program that uses dynamic programming and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,90
Problem 341: Network flow Task,Write a program that uses network flow and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,98
Problem 342: Shortest path Task,Write a program that uses shortest path and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,96
Problem 343: Recursion Task,Write a program that uses recursion and sorting to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,69
Problem 344: Two pointers Task,Write a program that uses two pointers and binary search to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,44
Problem 345: Tree Task,Write a program that uses tree and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,98
Problem 346: Dynamic programming Task,Write a program that uses dynamic programming and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,78
Problem 347: Print Task,Write a program that uses print and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,8
Problem 348: Print Task,Write a program that uses print and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,25
Problem 349: Sum Task,Write a program that uses sum and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,25
Problem 350: Graph Task,Write a program that uses graph and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,95
Problem 351: Hash map Task,Write a program that uses hash map and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,67
Problem 352: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,86
Problem 353: Print Task,Write a program that uses print and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,16
Problem 354: Sorting Task,Write a program that uses sorting and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,51
Problem 355: Average Task,Write a program that uses average and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,8
Problem 356: Greedy Task,Write a program that uses greedy and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,63
Problem 357: Segment tree Task,Write a program that uses segment tree and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,95
Problem 358: Shortest path Task,Write a program that uses shortest path and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,72
Problem 359: Hash map Task,Write a program that uses hash map and sorting to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,32
Problem 360: If statement Task,Write a program that uses if statement and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,25
Problem 361: Greedy Task,Write a program that uses greedy and sorting to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,49
Problem 362: Print Task,Write a program that uses print and convert to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,15
Problem 363: Loop Task,Write a program that uses loop and convert to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,29
Problem 364: Recursion Task,Write a program that uses recursion and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,57
Problem 365: Array Task,Write a program that uses array and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,30
Problem 366: Average Task,Write a program that uses average and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,23
Problem 367: Segment tree Task,Write a program that uses segment tree and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,80
Problem 368: Network flow Task,Write a program that uses network flow and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,71
Problem 369: Recursion Task,Write a program that uses recursion and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,31
Problem 370: Two pointers Task,Write a program that uses two pointers and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,45
Problem 371: Network flow Task,Write a program that uses network flow and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,72
Problem 372: Average Task,Write a program that uses average and convert to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,28
Problem 373: Convert Task,Write a program that uses convert and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,17
Problem 374: Average Task,Write a program that uses average and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,11
Problem 375: Average Task,Write a program that uses average and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,1
Problem 376: Two pointers Task,Write a program that uses two pointers and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,53
Problem 377: Average Task,Write a program that uses average and if statement to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,21
Problem 378: Bitmask Task,Write a program that uses bitmask and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,72
Problem 379: Convert Task,Write a program that uses convert and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,14
Problem 380: Count Task,Write a program that uses count and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,1
Problem 381: Two pointers Task,Write a program that uses two pointers and recursion to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,50
Problem 382: Print Task,Write a program that uses print and array to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,10
Problem 383: Average Task,Write a program that uses average and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,13
Problem 384: Print Task,Write a program that uses print and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,6
Problem 385: Bitmask Task,Write a program that uses bitmask and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,86
Problem 386: Average Task,Write a program that uses average and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,16
Problem 387: Stack Task,Write a program that uses stack and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,63
Problem 388: Tree Task,Write a program that uses tree and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,97
Problem 389: Print Task,Write a program that uses print and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,12
Problem 390: Segment tree Task,Write a program that uses segment tree and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,75
Problem 391: Count Task,Write a program that uses count and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,19
Problem 392: Loop Task,Write a program that uses loop and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,13
Problem 393: Graph Task,Write a program that uses graph and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,78
Problem 394: Tree Task,Write a program that uses tree and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,74
Problem 395: Segment tree Task,Write a program that uses segment tree and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,84
Problem 396: Convert Task,Write a program that uses convert and basic math to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,4
Problem 397: Graph Task,Write a program that uses graph and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,71
Problem 398: Loop Task,Write a program that uses loop and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,27
Problem 399: Hash map Task,Write a program that uses hash map and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,34
Problem 400: Average Task,Write a program that uses average and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,2
Problem 401: Average Task,Write a program that uses average and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,18
Problem 402: Sum Task,Write a program that uses sum and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,7
Problem 403: Binary search Task,Write a program that uses binary search and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,68
Problem 404: Dynamic programming Task,Write a program that uses dynamic programming and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,91
Problem 405: Print Task,Write a program that uses print and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,10
Problem 406: Greedy Task,Write a program that uses greedy and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,55
Problem 407: Dynamic programming Task,Write a program that uses dynamic programming and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,71
Problem 408: Hash map Task,Write a program that uses hash map and recursion to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,41
Problem 409: Array Task,Write a program that uses array and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,15
Problem 410: Dynamic programming Task,Write a program that uses dynamic programming and graph to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,73
Problem 411: Two pointers Task,Write a program that uses two pointers and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,46
Problem 412: Sorting Task,Write a program that uses sorting and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,51
Problem 413: Queue Task,Write a program that uses queue and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,35
Problem 414: Sorting Task,Write a program that uses sorting and two pointers to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,48
Problem 415: Network flow Task,Write a program that uses network flow and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,82
Problem 416: Segment tree Task,Write a program that uses segment tree and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,71
Problem 417: Tree Task,Write a program that uses tree and shortest path to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,93
Problem 418: Two pointers Task,Write a program that uses two pointers and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,32
Problem 419: Bitmask Task,Write a program that uses bitmask and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,92
Problem 420: Basic math Task,Write a program that uses basic math and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,25
Problem 421: Loop Task,Write a program that uses loop and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,16
Problem 422: Two pointers Task,Write a program that uses two pointers and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,51
Problem 423: Print Task,Write a program that uses print and array to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,27
Problem 424: Array Task,Write a program that uses array and average to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,3
Problem 425: Count Task,Write a program that uses count and basic math to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,4
Problem 426: Network flow Task,Write a program that uses network flow and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,73
Problem 427: Bitmask Task,Write a program that uses bitmask and graph to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,75
Problem 428: Binary search Task,Write a program that uses binary search and recursion to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,67
Problem 429: Greedy Task,Write a program that uses greedy and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,59
Problem 430: Convert Task,Write a program that uses convert and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,3
Problem 431: Network flow Task,Write a program that uses network flow and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,97
Problem 432: Two pointers Task,Write a program that uses two pointers and binary search to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,56
Problem 433: Tree Task,Write a program that uses tree and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,92
Problem 434: Print Task,Write a program that uses print and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,9
Problem 435: Binary search Task,Write a program that uses binary search and hash map to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,70
Problem 436: Print Task,Write a program that uses print and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,20
Problem 437: Count Task,Write a program that uses count and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,25
Problem 438: Tree Task,Write a program that uses tree and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,84
Problem 439: Count Task,Write a program that uses count and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,29
Problem 440: Sum Task,Write a program that uses sum and count to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,16
Problem 441: Binary search Task,Write a program that uses binary search and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,61
Problem 442: Shortest path Task,Write a program that uses shortest path and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,96
Problem 443: If statement Task,Write a program that uses if statement and average to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,27
Problem 444: Queue Task,Write a program that uses queue and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,66
Problem 445: Two pointers Task,Write a program that uses two pointers and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,33
Problem 446: Network flow Task,Write a program that uses network flow and dynamic programming to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,97
Problem 447: Dynamic programming Task,Write a program that uses dynamic programming and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,72
Problem 448: Stack Task,Write a program that uses stack and two pointers to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,39
Problem 449: Loop Task,Write a program that uses loop and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,28
Problem 450: Stack Task,Write a program that uses stack and greedy to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,32
Problem 451: Stack Task,Write a program that uses stack and greedy to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,37
Problem 452: Binary search Task,Write a program that uses binary search and queue to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,62
Problem 453: Two pointers Task,Write a program that uses two pointers and binary search to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,62
Problem 454: If statement Task,Write a program that uses if statement and convert to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,9
Problem 455: Dynamic programming Task,Write a program that uses dynamic programming and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,94
Problem 456: Sum Task,Write a program that uses sum and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,29
Problem 457: Segment tree Task,Write a program that uses segment tree and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,90
Problem 458: Tree Task,Write a program that uses tree and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,85
Problem 459: Tree Task,Write a program that uses tree and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,72
Problem 460: Recursion Task,Write a program that uses recursion and stack to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,39
Problem 461: Greedy Task,Write a program that uses greedy and binary search to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,64
Problem 462: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,83
Problem 463: Print Task,Write a program that uses print and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,26
Problem 464: Graph Task,Write a program that uses graph and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,72
Problem 465: Print Task,Write a program that uses print and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,6
Problem 466: Count Task,Write a program that uses count and loop to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,29
Problem 467: Queue Task,Write a program that uses queue and recursion to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,31
Problem 468: Convert Task,Write a program that uses convert and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,4
Problem 469: Dynamic programming Task,Write a program that uses dynamic programming and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,87
Problem 470: Bitmask Task,Write a program that uses bitmask and dynamic programming to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,80
Problem 471: Tree Task,Write a program that uses tree and dynamic programming to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,100
Problem 472: Sum Task,Write a program that uses sum and if statement to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,5
Problem 473: Graph Task,Write a program that uses graph and tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,84
Problem 474: Sum Task,Write a program that uses sum and array to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,17
Problem 475: Graph Task,Write a program that uses graph and shortest path to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,81
Problem 476: Hash map Task,Write a program that uses hash map and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,50
Problem 477: Tree Task,Write a program that uses tree and bitmask to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,88
Problem 478: Bitmask Task,Write a program that uses bitmask and dynamic programming to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,77
Problem 479: Dynamic programming Task,Write a program that uses dynamic programming and segment tree to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,79
Problem 480: Hash map Task,Write a program that uses hash map and queue to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,41
Problem 481: If statement Task,Write a program that uses if statement and print to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,2
Problem 482: Graph Task,Write a program that uses graph and network flow to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,91
Problem 483: Queue Task,Write a program that uses queue and hash map to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,47
Problem 484: Bitmask Task,Write a program that uses bitmask and network flow to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Hard,90
Problem 485: Graph Task,Write a program that uses graph and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,97
Problem 486: Average Task,Write a program that uses average and loop to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,7
Problem 487: Sum Task,Write a program that uses sum and print to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,26
Problem 488: Shortest path Task,Write a program that uses shortest path and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,94
Problem 489: Binary search Task,Write a program that uses binary search and recursion to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,54
Problem 490: Convert Task,Write a program that uses convert and count to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,27
Problem 491: Shortest path Task,Write a program that uses shortest path and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,100
Problem 492: Graph Task,Write a program that uses graph and segment tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,74
Problem 493: Queue Task,Write a program that uses queue and hash map to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Medium,52
Problem 494: Print Task,Write a program that uses print and sum to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,7
Problem 495: Average Task,Write a program that uses average and array to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,1
Problem 496: Segment tree Task,Write a program that uses segment tree and bitmask to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,92
Problem 497: Convert Task,Write a program that uses convert and sum to solve the problem. The constraints are small.,The first line contains an integer N.,Print the result.,Easy,30
Problem 498: Count Task,Write a program that uses count and convert to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Easy,2
Problem 499: Greedy Task,Write a program that uses greedy and binary search to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Medium,70
Problem 500: Graph Task,Write a program that uses graph and tree to solve the problem. The constraints are small. This is a standard optimization problem.,The first line contains an integer N.,Print the result.,Hard,89