Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <algorithm>
- #include <set>
- using namespace std;
- typedef long long ll;
- void f(ll n) {
- set<ll> st;
- for(ll i = 0; i <= n; i++) {
- for(ll j = 0; j <= n; j++) {
- for(ll x = 0; x <= n; x++) {
- for(ll y = 0; y <= n; y++) {
- if(i + j + x + y == n) {
- st.insert(1 * i + 5 * j + 10 * x + 50 * y);
- }
- }
- }
- }
- }
- cout << (int) st.size() << endl;
- }
- int main()
- {
- ios_base::sync_with_stdio(false);
- int n;
- cin >> n;
- if(n <= 50) {
- f(n);
- return 0;
- }
- ll result = 2203;
- int c = 50;
- while(c + 1 <= n) {
- c++;
- result += 49;
- }
- cout << result << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement