http://hihocoder.com/contest/ntest2016spring1/problem/1
提交已经关闭,也不知道做的对不对,花了一晚上,测试过了用例
import java.util.HashMap;
import java.util.Scanner;
/**
* @author jun
* */
public class Main {
public static void main(String[] args){
Scanner input = new Scanner(System.in);
//编码表
int[][] table=new int[][]
{
{1,1,1,0,1,1,1},
{0,0,1,0,0,1,0},
{1,0,1,1,1,0,1},
{1,0,1,1,0,1,1},
{0,1,1,1,0,1,0},
{1,1,0,1,0,1,1},
{1,1,0,1,1,1,1},
{1,0,1,0,0,1,0},
{1,1,1,1,1,1,1},
{1,1,1,1,0,1,1}
};
int S=input.nextInt();
for(int i=0;i map = new HashMap();
for(int l=0;l<10;l++){
map.put(l, 0);
}
// System.out.println(tmp);
for(int l=0;l=0) {tmp=tmp*equal[l];l--;};
l=j+1;
while(l<=K) {tmp=tmp*total[l];l++;};
result+=tmp;
}
}
System.out.println(result);
}
input.close();
}
}