packagecom.diqijie.shengsai;
/**
*@authorleibaobao
* 煤球数目
* 解：100层为1+2+3....+100 = 5050
*/
publicclass_1 {
publicstaticvoidmain(String[] args) {
//TODOAuto-generated method stub
for(intj = i; j < 100; j++){
sum += j;
if(sum == 236)
System.out.println(i);
}
sum = 0;
}
}
}
packagecom.diqijie.shengsai;
importjava.util.HashSet;
/**
*@authorleibaobao
// TODO Auto-generated method stub
flag[n] = true;
for(int i = 0; i < 5; i++){
//加一减一要在同一行、加四减四要在同一列
if(!flag[i] && (a[i]/4 == a[n]/4) && (a[i] == a[n] - 1 || a[i] == a[n] + 1)){
*/
publicclass_5 {
publicstaticvoidf(int[] a,intk,intn, String s) {
if(k == a.length) {
if(n == 0)
System.out.println(s);
return;
}
String s2 = s;
for(inti = 0; i <= a[k]; i++) {
inttemp_2 = c*(d*100+e*10+f);
inttemp_3 = c*(g*100 +h*10 +i);
if((temp_1+temp_2)%temp_3 == 0)
if(a + (temp_1+temp_2)/temp_3 == 10){
count++;
}
}
}
System.out.println(count);
/**
*@authorleibaobao抽签
* 解：填代码题读懂即可,dfs
*/
publicclass_5 {
publicstaticvoidf(int[] a,intk,intn, String s) {
if(k == a.length) {
if(n == 0)
System.out.println(s);
// TODO Auto-generated method stub
boolean flag[] = new boolean[5];
dfs(flag,0);
return flag[0]&&flag[1]&&flag[2]&&flag[3]&&flag[4];
}
private static void dfs(boolean[] flag,int n) {
for(inta = 1; a < 10; a++)
for(intb = 1; b < 10; b++)
for(intc = 1; c < 10; c++)
for(intd = 1; d < 10; d++)
for(inte = 1; e < 10; e++)
for(intf = 1; f < 10; f++)
intsum = 0;
for(inti = 1; i <= 100; i++){
for(intj = 1; j <= i; j++)
sum += j;
}
System.out.println(sum);
}
}
packagecom.diqijie.shengsai;
/**
*@authorleibaobao
for(intg = 1; g < 10; g++)
for(inth = 1; h < 10; h++)
for(inti = 1; i < 10; i++)
{
if(a!=b&&a!=c&&a!=d&&a!=e&&a!=f&&a!=g&&a!=h&&a!=i&&
b!=c&&b!=d&&b!=e&&b!=f&&b!=g&&b!=h&&b!=i&&
publicstaticint[]n=newint[3];
publicstaticintmin;
return;
}
String s2 = s;
for(inti = 0; i <= a[k]; i++) {
f(a,k+1,5-s2.length(),s2);
s2 += (char) (k +'A');
}
}
publicstaticvoidmain(String[] args) {
int[] a = { 4, 2, 2, 1, 1, 3 };
importjava.util.Scanner;
/**
*@authorleibaobao
* 取球博弈
* 解：此解是错的要进行追踪更进的话，访问我博客
/u013993712/article/details/51163744
其他题均同，记得点赞哟
*/
publicclass_9 {
if(a[j] == 1)
continue;
a[j] = 1;
for(intk = j + 1; k < a.length; k++) {
if(a[k] == 1)
continue;
a[k] = 1;
System.out.println(s+" "+(char) (i +'A')+ (char) (j +'A') + (char) (k +'A') +" "+remain(a));// 填空位置
System.out.println(a +" "+ b +" "+ c +" "+ d);
breakout;
}
}
longtime1 = System.currentTimeMillis();
System.out.println(time1-time);
}
}
packagecom.diqijie.shengsai;
a[k] = 0;
}
a[j] = 0;
}
a[i] = 0;
}
}
publicstaticvoidmain(String[] args) {
int[] a =newint[9];
a[0] = 1;
for(intb = 1; b < a.length; b++) {
a[b] = 1;
for(intc = b + 1; c < a.length; c++) {
* 生日蜡烛
* 解：人最大也不过100岁，不要想太多。暴力一点
*/
publicclass_2 {
publicstaticvoidmain(String[] args) {
//TODOAuto-generated method stub
intsum = 0;
for(inti = 0; i < 100; i++){
f(a,k+1,5-s2.length(),s2);
s2 += (char) (k +'A');
}
}
publicstaticvoidmain(String[] args) {
int[] a = { 4, 2, 2, 1, 1, 3 };
f(a, 0, 5,"");
}
}
packagecom.diqijie.shengsai;
dfs(flag,i);
}
if (!flag[i] && (a[i]%4 == a[n]%4) && (a[i] == a[n] - 4 || a[i] == a[n] + 4)){
dfs(flag,i);
}
}
}
}
packagecom.diqijie.shengsai;
importjava.util.Scanner;
for(a[4] = a[3]+1; a[4] < 12; a[4]++)
if(jus()){
hashset.add(""+a[0]+a[1]+a[2]+a[3]+a[4]);