Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define nl "\n"
- #define fi first
- #define se second
- #define pb push_back
- #define ll long long
- #define ull unsigned ll
- #define RV return void
- // #define inf 2000000000
- #define sz(x) int(x.size())
- #define all(v) v.begin(), v.end()
- #define rall(v) v.rbegin(), v.rend()
- #define Mini(x) *min_element(all(x))
- #define Maxi(x) *max_element(all(x))
- #define fixed(n) fixed << setprecision(n)
- #define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
- #define cin(v) for (auto&i:v) cin >> i;
- #define cout(v) for (auto&i:v) cout << i << " ";
- #define clr(memo, x) memset(memo, x, sizeof memo)
- #define updmin(a, b) a = min(a, b)
- #define updmax(a, b) a = max(a, b)
- #define vi vector < int >
- #define vl vector < ll >
- #define vc vector < char >
- #define vs vector < string >
- #define v2i vector < vector < int > >
- #define v2l vector < vector < int > >
- #define seti set < int >
- #define setl set < ll >
- #define mapii map < int , int >
- #define mapll map < ll , ll >
- #define mapli map < ll , int >
- #define mapci map < char , int >
- #define mapsi map < string , int >
- #define pll pair < ll , ll >
- #define pii pair < int , int >
- #define range(l,r,x) for(int i=l ; i < r ; i+=x)
- #define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
- vector < string > ternary= {"NO\n" , "YES\n"};
- void Zainab(){
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin);
- freopen("output.txt", "w", stdout);
- #endif
- }
- /*================================ solution ================================ */
- void myCode(){
- ll saved[6][100][6][100]{};
- int n ;
- cin >> n ;
- vector < int > v(n);
- for(auto& x : v){
- cin >> x;
- int w = x;
- string s = to_string(x);
- int total =0 , sum =0 ;
- while(w){
- total += w % 10;
- w/=10;
- }
- w = x;
- int len1=0 ;
- saved[0][0][sz(s)][total]++;
- while(w){
- len1++;
- sum += w % 10 ;
- saved[len1][sum ][sz(s) - len1][total - sum ]++;
- w/=10;
- }
- }
- ll ans =0;
- for(auto& x : v ){
- string s = to_string(x);
- int total =0;
- for(auto& c : s ) total += c-'0';
- for(int i =1 ; i <= 5 ; i++){
- if(sz(s) > i){
- int sum =0;
- for(int j =0 ; j < i ; j++) sum += s[j]-'0';
- if(i - (sz(s) - i) >=0)
- // ans += saved[ i - (sz(s) - i) ][total - sum][0][0] ;
- ans += saved[0][0] [ i - (sz(s) - i) ][total - sum] ;
- }
- else{
- for(int k = 0 ; k <= 9 * (i-sz(s)) ; k++){
- ans += saved [i-sz(s)] [k] [i] [total + k];
- }
- }
- }
- }
- cout << ans << nl;
- }
- int main(){
- FastCode ;
- // Zainab() ;
- int testCase=1;
- // cin >> testCase ;
- for(int i=1 ; i<= testCase ; i++){
- // cout << "Case #" << i << ": ";
- myCode();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement