This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//struct Edge {int u, v, weight;bool operator<(Edge const& other) {return weight < other.weight;}};
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long
#define sp ' '
#define pb push_back
#define ar for(int i=1;i<=n;i++)
using namespace std;
ll t=1;
const ll N=3e5+100;
ll n,m,q,k;
ll a[N],b[N],c[N];
void solve()
{
cin>>n>>m;
while(m--)
{
char c;
cin>>c;
if(c=='S'){ll x;cin>>x;a[x]=abs(a[x]-1);}
else
{
ll l,r;cin>>l>>r;
bool ok=false;
for(int i=2;i<=r;i++)
{
ll num=0;
for(int j=i;j<=r;j+=i){if(a[j]&&j>=l&&j<=r){num++;}}
if(num>=2){ok=true;}
}
if(ok){cout<<"DA"<<endl;}
else{cout<<"NE"<<endl;}
}
}
return;
}
int main()
{
//freopen("shell.in", "r", stdin);
// freopen("shell.out", "w", stdout);
ios::sync_with_stdio(NULL);
cin.tie(NULL);cout.tie(NULL);
// cin>>t;
while(t--){solve();}
return 0;
}
//09:00 :: 9:45
//10:30 ::
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |