Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream f("scobitoare.in");
- ofstream g("scobitoare.out");
- int T(int n)
- {
- if(n==1) return 1;
- if(n==2) return 3;
- if(n==3) return 7;
- if(n==4) return 11;
- int Puterea=0,PutereDeDoi=1;
- while(PutereDeDoi<n)
- {
- Puterea++;
- PutereDeDoi=PutereDeDoi*2;
- }
- if(PutereDeDoi==n)
- {
- return (pow(2,2*Puterea+1)+1)/3;
- }
- else
- {
- PutereDeDoi=PutereDeDoi/2;
- return T(PutereDeDoi)+ 2*T(n-PutereDeDoi)+T(n-PutereDeDoi+1)-1;
- }
- }
- int main()
- {
- int n,p;
- f>>p;
- f>>n;
- if(p==1)
- g<<T(n);
- else g<<T(n)-T(n-1);
- }
Add Comment
Please, Sign In to add comment