Advertisement
Guest User

Untitled

a guest
Jan 25th, 2020
92
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.78 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std ;
  3. #define ll long long
  4.  
  5. ll lcm(ll a, ll b)
  6. {
  7. return a/__gcd(a,b) *b;
  8. }
  9. int main ()
  10. {
  11. int t;
  12. scanf("%d",&t);
  13. int a[3000];
  14. while (t--)
  15. {
  16. int n ;
  17. scanf("%d",&n);
  18. for (int i =0 ; i <n ; i ++)
  19. {
  20. scanf("%d",a+i);
  21. }
  22. int ans =0 ;
  23. for (int i =0 ; i < n ; i ++ )
  24. {
  25. ll sum =0 ;
  26. ll tot_lcm = 1;
  27. for (int j =i ; j< n ; j++)
  28. {
  29. sum += a[j];
  30. tot_lcm = lcm(tot_lcm, a[j]);
  31. if( tot_lcm > (1ll<<30)*(n-i) )
  32. break;
  33. ans += (sum % tot_lcm == 0);
  34. }
  35. }
  36. printf("%d\n",ans );
  37.  
  38. }
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement