Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <stdlib.h>
- using namespace std;
- int n;
- long int parzysta(long int k)
- {
- return 2^n;
- }
- long int nieparzysta(long int l)
- {
- return (n-1)-(n-2);
- }
- long int zero(long int m)
- {
- return 1;
- }
- int main()
- {
- cout << "Podaj n" << endl;
- cin>>n;
- if (n==0)
- cout <<zero(n);
- else if (n % 2==0)
- cout <<parzysta(n);
- else if (n % 2!=0)
- cout <<nieparzysta(n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement