|
#pragma warning(disable:4018)
|
|
#pragma warning(disable:4244)
|
|
#pragma warning(disable:4267)
|
|
#pragma warning(disable:4786)
|
|
#pragma warning(disable:4800)
|
|
#pragma warning(disable:4996)
|
|
#include "assert.h"
|
|
#include "ctype.h"
|
|
#include "float.h"
|
|
#include "math.h"
|
|
#include "stdio.h"
|
|
#include "string.h"
|
|
#include "stdlib.h"
|
|
#include "stdarg.h"
|
|
#include "time.h"
|
|
#include "algorithm"
|
|
#include "numeric"
|
|
#include "functional"
|
|
#include "utility"
|
|
#include "bitset"
|
|
#include "vector"
|
|
#include "list"
|
|
#include "set"
|
|
#include "map"
|
|
#include "queue"
|
|
#include "stack"
|
|
#include "string"
|
|
#include "sstream"
|
|
#include "iostream"
|
|
#define all(v) (v).begin(), (v).end()
|
|
typedef long long i64;
|
|
template <class T> void make_unique(T& v) {sort(all(v)); v.resize(unique(all(v)) - v.begin());}
|
|
using namespace std;
|
|
|
|
int f(int n){
|
|
int count = 0;
|
|
for(int i=1, m=(int)(ceil(sqrt((double)(n)))); i<=m; ++i){
|
|
for(int j=i; i*j<=n; ++j)++count;
|
|
}
|
|
return count;
|
|
}
|
|
|
|
int main(){
|
|
freopen("data.in","r",stdin);
|
|
int n;
|
|
while(scanf("%d", &n) == 1){
|
|
int res = f(n);
|
|
printf("%d\n",res);
|
|
}
|
|
return 0;
|
|
} |