Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma comment(linker,"/STACK:300000000")
- #define _CRT_SECURE_NO_WARNINGS
- #include <iostream>
- #include <vector>
- #include <string>
- #include <algorithm>
- #include <cmath>
- #include <map>
- #include <set>
- #include <iomanip>
- #include <memory.h>
- #include <cstdio>
- #include <sstream>
- #include <deque>
- #include <bitset>
- #include <numeric>
- #include <ctime>
- #include <queue>
- using namespace std;
- #define show(x) cout << #x << " = " << (x) << endl;
- #define fori(i,n) for(int i = 0; i < (n); i++)
- #define forab(i,a,b) for(int i = (a); i <= (b); i++)
- #define sz(v) int((v).size())
- #define all(v) (v).begin(),(v).end()
- const double pi = 3.1415926535897932384626433832795;
- template<class T> T abs(const T &a) { return a >= 0 ? a : -a; };
- template<class T> T sqr(const T &x) { return x * x; }
- typedef pair<int,int> ii;
- typedef long long ll;
- ///////////////////////////////////////
- const int billion = 1000000000;
- const int P = 100000;
- int s;
- int prec[P];
- int digSum(int n)
- {
- int r = 0;
- while(n)
- {
- r += n%10;
- n /= 10;
- }
- return r;
- }
- int main()
- {
- #ifndef ONLINE_JUDGE
- freopen("input.txt","r",stdin);
- freopen("output.txt","w",stdout);
- #endif
- cin >> s;
- fori(i,P)
- prec[i] = digSum(i);
- int ans = 0, a;
- fori(i,billion/P)
- {
- a = s-prec[i];
- fori(j,P)
- ans += (prec[j] == a);
- }
- if(s == 1)
- ans++;
- cout << ans;
- }
Advertisement
Add Comment
Please, Sign In to add comment