zoukankan      html  css  js  c++  java
  • 杭电ACM 2012

    #include<stdio.h>
    #include<math.h>

    int
    main()
    {

        int
    i, j, n, x, y, t;
        while
    (scanf("%d%d",&x,&y)!=EOF)
        {
       
            if
    (x==0&&y==0)
            {

                continue
    ;
            }

            j=0;
            for
    (i=x;i<=y;i++)
            {

                t=i*i+i+41;

                    for
    (n=2;n<=sqrt(t);n++)
                    {

                        if
    (t%n==0)
                        {

                            j+=1;
                            break
    ;
                        }

                        else

                        {

                            j=j;
                        }
                   
                    }
               
               
                }

                if
    (j==0)
                {

                    printf("OK\n");
                   
                }

                else

                {

                    printf("Sorry\n");
                }
           
       
        }



        return
    0;
    }

  • 相关阅读:
    雷锋依然在人间 工厂方法模式
    为别人做嫁衣 代理模式
    穿什么有这么重要? 装饰模式
    437. Path Sum III
    434. Number of Segments in a String
    447. Add Strings
    414. Third Maximum Number
    412. Fizz Buzz
    404. Sum of Left Leaves
    405. Convert a Number to Hexadecimal
  • 原文地址:https://www.cnblogs.com/lMercury/p/2963599.html
Copyright © 2011-2022 走看看