Java to puthon converter

import java.util.*;
import java.lang.*;
import java.io.*;

// Please name your class Main
class Main {
	public static void main(String[] args) {
        int answer=0,mod=1;
        double value;
        Scanner in = new Scanner(System.in);
        int p = in.nextInt();
        int q = in.nextInt();
        int n = in.nextInt();
        int m = in.nextInt();

        if(1<=p && p<=1000){
            if(0<=q && q<=1000){
                if(1<=n || m<=(10^9)){

                    for(int i=1;i<=n;i++) {

                        value = Math.pow(p, i) * Math.pow(i, q) ;
                        answer+=value;
                        
                        mod= answer % m;
                        

                        
                        }
                    
                        System.out.println(mod);
                            }
                        }
                    }
                }
}

Similar codes

2 votes158 views2 answers
Count bits c++
C++
0 vote117 views1 answer
Fractional Knapsack problem
C++
0 vote127 views1 answer
Str[i] - '0'
C++
0 vote111 views1 answer
Number of characters in string
C++
4 votes113 views2 answers
String count occurrences c++
C++
0 vote124 views1 answer
C++ file handiling
C++
0 vote117 views1 answer
Max element in an array with the index in c++
C++
-3 votes121 views1 answer
Cpp code for array sorting
C++
0 vote124 views1 answer
Http://nv-study.ru/http://nv-study.ru/http://nv-study.ru/
C++
17 votes120 views2 answers
How to output to console c++
C++