初级守护
#include<iostream>
using namespace std;
int main(){
long long sum=1;
int m,n;
cin>>m>>n;
for(int i=m;i<=n;i++){
sum*=i;
}
cout<<sum;
return 0;
}
初级守护
good
初级守护
2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsb2bsbvv2bsbvvv2bsbvv2bsb
