纯度大法

#include<bits/stdc++.h>
using namespace std;

int nums[100];
int sum=1;
int sq(int n){
	if(n<=0)return 0;
    if(n-1<100){
        sum+= nums[n-1]-1;
        return 0;
    }
    for(int i = 1;i<=n/2;i++){
        sum+=1;
        sq(i);  
    }
}
int sq2(int n){
	if(n<=0)return 0;
    for(int i = 1;i<=n/2;i++){
        sum+=1;
        sq(i);  
    }
}
int main(){
	int n;
    cin >> n;
    for(int i = 0 ; i<100;i++){
        sum = 1;
        sq2(i+1);
        nums[i] = sum;
    }
    sum=1;  
    sq(n);
    cout<<sum;
    //for(int i = 0;i<100;i++)cout<<nums[i]<<endl;
}