Advertisement
Guest User

Untitled

a guest
May 25th, 2018
87
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.39 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. int main()//Найти количество пар, произведение которых кратно 58
  4. {
  5. int n,i,k,a,max,k29,k58,n58,k2;
  6. cin>>n;
  7. for(i=0;i<n;i++)
  8. {
  9. cin>>a;
  10. if(a%58==0)
  11. k58++;
  12. else
  13. if(a%29==0)
  14. k29++;
  15. if(a%2==0)
  16. k2++;
  17. }
  18. n58=n-k58;
  19. max=k29*k2+n58*k58+k58*(k58-1)/2;
  20. cout<<max;
  21. return 0;
  22. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement