Submission #1678421


Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cstring>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=500000+10;
char s[maxn];
int a[maxn];
int i,j,k,l,t,n,m,num;
int main(){
	scanf("%s",s);
	n=strlen(s);
	reverse(s,s+n);
	fo(i,0,n-1) a[i]=s[i]-'0';
	t=i=0;
	while (i<n){
		t+=a[i]*9;
		a[i]=t%10;
		t/=10;
		if (t&&i==n-1) n++;
		i++;
	}
	fo(i,0,n-1) num+=a[i];
	fo(k,1,1000000000){
		a[0]++;
		if (a[0]<10) continue;
		num++;
		t=i=0;
		while (i<n){
			t+=a[i];
			num-=a[i];
			a[i]=t%10;
			num+=a[i];
			t/=10;
			if (!t) break;
			if (i==n-1) n++;
			i++;
		}
		if (!a[0]&&num==k) break;
	}
	printf("%d\n",(k-1)/9+1);
}

Submission Info

Submission Time
Task E - Increasing Numbers
User werkeytom
Language C++14 (GCC 5.4.1)
Score 0
Code Size 691 Byte
Status TLE
Exec Time 2103 ms
Memory 2688 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1300
Status
TLE × 4
TLE × 40
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 TLE 2103 ms 256 KB
in10.txt TLE 2103 ms 2560 KB
in11.txt TLE 2103 ms 2560 KB
in12.txt TLE 2103 ms 2560 KB
in13.txt TLE 2103 ms 2560 KB
in14.txt TLE 2103 ms 2560 KB
in15.txt TLE 2103 ms 2560 KB
in16.txt TLE 2103 ms 2560 KB
in17.txt TLE 2103 ms 2432 KB
in18.txt TLE 2103 ms 2560 KB
in19.txt TLE 2103 ms 2560 KB
in2.txt TLE 2103 ms 2560 KB
in20.txt TLE 2103 ms 2560 KB
in21.txt TLE 2103 ms 2560 KB
in22.txt TLE 2103 ms 2560 KB
in23.txt TLE 2103 ms 2560 KB
in24.txt TLE 2103 ms 2560 KB
in25.txt TLE 2103 ms 2560 KB
in26.txt TLE 2103 ms 2688 KB
in27.txt TLE 2103 ms 1920 KB
in28.txt TLE 2103 ms 2560 KB
in29.txt TLE 2103 ms 2560 KB
in3.txt TLE 2103 ms 2560 KB
in30.txt TLE 2103 ms 2560 KB
in31.txt TLE 2103 ms 2560 KB
in4.txt TLE 2103 ms 2560 KB
in5.txt TLE 2103 ms 2560 KB
in500000.txt TLE 2103 ms 2560 KB
in6.txt TLE 2103 ms 2560 KB
in7.txt TLE 2103 ms 2048 KB
in8.txt TLE 2103 ms 2560 KB
in9.txt TLE 2103 ms 2560 KB
sample1.txt TLE 2103 ms 128 KB
sample2.txt TLE 2103 ms 128 KB
sample3.txt TLE 2103 ms 128 KB
sample4.txt TLE 2103 ms 128 KB