diff --git a/.github/workflows/python-package-conda.yml b/.github/workflows/python-package-conda.yml new file mode 100644 index 0000000..9bd6d2b --- /dev/null +++ b/.github/workflows/python-package-conda.yml @@ -0,0 +1,34 @@ +name: Python Package using Conda + +on: [push] + +jobs: + build-linux: + runs-on: ubuntu-latest + strategy: + max-parallel: 5 + + steps: + - uses: actions/checkout@v2 + - name: Set up Python 3.10 + uses: actions/setup-python@v2 + with: + python-version: 3.10 + - name: Add conda to system path + run: | + # $CONDA is an environment variable pointing to the root of the miniconda directory + echo $CONDA/bin >> $GITHUB_PATH + - name: Install dependencies + run: | + conda env update --file environment.yml --name base + - name: Lint with flake8 + run: | + conda install flake8 + # stop the build if there are Python syntax errors or undefined names + flake8 . --count --select=E9,F63,F7,F82 --show-source --statistics + # exit-zero treats all errors as warnings. The GitHub editor is 127 chars wide + flake8 . --count --exit-zero --max-complexity=10 --max-line-length=127 --statistics + - name: Test with pytest + run: | + conda install pytest + pytest diff --git a/F1,F2,F3 b/F1,F2,F3 new file mode 100644 index 0000000..e69de29 diff --git a/newjava b/newjava new file mode 100644 index 0000000..34ee024 --- /dev/null +++ b/newjava @@ -0,0 +1,37 @@ +import java.io.*; +import java.util.*; +public class PetersonNumberExample1 +{ +//an array is defined for the quickly find the factorial +static long[] factorial = new int[] { 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001600}; +//driver code +public static void main(String args[]) +{ +//constructor of the Scanner class +om the user +int n=sc.nextInt(); +//calling the user-defined function to check Peterson number +if (isPeterson(n)) +System.out.println("The given number is a Peterson number."); +else +System.out.println("The given number is not a Peterson number."); +} +//function to check the given number is Peterson or not +static boolean isPeterson(int n) +{ +int num = n; +int sum = 0; +//loop executes until the condition becomes false +while (n > 0) +{ +//determines the last digit of the given number +int digit = n % 10; +//determines the factorial of the digit and add it to the variable sum +sum += factorial[digit]; +//removes the last digit of the given number +n = n / 10; +} +//compares sum with num if they are equal returns the number itself +return (sum == num); +} +}