oj.uz

Submission #22828

# Submission time Handle Problem Language Result Execution time Memory
22828 2017-04-30T07:45:54 Z ↓우리보다잘하는팀(#947, ainta, gs12117, gs13068) Polynomial Quine (KRIII5_PQ) C++
7 / 7
 129 ms 4632 KB 
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int _minv[210][210];
long long int mpow(int x, int y, int mod) {
	if (y == 0)return 1;
	long long int res = mpow(x, y / 2, mod);
	res *= res;
	res %= mod;
	if (y % 2 == 1) {
		res *= x;
		res %= mod;
	}
	return res;
}
int minv(int x, int mod) {
	if (_minv[mod][x] != 0)return _minv[mod][x];
	return _minv[mod][x] = mpow(x, mod - 2, mod);
}
vector<vector<int> > solve(int p, vector<vector<int> > a) {
	int s = 0;
	int dr = -1;
	for (int i = 0; i < a.size() + 1; i++) {
		int flg, r;
		flg = 0;
		for (int j = s; j < a.size(); j++) {
			if (a[j][i] != 0) {
				flg = 1;
				r = j;
				break;
			}
		}
		if (flg == 0) {
			dr = i;
			continue;
		}
		vector<int> t = a[r];
		a[r] = a[s];
		a[s] = t;
		int ip = minv(a[s][i], p);
		for (int j = i; j < a[s].size(); j++) {
			a[s][j] *= ip;
			a[s][j] %= p;
		}
		for (int j = s + 1; j < a.size(); j++) {
			int z = a[j][i];
			for (int k = i; k < a[j].size(); k++) {
				a[j][k] += p - (z*a[s][k] % p);
				a[j][k] %= p;
			}
		}
		s++;
	}
	vector<vector<int> > res;
	for (int i = 0; i < p; i++) {
		vector<int> t = a[0];
		for (int j = 0; j < t.size(); j++) {
			t[j] = 0;
		}
		t[dr] = i;
		for (int j = dr - 1; j >= 0; j--) {
			int s=0;
			for (int k = j + 1; k <= dr; k++) {
				s += t[k] * a[j][k];
				s %= p;
			}
			t[j] = (p - s) % p;
		}
		res.push_back(t);
	}
	return res;
}
vector<int> tsolve(int p, vector<vector<int> > a, vector<int> ans) {
	int s = 0;
	int dr = -1;
	for (int i = 0; i < a.size() + 1; i++) {
		int flg, r;
		flg = 0;
		for (int j = s; j < a.size(); j++) {
			if (a[j][i] != 0) {
				flg = 1;
				r = j;
				break;
			}
		}
		if (flg == 0) {
			dr = i;
			continue;
		}
		vector<int> t = a[r];
		a[r] = a[s];
		a[s] = t;
		int td = ans[r];
		ans[r] = ans[s];
		ans[s] = td;
		int ip = minv(a[s][i], p);
		for (int j = i; j < a[s].size(); j++) {
			a[s][j] *= ip;
			a[s][j] %= p;
		}
		ans[s] *= ip;
		ans[s] %= p;
		for (int j = s + 1; j < a.size(); j++) {
			int z = a[j][i];
			for (int k = i; k < a[j].size(); k++) {
				a[j][k] += p - (z*a[s][k] % p);
				a[j][k] %= p;
			}
			ans[j] += p - (z*ans[s] % p);
			ans[j] %= p;
		}
		s++;
	}
	vector<int> res = a[0];
	for (int j = 0; j < res.size(); j++) {
		res[j] = 0;
	}
	int pd = a.size() - 1;
	for (int j = a.size(); j >= 0; j--) {
		if (j == dr) {
			res[j] = 0;
			continue;
		}
		int s = 0;
		for (int k = j + 1; k < res.size(); k++) {
			s += res[k] * a[pd][k];
			s %= p;
		}
		res[j] = (ans[pd] + p - s) % p;
		pd--;
	}
	return res;
}
vector<vector<int> > pnsolve(int p, int pd, vector<vector<int> > a) {
	if (p == pd)return solve(p, a);
	vector<vector<int> > res;
	vector<vector<int> > b;
	int spd = pd / p;
	for (int i = 0; i < a.size(); i++) {
		vector<int> tb;
		for (int j = 0; j < a[i].size(); j++) {
			tb.push_back(a[i][j] % spd);
		}
		b.push_back(tb);
	}
	vector<vector<int> > tres = pnsolve(p, spd, b);
	vector<int> sp = tres[1];
	vector<int> spb;
	vector<vector<int> > qs;
	for (int i = 0; i < a.size(); i++) {
		vector<int> tb;
		spb.push_back(0);
		for (int j = 0; j < a[i].size(); j++) {
			spb[i] += sp[j] * a[i][j];
			tb.push_back(a[i][j] % p);
		}
		qs.push_back(tb);
	}
	for (int i = 0; i < spb.size(); i++) {
		spb[i] /= spd;
		spb[i] %= p;
		spb[i] = p - spb[i];
		spb[i] %= p;
	}
	vector<int> pres = tsolve(p, qs, spb);
	for (int i = 0; i < pres.size(); i++) {
		pres[i] = sp[i] + spd*pres[i];
		pres[i] %= pd;
	}
	for (int i = 0; i < pd; i++) {
		vector<int> t;
		for (int j = 0; j < pres.size(); j++) {
			t.push_back(pres[j] * i%pd);
		}
		res.push_back(t);
	}
	for (int i = 0; i < res.size(); i++) {
		for (int j = 0; j < a.size(); j++) {
			int t = 0;
			for (int k = 0; k < a[j].size(); k++) {
				t += res[i][k] * a[j][k];
			}
/*			if (t%pd != 0) {
				printf("WRONG:\n");
				printf("res:");
				for (int k = 0; k < a[j].size(); k++) {
					printf("%d ", res[i][k]);
				}
				printf("\n");
				printf("a:");
				for (int k = 0; k < a[j].size(); k++) {
					printf("%d ", a[j][k]);
				}
				printf("\n");
				printf("%d\n", t%pd);
			}*/
		}
	}
	return res;
}
vector<vector<int> > crtsolve(int n, int sn, vector<vector<int> > a) {
	vector<vector<int> > res;
	if (n == 1) {
		vector<int> t;
		for (int i = 0; i < sn; i++) {
			t.push_back(0);
		}
		res.push_back(t);
		return res;
	}
	int pdiv;
	for (int i = 2; i <= n; i++) {
		if (n%i == 0) {
			pdiv = i;
			break;
		}
	}
	int pn = pdiv;
	while (n % (pdiv*pn) == 0) {
		pn *= pdiv;
	}
	int cn = n / pn;
	vector<vector<int> > aa;
	vector<vector<int> > ab;
	for (int i = 0; i < a.size(); i++) {
		vector<int> ta;
		vector<int> tb;
		for (int j = 0; j < a[i].size(); j++) {
			ta.push_back(a[i][j] % pn);
			tb.push_back(a[i][j] % cn);
		}
		aa.push_back(ta);
		ab.push_back(tb);
	}
	vector<vector<int> > resa = pnsolve(pdiv, pn, aa);
	vector<vector<int> > resb = crtsolve(cn, sn, ab);
	for (int i = 0; i < resa.size(); i++) {
		for (int j = 0; j < resb.size(); j++) {
			vector<int> t;
			for (int k = 0; k < sn; k++) {
				int r = resa[i][k];
				while (r%cn != resb[j][k])r += pn;
				t.push_back(r);
			}
			res.push_back(t);
		}
	}
	return res;
}
int main() {
	int n;
	vector<vector<int> > s;
	scanf("%d", &n);
	for (int i = 1; i < n; i++) {
		vector<int> t;
		int r = 1;
		for (int j = 0; j < n; j++) {
			t.push_back(r);
			r *= i;
			r %= n;
		}
		t[i] += n - 1;
		t[i] %= n;
		vector<int> rt;
		for (int j = n - 1; j >= 0; j--) {
			rt.push_back(t[j]);
		}
		s.push_back(rt);
	}
	vector<vector<int> > res = crtsolve(n, n, s);
	std::sort(res.begin(), res.end());
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			printf("%d ", res[i][j]);
		}
		printf("\n");
	}
}

Compilation message

PQ.cpp: In function 'std::vector<std::vector<int> > solve(int, std::vector<std::vector<int> >)':
PQ.cpp:24:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.size() + 1; i++) {
                    ^
PQ.cpp:27:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = s; j < a.size(); j++) {
                     ^
PQ.cpp:42:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i; j < a[s].size(); j++) {
                     ^
PQ.cpp:46:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = s + 1; j < a.size(); j++) {
                         ^
PQ.cpp:48:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = i; k < a[j].size(); k++) {
                      ^
PQ.cpp:58:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < t.size(); j++) {
                     ^
PQ.cpp: In function 'std::vector<int> tsolve(int, std::vector<std::vector<int> >, std::vector<int>)':
PQ.cpp:77:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.size() + 1; i++) {
                    ^
PQ.cpp:80:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = s; j < a.size(); j++) {
                     ^
PQ.cpp:98:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i; j < a[s].size(); j++) {
                     ^
PQ.cpp:104:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = s + 1; j < a.size(); j++) {
                         ^
PQ.cpp:106:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = i; k < a[j].size(); k++) {
                      ^
PQ.cpp:116:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int j = 0; j < res.size(); j++) {
                    ^
PQ.cpp:126:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int k = j + 1; k < res.size(); k++) {
                         ^
PQ.cpp: In function 'std::vector<std::vector<int> > pnsolve(int, int, std::vector<std::vector<int> >)':
PQ.cpp:140:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.size(); i++) {
                    ^
PQ.cpp:142:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < a[i].size(); j++) {
                     ^
PQ.cpp:151:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.size(); i++) {
                    ^
PQ.cpp:154:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < a[i].size(); j++) {
                     ^
PQ.cpp:160:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < spb.size(); i++) {
                    ^
PQ.cpp:167:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < pres.size(); i++) {
                    ^
PQ.cpp:173:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < pres.size(); j++) {
                     ^
PQ.cpp:178:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < res.size(); i++) {
                    ^
PQ.cpp:179:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < a.size(); j++) {
                     ^
PQ.cpp:181:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = 0; k < a[j].size(); k++) {
                      ^
PQ.cpp: In function 'std::vector<std::vector<int> > crtsolve(int, int, std::vector<std::vector<int> >)':
PQ.cpp:226:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.size(); i++) {
                    ^
PQ.cpp:229:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < a[i].size(); j++) {
                     ^
PQ.cpp:238:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < resa.size(); i++) {
                    ^
PQ.cpp:239:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < resb.size(); j++) {
                     ^
PQ.cpp: In function 'int main()':
PQ.cpp:254:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
PQ.cpp: In function 'std::vector<std::vector<int> > crtsolve(int, int, std::vector<std::vector<int> >)':
PQ.cpp:236:50: warning: 'pdiv' may be used uninitialized in this function [-Wmaybe-uninitialized]
  vector<vector<int> > resa = pnsolve(pdiv, pn, aa);
                                                  ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2124 KB Output is correct
2 Correct 0 ms 2124 KB Output is correct
3 Correct 0 ms 2124 KB Output is correct
4 Correct 0 ms 2124 KB Output is correct
5 Correct 0 ms 2124 KB Output is correct
6 Correct 0 ms 2124 KB Output is correct
7 Correct 0 ms 2124 KB Output is correct
8 Correct 0 ms 2124 KB Output is correct
9 Correct 0 ms 2124 KB Output is correct
10 Correct 0 ms 2124 KB Output is correct
11 Correct 0 ms 2124 KB Output is correct
12 Correct 0 ms 2256 KB Output is correct
13 Correct 0 ms 2256 KB Output is correct
14 Correct 0 ms 2256 KB Output is correct
15 Correct 0 ms 2256 KB Output is correct
16 Correct 0 ms 2256 KB Output is correct
17 Correct 0 ms 2256 KB Output is correct
18 Correct 0 ms 2256 KB Output is correct
19 Correct 3 ms 2256 KB Output is correct
20 Correct 3 ms 2388 KB Output is correct
21 Correct 3 ms 2388 KB Output is correct
22 Correct 0 ms 2388 KB Output is correct
23 Correct 3 ms 2388 KB Output is correct
24 Correct 6 ms 2388 KB Output is correct
25 Correct 6 ms 2388 KB Output is correct
26 Correct 9 ms 2520 KB Output is correct
27 Correct 6 ms 2520 KB Output is correct
28 Correct 13 ms 2520 KB Output is correct
29 Correct 13 ms 2520 KB Output is correct
30 Correct 13 ms 2520 KB Output is correct
31 Correct 16 ms 2652 KB Output is correct
32 Correct 19 ms 2784 KB Output is correct
33 Correct 23 ms 2784 KB Output is correct
34 Correct 23 ms 2784 KB Output is correct
35 Correct 29 ms 2916 KB Output is correct
36 Correct 29 ms 2916 KB Output is correct
37 Correct 33 ms 2916 KB Output is correct
38 Correct 36 ms 3048 KB Output is correct
39 Correct 43 ms 3048 KB Output is correct
40 Correct 46 ms 3048 KB Output is correct
41 Correct 53 ms 3180 KB Output is correct
42 Correct 53 ms 3180 KB Output is correct
43 Correct 63 ms 3312 KB Output is correct
44 Correct 66 ms 3312 KB Output is correct
45 Correct 69 ms 3312 KB Output is correct
46 Correct 69 ms 3312 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2124 KB Output is correct
2 Correct 0 ms 2124 KB Output is correct
3 Correct 0 ms 2124 KB Output is correct
4 Correct 0 ms 2124 KB Output is correct
5 Correct 0 ms 2124 KB Output is correct
6 Correct 0 ms 2124 KB Output is correct
7 Correct 0 ms 2124 KB Output is correct
8 Correct 0 ms 2124 KB Output is correct
9 Correct 0 ms 2124 KB Output is correct
10 Correct 0 ms 2124 KB Output is correct
11 Correct 0 ms 2124 KB Output is correct
12 Correct 0 ms 2124 KB Output is correct
13 Correct 0 ms 2124 KB Output is correct
14 Correct 0 ms 2124 KB Output is correct
15 Correct 0 ms 2124 KB Output is correct
16 Correct 0 ms 2124 KB Output is correct
17 Correct 0 ms 2124 KB Output is correct
18 Correct 0 ms 2124 KB Output is correct
19 Correct 0 ms 2124 KB Output is correct
20 Correct 0 ms 2256 KB Output is correct
21 Correct 0 ms 2256 KB Output is correct
22 Correct 0 ms 2256 KB Output is correct
23 Correct 0 ms 2256 KB Output is correct
24 Correct 0 ms 2256 KB Output is correct
25 Correct 0 ms 2256 KB Output is correct
26 Correct 0 ms 2256 KB Output is correct
27 Correct 0 ms 2256 KB Output is correct
28 Correct 0 ms 2256 KB Output is correct
29 Correct 0 ms 2256 KB Output is correct
30 Correct 0 ms 2256 KB Output is correct
31 Correct 0 ms 2256 KB Output is correct
32 Correct 0 ms 2256 KB Output is correct
33 Correct 0 ms 2256 KB Output is correct
34 Correct 0 ms 2256 KB Output is correct
35 Correct 0 ms 2256 KB Output is correct
36 Correct 0 ms 2256 KB Output is correct
37 Correct 0 ms 2256 KB Output is correct
38 Correct 3 ms 2256 KB Output is correct
39 Correct 0 ms 2256 KB Output is correct
40 Correct 3 ms 2256 KB Output is correct
41 Correct 0 ms 2256 KB Output is correct
42 Correct 0 ms 2256 KB Output is correct
43 Correct 3 ms 2388 KB Output is correct
44 Correct 3 ms 2256 KB Output is correct
45 Correct 3 ms 2256 KB Output is correct
46 Correct 3 ms 2388 KB Output is correct
47 Correct 0 ms 2256 KB Output is correct
48 Correct 3 ms 2388 KB Output is correct
49 Correct 3 ms 2388 KB Output is correct
50 Correct 3 ms 2388 KB Output is correct
51 Correct 3 ms 2388 KB Output is correct
52 Correct 6 ms 2384 KB Output is correct
53 Correct 3 ms 2388 KB Output is correct
54 Correct 3 ms 2388 KB Output is correct
55 Correct 3 ms 2388 KB Output is correct
56 Correct 3 ms 2388 KB Output is correct
57 Correct 6 ms 2520 KB Output is correct
58 Correct 6 ms 2520 KB Output is correct
59 Correct 3 ms 2520 KB Output is correct
60 Correct 6 ms 2388 KB Output is correct
61 Correct 6 ms 2520 KB Output is correct
62 Correct 3 ms 2388 KB Output is correct
63 Correct 6 ms 2388 KB Output is correct
64 Correct 6 ms 2520 KB Output is correct
65 Correct 9 ms 2520 KB Output is correct
66 Correct 9 ms 2520 KB Output is correct
67 Correct 6 ms 2520 KB Output is correct
68 Correct 9 ms 2520 KB Output is correct
69 Correct 6 ms 2520 KB Output is correct
70 Correct 9 ms 2520 KB Output is correct
71 Correct 6 ms 2520 KB Output is correct
72 Correct 16 ms 2652 KB Output is correct
73 Correct 9 ms 2652 KB Output is correct
74 Correct 9 ms 2520 KB Output is correct
75 Correct 13 ms 2652 KB Output is correct
76 Correct 13 ms 2652 KB Output is correct
77 Correct 13 ms 2652 KB Output is correct
78 Correct 6 ms 2652 KB Output is correct
79 Correct 9 ms 2652 KB Output is correct
80 Correct 19 ms 2784 KB Output is correct
81 Correct 13 ms 2784 KB Output is correct
82 Correct 13 ms 2652 KB Output is correct
83 Correct 19 ms 2784 KB Output is correct
84 Correct 16 ms 2784 KB Output is correct
85 Correct 13 ms 2652 KB Output is correct
86 Correct 16 ms 2652 KB Output is correct
87 Correct 16 ms 2652 KB Output is correct
88 Correct 13 ms 2652 KB Output is correct
89 Correct 13 ms 2652 KB Output is correct
90 Correct 26 ms 2868 KB Output is correct
91 Correct 13 ms 2652 KB Output is correct
92 Correct 19 ms 2784 KB Output is correct
93 Correct 13 ms 2784 KB Output is correct
94 Correct 19 ms 2784 KB Output is correct
95 Correct 16 ms 2784 KB Output is correct
96 Correct 26 ms 2916 KB Output is correct
97 Correct 39 ms 3312 KB Output is correct
98 Correct 19 ms 2784 KB Output is correct
99 Correct 19 ms 3048 KB Output is correct
100 Correct 29 ms 3044 KB Output is correct
101 Correct 13 ms 2920 KB Output is correct
102 Correct 23 ms 2916 KB Output is correct
103 Correct 29 ms 2916 KB Output is correct
104 Correct 26 ms 2916 KB Output is correct
105 Correct 29 ms 3180 KB Output is correct
106 Correct 33 ms 3180 KB Output is correct
107 Correct 23 ms 2912 KB Output is correct
108 Correct 29 ms 3048 KB Output is correct
109 Correct 19 ms 2916 KB Output is correct
110 Correct 49 ms 3180 KB Output is correct
111 Correct 23 ms 3048 KB Output is correct
112 Correct 33 ms 3048 KB Output is correct
113 Correct 29 ms 3180 KB Output is correct
114 Correct 36 ms 3048 KB Output is correct
115 Correct 43 ms 3444 KB Output is correct
116 Correct 43 ms 3180 KB Output is correct
117 Correct 33 ms 3048 KB Output is correct
118 Correct 36 ms 3312 KB Output is correct
119 Correct 26 ms 3048 KB Output is correct
120 Correct 46 ms 3444 KB Output is correct
121 Correct 39 ms 3180 KB Output is correct
122 Correct 33 ms 3184 KB Output is correct
123 Correct 66 ms 3708 KB Output is correct
124 Correct 29 ms 3180 KB Output is correct
125 Correct 59 ms 3840 KB Output is correct
126 Correct 46 ms 3180 KB Output is correct
127 Correct 46 ms 3576 KB Output is correct
128 Correct 46 ms 3312 KB Output is correct
129 Correct 63 ms 3532 KB Output is correct
130 Correct 29 ms 3180 KB Output is correct
131 Correct 49 ms 3576 KB Output is correct
132 Correct 43 ms 3316 KB Output is correct
133 Correct 49 ms 3312 KB Output is correct
134 Correct 59 ms 3708 KB Output is correct
135 Correct 46 ms 3312 KB Output is correct
136 Correct 69 ms 3708 KB Output is correct
137 Correct 46 ms 3312 KB Output is correct
138 Correct 53 ms 3444 KB Output is correct
139 Correct 79 ms 3840 KB Output is correct
140 Correct 56 ms 3840 KB Output is correct
141 Correct 49 ms 3444 KB Output is correct
142 Correct 66 ms 3576 KB Output is correct
143 Correct 46 ms 3444 KB Output is correct
144 Correct 66 ms 3840 KB Output is correct
145 Correct 43 ms 3444 KB Output is correct
146 Correct 66 ms 3444 KB Output is correct
147 Correct 69 ms 3576 KB Output is correct
148 Correct 66 ms 3972 KB Output is correct
149 Correct 129 ms 4632 KB Output is correct
150 Correct 73 ms 3576 KB Output is correct
151 Correct 73 ms 4104 KB Output is correct
152 Correct 86 ms 3844 KB Output is correct
153 Correct 96 ms 4104 KB Output is correct
154 Correct 109 ms 3968 KB Output is correct
155 Correct 0 ms 2124 KB Output is correct
156 Correct 0 ms 2124 KB Output is correct
157 Correct 0 ms 2124 KB Output is correct
158 Correct 0 ms 2124 KB Output is correct
159 Correct 0 ms 2124 KB Output is correct
160 Correct 0 ms 2124 KB Output is correct
161 Correct 0 ms 2124 KB Output is correct
162 Correct 0 ms 2124 KB Output is correct
163 Correct 0 ms 2124 KB Output is correct
164 Correct 0 ms 2124 KB Output is correct
165 Correct 0 ms 2124 KB Output is correct
166 Correct 0 ms 2256 KB Output is correct
167 Correct 0 ms 2256 KB Output is correct
168 Correct 0 ms 2256 KB Output is correct
169 Correct 0 ms 2256 KB Output is correct
170 Correct 0 ms 2256 KB Output is correct
171 Correct 0 ms 2256 KB Output is correct
172 Correct 0 ms 2256 KB Output is correct
173 Correct 3 ms 2256 KB Output is correct
174 Correct 3 ms 2388 KB Output is correct
175 Correct 3 ms 2388 KB Output is correct
176 Correct 0 ms 2388 KB Output is correct
177 Correct 3 ms 2388 KB Output is correct
178 Correct 6 ms 2388 KB Output is correct
179 Correct 6 ms 2388 KB Output is correct
180 Correct 9 ms 2520 KB Output is correct
181 Correct 6 ms 2520 KB Output is correct
182 Correct 13 ms 2520 KB Output is correct
183 Correct 13 ms 2520 KB Output is correct
184 Correct 13 ms 2520 KB Output is correct
185 Correct 16 ms 2652 KB Output is correct
186 Correct 19 ms 2784 KB Output is correct
187 Correct 23 ms 2784 KB Output is correct
188 Correct 23 ms 2784 KB Output is correct
189 Correct 29 ms 2916 KB Output is correct
190 Correct 29 ms 2916 KB Output is correct
191 Correct 33 ms 2916 KB Output is correct
192 Correct 36 ms 3048 KB Output is correct
193 Correct 43 ms 3048 KB Output is correct
194 Correct 46 ms 3048 KB Output is correct
195 Correct 53 ms 3180 KB Output is correct
196 Correct 53 ms 3180 KB Output is correct
197 Correct 63 ms 3312 KB Output is correct
198 Correct 66 ms 3312 KB Output is correct
199 Correct 69 ms 3312 KB Output is correct
200 Correct 69 ms 3312 KB Output is correct