fork download
  1. import java.io.*;
  2. import java.util.*;
  3. import java.text.*;
  4. import java.math.*;
  5. import java.util.regex.*;
  6.  
  7. class Solution {
  8.  
  9. public static void main(String[] args) {
  10. try{
  11. int line=0;
  12. line=Integer.parseInt(br.readLine());
  13. for(int i=0;i<line;i++)
  14. {
  15. int n=Integer.parseInt(br.readLine());
  16. System.out.println(countPrime(ways(n)));
  17. }
  18. }
  19. catch(Exception e)
  20. {
  21.  
  22. }
  23. }
  24. static int ways(int n)
  25. {
  26. int way=1;
  27. for(int i=1;i<=n/4;i++)
  28. {
  29. way+=n-(4*i)+i;
  30. }
  31. return way;
  32. }
  33. static int countPrimes(int m)
  34. {
  35. int p=0;
  36. for(n=2;n<=m;n++)
  37. {
  38. if(isPrime(n))
  39. {
  40. p++;
  41. }
  42. }
  43. return p;
  44.  
  45. }
  46. static boolean isPrime(int n)
  47. {
  48. for(int i=2;i<n/2;i++)
  49. {
  50. if(n%i==0)
  51. return false;
  52. }
  53. return true;
  54. }
  55. }
Compilation error #stdin compilation error #stdout 0s 0KB
stdin
2
1
7
compilation info
Main.java:17: error: cannot find symbol
        	System.out.println(countPrime(ways(n)));
        	                   ^
  symbol:   method countPrime(int)
  location: class Solution
Main.java:37: error: cannot find symbol
    	for(n=2;n<=m;n++)
    	    ^
  symbol:   variable n
  location: class Solution
Main.java:37: error: cannot find symbol
    	for(n=2;n<=m;n++)
    	        ^
  symbol:   variable n
  location: class Solution
Main.java:37: error: cannot find symbol
    	for(n=2;n<=m;n++)
    	             ^
  symbol:   variable n
  location: class Solution
Main.java:39: error: cannot find symbol
    		if(isPrime(n))
    		           ^
  symbol:   variable n
  location: class Solution
5 errors
stdout
Standard output is empty