dp implementation

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
const int N=200001;
#define ll long long




int main() {
     ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
          int cnt[200005] = {0};
     ll sum = 0;
     for(int i=1; i<=200000; i++) {
         string s = to_string(i);
 
         for(int j=0; j<s.size(); j++) {
             sum += s[j] - 48;
         }
         cnt[i] = sum;
     }
    int t;
    cin >> t;
    while(t--)
    {
        int n;
        cin>>n;
        cout<<cnt[n]<<endl;
    }
   
     }


Comments

Submit
0 Comments
More Questions

622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable
287. Find the Duplicate Number
279. Perfect Squares
275. H-Index II
274. H-Index