Java implementation to count the number of ways a number can be written as sum of prime number and twice a square
import java . util . * ; class GFG { static int n = 500000 - 2 ; static Vector < Integer > v = new Vector < > ( ) ;