牛客练习赛48

A:小w的a+b问题

#include 
 
using namespace std;
 
int main() 
{
    int n;
    scanf("%d", &n);
    if(n == -1) 
        puts("No solution"); 
    else 
        printf("%d %d\n", 2147483647, 2147483649 + n);
}

小w的a=b问题

#include
#include
#define p1 998244353
#define p2 1000000009
#define ll long long
ll func1[100100],func2[100100];
int main()
{
    func1[0]=1,func2[0]=1;
    for(int i=1;i<=100000;++i)
        func1[i]=func1[i-1]*i%p1,func2[i]=func2[i-1]*i%p2;
    int T,n,m;
    scanf("%d",&T);
    while(T--)
    {
        ll x;
        scanf("%d%d",&n,&m);
        ll a1=1,a2=1;
        for(int i=1;i<=n;++i)
        {
            scanf("%lld",&x);
            a1=a1*func1[x]%p1;
            a2=a2*func2[x]%p2;
        }
        ll b1=1,b2=1;
        for(int i=1;i<=m;++i)
        {
            scanf("%lld",&x);
            b1=b1*func1[x]%p1;
            b2=b2*func2[x]%p2;
        }
        if(b1==a1&&b2==a2)
            puts("equal");
        else
            puts("unequal");
    }
    return 0;
}