NowCoder小定律

题目：https://www.nowcoder.com/pat/2/problem/259

 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;
 const int maxn = ;
 int f[maxn];

 void db(){
     memset(f, , sizeof(f));
     f[] = ;
     f[] = ;
     f[] = ;
     for (int i = ; i < maxn; i++){
         if (f[i] == ){
             int j = i+i;
             while (j < maxn){
                 f[j] = ;
                 j += i;
             }
         }
     }
 }

 int main(){
     std:ios::sync_with_stdio(false);
     int x, y;
     db();
     while ((cin >> x >> y) && (x||y)){
         int n;
         bool ok = true;
         for (int i = x; i <= y; i++){
             n = i *i + i + ;
             if (f[n] == ){
                 ok = false;
                 break;
             }
         }
         if (ok){
             cout << "OK" << endl;
         }
         else
             cout << "Sorry" << endl;
     }
 //    system("pause");
     return ;
 }