Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream f("produs2.in");
- ofstream g("produs2.out");
- long long a[1000001];
- long long n,p,i,j,x,s,prod,st,dr,k;
- int main()
- {
- f>>n>>p;
- for(i=1;i<=n;++i)
- f>>a[i];
- st=1;
- dr=0;
- prod=1;
- while(prod*a[dr+1]<=p&&dr+1<=n)
- {
- ++dr;
- prod*=a[dr];
- }
- s+=(dr-st+1)*(dr-st+2)/2;
- while(dr<=n&&st<=n)
- {
- prod/=a[st];
- st++;
- while(prod*a[dr+1]<=p&&dr<n)
- {
- prod*=a[dr+1];
- dr++;
- s+=dr-st+1;
- }
- }
- g<<s;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement