Submission #1374612
Source Code Expand
#include<cstdio> #include<cstring> #include<algorithm> #define N 500050 using namespace std; int n; char s[N]; int a[N]; bool check(int x){ int len = n; for(int i = 1; i <= n; i++) a[i] = (s[i] - '0') * 9; a[1] += 9 * x; for(int i = 1; i <= len; i++){ a[i + 1] += a[i] / 10; a[i] %= 10; if(a[i + 1] && i == len) len++; } int sum = 0; for(int i = 1; i <= len; i++) sum += a[i], a[i] = 0; return sum <= 9 * x; } int main(){ scanf("%s", s + 1); n = strlen(s + 1); reverse(s + 1, s + n + 1); int l = 1, r = n; while(l < r){ int mid = l + r >> 1; if(check(mid)) r = mid; else l = mid + 1; } printf("%d\n", l); }
Submission Info
Submission Time | |
---|---|
Task | E - Increasing Numbers |
User | FYTalon |
Language | C++14 (GCC 5.4.1) |
Score | 1300 |
Code Size | 673 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 2560 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:26:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", s + 1); ^
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 | 1 ms | 256 KB |
in10.txt | AC | 44 ms | 2560 KB |
in11.txt | AC | 44 ms | 2560 KB |
in12.txt | AC | 44 ms | 2560 KB |
in13.txt | AC | 44 ms | 2560 KB |
in14.txt | AC | 44 ms | 2560 KB |
in15.txt | AC | 44 ms | 2560 KB |
in16.txt | AC | 44 ms | 2560 KB |
in17.txt | AC | 41 ms | 2432 KB |
in18.txt | AC | 44 ms | 2560 KB |
in19.txt | AC | 43 ms | 2560 KB |
in2.txt | AC | 44 ms | 2560 KB |
in20.txt | AC | 44 ms | 2560 KB |
in21.txt | AC | 44 ms | 2560 KB |
in22.txt | AC | 44 ms | 2560 KB |
in23.txt | AC | 44 ms | 2560 KB |
in24.txt | AC | 44 ms | 2560 KB |
in25.txt | AC | 44 ms | 2560 KB |
in26.txt | AC | 42 ms | 2560 KB |
in27.txt | AC | 31 ms | 1920 KB |
in28.txt | AC | 44 ms | 2560 KB |
in29.txt | AC | 44 ms | 2560 KB |
in3.txt | AC | 44 ms | 2560 KB |
in30.txt | AC | 44 ms | 2560 KB |
in31.txt | AC | 44 ms | 2560 KB |
in4.txt | AC | 42 ms | 2560 KB |
in5.txt | AC | 44 ms | 2560 KB |
in500000.txt | AC | 44 ms | 2560 KB |
in6.txt | AC | 44 ms | 2560 KB |
in7.txt | AC | 35 ms | 2176 KB |
in8.txt | AC | 43 ms | 2560 KB |
in9.txt | AC | 42 ms | 2560 KB |
sample1.txt | AC | 1 ms | 128 KB |
sample2.txt | AC | 1 ms | 128 KB |
sample3.txt | AC | 0 ms | 128 KB |
sample4.txt | AC | 1 ms | 128 KB |