I got wrong Answer in Test-Case 15.Can someone please tell me where i am getting it wrong ?
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ll n;
cin>>n;
ll gcd = 0;
while(n--)
{
ll m;
cin >> m;
ll num = 1;
vector <ll> getn(m);
for(int i = 0 ;i < m ;i++)
{
cin>>getn[i];
num = ( 1LL * (num % mod) * (getn[i] % mod) ) % mod;
}
gcd = __gcd(gcd , num) % mod;
}
cout<<gcd;
return 0;
}
created
last reply
- 4
replies
- 657
views
- 2
users
- 1
link