#564242 (C++14) No.1253 雀見椪

• 問題: No.1253 雀見椪
• ユーザー: kotatsugame
• 提出日時: 2020-10-09 21:38:55
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 67 ms / 2,000 ms
• コード長: 2,485 bytes
• コンパイル時間: 653 ms
• コンパイル使用メモリ: 69,888 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-20 09:53:49
• 合計ジャッジ時間: 2,112 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	7 ms; 5,376 KB
testcase_04	AC	64 ms; 5,376 KB
testcase_05	AC	63 ms; 5,376 KB
testcase_06	AC	63 ms; 5,376 KB
testcase_07	AC	63 ms; 5,376 KB
testcase_08	AC	64 ms; 5,376 KB
testcase_09	AC	64 ms; 5,376 KB
testcase_10	AC	65 ms; 5,376 KB
testcase_11	AC	67 ms; 5,376 KB
testcase_12	AC	65 ms; 5,376 KB
testcase_13	AC	63 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB

コンパイルメッセージ

a.cpp:6:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]

ソースコード

#line 1 "a.cpp"
#include<iostream>
using namespace std;
#line 3 "/home/kotatsugame/library/math/modint.cpp"
#include<utility>
template<int m>
struct modint{
	unsigned int x;
	constexpr modint()noexcept:x(){}
	constexpr modint(long long _x)noexcept:x((_x%=m)<0?_x+m:_x){}
	constexpr unsigned int val()const noexcept{return x;}
	constexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}
	constexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}
	constexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}
	constexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}
	constexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}
	constexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}
	constexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}
	constexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}
	constexpr modint operator+()const noexcept{return*this;}
	constexpr modint operator-()const noexcept{return modint()-*this;}
	constexpr modint pow(long long n)const noexcept
	{
		if(n<0)return pow(-n).inv();
		modint x=*this,r=1;
		for(;n;x*=x,n>>=1)if(n&1)r*=x;
		return r;
	}
	constexpr modint inv()const noexcept
	{
		int s=x,t=m,x=1,u=0;
		while(t)
		{
			int k=s/t;
			s-=k*t;
			swap(s,t);
			x-=k*u;
			swap(x,u);
		}
		return modint(x);
	}
	friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}
	friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}
	friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}
	friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}
	friend constexpr modint operator==(const modint&a,const modint&b){return a.x==b.x;}
	friend constexpr modint operator!=(const modint&a,const modint&b){return a.x!=b.x;}
	friend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}
	friend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}
};
#line 4 "a.cpp"
using mint=modint<(int)1e9+7>;
int T;
main()
{
	cin>>T;
	for(;T--;)
	{
		long N;
		mint A[3],B[3];
		cin>>N;
		for(int i=0;i<3;i++)cin>>A[i]>>B[i];
		mint all=B[0]*B[1]*B[2];
		A[0]*=B[1]*B[2];
		A[1]*=B[0]*B[2];
		A[2]*=B[0]*B[1];
		cout<<1-((A[0]+A[1]).pow(N)+(A[1]+A[2]).pow(N)+(A[2]+A[0]).pow(N)-2*(A[0].pow(N)+A[1].pow(N)+A[2].pow(N)))/all.pow(N)<<endl;
	}
}