Submission #1359308
Source Code Expand
#include<set> #include<map> #include<cmath> #include<ctime> #include<cstdio> #include<cassert> #include<cstdlib> #include<cstring> #include<algorithm> using namespace std; const double PI=acos(-1); typedef long long ll; typedef pair<int,int> pi; #define fi first #define se second #define mp make_pair #define pb push_back #define rep(i,a,b) for (int i=(a);i<=(b);i++) #define per(i,a,b) for (int i=(a);i>=(b);i--) #define Rep(i,a,b) for (int i=(a);i<(b);i++) #define Per(i,a,b) for (int i=(a);i>(b);i--) //debug #define deb printf("begin\n"); #define dee printf("end\n"); #define def printf("find\n"); #define dey printf("Yes\n"); #define den printf("No\n"); #define dew printf("wrong\n"); void read(int&x){ x=0;int f=1;char ch=getchar(); while ((ch<'0'||ch>'9')&&ch!='-')ch=getchar(); if (ch=='-')f=-1,ch=getchar(); while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar(); x*=f; } //--------------------------head--------------------------// #define maxn 500005 char s[maxn];int n,nxt[maxn]; int main(){ //freopen("Increasing Numbers.in","r",stdin); //freopen("Increasing Numbers.out","w",stdout); scanf("%s",s+1);n=strlen(s+1);int sum=0; nxt[n]=n+1;per(i,n-1,1)if (s[i]==s[i+1])nxt[i]=nxt[i+1];else nxt[i]=i+1; rep(i,1,n){ int j=nxt[i]; if (j==n){ if ((((s[i]-'0'+10-sum%10)%10)==1)&&(((s[n]-'0'+10-sum%10)%10)==0)){sum+=10;break;} } if (j>n){sum+=((s[i]-'0'+10-sum%10)%10);/*printf("%d\n",s[i]-'0'+10-sum%10);*/break;} else if (s[i]<s[j])sum+=((s[i]-'0'+10-sum%10)%10); else sum+=((s[i]-'0'+9-sum%10)%10); //printf("%d\n",sum); } printf("%d\n",(sum+8)/9);return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Increasing Numbers |
User | Dream_Reality |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1650 Byte |
Status | WA |
Exec Time | 8 ms |
Memory | 2560 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:43:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",s+1);n=strlen(s+1);int sum=0; ^
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 | 7 ms | 2560 KB |
in11.txt | AC | 3 ms | 2560 KB |
in12.txt | WA | 4 ms | 2560 KB |
in13.txt | WA | 6 ms | 2560 KB |
in14.txt | WA | 7 ms | 2560 KB |
in15.txt | WA | 7 ms | 2560 KB |
in16.txt | WA | 7 ms | 2560 KB |
in17.txt | WA | 6 ms | 2432 KB |
in18.txt | WA | 8 ms | 2560 KB |
in19.txt | WA | 7 ms | 2560 KB |
in2.txt | WA | 7 ms | 2560 KB |
in20.txt | WA | 7 ms | 2560 KB |
in21.txt | WA | 8 ms | 2560 KB |
in22.txt | WA | 8 ms | 2560 KB |
in23.txt | WA | 8 ms | 2560 KB |
in24.txt | WA | 7 ms | 2560 KB |
in25.txt | WA | 7 ms | 2560 KB |
in26.txt | WA | 7 ms | 2560 KB |
in27.txt | WA | 5 ms | 1920 KB |
in28.txt | WA | 7 ms | 2560 KB |
in29.txt | WA | 8 ms | 2560 KB |
in3.txt | WA | 8 ms | 2560 KB |
in30.txt | WA | 8 ms | 2560 KB |
in31.txt | WA | 8 ms | 2560 KB |
in4.txt | WA | 8 ms | 2560 KB |
in5.txt | WA | 7 ms | 2560 KB |
in500000.txt | WA | 3 ms | 2560 KB |
in6.txt | WA | 7 ms | 2560 KB |
in7.txt | WA | 6 ms | 2176 KB |
in8.txt | WA | 7 ms | 2560 KB |
in9.txt | WA | 7 ms | 2560 KB |
sample1.txt | AC | 1 ms | 128 KB |
sample2.txt | AC | 1 ms | 128 KB |
sample3.txt | AC | 1 ms | 128 KB |
sample4.txt | AC | 1 ms | 128 KB |