Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int a[10000] = {0};
- int prim(int n)
- {
- int k = 1;
- for(int i = 1; i<=n/2; i++)
- {
- if(n%i==0) k++;
- }
- return k;
- }
- int divmax(int n)
- {
- int k=0;
- for(int i = 1; i<=n; i++)
- {
- if(n%i==0 && prim(i) == 2) k=i;
- }
- return k;
- }
- int main()
- {
- int n, c, x;
- cin>>n>>c;
- if(c==1)
- {
- for(int i=0; i<n; i++)
- {
- cin>>x;
- a[i]=divmax(x);
- cout<<a[i]<<' ';
- }
- int s, maxim = 0;
- for(int i = 0; i<n; i++)
- {
- for(int j = n-1; j>=0; j--)
- {
- if(a[i] == a[j])
- {
- s=j-i+1;
- if(maxim<s) maxim=s;
- }
- }
- }
- cout<<endl;
- cout<<maxim;
- }
- if(c==2)
- {
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement