TECH FOR U

Given a string,  , matching the regular expression  [A-Za-z !,?._'@]+ , split the string into  tokens . We define a token to be one or more consecutive English alphabetic letters. Then, print the number of tokens, followed by each token on a new line. Note:  You may find the  String.split  method helpful in completing this challenge. Input Format A single string,  . Constraints  is composed of  any  of the following: English alphabetic letters, blank spaces, exclamation points ( ! ), commas ( , ), question marks ( ? ), periods ( . ), underscores ( _ ), apostrophes ( ' ), and at symbols ( @ ). Output Format On the first line, print an integer,  , denoting the number of tokens in string   (they  do not  need to be unique). Next, print each of the   tokens on a new line in the same order as they appear in input string  . Sample Input He is a very very good boy, isn't he? Sample Output 10 He is a very very good

import java.util.Scanner; class PrintPrime { public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println("enter no to print prime no "); int n =s.nextInt(); int i,j; for( i=2;i<n;i++) { for(j=2;j<i;j++) if(i%j==0) { break; } if(i==j) System.out.println(i); } } } 

import java.util.Scanner; class PrimeDemo { public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println("enter no to check prime "); int n =s.nextInt(); int i; for( i=2;i<n;i++) { if(n%i==0) { System.out.println("no is not prime "); break; } } if(n==i) { System.out.println("no is prime "); } } }

import java.util.Scanner; class ReverseNumber { public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println("enter no to reverse"); int n=s.nextInt(); int x,r=0; while(n>0) {            x=n%10;            r=10*r+x;            n=n/10; } System.out.println("reverse of no" + r); } }