Submission #3607557
Source Code Expand
#include<bits/stdc++.h>
#define X first
#define Y second
#define pb emplace_back
#define FOR(i,a,b) for(int (i)=(a);i<(b);++(i))
#define EFOR(i,a,b) for(int (i)=(a);i<=(b);++(i))
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef ll LL;
typedef pii PII;
typedef pll PLL;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;
int K;
LL ten[20];
int S(LL v) {
int ret = 0;
rep(i, 20) {
if (v/ten[i] == 0) return ret;
ret += v/ten[i]%10;
}
return ret;
}
int main() {
scanf("%d", &K);
rep(i, 9) {
printf("%d\n", i+1);
K--;
if (K == 0) return 0;
}
ten[0] = 1;
reps(i, 1, 20) {
ten[i] = ten[i-1] * 10LL;
}
LL cur = 10;
int d = 2;
while (K > 0) {
rep(i, d) {
if (cur > ten[i] * S(cur)) {
int f = cur/ten[i]%10;
cur += (9 - f) * ten[i];
}
}
printf("%lld\n", cur);
cur++;
while (cur >= ten[d]) d++;
--K;
}
}
Submission Info
Submission Time
2018-11-16 17:32:32+0900
Task
D - Snuke Numbers
User
potetisensei
Language
C++14 (GCC 5.4.1)
Score
500
Code Size
1556 Byte
Status
AC
Exec Time
3 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:41:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &K);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
500 / 500
Status
Set Name
Test Cases
Sample
sample.txt
All
sample.txt, 1.txt, sample.txt
Case Name
Status
Exec Time
Memory
1.txt
AC
3 ms
256 KB
sample.txt
AC
1 ms
256 KB