ABC-DEF

传送门

题目描述:

输入:

 2 3 5 1 2 4

输出:

22

输入:

1 1 1000000000 0 0 0

输出:

1755647

输入:

1000000000000000000 1000000000000000000 1000000000000000000 1000000000000000000 1000000000000000000 1000000000000000000

输出:

0

思路:

由于本题数据量较大,所以我们将每个数都对998244353取模,防止最后出现负数,将最后结果加上998244353再对998244353取模即可。

代码:

#include<iostream>
using namespace std;
#define ll long long

int main()
{
	ll a,b,c,d,e,f;
	cin>>a>>b>>c>>d>>e>>f;
	a%=998244353;
	b%=998244353;
	c%=998244353;
	d%=998244353;
	e%=998244353;
	f%=998244353;
	a=(a*b)%998244353;
	ll q=(a*c)%998244353;
	d=(d*e)%998244353;
	ll w=(d*f)%998244353;
	cout<<(q-w+998244353)%998244353;
	return 0;
}