Guest User

Untitled

a guest
Aug 22nd, 2015
255
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.52 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<vector>
  3. #include<algorithm>
  4. #include<iostream>
  5. #include <set>
  6. #include <map>
  7. using namespace std;
  8.  
  9. typedef long long ll;
  10. int main()
  11. {
  12. vector<ll> ar;
  13. ll t,i,k;
  14. set<ll> ss;
  15. ar.push_back(0);
  16. for(i=1;i<=500000;i++)
  17. {
  18. k=ar[i-1]-i;
  19. if((ar[i-1]-i)>0 && ss.find(k)==ss.end())
  20. ar.push_back(ar[i-1]-i);
  21. else
  22. ar.push_back(ar[i-1]+i);
  23. ss.insert(ar[ar.size()-1]);
  24. }
  25. while(scanf("%lld",&t)==1)
  26. {
  27. if(t==-1)
  28. break;
  29. printf("%lld\n",ar[t]);
  30. }
  31. return 0;
  32. }
Advertisement
Add Comment
Please, Sign In to add comment