nahidcse05
BAN USERpublic class validphone {
public static void main(String[] args)
{
int n = 3;
int start = (int)Math.pow(10,n-1);
int end = (int)Math.pow(10,n) - 1;
for(int i=start; i<=end; i++)
{
char num[] = (i+"").toCharArray();
boolean flag = true;
for(int j=0; j<num.length;j++)
{
if(num[j]=='7' || num[j]=='8' || num[j]=='9')
{
flag = false;
break;
}
}
if(flag==true)
{
for(int j=0; j<num.length;j++)
{
if(num[j]=='4' && num[0]!='4')
{
flag=false;
break;
}
}
}
if(flag==true)
{
for(int j=1; j<num.length;j++)
{
if(num[j-1]==num[j])
{
flag = false;
break;
}
}
}
if(flag==true)
System.out.println(i);
}
}
}
- nahidcse05 June 06, 2015public class triangle {
public static void print(int[] a, int n)
{
if(a.length>0)
{
int tmp[] = new int[n-1];
for(int i=0; i<n;i++)
{
if(i+1<n)
tmp[i]=a[i]+a[i+1];
}
print(tmp,tmp.length);
System.out.print("{{");
for(int i=0; i<n;i++)
{
System.out.print(a[i]+",");
}
System.out.println("}}");
}
}
public static void main(String[] args)
{
int a[] = {4,7,3,6,7};
print(a,a.length);
}
}
- nahidcse05 June 06, 2015public class sumFactorNumber {
public static void main(String[] args){
for(int n = 2; n<=100; n++)
{
int sum = 1; //1 is the factor of all numbers
for(int i=2; i<n; i++)
{
if(n%i==0)
{
sum = sum + i;
}
}
if(sum==n)
System.out.println(n+"is sum factor");
}
}
}
public class mountainPoint {
public static void main(String[] args)
{
int matrix[][] = {{2,4,5,6,7},
{4,5,67,3,5},
{5,6,7,8,54},
{3,4,5,6,8},
{3,4,56,4,5}};
int m = matrix.length;
int n = matrix[0].length;
ArrayList<Integer> list = new ArrayList<Integer>();
for(int i=0; i<m; i++)
{
for(int j=0; j<n; j++)
{
if((i-1)>=0 && (i+1)<m && (j-1)>=0 && (j+1)<n)
{
if(matrix[i][j]>matrix[i-1][j-1]
&& matrix[i][j]>matrix[i-1][j]
&& matrix[i][j]>matrix[i-1][j+1]
&& matrix[i][j]>matrix[i][j-1]
&& matrix[i][j]>matrix[i][j+1]
&& matrix[i][j]>matrix[i+1][j-1]
&& matrix[i][j]>matrix[i+1][j]
&& matrix[i][j]>matrix[i+1][j+1])
{
System.out.println("Mountain Point:"+matrix[i][j]+"at index i:"+i+", "+j);
}
}
}
}
}
}
- nahidcse05 June 05, 2015public class encript {
public static void main(String[] arg){
String str = "aTce";
str = str.toUpperCase();
int n = 4;
for(int i=0; i<str.length(); i++)
{
int val = str.charAt(i) - 64;
val = val*n - 1;
if(val>26)
{
val = val%26;
}
char c = (char)(val+'a');
System.out.print(c);
}
}
}
- nahidcse05 June 05, 2015public class wordinMatrix {
public static boolean find(char[][] matrix, int[] index, char c)
{
for(int i=0; i<matrix.length; i++)
{
for(int j=0; j<matrix[i].length; j++)
{
if(matrix[i][j]==c)
{
index[0] = i;
index[1] = j;
return true;
}
}
}
return false;
}
public static void main(String[] args)
{
char matrix[][] = {{'n','a','h','i'},
{'o','u','i','f'},
{'n','t','d','a'},
{'e','i','e','e'}};
//String str = "nude";
String str = "none";
if(str.length()>4)
{
System.out.println("String is invalid");
return;
}
int [] index = new int [2];
if(find(matrix, index, str.charAt(0)))
{
System.out.println("Checking");
int i = index[0];
int j = index[1] + 1;
System.out.println(i+","+j);
boolean flag = true;
// col check
for(int k=1; j<matrix.length; j++,k++)
{
if(str.charAt(k)!=matrix[i][j])
{
flag = false;
break;
}
}
if(flag == true)
{
System.out.println("Found in Column");
return;
}
// row check
i = index[0] + 1;
j = index[1];
flag = true;
for(int k=1; i<matrix.length; i++,k++)
{
if(str.charAt(k)!=matrix[i][j])
{
flag = false;
break;
}
}
if(flag == true)
{
System.out.println("Found in Row");
return;
}
// diagonal check
flag = true;
i = index[0] + 1;
j = index[1] + 1;
for(int k=1; i<matrix.length && j<matrix.length; i++,j++,k++)
{
if(str.charAt(k)!=matrix[i][j])
{
flag = false;
break;
}
}
if(flag == true)
{
System.out.println("Found in Diagonal");
return;
}
}
}
}
public class balancedSparanthesis {
public static void main(String[] args)
{
String str = "(a{A}b[c])";
char[] arr = str.toCharArray();
Stack<Integer> first = new Stack<>();
Stack<Integer> second = new Stack<>();
Stack<Integer> third = new Stack<>();
boolean flag = true;
for(int i=0; i<str.length(); i++)
{
char tmp = str.charAt(i);
if(tmp=='(')
first.push(1);
else if(tmp==')')
{
if(first.isEmpty())
{
flag = false;
break;
}
else
first.pop();
}
if(tmp=='{')
second.push(1);
else if(tmp=='}')
{
if(second.isEmpty())
{
flag = false;
break;
}
else
second.pop();
}
if(tmp=='[')
third.push(1);
else if(tmp==']')
{
if(third.isEmpty())
{
flag = false;
break;
}
else
third.pop();
}
}
if(flag)
System.out.println("Balanced");
else
System.out.println("Not Balanced");
}
}
import java.util.ArrayList;
import java.util.Stack;
public class AdditiveNumbers{
public static void main(String[] args)
{
//int number = 123459;
//int number = 123456579;
int number = 123459729;
Stack<Integer> s = new Stack<Integer>();
int div = number;
int quotent = 0;
int number_digit = 0;
// calculating number of digits in the number
while(div!=0)
{
quotent = div%10;
s.push(quotent);
div = div/10;
number_digit++;
}
// inserting the number in the original format in array from stack
int num[] = new int [number_digit];
for(int i=0; i<number_digit;i++)
num[i] = s.pop();
//System.out.println(number_digit);
// calculating the number possible of digit we can allocate in each part i.e a can 1 of a can be 12
int i = 0;
ArrayList<Integer> list = new ArrayList<>();
for(i=1;i*3<=number_digit;i++)
{
int j = i*3;
if(number_digit%j==0)
list.add(i);
}
boolean flag = true;
for(int x=0; x<list.size(); x++)
{
i = list.get(x);
flag = true;
for(int j=0; j<num.length;)
{
int a=0,b=0,c=0;
for(int k=i-1; k>=0; k--)
{
a = (int) (a + Math.pow(10, k)*num[j++]);
}
for(int k=i-1; k>=0; k--)
{
b = (int) (b + Math.pow(10, k)*num[j++]);
}
for(int k=i-1; k>=0; k--)
{
c = (int) (c + Math.pow(10, k)*num[j++]);
}
System.out.println(a+" ,"+b+" ,"+c);
if(a+b!=c)
{
flag = false;
break;
}
}
if(flag==true)
break;
}
if(flag==true)
System.out.println("Yes");
else
System.out.println("No");
}
}
public class faulty {
public static void main(String[] args)
{
String given_password = "164";
String exp_password = "18684";
boolean flag = false;
for(Character i='0'; i<='9'; i++)
{
String possible_password = exp_password.replaceAll(i.toString(),"");
if(possible_password.equalsIgnoreCase(given_password))
{
System.out.println("Password Accepted");
flag = true;
break;
}
}
if(flag==false)
{
System.out.println("Password is incorrect");
}
}
}
- nahidcse05 June 04, 2015public class twoHalsves {
public static void main(String[] args)
{
int first = 31970;
int sec = 1000;
int div = first;
int quotent = 0;
int multiplier = 0;
int sum = 0;
int min = Integer.MAX_VALUE;
int part1 = 0, part2 = 0;
while(div!=0)
{
quotent = (int) (quotent + (div%10) * Math.pow(10, multiplier));
multiplier++;
div = (int)div/10;
sum = quotent+div;
if(sum<=sec)
{
int diff = sec - sum;
if(diff<min)
{
min = diff;
part1 = quotent;
part2 = div;
}
}
}
System.out.println("Parts:"+ part1+" "+part2);
}
}
- nahidcse05 June 06, 2015