Submission #1881164
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <iterator> #include <bitset> #include <ctime> #include<complex> using namespace std; #define FOR(i,a,b) for (int i = (a); i < (b); i++) #define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--) #define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++) #define FILL(a,value) memset(a, value, sizeof(a)) #define SZ(a) (int)a.size() #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; const double PI = acos(-1.0); const int INF = 1000 * 1000 * 1000 + 7; const LL LINF = INF * (LL)INF; const int MAX = 5 * 100000 + 47; const int MOD = 1000 * 1000 * 1000 + 7; int A[MAX]; string s; int n; int summ = 0; void addOne() { FOR(i, 0, n) { if (A[i] != 9) { summ++; A[i]++; break; } summ -= 9; A[i] = 0; } } int main() { //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); ios::sync_with_stdio(false); cin.tie(0); cin >> s; n = SZ(s); FOR(i, 0, n) { A[i] = s[n - i - 1] - '0'; } int nex = 0; FOR(i, 0, n + 1) { int val = A[i] * 9 + nex; A[i] = val % 10; nex = val / 10; } if (A[n]) n++; FOR(i, 0, n) { summ += A[i]; } FOR(k, 1, MAX) { FOR(i, 0, 9) { addOne(); } if (summ <= 9 * k) { cout << k << endl; return 0; } } }
Submission Info
Submission Time | |
---|---|
Task | E - Increasing Numbers |
User | vjudge5 |
Language | C++14 (Clang 3.8.0) |
Score | 1300 |
Code Size | 1651 Byte |
Status | AC |
Exec Time | 37 ms |
Memory | 2808 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1300 / 1300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in4.txt, in5.txt, in500000.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 2 ms | 384 KB |
in10.txt | AC | 35 ms | 2808 KB |
in11.txt | AC | 26 ms | 2808 KB |
in12.txt | AC | 28 ms | 2808 KB |
in13.txt | AC | 34 ms | 2808 KB |
in14.txt | AC | 35 ms | 2808 KB |
in15.txt | AC | 35 ms | 2808 KB |
in16.txt | AC | 36 ms | 2808 KB |
in17.txt | AC | 25 ms | 2680 KB |
in18.txt | AC | 31 ms | 2808 KB |
in19.txt | AC | 28 ms | 2808 KB |
in2.txt | AC | 31 ms | 2808 KB |
in20.txt | AC | 26 ms | 2808 KB |
in21.txt | AC | 30 ms | 2808 KB |
in22.txt | AC | 30 ms | 2808 KB |
in23.txt | AC | 31 ms | 2808 KB |
in24.txt | AC | 37 ms | 2808 KB |
in25.txt | AC | 35 ms | 2808 KB |
in26.txt | AC | 30 ms | 2808 KB |
in27.txt | AC | 22 ms | 2044 KB |
in28.txt | AC | 31 ms | 2808 KB |
in29.txt | AC | 31 ms | 2808 KB |
in3.txt | AC | 31 ms | 2808 KB |
in30.txt | AC | 33 ms | 2808 KB |
in31.txt | AC | 31 ms | 2808 KB |
in4.txt | AC | 31 ms | 2808 KB |
in5.txt | AC | 26 ms | 2808 KB |
in500000.txt | AC | 27 ms | 2808 KB |
in6.txt | AC | 31 ms | 2808 KB |
in7.txt | AC | 23 ms | 2296 KB |
in8.txt | AC | 26 ms | 2808 KB |
in9.txt | AC | 35 ms | 2808 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
sample4.txt | AC | 1 ms | 256 KB |