Problem:
４つの整数の和 II
4,000 以下の正の整数
n
を入力し、0 〜 1000 の範囲の整数
a, b, c, d
の組で
a + b + c + d = n
を満たすものの組み合わせ数を出力するプログラムを作成して下さい。
Input
複数のデータセットが与えられます。各データセットに
n
が１行に与えられます。入力の最後まで処理して下さい。
データセットの数は 50 を超えません。
Output
各データセットごとに、
a, b, c, d
の組み合わせの個数を１行に出力して下さい。
Sample Input
2
3
35
Output for the Sample Input
10
20
8436

Submitted solutions:

code_snippet: #include <iostream>
using namespace std;
int main() {
  unsigned long long dp[4001][5];
  for (int i = 0; i < 5; i++)
    for (int j = 0; j < 4001; j++)
      dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;
  for (int i = 2; i <= 4; i++)
    for (int j = 0; j <= 4000; j++)
      for (int k = 0; k <= j; k++)
        dp[j][i] += dp[j - k][i - 1];
  int n;
  while (cin >> n)
    cout << dp[n][4] << endl;
  return 0;
}
accuracy: 0.18181818181818182
time_ms: 10
memory_kb: 3248
final_rank: 18

code_snippet: #include <iostream>
using namespace std;

int main() {
  unsigned int dp[4001][5];
  for (unsigned int i = 0; i < 5; i++)
    for (unsigned int j = 0; j < 4001; j++)
      dp[j][i] = (i == 1 && j <= 1000) ? 1 : 0;
  for (unsigned int i = 2; i <= 4; i++)
    for (unsigned int j = 0; j <= 4000; j++)
      for (unsigned int k = 0; k <= j; k++)
        dp[j][i] += dp[j - k][i - 1];
  unsigned int n;
  while (cin >> n)
    cout << dp[n][4] << endl;
  return 0;
}
accuracy: 0.18181818181818182
time_ms: 10
memory_kb: 3160
final_rank: 13

code_snippet: #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REP1(i,x) for(int i=1;i<=(int)(x);i++)
#define REP2(i,s,e) for(int i=(int)(s);i<=(int)(e);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREP1(i,x) for(int i=((int)(x));i>=1;i--)
#define RREP2(i,s,e) for(int i=((int)(e));i>=(int)(s);i--)
#define ALL(x) (x).begin(),(x).end()
#define INF32 (1000001000)
#define INF (4000000000000001000LL)
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
#define endl '\n'

int main() {
  const ll m = 1000;
  ll n;
  map<ll,ll> c;
  REP(a, m+1) {
    REP(b, m+1) {
      c[a+b]++;
    }
  }
  while (cin >> n) {
    ll ans = 0;
    for (auto [ab,count]: c) {
      if (c.find(n-ab) != c.end()) {
        ans += count*c[n-ab];
      }
    }
    cout << ans << '\n';
  }
  return 0;
}
accuracy: 1
time_ms: 30
memory_kb: 3564
final_rank: 7

code_snippet: #include <iostream>
using namespace std;

const int mod = 1e9 + 7;
const int maxn = 4001;
const int maxk = 5;
unsigned long long dp[maxn][maxk];

void precompute() {
    for (int i = 0; i < maxk; i++)
        for (int j = 0; j < maxn; j++)
            dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;
    for (int i = 2; i < maxk; i++)
        for (int j = 0; j < maxn; j++)
            for (int k = 0; k <= j && k <= 1000; k++)
                dp[j][i] = (dp[j][i] + dp[j - k][i - 1]) % mod;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    precompute();
    int n;
    while (cin >> n)
        cout << dp[n][4] << '\n';
    return 0;
}
accuracy: 1
time_ms: 20
memory_kb: 3348
final_rank: 4

code_snippet: #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
  unsigned long long dp[4001][5];
  for (int i = 0; i < 5; i++)
    for (int j = 0; j < 4001; j++)
      dp[j][i] = i == 1 && j <= 10001 ? 1 : 0;
  for (int i = 2; i <= 4; i++)
    for (int j = 0; j <= 4000; j++)
      for (int k = 0; k <= j && k <= 10002; k++)
        dp[j][i] += dp[j - k][i - 1];
  int n;
  while (cin >> n)
    cout << dp[n][4] << endl;
  return 0;
}
accuracy: 0.18181818181818182
time_ms: 10
memory_kb: 3240
final_rank: 16

code_snippet: #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
  unsigned long long dp[4001][5];
  for (int i = 0; i < 5; i++)
    for (int j = 0; j < 4001; j++)
      dp[j][i] = i == 1 && j <= 10001 ? 1 : 0;
  for (int i = 2; i <= 4; i++)
    for (int j = 0; j <= 4000; j++)
      for (int k = 0; k <= j && k <= 10001; k++)
        dp[j][i] += dp[j - k][i - 1];
  int n;
  while (cin >> n)
    cout << dp[n][4] << endl;
  return 0;
}
accuracy: 0.18181818181818182
time_ms: 10
memory_kb: 3220
final_rank: 15

code_snippet: #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
  unsigned long long dp[4001][5];
  for (int i = 0; i < 5; i++)
    for (int j = 0; j < 4001; j++)
      dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;
  for (int i = 2; i <= 4; i++)
    for (int j = 0; j <= 4000; j++)
      for (int k = 0; k <= j && k <= 2000; k++)
        dp[j][i] += dp[j - k][i - 1];
  int n;
  while (cin >> n)
    cout << dp[n][4] << endl;
  return 0;
}
accuracy: 0.18181818181818182
time_ms: 10
memory_kb: 3244
final_rank: 17

code_snippet: #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
  unsigned long long dp[4001][5];
  for (int i = 0; i < 5; i++)
    for (int j = 0; j < 4001; j++)
      dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;
  for (int i = 2; i <= 4; i++)
    for (int j = 0; j <= 4000; j++)
      for (int k = 0; k <= j; k++)
        dp[j][i] += dp[j - k][i - 1];
  int n;
  while (cin >> n)
    cout << dp[n][4] << endl;
  return 0;
}
accuracy: 0.18181818181818182
time_ms: 10
memory_kb: 3208
final_rank: 14

code_snippet: #include <iostream>
#include <vector>
using namespace std;

int main() {
  vector<vector<unsigned long long>> dp(4001, vector<unsigned long long>(5, 0));
  for (int i = 0; i < 5; i++)
    for (int j = 0; j < 4001; j++)
      dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;
  for (int i = 2; i <= 4; i++)
    for (int j = 0; j <= 4000; j++)
      for (int k = 0; k <= j && k <= 1000; k++)
        dp[j][i] += dp[j - k][i - 1];
  int n;
  while (cin >> n)
    cout << dp[n][4] << endl;
  return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 3728
final_rank: 6

code_snippet: #include "bits/stdc++.h"

#define REP(i,num) for(ll i=0;i<(num);++i)
#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=ll>
T in(){ T x; cin >> x; return (x); }
template<typename T=ll,typename C=vector<T>>
C vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }
template<typename T=ll,size_t N>
array<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}

void vout(){ cout << endl; }
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }
void out(){ cout << endl; }
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }

template<typename T>
bool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }
template<typename T>
bool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);

	ll N;
	while(cin>>N){
		vll X(2001,0);
		REP(i,1001){
			REP(j,1001){
				X[i+j]++;
			}
		}
		ll S=0;
		REP(i,1001){
			REP(j,1001){
				ll r=N-(i+j);
				if(r<0 || r>2000) continue;
				S += X[r];
			}
		}
		out(S);
	}
	
	return 0;
}
accuracy: 1
time_ms: 40
memory_kb: 3480
final_rank: 8

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

using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class t> using vc = vector<t>;
template<class t> using vvc = vc<vc<t>>;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vc<int>;
using vvi = vvc<int>;
using vl = vc<ll>;
using vvl = vvc<ll>;

#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define irep(i,a,b) for (int i = (a); i > (b); i--)
#define all(a) a.begin(),a.end()
#define print(n) cout << n << '\n'
#define pritn(n) print(n)
#define printv(n,a) {copy(all(n),ostream_iterator<a>(cout," ")); cout<<"\n";}
#define printvv(n,a) {for(auto itr:n) printv(itr,a);}
#define rup(a,b) (a+b-1)/b
#define input(A,N) rep(i,0,N) cin>>A[i]
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)


int main(){
    cout << fixed << setprecision(15);
    int n;
    while(cin>>n){
        int ans = 0;
        rep(i,0,1001){
            if(n<i) break;
            rep(j,0,1001){
                int m = n - i - j;
                if(m<0) break;
                if(m>2000) continue; 
                ans += min(m,1000) - max(0,m-1000) + 1;
            }
        }
        print(ans);
    }
    
    //system("pause");
    return 0;
}
accuracy: 1
time_ms: 20
memory_kb: 3368
final_rank: 5

code_snippet: #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcountll(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
int msb(ll v){return 63-__builtin_clzll(v);}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

int main(){
    int n;
    while(cin>>n){
        vector<ll> dp(n+1,0);
        dp[0]=1;
        for(int i=0;i<4;i++){
            for(int j=n;j>=0;j--){
                for(int k=1;k<=1000&&j+k<=n;k++){
                    dp[j+k]+=dp[j];
                }
            }
        }
        out(dp[n]);
    }
}
accuracy: 1
time_ms: 140
memory_kb: 3628
final_rank: 9

code_snippet: #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n;
    while(cin >> n){
        vector<int> v;
        for(int i = 0; i <= min(1000, n); i++){
            for(int j = 0; j <= min(1000, n); j++){
                v.emplace_back(i + j);
            }
        }
        sort(v.begin(), v.end());

        ll ans = 0;
        rep(i,v.size()){
            if(v[i] > n) break;
            if(n - v[i] > v.back()) break;
            ans += upper_bound(v.begin(), v.end(), n - v[i]) - lower_bound(v.begin(), v.end(), n - v[i]);
        }
        cout << ans << endl;
    }
}
accuracy: 0.18181818181818182
time_ms: 90
memory_kb: 11140
final_rank: 20

code_snippet: #include<bits/stdc++.h>

using namespace std;
using ll = long long;
void solve();

int N;

int main()
{
	while(cin>>N)solve();
}

void solve()
{
	vector<vector<ll>> dp(5, vector<ll>(N + 1));
	dp[0][0] = 1;

	for(int t = 0; t < 4; t++) {
		for(int i = 0; i <= N; i++) {
			for(int j = 0; j <= 1000; j++) {
				if(i + j > N)continue;
				dp[t + 1][i + j] += dp[t][i];
			}
		}
	}
	cout << dp[4][N] << endl;
}
accuracy: 1
time_ms: 220
memory_kb: 3596
final_rank: 11

code_snippet: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;

int main() {
    int n;
    while (cin >> n) {
        ll ans = 0;
        rep(i, 1001) {
            rep(j, 1001) {
                rep(k, 1001) {
                    int l = n - i - j - k;
                    if (l < 0)
                        break;

                    ans++;
                }
            }
        }
        cout << ans << "\n";
    }
    return 0;
}
accuracy: 0.18181818181818182
time_ms: 960
memory_kb: 3376
final_rank: 19

code_snippet: #include<iostream>
using namespace std;
int main()
{
	int a[4001]={};
	for(int i=0;i<=1000;i++) {
		for(int j=0;j<=1000;j++) {
			a[i+j]++;
		}
	}
	int n;
	while(cin>>n){
	long long int all=0;
	for(int i=0;i<=1000;i++) {
		for(int j=0;j<=1000&&j<=n-i;j++) {
			all+=a[n-i-j];
		}
	}
	cout<<all<<endl;}
	return 0;
}
accuracy: 1
time_ms: 20
memory_kb: 3112
final_rank: 2

code_snippet: #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define unless(c) if (!(c))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)

using namespace std;
using ll = long long;		using ld = long double;
using VB = vector<bool>;	using VVB = vector<VB>;
using VI = vector<int>;		using VVI = vector<VI>;
using VL = vector<ll>;		using VVL = vector<VL>;
using VS = vector<string>;	using VD = vector<ld>;
using PII = pair<int, int>;	using VP = vector<PII>;
using PLL = pair<ll, ll>;	using VPL = vector<PLL>;
template<class T>using PQ = priority_queue<T>;
template<class T>using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr ll inf_ll = (ll)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;

// --- input --- //
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#define fwrite_unlocked fwrite
#define fflush_unlocked fflush
#endif
class Input {
	static int gc() {
		return getchar_unlocked();
	}
	template<class T>static void i(T& v) {
		cin >> v;
	}
	static void i(char& v) {
		while (isspace(v = gc()));
	}
	static void i(bool& v) {
		v = in<char>() != '0';
	}
	static void i(string& v) {
		v.clear(); char c; for (i(c); !isspace(c); c = gc())v += c;
	}
	static void i(int& v) {
		bool neg = false; v = 0; char c; i(c);
		if (c == '-') { neg = true; c = gc(); }
		for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
		if (neg)v = -v;
	}
	static void i(long long& v) {
		bool neg = false; v = 0; char c; i(c);
		if (c == '-') { neg = true; c = gc(); }
		for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
		if (neg)v = -v;
	}
	static void i(double& v) {
		double dp = 1; bool neg = false, adp = false; v = 0; char c; i(c);
		if (c == '-') { neg = true; c = gc(); }
		for (; isdigit(c) || c == '.'; c = gc()) {
			if (c == '.')adp = true;
			else if (adp)v += (c - '0') * (dp *= 0.1);
			else v = v * 10 + (c - '0');
		}
		if (neg)v = -v;
	}
	static void i(long double& v) {
		long double dp = 1; bool neg = false, adp = false; v = 0; char c; i(c);
		if (c == '-') { neg = true; c = gc(); }
		for (; isdigit(c) || c == '.'; c = gc()) {
			if (c == '.')adp = true;
			else if (adp)v += (c - '0') * (dp *= 0.1);
			else v = v * 10 + (c - '0');
		}
		if (neg)v = -v;
	}
	template<class T, class U>static void i(pair<T, U>& v) {
		i(v.first); i(v.second);
	}
	template<class T>static void i(vector<T>& v) {
		for (auto& e : v)i(e);
	}
	struct InputV {
		int n, m;
		InputV(int _n) :n(_n), m(0) {}
		InputV(const pair<int, int>& nm) :n(nm.first), m(nm.second) {}
		template<class T>operator vector<T>() {
			vector<T> v(n); i(v); return v;
		}
		template<class T>operator vector<vector<T>>() {
			vector<vector<T>> v(n, vector<T>(m)); i(v); return v;
		}
	};
public:
	static string get_line() {
		string v; char c;
		for (i(c); c != '\n' && c != '\0'; c = gc())v += c;
		return v;
	}
	template<class T>static T in() {
		T v; i(v); return v;
	}
	template<class T>operator T()const {
		return in<T>();
	}
	int operator--(int)const {
		return in<int>() - 1;
	}
	InputV operator[](int n)const {
		return InputV(n);
	}
	InputV operator[](const pair<int, int>& n)const {
		return InputV(n);
	}
	void operator()()const {}
	template<class H, class...T>void operator()(H&& h, T&& ...t)const {
		i(h); operator()(forward<T>(t)...);
	}
}in;
#define input(T) Input::in<T>()
#define INT input(int)
#define LL input(ll)
#define STR input(string)
#define inputs(T, ...) T __VA_ARGS__; in(__VA_ARGS__)
#define ini(...) inputs(int, __VA_ARGS__)
#define inl(...) inputs(ll, __VA_ARGS__)
#define ins(...) inputs(string, __VA_ARGS__)

// --- output --- //
struct BoolStr {
	const char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {}
}Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
	const char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {}
}spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");
class Output {
	BoolStr B{ Yes }; DivStr D{ spc };
	void p(int v)const {
		if (v < 0)putchar_unlocked('-'), v = -v;
		char b[10]; int i = 0;
		while (v)b[i++] = '0' + v % 10, v /= 10;
		if (!i)b[i++] = '0';
		while (i--)putchar_unlocked(b[i]);
	}
	void p(ll v)const {
		if (v < 0)putchar_unlocked('-'), v = -v;
		char b[20]; int i = 0;
		while (v)b[i++] = '0' + v % 10, v /= 10;
		if (!i)b[i++] = '0';
		while (i--)putchar_unlocked(b[i]);
	}
	void p(bool v)const {
		p(v ? B.t : B.f);
	}
	void p(char v)const {
		putchar_unlocked(v);
	}
	void p(const char* v)const {
		fwrite_unlocked(v, 1, strlen(v), stdout);
	}
	void p(double v)const {
		printf("%.20f", v);
	}
	void p(ld v)const {
		printf("%.20Lf", v);
	}
	template<class T> void p(const T& v)const {
		cout << v;
	}
	template<class T, class U>void p(const pair<T, U>& v)const {
		p(v.first); p(D.d); p(v.second);
	}
	template<class T>void p(const vector<T>& v)const {
		rep(i, sz(v)) { if (i)p(D.d); p(v[i]); }
	}
	template<class T>void p(const vector<vector<T>>& v)const {
		rep(i, sz(v)) { if (i)p(D.l); p(v[i]); }
	}
public:
	Output& operator()() {
		p(D.l); return *this;
	}
	template<class H>Output& operator()(H&& h) {
		p(h); p(D.l); return *this;
	}
	template<class H, class...T>Output& operator()(H&& h, T&& ...t) {
		p(h); p(D.d); return operator()(forward<T>(t)...);
	}
	template<class It>Output& range(const It& l, const It& r) {
		for (It i = l; i != r; i++) { if (i != l)p(D.d); p(*i); } p(D.l); return *this;
	}
	template<class T>Output& range(const T& a) {
		range(a.begin(), a.end()); return *this;
	}
	template<class...T>void exit(T&& ...t) {
		operator()(forward<T>(t)...); std::exit(EXIT_SUCCESS);
	}
	Output& flush() {
		fflush_unlocked(stdout); return *this;
	}
	Output& set(const BoolStr& b) {
		B = b; return *this;
	}
	Output& set(const DivStr& d) {
		D = d; return *this;
	}
	Output& set(const char* t, const char* f) {
		B = BoolStr(t, f); return *this;
	}
}out;

// --- step --- //
template<class T>struct Step {
	class It {
		T a, b, c;
	public:
		constexpr It() : a(T()), b(T()), c(T()) {}
		constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}
		constexpr It& operator++() {
			--b; a += c; return *this;
		}
		constexpr It operator++(int) {
			It tmp = *this; --b; a += c; return tmp;
		}
		constexpr const T& operator*()const {
			return a;
		}
		constexpr const T* operator->()const {
			return &a;
		}
		constexpr bool operator==(const It& i)const {
			return b == i.b;
		}
		constexpr bool operator!=(const It& i)const {
			return !(b == i.b);
		}
		constexpr T start()const {
			return a;
		}
		constexpr T count()const {
			return b;
		}
		constexpr T step()const {
			return c;
		}
	};
	constexpr Step(T b, T c, T s) : be(b, c, s) {}
	constexpr It begin()const {
		return be;
	}
	constexpr It end()const {
		return en;
	}
	constexpr T start()const {
		return be.start();
	}
	constexpr T count()const {
		return be.count();
	}
	constexpr T step()const {
		return be.step();
	}
	constexpr T sum()const {
		return start() * count() + step() * (count() * (count() - 1) / 2);
	}
	operator vector<T>()const {
		return as_vector();
	}
	template<class F>void each(const F& f)const {
		for (T i : *this)f(i);
	}
	auto as_vector()const {
		vector<T> res; res.reserve(count()); each([&](T i) {res.push_back(i); }); return res;
	}
	template<class F, class U = decay_t<result_of_t<F(T)>>>auto map(const F& f)const {
		vector<U> res; res.reserve(count()); each([&](T i) {res.push_back(f(i)); }); return res;
	}
	template<class F>auto select(const F& f)const {
		vector<T> res; each([&](T i) {if (f(i))res.push_back(i); }); return res;
	}
	template<class F>int count_if(const F& f)const {
		int res = 0; each([&](T i) {if (f(i))++res; }); return res;
	}
	template<class F>T find_if(const F& f)const {
		for (T i : *this)if (f(i))return i; return 0;
	}
	template<class F>auto max_by(const F& f)const {
		auto v = map(f); return *max_element(v.begin(), v.end());
	}
	template<class F>auto min_by(const F& f)const {
		auto v = map(f); return *min_element(v.begin(), v.end());
	}
	template<class F>bool all_of(const F& f)const {
		for (T i : *this)if (!f(i))return false; return true;
	}
	template<class F>bool any_of(const F& f)const {
		for (T i : *this)if (f(i))return true; return false;
	}
	template<class F, class U = decay_t<result_of_t<F(T)>>>auto sum(const F& f)const {
		U res = 0; each([&](T i) {res += static_cast<U>(f(i)); }); return res;
	}
	using value_type = T;
	using iterator = It;
private:
	It be, en;
};
template<class T>inline constexpr auto step(T a) {
	return Step<T>(0, a, 1);
}
template<class T>inline constexpr auto step(T a, T b) {
	return Step<T>(a, b - a, 1);
}
template<class T>inline constexpr auto step(T a, T b, T c) {
	return Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);
}

// --- functions --- //
inline namespace {
	template<class T>inline void Sort(T& a) {
		sort(all(a));
	}
	template<class T>inline void RSort(T& a) {
		sort(rall(a));
	}
	template<class T, class F>inline void Sort(T& a, const F& f) {
		sort(all(a), f);
	}
	template<class T, class F>inline void RSort(T& a, const F& f) {
		sort(rall(a), f);
	}
	template<class T>inline T Sorted(T a) {
		Sort(a); return a;
	}
	template<class T>inline T RSorted(T a) {
		RSort(a); return a;
	}
	template<class T, class F>inline T Sorted(T& a, const F& f) {
		Sort(a, f); return a;
	}
	template<class T, class F>inline T RSorted(T& a, const F& f) {
		RSort(a, f); return a;
	}
	template<class T, class F>inline void SortBy(T& a, const F& f) {
		sort(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class F>inline void RSortBy(T& a, const F& f) {
		sort(rall(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T>inline void Reverse(T& a) {
		reverse(all(a));
	}
	template<class T>inline void Unique(T& a) {
		a.erase(unique(all(a)), a.end());
	}
	template<class T>inline void Uniq(T& a) {
		Sort(a); Unique(a);
	}
	template<class T>inline void Rotate(T& a, int left) {
		rotate(a.begin(), a.begin() + left, a.end());
	}
	template<class T>inline T Reversed(T a) {
		Reverse(a); return a;
	}
	template<class T>inline T Uniqued(T a) {
		Unique(a); return a;
	}
	template<class T>inline T Uniqed(T a) {
		Uniq(a); return a;
	}
	template<class T>inline T Rotated(T a, int left) {
		Rotate(a, left); return a;
	}
	template<class T>inline auto Max(const T& a) {
		return *max_element(all(a));
	}
	template<class T>inline auto Min(const T& a) {
		return *min_element(all(a));
	}
	template<class T>inline int MaxPos(const T& a) {
		return max_element(all(a)) - a.begin();
	}
	template<class T>inline int MinPos(const T& a) {
		return min_element(all(a)) - a.begin();
	}
	template<class T, class F>inline auto MaxBy(const T& a, const F& f) {
		return *max_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class F>inline auto MinBy(const T& a, const F& f) {
		return *min_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class U>inline int Count(const T& a, const U& v) {
		return count(all(a), v);
	}
	template<class T, class F>inline int CountIf(const T& a, const F& f) {
		return count_if(all(a), f);
	}
	template<class T, class U>inline int Find(const T& a, const U& v) {
		return find(all(a), v) - a.begin();
	}
	template<class T, class F>inline int FindIf(const T& a, const F& f) {
		return find_if(all(a), f) - a.begin();
	}
	template<class T, class U = typename T::value_type>inline U Sum(const T& a) {
		return accumulate(all(a), U());
	}
	template<class T, class U>inline bool Includes(const T& a, const U& v) {
		return find(all(a), v) != a.end();
	}
	template<class T, class F>inline auto Sum(const T& v, const F& f) {
		return accumulate(next(v.begin()), v.end(), f(*v.begin()), [&](auto a, auto b) {return a + f(b); });
	}
	template<class T, class U>inline int Lower(const T& a, const U& v) {
		return lower_bound(all(a), v) - a.begin();
	}
	template<class T, class U>inline int Upper(const T& a, const U& v) {
		return upper_bound(all(a), v) - a.begin();
	}
	template<class T, class F>inline void RemoveIf(T& a, const F& f) {
		a.erase(remove_if(all(a), f), a.end());
	}
	template<class F>inline auto Vector(size_t size, const F& f) {
		vector<decay_t<result_of_t<F(size_t)>>> res(size);
		for (size_t i = 0; i < size; ++i)res[i] = f(i);
		return res;
	}
	template<class T>inline auto Grid(size_t h, size_t w, const T& v = T()) {
		return vector<vector<T>>(h, vector<T>(w, v));
	}
	template<class T>inline auto Slice(const T& v, size_t i, size_t len) {
		return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();
	}
	template<class T, class F>inline auto Each(const T& v, F&& f) {
		for (auto& i : v)f(i);
	}
	template<class T, class F>inline auto Select(const T& v, const F& f) {
		T res;
		for (const auto& e : v)if (f(e))res.push_back(e);
		return res;
	}
	template<class T, class F>inline auto Map(const T& v, F&& f) {
		vector<decay_t<result_of_t<F(typename T::value_type)>>> res(v.size());
		size_t i = 0; for (const auto& e : v)res[i++] = f(e);
		return res;
	}
	template<class T, class F>inline auto MapIndex(const T& v, const F& f) {
		vector<decay_t<result_of_t<F(size_t, typename T::value_type)>>> res(v.size());
		size_t i = 0; for (auto it = v.begin(); it != v.end(); ++it, ++i)res[i] = f(i, *it);
		return res;
	}
	template<class T, class F>inline auto TrueIndex(const T& v, const F& f) {
		vector<size_t> res;
		for (size_t i = 0; i < v.size(); ++i)if (f(v[i]))res.push_back(i);
		return res;
	}
	template<class T, class U = typename T::value_type>inline auto Indexed(const T& v) {
		vector<pair<U, int>> res(v.size());
		for (int i = 0; i < (int)v.size(); ++i)res[i] = make_pair(static_cast<U>(v[i]), i);
		return res;
	}
	inline auto operator*(string s, size_t n) {
		string res;
		for (size_t i = 0; i < n; ++i)res += s;
		return res;
	}
	template<class T>inline auto& operator<<(vector<T>& v, const vector<T>& v2) {
		v.insert(v.end(), all(v2)); return v;
	}
	template<class T>inline T Ceil(T n, T m) {
		return (n + m - 1) / m;
	}
	template<class T>inline T Ceil2(T n, T m) {
		return Ceil(n, m) * m;
	}
	template<class T>inline T Tri(T n) {
		return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
	}
	template<class T>inline T nC2(T n) {
		return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);
	}
	template<class T>inline T Mid(const T& l, const T& r) {
		return l + (r - l) / 2;
	}
	inline int pop_count(int n) {
		return bitset<32>(n).count();
	}
	inline int pop_count(ll n) {
		return bitset<64>(n).count();
	}
	template<class T>inline bool chmax(T& a, const T& b) {
		if (a < b) { a = b; return true; } return false;
	}
	template<class T>inline bool chmin(T& a, const T& b) {
		if (a > b) { a = b; return true; } return false;
	}
	template<class T>inline bool inRange(const T& v, const T& min, const T& max) {
		return min <= v && v < max;
	}
	template<class T>inline bool isSquere(T n) {
		T s = sqrt(n); return s * s == n || (s + 1) * (s + 1) == n;
	}
	template<class T = ll>inline T BIT(int b) {
		return T(1) << b;
	}
	template<class T>inline T Gcd(T n, T m) {
		return m ? Gcd(m, n % m) : n;
	}
	template<class T>inline T Lcm(T n, T m) {
		return n / Gcd(n, m) * m;
	}
	template<class T, class U = typename T::value_type>inline U Gcdv(const T& v) {
		return accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd<U>);
	}
	template<class T, class U = typename T::value_type>inline U Lcmv(const T& v) {
		return accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm<U>);
	}
	template<class T>inline T Pow(T a, T n) {
		T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; } return r;
	}
	template<class T>inline T Powmod(T a, T n, T m = MOD) {
		T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r;
	}
}

// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif

// ---------------------------------------------------------------- //

int main() {
	map<int, ll> cnt;
	rep(i, 1001)rep(j, 1001) {
		cnt[i + j]++;
	}
	for (int n; cin >> n;) {
		ll ans = 0;
		for (auto p : cnt) {
			if (cnt.count(n - p.first))
				ans += p.second * cnt[n - p.first];
		}
		out(ans);
	}
}
accuracy: 1
time_ms: 30
memory_kb: 3232
final_rank: 3

code_snippet: #include <iostream>

using namespace std;

int n;
int dp[5][4001];

int main() {
    fill(dp[0], dp[5], 0);
    dp[0][0] = 1;
    for (int i = 1; i <= 4; i++) {
        for (int j = 0; j <= 4000; j++) {
            for (int k = 0; k <= 1000; k++) {
                if (j + k <= 4000)
                    dp[i][j + k] += dp[i - 1][j];
            }
        }
    }
    while (cin >> n) {
        cout << dp[4][n] << endl;
    }
}
accuracy: 1
time_ms: 10
memory_kb: 3168
final_rank: 1

code_snippet: #include <iostream>

using namespace std;

int n;
int dp[5][4001];

int main() {
    while (cin >> n) {
        fill(dp[0], dp[4], 0);
        dp[0][0] = 1;
        for (int i = 1; i <= 4; i++) {
            for (int j = 0; j <= n; j++) {
                for (int k = 0; k <= 1000; k++) {
                    if (j + k <= n)
                        dp[i][j + k] += dp[i - 1][j];
                }
            }
        }
        cout << dp[4][n] << endl;
    }
}
accuracy: 0.2727272727272727
time_ms: 170
memory_kb: 3168
final_rank: 12

code_snippet: #include <iostream>

using namespace std;

int n;
int dp[5][4001];

int main() {
    while (cin >> n) {
        fill(dp[0], dp[5], 0);
        dp[0][0] = 1;
        for (int i = 1; i <= 4; i++) {
            for (int j = 0; j <= n; j++) {
                for (int k = 0; k <= 1000; k++) {
                    if (j + k <= n)
                        dp[i][j + k] += dp[i - 1][j];
                }
            }
        }
        cout << dp[4][n] << endl;
    }
}
accuracy: 1
time_ms: 250
memory_kb: 3184
final_rank: 10