1 2 0 1 4 + 2 2 0 1 4 + 3 2 0 1 4 + . . . + 2 0 1 4 2 0 1 4 ( m o d 2 0 1 6 )
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
|
C++:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
|
Answer computes in 0.078s.
int find remainder 5() { int iK = 0, tmp = 1; List<int> ar = new List<int>(); for (int i = 1; i <= 2014; i++) { tmp = i; for (int j = 1; j < 2014; j++) { tmp = (tmp * i) % 2016; } iK = (iK + tmp) % 2016; } return iK; }
Problem Loading...
Note Loading...
Set Loading...
Python: