Advertisement
J00ker

(10-23)T

Oct 22nd, 2014
34
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.73 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3.  
  4. using namespace std;
  5.  
  6. //b
  7. int VeriFib(int n, int p, int p2)
  8. {
  9. if(n <= 1)
  10. {
  11. if(n == 1) return n;
  12. else return 0;
  13. }
  14. else return VeriFib(n-p, p2, p+p2);
  15. }
  16.  
  17. //c
  18. int NrDiv(int n, int d, int nrd)
  19. {
  20. if(n == 1) return nrd+1;
  21. else if(n % d == 0) return NrDiv(n/d, d, nrd++);
  22. else return (nrd+1) * NrDiv(n, d+1, 1);
  23. }
  24.  
  25. //d
  26. int VeriPrim(int n, int d)
  27. {
  28. if(n % d == 0) return 0;
  29. else if(d * d > n) return 1;
  30. else return VeriPrim(n, d+1);
  31. }
  32.  
  33. int main()
  34. {
  35. cout << VeriFib(21, 1, 1) << "\n\n";
  36. //cout << NrDiv(12, 2, 1) << "\n\n";
  37. for(int i = 2; i <= 31; i++) cout << i << " - " << VeriPrim(i, 2) << "\n";
  38. return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement