Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<vector>
- #include<algorithm>
- #include<iostream>
- #include <set>
- #include <map>
- using namespace std;
- typedef long long ll;
- int main()
- {
- vector<ll> ar;
- ll t,i,k;
- set<ll> ss;
- ar.push_back(0);
- for(i=1;i<=500000;i++)
- {
- k=ar[i-1]-i;
- if((ar[i-1]-i)>0 && ss.find(k)==ss.end())
- ar.push_back(ar[i-1]-i);
- else
- ar.push_back(ar[i-1]+i);
- ss.insert(ar[ar.size()-1]);
- }
- while(scanf("%lld",&t)==1)
- {
- if(t==-1)
- break;
- printf("%lld\n",ar[t]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment