Submission #1365311
Source Code Expand
#include<bits/stdc++.h> #define rep(i,k,n) for(int i=k;i<=n;i++) #define rep2(i,k,n) for(int i=k;i>=n;i--) using namespace std; const int N=5e5+7; char s[N]; int a[N],n,now; int main(){ scanf("%s",s+1); n=strlen(s+1); rep(i,1,n)a[i+1]=s[i]-'0'; int c=0; rep2(i,n+1,1){ int res=a[i]*9 + c; a[i]=res%10; c=res/10; now+=a[i]; } c=9; rep2(i,n+1,0){ if(a[i]+c < 10){ now+=c; a[i]+=c; break; }else{ now-=a[i]; int res=a[i]+c; c=res/10; a[i]=res%10; now+=a[i]; } } rep(k,1,1000000){ if(now<=9*k){ printf("%d\n",k); return 0; } } }
Submission Info
Submission Time | |
---|---|
Task | E - Increasing Numbers |
User | Dream_Reality |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 797 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 2688 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:21: 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 | 0 / 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 | WA | 1 ms | 256 KB |
in10.txt | WA | 5 ms | 2688 KB |
in11.txt | WA | 5 ms | 2688 KB |
in12.txt | WA | 5 ms | 2688 KB |
in13.txt | WA | 5 ms | 2688 KB |
in14.txt | WA | 5 ms | 2688 KB |
in15.txt | WA | 5 ms | 2688 KB |
in16.txt | WA | 5 ms | 2688 KB |
in17.txt | WA | 5 ms | 2560 KB |
in18.txt | AC | 5 ms | 2688 KB |
in19.txt | WA | 5 ms | 2688 KB |
in2.txt | WA | 5 ms | 2688 KB |
in20.txt | WA | 5 ms | 2688 KB |
in21.txt | WA | 5 ms | 2688 KB |
in22.txt | WA | 5 ms | 2688 KB |
in23.txt | WA | 5 ms | 2688 KB |
in24.txt | WA | 5 ms | 2688 KB |
in25.txt | WA | 5 ms | 2688 KB |
in26.txt | WA | 5 ms | 2560 KB |
in27.txt | WA | 4 ms | 1920 KB |
in28.txt | AC | 5 ms | 2688 KB |
in29.txt | WA | 5 ms | 2688 KB |
in3.txt | AC | 5 ms | 2688 KB |
in30.txt | WA | 5 ms | 2688 KB |
in31.txt | AC | 5 ms | 2688 KB |
in4.txt | WA | 5 ms | 2688 KB |
in5.txt | WA | 5 ms | 2688 KB |
in500000.txt | AC | 5 ms | 2688 KB |
in6.txt | WA | 5 ms | 2688 KB |
in7.txt | AC | 4 ms | 2176 KB |
in8.txt | WA | 5 ms | 2688 KB |
in9.txt | WA | 5 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 |