SHARE
TWEET

UGABUGA

a guest Oct 22nd, 2019 88 in 134 days
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. #include <iostream>
  2. #include <vector>
  3. #include <string>
  4. #include <bits/stdc++.h>
  5. unsigned long long find_lcm(std::vector<unsigned long int> args);
  6. unsigned long long gcd(unsigned long int a,unsigned long long b)
  7. {
  8.     if(b==0)
  9.     {
  10.         return a;
  11.     }
  12.     return gcd(b,a%b);
  13. }
  14. int main()
  15. {
  16. unsigned int counter=0;
  17. std::cin>>counter;
  18. std::vector<unsigned long int> numbers;
  19. for(int i=0;i<counter;i++)
  20. {
  21. unsigned long int temp;
  22. std::cin>>temp;
  23. numbers.push_back(temp);
  24. }
  25. unsigned int iterator=0;
  26. while(iterator+1<=numbers.size())
  27. {
  28. if(numbers[iterator]%2==1)
  29. {
  30. std::cout<<"\nNIE";
  31. }
  32. else if(std::to_string(numbers[iterator]).back()=='8')
  33. {
  34. std::cout<<"\nNIE";
  35. }
  36. else
  37. {
  38. }
  39. iterator++;
  40. }
  41. return 0;
  42. }
  43. unsigned long long find_lcm(std::vector<unsigned long int> args)
  44. {
  45.     unsigned long long result=args[0];
  46.     for(int i=1;i<args.size();i++)
  47.     {
  48.         result=
  49.     }
  50. }
  51. void printDivisors(unsigned long int n)
  52. {
  53.     // Note that this loop runs till square root
  54.     for (unsigned int i=1; i<=sqrt(n); i++)
  55.     {
  56.         if (n%i == 0)
  57.         {
  58.             // If divisors are equal, print only one
  59.             if (n/i == i) {}
  60.                 //printf("%d ", i);
  61.  
  62.             else{} // Otherwise print both
  63.                 //printf("%d %d ", i, n/i);
  64.         }
  65.     }
  66. }
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
 
Top