Contest/aoj1241.cpp at master · ryojiro/Contest · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
#define pb push_back
#define mp make_pair
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
typedef unsigned long long ull;
const int IINF = 1<<28;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

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

	vi v;
	REP(i, IINF) {
		if(i*i > 1<<15)
			break;
		v.pb(i*i);
	}
	int ans[1<<15+1] = {};
	REP(i, v.size()) {
		FOR(j, i, v.size()) {
			FOR(k, j, v.size()) {
				FOR(l, k, v.size()) {
					if(v[i]+v[j]+v[k]+v[l] > 1<<15)
						break;
					ans[v[i]+v[j]+v[k]+v[l]]++;
				}
			}
		}
	}
	int n;
	while(cin >> n, n)
		cout << ans[n] << endl;
	return 0;
}