Download as txt, pdf, or txt
Download as txt, pdf, or txt
You are on page 1of 6

Fibanocci series

import java.util.*;
public class Main
{
public static void main(String[] args)
{
int a=0,b=1,c,count=10;
System.out.println(a+"\n"+b);
for (int i=0;i<count;i++)
{
c=a+b;
System.out.println(c);
a=b;
b=c;
}
}
}

------------------------------------------------------------------------
Prime number or not

import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n,flag=0;
n=sc.nextInt();
for(int i=2;i<=n/2;i++)
{
if(n%i==0)
{
flag=1;
break;
}

}
if(flag==1 || n==1 || n==0)
{
System.out.println("Not Prime");
}
else
{
System.out.println("Prime");
}
}
}

--------------------------------------------------------------------
Palindrome

import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n,sum=0,r;
n=sc.nextInt();
int temp=n;
while(n>0)
{
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
if(sum==temp)
{
System.out.println("Palindrome");
}
else
{
System.out.println("Not a Palindrome");
}
}
}

----------------------------------------------------------------------------

reverse a number

import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n;
n=sc.nextInt();
int rev=0,r;
while(n!=0)
{
r=n%10;
rev=rev*10+r;
n=n/10;
}
System.out.println(rev);
}
}

------------------------------------------------------------------------------
factorial

import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int fact=1;
for(int i=1;i<=n;i++)
{
fact=fact*i;
}
System.out.println(fact);
}
}

------------------------------------------------------------------------------

gcd

import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int a=sc.nextInt();
int b=sc.nextInt();
int gcd=1;
for(int i=1;i<=a && i<=b;i++)
{
if(a%i==0 && b%i==0)
{
gcd=i;
}
}
System.out.println(gcd);
}
}

--------------------------------------------------------------------------------
perfect number

import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n;
n=sc.nextInt();
int sum=0;
for(int i=1;i<=n/2;i++)
{
if(n%i==0)
{
sum=sum+i;
}
}
if(sum==n)
{
System.out.println("perfect number");
}
else
{
System.out.println("Not perfect");
}
}
}

----------------------------------------------------------------
two strings anagram or not
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
String s1,s2;
s1=sc.next();
s2=sc.next();
if(s1.length()!=s2.length())
{
System.out.println("not anagram");
}
else
{
char[] str1=s1.toCharArray();
char[] str2=s2.toCharArray();
Arrays.sort(str1);
Arrays.sort(str2);
if(Arrays.equals(str1,str2)==true)
{
System.out.println("anagram");
}
else
{
System.out.println("not anagram");
}
}
}
}

---------------------------------------------------------------
string palindrome or not

import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
String s=sc.next();
String rev="";
for(int i=(s.length())-1;i>=0;i--)
{
rev=rev+s.charAt(i);
}
if(s.equals(rev))
{
System.out.println("palindrome");
}
else
{
System.out.println("not palindrome");
}
}
}

-------------------------------------------------------------------
string frequency

import java.util.*;
public class Main
{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String s=sc.next();
int[] freq=new int[s.length()];
int i,j;
char str[]=s.toCharArray();
for(i=0;i<s.length();i++) {
freq[i]=1;
for(j=i+1;j<s.length();j++) {
if(str[i]==str[j]) {
freq[i]++;
str[j]='0';
}
}
}
for(i=0;i<freq.length;i++) {
if(str[i]!=' ' && str[i]!='0')
System.out.println(str[i]+ "-" +freq[i]);
}
}
}

-------------------------------------------------------------------------
frequency of a number

import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n;
n=sc.nextInt();
int a[]=new int[100];
int i;
while(n!=0)
{
int x=n%10;
a[x]+=1;
n=n/10;
}
for(i=0;i<10;i++)
{
if(a[i]!=0)
{
System.out.println(i+"-"+a[i]);
}
}

}
}

You might also like