Submission #940329

#TimeUsernameProblemLanguageResultExecution timeMemory
940329vjudge1Sequence (BOI14_sequence)C++17
0 / 100
3 ms348 KiB
// in the name of God #include<bits/stdc++.h> using namespace std; #define int long long #define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ff first #define ss second #define pb(x) push_back(x) #define all(x) x.begin(), x.end() #define mk make_pair #define ppb pop_back #define endl '\n' #define pii pair<int, int> #define sz(x) (int)x.size() #define file() freopen("input.txt", "r", stdin); #pragma GCC optimize("Ofast") #pragma GCC optimize("O4") #pragma GCC optimize("unroll-loops") //#pragma GCC target("avx2") mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int mod = 1e9 + 7, maxn = 2e5 + 10, sq = 3163, inf = 1e18 + 10, lg = 25, pp = 4447, modd = 1e9 + 9; int n; string a; signed main(){ fast();//file(); cin >> n; for(int i = 0; i < n; ++i) {int x; cin >> x; a += ((char) x + '0');} for(int i = 0; i < (1001 - n); ++i){ bool bol = true; for(int j = 0; j < n; ++j){ string s = to_string(i + j); bool x = false; for(int k = 0; k < s.size(); ++k){ if(s[k] == a[j]) x = true; } if(!x) bol = false; } if(bol){ cout << i; return 0; } } } // Happiness can be found even in the darkest of times, // if one only remembers to turn on the light.

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:35:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |    for(int k = 0; k < s.size(); ++k){
      |                   ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...