fork download
copy 
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. #include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b)  for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x)   for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read()  (strtol(ipos,&ipos,10))
  23. #define sqr(x)  ((x)*(x))
  24. #define pb  push_back
  25. #define PS  system("pause");
  26. typedef long long   ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. int n,l,m,tmp,cnt,ans,p[1000008],f[1000008];
  34. void Work()
  35. {
  36.     scanf("%d%d",&n,&l);
  37.     rep(i,1,n)
  38.     {
  39.         scanf("%d",&m);cnt=0;tmp=0;
  40.         rep(i,1,(int)sqrt((double)m))if(m%i==0)
  41.         {
  42.             if(i>=l)p[++cnt]=i;
  43.             if(m/i>=l)p[++cnt]=m/i;
  44.         }
  45.         rep(i,1,cnt)tmp=max(f[p[i]],tmp);tmp++;
  46.         rep(i,1,cnt)f[p[i]]=tmp;
  47.     }
  48.     rep(i,1,100000)ans=max(ans,f[i]);
  49.     cout<<ans<<endl;
  50. }
  51. int main()
  52. {
  53. //  freopen((name+in).c_str(),"r",stdin);
  54. //  freopen((name+out).c_str(),"w",stdout);
  55. //  Init();
  56.     Work();
  57.     return 0;
  58. }
  59. 
Not running #stdin #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/0mIG1
language:
C++ (gcc 8.3)
created:
12 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!