Submission #1673474
Source Code Expand
#include <stdio.h> #include <iostream> #include <algorithm> #include <memory.h> #include <vector> using namespace std; typedef long long LL; const int maxn = 600005; char str[maxn];int n[maxn],L,sum; int main() { #ifdef Amberframe freopen("agc011e.in","r",stdin); freopen("agc011e.out","w",stdout); #endif scanf("%s",str+1);L=strlen(str+1); for (int i=1;i<=L;i++) n[i]=str[L-i+1]-'0'; for (int t=0,i=1;i<=L+10;i++) n[i]=n[i]*9+t,t=n[i]/10,n[i]%=10,sum+=n[i]; for (int k=0;;k++) { if (sum<=9*k) {printf("%d\n",k);return 0;} else { n[1]+=9;sum+=9;int p=1; while (n[p]>=10) n[p]-=10,sum-=9,n[++p]++; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Increasing Numbers |
User | Amberframe |
Language | C++14 (GCC 5.4.1) |
Score | 1300 |
Code Size | 669 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 2688 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:18:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",str+1);L=strlen(str+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 | 7 ms | 2688 KB |
in11.txt | AC | 6 ms | 2688 KB |
in12.txt | AC | 6 ms | 2688 KB |
in13.txt | AC | 7 ms | 2688 KB |
in14.txt | AC | 7 ms | 2688 KB |
in15.txt | AC | 7 ms | 2688 KB |
in16.txt | AC | 7 ms | 2688 KB |
in17.txt | AC | 5 ms | 2560 KB |
in18.txt | AC | 6 ms | 2688 KB |
in19.txt | AC | 6 ms | 2688 KB |
in2.txt | AC | 6 ms | 2688 KB |
in20.txt | AC | 6 ms | 2688 KB |
in21.txt | AC | 6 ms | 2688 KB |
in22.txt | AC | 6 ms | 2688 KB |
in23.txt | AC | 6 ms | 2688 KB |
in24.txt | AC | 7 ms | 2688 KB |
in25.txt | AC | 7 ms | 2688 KB |
in26.txt | AC | 6 ms | 2560 KB |
in27.txt | AC | 5 ms | 1920 KB |
in28.txt | AC | 6 ms | 2688 KB |
in29.txt | AC | 6 ms | 2688 KB |
in3.txt | AC | 6 ms | 2688 KB |
in30.txt | AC | 6 ms | 2688 KB |
in31.txt | AC | 6 ms | 2688 KB |
in4.txt | AC | 6 ms | 2688 KB |
in5.txt | AC | 5 ms | 2688 KB |
in500000.txt | AC | 6 ms | 2688 KB |
in6.txt | AC | 6 ms | 2688 KB |
in7.txt | AC | 5 ms | 2176 KB |
in8.txt | AC | 5 ms | 2688 KB |
in9.txt | AC | 7 ms | 2688 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 |