Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <vector>
- #include<iostream>
- #include <algorithm>
- #include <cmath>
- #include <iomanip>
- #include <fstream>
- #include <string>
- #include <set>
- #include <deque>
- #include <queue>
- #include <map>
- #include <bitset>
- #include <random>
- #include <cassert>
- #include <unordered_map>
- #include <unordered_set>
- using namespace std;
- typedef long long ll;
- typedef unsigned long long ull;
- typedef long double ld;
- #define endl "\n"
- #define all(a) a.begin(), a.end()
- #define allr(a) a.rbegin(), a.rend()
- #define pb push_back
- #define F first
- #define S second
- int mod = 10000;
- template<typename T>
- T mul(T x) {
- return x;
- }
- template<typename T, typename... Ts>
- T mul(T x, Ts... y) {
- return (x * 1ll * mul(y...)) % mod;
- }
- template<typename T, typename... Ts>
- void uul(T& x, Ts... y) {
- x = mul(x, y...);
- }
- int bin(int a, ll deg) {
- int r = 1;
- while (deg) {
- if (deg & 1)
- uul(r, a);
- deg >>= 1;
- uul(a, a);
- }
- return r;
- }
- void solve() {
- int ans = 0;
- for (int i = 1; i <= 14; i++) {
- ans += bin(5, 25 * i);
- }
- cout << ans << endl;
- }
- signed main() {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- ll t = 1;
- //cin >> t;
- while (t--) {
- solve();
- //cout << "Case #" << buffer << ' ';
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement