minid | Minimal Viable Identifier

I have a command I am trying to run, minimus2 -D OVERLAP=100 -D MINID=95 -D THREADS=1 and there can be no spaces for the -D commands, e.g. minimus2 -D OVERLAP 100 -D MINID 95 -D THREADS 1, will fail.

I've tried,

I have 70 input files, file names are as like slurm-22801576.out, slurm-22801573.out, slurm-26801571.out, and so on. I want to extract all desired strings to one file. So I did the following but I was able to do so for one file only. How to do that on multiple files?

So i'm trying to make a like system for my imageshare. For that i tried to use the "Laravel Follow" from overtrue but it's giving me problems.

Everytime i try to use the functions that he says in his GitHub page it always gives me "Call to undefined method App\Models\Photo::needsToApproveFollowRequests()".

This is my User.php

I have a service that downloads and uploads an img in s3, it is working and looping 24.7 when in local in debug mode, but whenever I deploy it in QA or PROD, it exits right after 1 loop. I thought it had something to do with the memory or s3 not allowing continuous save, but when I commented all codes except for the 1st and last line, I confirmed that it only ran once.

here is the program.cs that calls the loop service

I am trying to call a method on web service as a get http method. I got error that I don't know why I got error. This is my method:

The topic link:https://codeforces.com/contest/109/problem/D

For the question, I'm time limit exceeded on test41

I guess that the data structure used is not appropriate, but I have thought about it for a long time and I don't know where to adopt a good data structure, please give me some advice.

algorithm ideas:

This approach is somewhat similar to selection sort. First, find a lucky number, then swap the position with the first number, then start from the second, find the smallest number, and then swap it with the lucky number, so that the smallest number starting from the second is placed at the first position, the lucky number is now in another position, and its position is recorded. Then swap the lucky number with the second number, and then repeat the above process. Special attention should be paid to the fact that we need to record the position of the lucky number we selected after sorting because the process before and after the position is slightly different and needs to be compared(This is explained in the code comments).

I am working with very large DataFrames in Julia resulting in out of memory errors when I do joins and other manipulations on the data. Fortunately the the data can be partitioned on an identifier column. I want to persist the partitioned DataFrame using the record batches feature build into Arrow.jl, and then read and process each record batch in turn. I have managed to get the following to work, but are unable to get the original DataFrame back on reading the data. On reading back the data I get a DataFrame with all the data in each column an array of the data in the original partition. I don't know whether my problem is how I am creating the partitions in the first place or on how I am reading back the data:

Imagine I've invoices from two branches. I need to select min and max invoice date and on that date show branch id. If at min/max date several branches have invoices, choose any.

Is there a way with the iOs Charts lib (3.6.0) to scale the Y axis with the nearest hundred, thousands, etc ?

I'm probably missing something but my Y axis doesn't make any sense :

In this exemple, I would like my Y axis to be something like :