<commit_before>package com.example.monkeyjava;

/**
 * Created by <NAME> on 27-10-2015.
 */
public class MonkeyJava {

    // This is the main, equivalent to if __name__ == '__main__': in python
    public static void main(String[] args) {

        // Creating some start variables
        int num_sailors = 5;
        int search_to = 3500;

        // For a certain amount of coconuts to begin with
        for (int i=0; i<search_to; i++) {
            // Since taking the modulo can result in non-integer fractions we declare the number of coconuts to float
            float num_coc = i;

            // Go through the number of sailors
            for (int j=0; j<num_sailors;j++){

                // Removing 1 coconut (for the monkey) and the amount that the certain sailor takes for himself
                num_coc = num_coc - 1 - (num_coc-1)/num_sailors;

            }

            /*
            Now each sailor has his own pile.
            The monkey has 5 and there's a pile left.
            Checking if there is an amount divisible by num_sailors left in the pile
            and if the number of remaining is positive (of course)
             */

            if ((num_coc % num_sailors == 0) & (num_coc >= 0)) {
                /* If the remaining (positive) number of coconuts is divisible between the sailors, then we found
                the solution.
                */
                System.out.println("Solution: " + i + " coconuts to begin with");
            }
        }

    }
}
<commit_msg>Lineshift<commit_after>package com.example.monkeyjava;

/**
 * Created by <NAME> on 27-10-2015.
 */
public class MonkeyJava {

    // This is the main, equivalent to if __name__ == '__main__': in python
    public static void main(String[] args) {

        // Creating some start variables
        int num_sailors = 5;
        int search_to = 3500;

        // For a certain amount of coconuts to begin with
        for (int i=0; i<search_to; i++) {
            // Since taking the modulo can result in non-integer fractions we declare the number of coconuts to float
            float num_coc = i;

            // Go through the number of sailors
            for (int j=0; j<num_sailors;j++){

                // Removing 1 coconut (for the monkey) and the amount that the certain sailor takes for himself
                num_coc = num_coc - 1 - (num_coc-1)/num_sailors;
            
			}

            /*
            Now each sailor has his own pile.
            The monkey has 5 and there's a pile left.
            Checking if there is an amount divisible by num_sailors left in the pile
            and if the number of remaining is positive (of course)
             */

            if ((num_coc % num_sailors == 0) & (num_coc >= 0)) {
                /* If the remaining (positive) number of coconuts is divisible between the sailors, then we found
                the solution.
                */
                System.out.println("Solution: " + i + " coconuts to begin with");
            }
        }

    }
}

{'fraction_non_alphanumeric': 0.0810009878169246, 'fraction_numerical': 0.01382943694435298, 'mean_word_length': 1.688495575221239, 'pattern_counts': {'":': 0, '<': 9, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1885049', 'n_tokens_mistral': 912, 'n_tokens_neox': 801, 'n_words': 336}