题意:
解法:
设答案为x,那么需要满足:
x%2=1,
x%3=1,
x%4=1,
...
x%n=1.
容易想到x=lcm(2,3,...n)+1
code:
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxm=2e6+5;
int n;
int lcm(int a,int b){
return a/__gcd(a,b)*b;
}
void solve(){
cin>>n;
int lc=1;
for(int i=2;i<=n;i++){
lc=lcm(lc,i);
}
cout<<lc+1<<endl;
}
signed main(){
ios::sync_with_stdio(0);
solve();
return 0;
}