My Crypto allert

A professor.

moon.... Joined July 2023

STEEM
Tradeable tokens that may be transferred anywhere at anytime.
Steem can be converted to STEEM POWER in a process called powering up.
133.442 STEEM
STEEM POWER
Influence tokens which give you more control over post payouts and allow you to earn on curation rewards.
STEEM POWER increases at an APR of approximately 2.68%, subject to blockchain variance. See FAQ for details.
Influence can also be delegated to other users via delegating your Steem Power. Returning your Steem Power takes exactly 5 days in which neither you nor the delegatee can use it.
0.000 STEEM
STEEM DOLLARS
Tradeable tokens that may be transferred anywhere at anytime.
$0.000
SAVINGS
Balances subject to 3 day withdraw waiting period.
0.000 STEEM
$0.000
Estimated Account Value
Total account asset valuation in USD.

$34.96

HISTORY

Beware of spam and phishing links in transfer memos. Do not open links from users you do not trust. Do not provide your private keys to any third party websites. Transactions will not show until they are confirmed on the blockchain, which may take a few minutes.
22 days agoTransfer 133.374 STEEM to bdhivesteem100026253
26 days agoTransfer 266.542 STEEM to bdhivesteem100026253
last monthStart power down of 534.390 STEEM
2 months agoTransfer 7775.766 STEEM to bdhivesteem100026253
2 months agoTransfer 0.001 STEEM to bdhivesteembinary ocurance #include <iostream> using namespace std; int binarySearchFirst(int arr[], int n, int x) { int left = 0, right = n - 1; int result = -1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == x) { result = mid; right = mid - 1; // Move to the left half } else if (arr[mid] < x) { left = mid + 1; } else { right = mid - 1; } } return result; } int binarySearchLast(int arr[], int n, int x) { int left = 0, right = n - 1; int result = -1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == x) { result = mid; left = mid + 1; // Move to the right half } else if (arr[mid] < x) { left = mid + 1; } else { right = mid - 1; } } return result; } int countOccurrences(int arr[], int n, int x) { int first = binarySearchFirst(arr, n, x); if (first == -1) { return 0; // x is not present in the array } int last = binarySearchLast(arr, n, x); return last - first + 1; } int main() { int n; cout << "Enter the number of elements: "; cin >> n; int arr[n]; cout << "Enter the elements in sorted order: "; for (int i = 0; i < n; i++) { cin >> arr[i]; } int x; cout << "Enter the element to count occurrences of: "; cin >> x; int count = countOccurrences(arr, n, x); cout << "Number of occurrences of " << x << " is: " << count << endl; return 0; }
2 months agoTransfer 0.001 STEEM to bdhivesteemfractional #include <iostream> #include <algorithm> using namespace std; // A structure to represent an item with weight and value struct Item { int value, weight; // Constructor Item(int value, int weight) : value(value), weight(weight) {} }; // Comparison function to sort items by value-to-weight ratio bool compare(Item a, Item b) { double r1 = (double)a.value / a.weight; double r2 = (double)b.value / b.weight; return r1 > r2; } // Function to calculate the maximum value we can get double fractionalKnapsack(int W, Item arr[], int n) { // Sort items by value-to-weight ratio sort(arr, arr + n, compare); double totalValue = 0.0; // Total value in knapsack for (int i = 0; i < n; i++) { // If adding the whole item doesn't exceed capacity, add it if (arr[i].weight <= W) { W -= arr[i].weight; totalValue += arr[i].value; } else { // Add the fractional part of the item totalValue += arr[i].value * ((double)W / arr[i].weight); break; } } return totalValue; } int main() { int n, W; cout << "Enter the number of items: "; cin >> n; cout << "Enter the capacity of the knapsack: "; cin >> W; Item arr[n]; cout << "Enter the value and weight of each item:" << endl; for (int i = 0; i < n; i++) { int value, weight; cin >> value >> weight; arr[i] = Item(value, weight); } double maxValue = fractionalKnapsack(W, arr, n); cout << "Maximum value in knapsack = " << maxValue << endl; return 0; }
2 months agoTransfer 0.001 STEEM to bdhivesteemactivity selection #include <iostream> #include <algorithm> using namespace std; // A structure to represent an activity struct Activity { int start; int finish; }; // A utility function to sort activities according to their finish time bool activityCompare(Activity s1, Activity s2) { return (s1.finish < s2.finish); } // Function to perform the Activity Selection algorithm void activitySelection(Activity activities[], int n) { // Sort activities based on their finish time sort(activities, activities + n, activityCompare); cout << "Selected activities are: " << endl; // The first activity always gets selected int i = 0; cout << "(" << activities[i].start << ", " << activities[i].finish << ")" << endl; // Consider the rest of the activities for (int j = 1; j < n; j++) { // If this activity has a start time greater than or equal to the finish time of the previously selected activity, select it if (activities[j].start >= activities[i].finish) { cout << "(" << activities[j].start << ", " << activities[j].finish << ")" << endl; i = j; } } } int main() { int n; cout << "Enter the number of activities: "; cin >> n; Activity activities[n]; cout << "Enter the start and finish times of the activities: " << endl; for (int i = 0; i < n; i++) { cin >> activities[i].start >> activities[i].finish; } activitySelection(activities, n); return 0; }
2 months agoTransfer 0.001 STEEM to bdhivesteemfibo seris #include<iostream> using namespace std; int Fib(int n) { //Base case if(n == 0) return 0; else if (n == 1) return 1; else { return Fib(n-1) + Fib(n-2); } } int main() { int n; cin >> n; for(int i = 0 ; i <= n ; i++) { cout << "Fib of " << i <<" "<< Fib(i) << endl; } return 0; }
2 months agoTransfer 0.001 STEEM to bdhivesteemlinear search #include <iostream> using namespace std; int linearSearch(int arr[], int n, int x) { for (int i = 0; i < n; i++) { if (arr[i] == x) { return i; // Return the index of the found element } } return -1; // Return -1 if the element is not found } int main() { int n; cout << "Enter the number of elements: "; cin >> n; int arr[n]; cout << "Enter the elements: "; for (int i = 0; i < n; i++) { cin >> arr[i]; } int x; cout << "Enter the element to search for: "; cin >> x; int result = linearSearch(arr, n, x); if (result != -1) { cout << "Element found at index " << result << endl; } else { cout << "Element not found in the array" << endl; } return 0; }
2 months agoTransfer 0.001 STEEM to bdhivesteembinary search #include <iostream> using namespace std; int binary_search(int arr[],int left , int right, int x){ while(left<=right){ int mid=left+(right-left)/2; if(arr[mid]==x){ return mid; } if(arr[mid]<x){ left=mid+1; } else{ right=mid-1; } } return -1; } int main() { int n; cout << "Enter the number of elements: "; cin >> n; int arr[n]; cout << "Enter the elements in sorted order: "; for (int i = 0; i < n; i++) { cin >> arr[i]; } int x; cout << "Enter the element to search for: "; cin >> x; int result = binary_search(arr, 0, n - 1, x); if (result != -1) cout << "Element found at index " << result << endl; else cout << "Element not found in the array" << endl; return 0; }
2 months agoTransfer 0.001 STEEM to bdhivesteembullble sort #include <iostream> using namespace std; void bubbleSort(int arr[], int n) { for (int i = 0; i < n-1; i++) { for (int j = 0; j < n-i-1; j++) { if (arr[j] > arr[j+1]) { // Swap arr[j] and arr[j+1] int temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } } void printArray(int arr[], int size) { for (int i = 0; i < size; i++) { cout << arr[i] << " "; } cout << endl; } int main() { int n; cout << "Enter the number of elements: "; cin >> n; int arr[n]; cout << "Enter the elements: "; for (int i = 0; i < n; i++) { cin >> arr[i]; } cout << "Unsorted array: "; printArray(arr, n); bubbleSort(arr, n); cout << "Sorted array: "; printArray(arr, n); return 0; }
2 months agoReceived 10.468 STEEM from binance-hot2
2 months agoTransfer 7763.544 STEEM to bdhivesteem100026253
2 months agoClaim rewards: 1.599 STEEM and 2.347 STEEM POWER
2 months agoClaim rewards: 0.572 STEEM and 0.868 STEEM POWER
2 months agoClaim rewards: 0.300 STEEM POWER
2 months agoClaim rewards: 0.180 STEEM POWER
2 months agoClaim rewards: 0.135 STEEM POWER
2 months agoClaim rewards: 0.249 STEEM POWER
2 months agoClaim rewards: 0.237 STEEM POWER
2 months agoClaim rewards: 1.572 STEEM POWER
2 months agoClaim rewards: 1.210 STEEM POWER
2 months agoClaim rewards: 0.259 STEEM POWER
2 months agoTransfer 7757.452 STEEM to bdhivesteem100026253
2 months agoClaim rewards: 0.231 STEEM POWER
2 months agoClaim rewards: 0.362 STEEM POWER
2 months agoClaim rewards: 0.352 STEEM POWER
2 months agoClaim rewards: 0.426 STEEM POWER
2 months agoClaim rewards: 1.600 STEEM POWER
2 months agoClaim rewards: 0.319 STEEM POWER
2 months agoClaim rewards: 0.336 STEEM POWER
2 months agoClaim rewards: 1.538 STEEM POWER
2 months agoClaim rewards: 0.419 STEEM POWER
2 months agoTransfer 7763.610 STEEM to bdhivesteem100026253
2 months agoClaim rewards: 0.399 STEEM POWER
2 months agoClaim rewards: 0.361 STEEM POWER
2 months agoClaim rewards: 0.639 STEEM POWER
2 months agoClaim rewards: 0.223 STEEM POWER
2 months agoClaim rewards: 0.183 STEEM POWER
2 months agoClaim rewards: 0.341 STEEM POWER
2 months agoClaim rewards: 0.178 STEEM POWER
2 months agoClaim rewards: 10.077 STEEM and 10.136 STEEM POWER
2 months agoTransfer 67.434 STEEM to bdhivesteem100026253
2 months agoStart power down of 31,170.690 STEEM
3 months agoClaim rewards: 9.777 STEEM and 9.834 STEEM POWER
3 months agoClaim rewards: 9.673 STEEM and 9.731 STEEM POWER
3 months agoClaim rewards: 9.406 STEEM and 9.462 STEEM POWER
3 months agoClaim rewards: 9.419 STEEM and 9.476 STEEM POWER
3 months agoClaim rewards: 9.697 STEEM and 9.756 STEEM POWER
3 months agoClaim rewards: 9.974 STEEM and 10.036 STEEM POWER
3 months agoClaim rewards: 9.488 STEEM and 9.548 STEEM POWER
3 months agoTransfer 64.071 STEEM to bdhivesteem100026253
3 months agoClaim rewards: 9.160 STEEM and 9.219 STEEM POWER
3 months agoClaim rewards: 9.402 STEEM and 9.463 STEEM POWER
3 months agoClaim rewards: 9.161 STEEM and 9.221 STEEM POWER
3 months agoClaim rewards: 9.604 STEEM and 9.668 STEEM POWER
3 months agoClaim rewards: 8.961 STEEM and 9.021 STEEM POWER
3 months agoClaim rewards: 8.932 STEEM and 8.993 STEEM POWER
3 months agoClaim rewards: 8.851 STEEM and 8.912 STEEM POWER
3 months agoTransfer 118.421 STEEM to bdhivesteem100026253
3 months agoClaim rewards: 8.706 STEEM and 8.766 STEEM POWER
3 months agoClaim rewards: 9.185 STEEM and 9.249 STEEM POWER