Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()//Найти количество пар, произведение которых кратно 58
- {
- int n,i,k,a,max,k29,k58,n58,k2;
- cin>>n;
- for(i=0;i<n;i++)
- {
- cin>>a;
- if(a%58==0)
- k58++;
- else
- if(a%29==0)
- k29++;
- if(a%2==0)
- k2++;
- }
- n58=n-k58;
- max=k29*k2+n58*k58+k58*(k58-1)/2;
- cout<<max;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement