# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
457973 | 2021-08-07T16:32:15 Z | myvaluska | Palindrome-Free Numbers (BOI13_numbers) | C++14 | 1000 ms | 292 KB |
// palindromefree.cpp : This file contains the 'main' function. Program execution begins and ends there. // #include <iostream> #include <string> using namespace std; long long int cifra[20]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int a; long long int b; cin >> a; cin >> b; long long int palfree = 0; cifra[0] = 1; for (int i = 1; i < 19; i++) { cifra[i] = cifra[i - 1]; cifra[i] *= 10; } for (long long int i = a; i <= b;) { string s; s = to_string(i); s += 's'; long long int palindrom = -37; int dlz=s.size()-1; for (int j = 0; j < s.size()-2; j++) { if (s[j] == s[j + 1]) { palindrom =s.size()-(j+1)-2; break; } else if (s[j] == s[j + 2]) { palindrom = s.size() - (j + 2)-2; break; } } if (palindrom == -37) { palfree += 1; palindrom = 0; } else { } i = (i / cifra[palindrom] * cifra[palindrom]) + cifra[palindrom]; } cout << palfree << "\n"; //std::cout << "Hello World!\n"; } // Run program: Ctrl + F5 or Debug > Start Without Debugging menu // Debug program: F5 or Debug > Start Debugging menu // Tips for Getting Started: // 1. Use the Solution Explorer window to add/manage files // 2. Use the Team Explorer window to connect to source control // 3. Use the Output window to see build output and other messages // 4. Use the Error List window to view errors // 5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project // 6. In the future, to open this project again, go to File > Open > Project and select the .sln file
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 7 ms | 204 KB | Output is correct |
4 | Correct | 3 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 0 ms | 204 KB | Output is correct |
11 | Correct | 0 ms | 204 KB | Output is correct |
12 | Correct | 1 ms | 204 KB | Output is correct |
13 | Correct | 1 ms | 204 KB | Output is correct |
14 | Correct | 3 ms | 204 KB | Output is correct |
15 | Correct | 3 ms | 204 KB | Output is correct |
16 | Correct | 1 ms | 204 KB | Output is correct |
17 | Correct | 1 ms | 204 KB | Output is correct |
18 | Correct | 1 ms | 204 KB | Output is correct |
19 | Correct | 7 ms | 204 KB | Output is correct |
20 | Correct | 4 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 122 ms | 204 KB | Output is correct |
2 | Execution timed out | 1037 ms | 204 KB | Time limit exceeded |
3 | Execution timed out | 1090 ms | 204 KB | Time limit exceeded |
4 | Execution timed out | 1081 ms | 204 KB | Time limit exceeded |
5 | Execution timed out | 1090 ms | 204 KB | Time limit exceeded |
6 | Execution timed out | 1098 ms | 204 KB | Time limit exceeded |
7 | Correct | 62 ms | 204 KB | Output is correct |
8 | Correct | 45 ms | 288 KB | Output is correct |
9 | Correct | 80 ms | 292 KB | Output is correct |
10 | Correct | 110 ms | 288 KB | Output is correct |
11 | Correct | 122 ms | 204 KB | Output is correct |
12 | Correct | 664 ms | 288 KB | Output is correct |
13 | Correct | 170 ms | 284 KB | Output is correct |
14 | Execution timed out | 1085 ms | 204 KB | Time limit exceeded |
15 | Execution timed out | 1087 ms | 204 KB | Time limit exceeded |
16 | Execution timed out | 1095 ms | 204 KB | Time limit exceeded |
17 | Correct | 0 ms | 204 KB | Output is correct |
18 | Correct | 0 ms | 204 KB | Output is correct |
19 | Correct | 0 ms | 204 KB | Output is correct |
20 | Correct | 0 ms | 204 KB | Output is correct |
21 | Execution timed out | 1090 ms | 204 KB | Time limit exceeded |
22 | Correct | 0 ms | 204 KB | Output is correct |
23 | Execution timed out | 1093 ms | 204 KB | Time limit exceeded |
24 | Correct | 0 ms | 204 KB | Output is correct |
25 | Execution timed out | 1087 ms | 204 KB | Time limit exceeded |
26 | Execution timed out | 1088 ms | 204 KB | Time limit exceeded |
27 | Execution timed out | 1086 ms | 204 KB | Time limit exceeded |
28 | Execution timed out | 1082 ms | 204 KB | Time limit exceeded |
29 | Correct | 1 ms | 204 KB | Output is correct |
30 | Correct | 0 ms | 204 KB | Output is correct |
31 | Execution timed out | 1094 ms | 204 KB | Time limit exceeded |
32 | Correct | 0 ms | 204 KB | Output is correct |
33 | Execution timed out | 1100 ms | 204 KB | Time limit exceeded |
34 | Correct | 0 ms | 204 KB | Output is correct |
35 | Execution timed out | 1089 ms | 204 KB | Time limit exceeded |
36 | Execution timed out | 1093 ms | 204 KB | Time limit exceeded |
37 | Execution timed out | 1092 ms | 204 KB | Time limit exceeded |
38 | Execution timed out | 1094 ms | 204 KB | Time limit exceeded |
39 | Execution timed out | 1079 ms | 204 KB | Time limit exceeded |
40 | Correct | 0 ms | 204 KB | Output is correct |
41 | Execution timed out | 1090 ms | 204 KB | Time limit exceeded |
42 | Correct | 1 ms | 204 KB | Output is correct |
43 | Execution timed out | 1092 ms | 204 KB | Time limit exceeded |
44 | Execution timed out | 1095 ms | 204 KB | Time limit exceeded |
45 | Execution timed out | 1082 ms | 204 KB | Time limit exceeded |