Submission #52475663

---

Source Code Expand

#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=300+5,M=2000+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-8;const int INF=1e9+7;mt19937 rnd(181766);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
using LL=__int128;
pair<ll,ll> A[3];
vector<ll> pr;
int cnt[3];
LL ans;ll m;
vector<pair<ll,ll> > e[3];
ll qry(ll x,ll k,ll p){
	if(x<0) return 0;
	return min(k%p,x%p+1)+(k%p)*(x/p);
}
void dfs(int x,LL w){
	if(x==2){
		for(auto i:e[x]) ans+=A[x].fi/A[x].se*w*(i.se-i.fi+1);
		for(auto i:e[x]) ans+=(qry(i.se,A[x].fi,A[x].se)-qry(i.fi-1,A[x].fi,A[x].se))*w;
		return;
	}
	e[x+1]=e[x];dfs(x+1,A[x].fi/A[x].se*w);
	e[x+1].clear();
	for(auto i:e[x]){
		if(i.fi%A[x].se>A[x].fi%A[x].se) i.fi=(i.fi/A[x].se+1)*A[x].se;
		while(i.fi/A[x].se<i.se/A[x].se) e[x+1].emplace_back(i.fi,i.fi/A[x].se*A[x].se+A[x].fi%A[x].se-1),i.fi=(i.fi/A[x].se+1)*A[x].se;
		if(i.fi<=i.se) e[x+1].emplace_back(i.fi,min(i.se,i.se/A[x].se*A[x].se+A[x].fi%A[x].se-1));
	}
	dfs(x+1,w);
}
void Solve(){
	int i,j;for(int i:{0,1,2}) scanf("%lld%lld",&A[i].fi,&A[i].se),A[i].se+=A[i].fi;
	LL lm=1;for(int i:{0,1,2}) lm*=A[i].se/__gcd(lm,(LL)A[i].se);
	lm=(LL)A[0].se*A[1].se*A[2].se/lm;
	for(int i:{0,1,2}){
		ll x=A[i].se;
		for(int j=2;1ll*j*j<=x;j++) if(x%j==0){
			pr.emplace_back(j);while(x%j==0) x/=j;
		}
		if(x^1) pr.emplace_back(x);
	}
	for(ll p:pr){
		for(int i:{0,1,2}) {
			ll x=A[i].se;cnt[i]=0;
			while(x%p==0) cnt[i]++,x/=p;
		}
		int mx=*max_element(cnt,cnt+3),k=mx-(accumulate(cnt,cnt+3,0)-mx-*min_element(cnt,cnt+3));
		ll pw=1;while(k--) pw*=p;
		for(int i:{0,1,2}) if(cnt[i]==mx) A[i].se/=pw;
	}
	m=1;for(int i:{0,1,2}) m*=A[i].se/__gcd(A[i].se,m),gdb(A[i].se);
	sort(A,A+3,[](pair<ll,ll> x,pair<ll,ll> y){return x.se>y.se;});
	e[0].emplace_back(0,m-1);
	dfs(0,1);
	/*for(ll i=0;i<m;i++){
		LL mul=1;for(int j:{0,1,2}) mul*=(A[j].fi/A[j].se+(i%A[j].se<A[j].fi%A[j].se));
		ans+=mul;gdb((ll)mul);
	}*/
	printf("%lld\n",ll(ans*lm%mod));
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}

Submission Info

Compile Error

Main.cpp: In function ‘void Solve()’:
Main.cpp:53:13: warning: unused variable ‘i’ [-Wunused-variable]
   53 |         int i,j;for(int i:{0,1,2}) scanf("%lld%lld",&A[i].fi,&A[i].se),A[i].se+=A[i].fi;
      |             ^
Main.cpp:53:15: warning: unused variable ‘j’ [-Wunused-variable]
   53 |         int i,j;for(int i:{0,1,2}) scanf("%lld%lld",&A[i].fi,&A[i].se),A[i].se+=A[i].fi;
      |               ^
Main.cpp:53:41: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   53 |         int i,j;for(int i:{0,1,2}) scanf("%lld%lld",&A[i].fi,&A[i].se),A[i].se+=A[i].fi;
      |                                    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result