对十求余常用求这个的个位数是duo's

  

static（修饰符）  静态方法

static void Hain(string[] args){
//m≤n
string str = Console.ReadLine();

string[] strArray = str.Split("");
int[] intArray =new int[strArray.Length];

for (int j =0; j< strArray.Length; j++）{
int number= Convert.Toint32(strArray[j];

intArray[j] = number;
}

int m = intArray[0];

int n = intArray[1];

for(int i =m;i<n+1;i++)// m -n range 

{

  bool isSu = true;

   for(int j=2;j<i;j++)// 2~i-1

   {

        if(i %j ==0)

        {

           isSu = false;

           break;

           }

}

if (isSu)

{

    int temp = i;

    int number = 0;

   while ( temp %10 !=0)//余数不等于0

   {

       number = number*10+temp%10;

       temp = temp /10;

         }

bool isSuFan = true;

   for(int j=2;j<number;j++) 

   {

        if(number %j ==0)

        {

           isSuFan = false;

           break;

           }

}

if(isSuFan == true)

{

     Console .write( number);

}

}

}

 

 

方法的修饰符： static

修饰符 static  静态修饰符

static int add3(int a,int b)

//函数修饰符 返回值 函数名/方法名 参数

 

取得反序

426  （6*10+2）*10+4

624

int temp=i;

int number=0;

while(temp%10!=0)

{

number=number*10+temp%10;

temp=temp\10;

}

void 空

static 静态

 

函數-返回值-方法名-參數

staic 靜態的  修飾浮

素数，除以2到自身减一的数没有等于0的数，使用for循环套if判断去确定，即i<n-1;判断if(n%i == 0)之后return 

static void Main(string[] args)
        {
            //区间内的真素数
            bool isPrime = false;
            string str = Console.ReadLine();
            string[] num = str.Split(' ');
            int mix = Convert.ToInt32(num[0]);
            int max = Convert.ToInt32(num[1]);

            for (int i = mix; i <= max; i++)
            {

                for (int j = 2; j < i; j++)
                {
                    if (i % j == 0)
                    {
                        isPrime = false;
                        break;
                    }
                    //取反
                    //642   642%10  4，，24  
                    int temp = i;
                    int number = 0;
                    while (temp % 10 != 0)
                    {
                        number = number * 10 + temp % 10;
                        temp = temp / 10;
                    }

                    for (int t = 2; t < number; t++)
                    {
                        if (number % t == 0)
                        {
                            isPrime = false;
                            break;
                        }
                        else
                        {
                            isPrime=true;
                        }

                    }
                }
                if (isPrime == true)
                {
                    Console.WriteLine(i + "是真素数！");
                }
            }
        }