提交时间:2025-10-08 14:00:25
运行 ID: 38425
#include <bits/stdc++.h> #define int long long using namespace std; int n,m; int ans=0,lans; int tg; void dfs(int dq,int lst){ if (dq==1){ lans++; return ; } if (dq<lst){ return ; } for (int ys=lst;ys<=dq;ys++){ if (ys>m) break; if (dq%ys==0){ dfs(dq/ys,ys); } } } signed main(){ // freopen("factor.in","r",stdin); // freopen("factor.out","w",stdout); ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin>>n>>m; for (int i=2;i<=n;i++){ lans=0; dfs(i,2); ans=ans^lans; // cout<<lans<<"\n"; } cout<<ans<<"\n"; return 0; }