Submission #1781509
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> P; typedef pair<int,P> P1; typedef pair<P,P> P2; #define pu push #define pb push_back #define mp make_pair #define eps 1e-7 #define INF 1000000000 #define mod 1000000007 #define fi first #define sc second #define rep(i,x) for(int i=0;i<x;i++) #define repn(i,x) for(int i=1;i<=x;i++) #define SORT(x) sort(x.begin(),x.end()) #define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) #define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) #define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) vector<string>rec(int n){ if(n == 1){ vector<string>ret; rep(i,10){ string str = ""; str.pb('0'+i); ret.pb(str); } return ret; } vector<string>x = rec(n-1); vector<string>ret; for(int i=0;i<10;i++){ char ch = '0'+i; string S = ""; S.pb(ch); rep(j,x.size()){ string X = x[j]; X+=S; reverse(X.begin(),X.end()); ret.pb(X); } reverse(x.begin(),x.end()); } return ret; } int main(){ int n; cin>>n; int x=1; rep(i,n) x *= 10; cout<<x-1<<endl; vector<string>vec = rec(n); rep(i,vec.size()) cout<<vec[i]<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Lock |
User | IH19980412 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1216 Byte |
Status | WA |
Exec Time | 171 ms |
Memory | 6820 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | WA | 3 ms | 256 KB |
subtask1_02.txt | WA | 18 ms | 896 KB |
subtask1_03.txt | WA | 171 ms | 6820 KB |