java ÕÒ³ö4λÊýµÄËùÓÐÎüѪ¹íÊý×Ö
/**
* ÕÒ³öËÄλÊýËùÓеÄÎüѪ¹íÊý×Ö
* ÎüѪ¹íÊý×Ö£ºÎ»ÊýΪżÊýµÄÊý×Ö¿ÉÒÔÓÉÒ»¶ÔÊý×ÖÏà³Ë¶øµÃ£¬Õâ¶ÔÊý×Ö°üº¬³Ë»ýÒ»°ëµÄλÊý
* È磺1260 = 21*60
*/
public class Vampire {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String s="";
for(int i=1; i<10; i++){
for(int j=0; j<10; j++){
s += (10*i+j)+" ";
}
}
System.out.println(s);
String[] arr = s.split(" ");
System.out.println("Á½Î»ÊýµÄ¸öÊýΪ£º"+arr.length);
int a,b;
int count=0;
for(int j=0; j<arr.length; j++){
for(int k=0; k<arr.length; k++){
a = Integer.valueOf(arr[j]).intValue();
b = Integer.valueOf(arr[k]).intValue();
//ΪÄÜÒÔÁ½¸ö0½áβ
if(a*b<10000 && a*b>1000 && (a*b)%100!=0){
count++;
System.out.print(arr[j]+"_"+arr[k]+" ");
}
}
System.out.println();
}
System.out.println("the total number is "+count); //6370
}
}
Ïà¹ØÎĵµ£º
Ô´´úÂ룺
import com.sap.mw.jco.*;
public class control extends Object
{
public static void main (String str[])
{
control control=new control();
}
int count;
JCO.Client mConnection;
JCO.Repository mRepository;
String[] SAPInterfaces;
public control()
{
try {
& ......
Java
鍼뱎˜
MC
ËùÓÐ
ITEM
1
¡¢
mc
±éÀú
item
ÔÀí
Mc
±éÀú
item
Óõ½µÄÃüÁîÓÐÈý¸ö£º
stats items
£¬
stats cachedump, get
¡£Í¨¹ý
telnet
³ÌÐò
telnet
µ½
mc
·þÎñÆ÷ÉÏ£¨
telnet ip
µØÖ·
¶Ë¿ÚºÅ£¬Èç
telnet 192.168.0.1 11211
£©£¬ÒÀ´ÎÖ ......
1.Ê×ÏÈ´´½¨Ò»¸ö¹¤³ÌËæ±ãÃüÃû¡£
2.´´½¨Ò»¸öÀàÃüÃûΪReg.
3.Ö´ÐдúÂë
4.ÊäÈë×¢²áµÄÐÕÃû£¬ÏÔʾÀ¸Ä¿»á³öÏÖplease input register name:£¬Ö»ÒªÊäÈëÓ¢ÎÄÃûÈ»ºó»Ø³µ£¬×¢²áÂë¾Í³öÀ´ÁË¡£°ÑÐÕÃûºÍ×¢²áÂëÏñ£º
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public clas ......
public class FindPrime {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int num = 100;
String s = "100ÒÔÄÚµÄËØÊý£º";
for (int i = 1; i <= num; i++) {
int count = 0;
for (int j = 1; j <= (int) Math.s ......
public class Fibonacci {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
NumOfFibonacci(9);
}
public static int MyFibonacci(int i){
if(i>0) {
if(i == 1)return 1;
if(i == 2)return 1;
else return MyFibonacc ......