| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 457971 | 2021-08-07T16:26:32 Z | myvaluska | Palindrome-Free Numbers (BOI13_numbers) | C++14 | 1 ms | 204 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;
for (int j = 0; j < s.size()-1; j++)
{
if (s[j] == s[j + 1])
{
palindrom =s.size()-(j+1);
palindrom -= 1;
break;
}
else if (s[j] == s[j + 2])
{
palindrom = s.size() - (j + 2);
palindrom -= 1;
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
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 2 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 4 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 5 | Correct | 0 ms | 204 KB | Output is correct |
| 6 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 7 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 8 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 9 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 10 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 11 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 12 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 13 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 14 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 15 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 16 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 17 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 18 | Correct | 1 ms | 204 KB | Output is correct |
| 19 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 20 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 4 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 5 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 6 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 7 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 8 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 9 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 10 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 11 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 12 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 13 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 14 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 15 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 16 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 17 | Correct | 1 ms | 204 KB | Output is correct |
| 18 | Correct | 1 ms | 204 KB | Output is correct |
| 19 | Correct | 1 ms | 204 KB | Output is correct |
| 20 | Correct | 0 ms | 204 KB | Output is correct |
| 21 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 22 | Correct | 1 ms | 204 KB | Output is correct |
| 23 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 24 | Correct | 0 ms | 204 KB | Output is correct |
| 25 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 26 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 27 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 28 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 29 | Correct | 0 ms | 204 KB | Output is correct |
| 30 | Correct | 0 ms | 204 KB | Output is correct |
| 31 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 32 | Correct | 0 ms | 204 KB | Output is correct |
| 33 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 34 | Correct | 0 ms | 204 KB | Output is correct |
| 35 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 36 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 37 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 38 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 39 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 40 | Correct | 0 ms | 204 KB | Output is correct |
| 41 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 42 | Correct | 0 ms | 204 KB | Output is correct |
| 43 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 44 | Incorrect | 1 ms | 204 KB | Output isn't correct |
| 45 | Incorrect | 0 ms | 204 KB | Output isn't correct |