TECH FOR U

import java.util.*; import java.lang.*; import java.io.*; class GFG { public static void main (String[] args) { Scanner s=new Scanner(System.in); int t=s.nextInt(); for(int i=0;i<t;i++) {     int a=s.nextInt();     int b=s.nextInt();     int k=s.nextInt();     int p=(int)Math.pow(a,b);     int count=0;     while(p>0 && count<k)     {         int rem=p%10;         count++;         if(count==k)         System.out.println(rem);         p=p/10;     } } } }

import java.util.Scanner; import java.lang.Math; class GP { public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println("enter how many text cases do you want"); int t=s.nextInt(); double a,b; int c,f; double r,n; for(int i=0;i<t;i++) {    System.out.print("first two term"); a=s.nextInt(); b=s.nextInt(); System.out.println("enter which term to find"); c=s.nextInt(); r=b/a; n=a*(Math.pow(r,(c-1)));               f=(int) Math.floor(n); System.out.println("n'th term ="+f); } } }

import java.util.Scanner; class Ap { public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println("enter how many text cases do you want"); int t=s.nextInt(); int a,b,c,d,n; for(int i=0;i<t;i++) {    System.out.print("first two term"); a=s.nextInt(); b=s.nextInt(); System.out.println("enter which term to find"); c=s.nextInt(); d=b-a; n=a+(c-1)*d; System.out.println("n'th term ="+n); } } }

import java.util.*; import java.lang.Math; import java.io.*; class GFG { public static void main (String[] args) { Scanner s =new Scanner(System.in);     System.out.println("enter how many text cases do you want"); int n =s.nextInt(); int sum=0,rem,cube,temp;     for(int i=0;i<n;i++)     {int x=s.nextInt();      temp=x;         while(x!=0)         {              rem =x%10;              cube=(int) Math.pow(rem,3);             sum =sum +cube;             x=x / 10;         }         if(sum ==temp)         System.out.println("YES");         else         System.out.println("NO");     } //code } }