/**
 * 利用栈演示二进制数转十进制
 */
package com.test;
import java.util.Scanner;
import java.util.Stack;

public class jinzhizhuanhuan {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		System.out.println("请输入二进制数");
		Scanner scan=new Scanner(System.in);
		String str=scan.next();
		char ch[]=str.toCharArray();
		int ar[]=new int[ch.length];
		//调用栈
		  Stack<Integer> stack=new Stack<Integer>();
		for (int i = 0; i < ch.length; i++) {
			ar[i]=Integer.parseInt(String.valueOf(ch[i]));
//			System.out.println(ar[i]);
			stack.push(ar[i]);
		}
		int sum=0;
		for (int i = 0; i < ar.length; i++) {
			sum+=stack.pop()*Math.pow(2, i);
		}
		System.out.println("转换为十进制是\n"+sum);	  
	}
}