代码

#include <bits/stdc++.h>

using namespace std;

inline int rd()
{
	int x=0;bool f=0;char ch=getchar();
	while(ch<'0' || ch>'9') {if(ch=='-') f=1;ch=getchar();}
	while(ch>='0' && ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}

#define x first
#define y second
#define vec vector
#define mp make_pair
#define pb emplace_back
#define upb upper_bound
#define lowb lower_bound
#define isz(x) (int)x.size()
#define gmx(a,b) (a=max(a,b))
#define gmn(a,b) (a=min(a,b))
#define fil(a,x) memset(a,x,sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)

/*

*/

typedef __int128 i128;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef set<int>::iterator iter;
const int P=1e6+3,B=5000;

LL s(int x) {
	LL ans=0,pw=1;
	while(x>1) {
		// ans=(ans+pw*P)%P;
		pw=P-pw*(P/x)%P;
		x=P%x;
	}
	// cerr<<pw<<"\n";
	return pw;

	// return x<=1?1:P-P/x*s(P%x)%P;
	// if(x<=1) return 1;
	// return P-P/x*s(P%x)%P;
}
LL qmi(int x,int k=P-2) {LL res=1; while(k) {if(k&1) res=res*x%P; x=x*1ll*x%P,k>>=1;} return res;}

signed main()
{
	ull ans=0;
	double st=clock();
	rep(i,2,P) ans+=s(i);
	double ed=clock();
	cout<<ed-st<<' '<<ans<<" ms\n";

	return 0;
}

评测结果