本题主要是简单的贪心 + 素数筛变化为约数筛 注意是无穷个灯随着n进行变化
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define PII pair<int,int>
#define pdd pair<double,double>
#define db double
const ll N = 2e5 + 9, inf = 8e18;
int a[N];
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
ll n, x; cin >> n >> x;
ll cnt = 0;
for(ll i = 1; i * i <= x; i ++)
{
if(x % i == 0)
{
cnt ++;
//注意这里 x和n的关系不确定,必须判断
if(x / i != i && x / i < n)cnt ++;
}
}
if(cnt % 2 == 0)cout << "OFF" << '\n';
else cout << "ON" << '\n';
return 0;
}