Submission #67541854

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF=0x3f3f3f3f;
const ll LLINF=0x3f3f3f3f3f3f3f3fLL;
const int MAX=5e5+10;
const int mod=998244353;
int main()
{
	ll n,x,l,r,ans,inv2;
	inv2=(mod+1)/2;
	scanf("%lld",&n);
	x=n%mod;
	ans=(1+x)*x%mod*inv2%mod;
	for(l=1;l<=n;l=r+1)
	{
		r=n/(n/l);
		ans-=((r-l+1)%mod)*((n/l)%mod);
		ans%=mod;
	}
	if(ans<0) ans+=mod;
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task E - Count A%B=C
User tokitsukaze
Language C++ 20 (gcc 12.2)
Score 475
Code Size 486 Byte
Status AC
Exec Time 18 ms
Memory 3868 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:13:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   13 |         scanf("%lld",&n);
      |         ~~~~~^~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 475 / 475
Status
AC × 3
AC × 56
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt, 01-47.txt, 01-48.txt, 01-49.txt, 01-50.txt, 01-51.txt, 01-52.txt, 01-53.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 1 ms 3868 KiB
00-sample-02.txt AC 1 ms 3868 KiB
00-sample-03.txt AC 12 ms 3640 KiB
01-01.txt AC 1 ms 3800 KiB
01-02.txt AC 1 ms 3808 KiB
01-03.txt AC 1 ms 3664 KiB
01-04.txt AC 1 ms 3644 KiB
01-05.txt AC 1 ms 3644 KiB
01-06.txt AC 1 ms 3732 KiB
01-07.txt AC 1 ms 3804 KiB
01-08.txt AC 1 ms 3572 KiB
01-09.txt AC 1 ms 3736 KiB
01-10.txt AC 1 ms 3672 KiB
01-11.txt AC 1 ms 3800 KiB
01-12.txt AC 1 ms 3808 KiB
01-13.txt AC 1 ms 3804 KiB
01-14.txt AC 1 ms 3616 KiB
01-15.txt AC 18 ms 3640 KiB
01-16.txt AC 18 ms 3668 KiB
01-17.txt AC 18 ms 3676 KiB
01-18.txt AC 18 ms 3644 KiB
01-19.txt AC 18 ms 3748 KiB
01-20.txt AC 18 ms 3748 KiB
01-21.txt AC 18 ms 3864 KiB
01-22.txt AC 18 ms 3864 KiB
01-23.txt AC 18 ms 3644 KiB
01-24.txt AC 18 ms 3732 KiB
01-25.txt AC 18 ms 3680 KiB
01-26.txt AC 18 ms 3808 KiB
01-27.txt AC 18 ms 3620 KiB
01-28.txt AC 1 ms 3868 KiB
01-29.txt AC 1 ms 3740 KiB
01-30.txt AC 1 ms 3748 KiB
01-31.txt AC 1 ms 3868 KiB
01-32.txt AC 1 ms 3640 KiB
01-33.txt AC 1 ms 3864 KiB
01-34.txt AC 1 ms 3640 KiB
01-35.txt AC 1 ms 3652 KiB
01-36.txt AC 1 ms 3864 KiB
01-37.txt AC 1 ms 3748 KiB
01-38.txt AC 1 ms 3624 KiB
01-39.txt AC 1 ms 3680 KiB
01-40.txt AC 2 ms 3728 KiB
01-41.txt AC 2 ms 3752 KiB
01-42.txt AC 13 ms 3676 KiB
01-43.txt AC 14 ms 3804 KiB
01-44.txt AC 4 ms 3804 KiB
01-45.txt AC 17 ms 3860 KiB
01-46.txt AC 7 ms 3752 KiB
01-47.txt AC 1 ms 3864 KiB
01-48.txt AC 8 ms 3648 KiB
01-49.txt AC 3 ms 3804 KiB
01-50.txt AC 11 ms 3620 KiB
01-51.txt AC 13 ms 3624 KiB
01-52.txt AC 3 ms 3732 KiB
01-53.txt AC 16 ms 3676 KiB