Pagini recente » Cod sursa (job #2875470) | Cod sursa (job #230640) | Cod sursa (job #2917841) | Cod sursa (job #2695671) | Cod sursa (job #135653)
Cod sursa(job #135653)
Utilizator |
Mircea Pasoi domino |
Data |
14 februarie 2008 02:26:39 |
Problema |
Lampa |
Scor |
Ascuns |
Compilator |
cpp |
Status |
done |
Runda |
|
Marime |
1.33 kb |
#include <stdio.h>
#include <string>
using namespace std;
#define FIN "lampa.in"
#define FOUT "lampa.out"
#define MAX_S 4000000
#define sz(x) ((int)(x).size())
int N, M; char s[MAX_S];
string C, S, bstA, bstB;
int works(const char a[], const char b[])
{
int i, p = 0, n = strlen(a), m = strlen(b);
for (i = 0; i < sz(C); ++i)
if (C[i] == 'A')
{
if (memcmp(s+p, a, n)) return 0;
p += n;
}
else
{
if (memcmp(s+p, b, m)) return 0;
p += m;
}
return 1;
}
int main(void)
{
int i, j, a, b;
string A, B;
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
scanf("%d %d %s", &N, &M, s);
S = s;
A = "A"; B = "B";
for (i = 3; i <= N; ++i)
{
C = A+B;
A = B; B = C;
if (i == N-2) a = sz(C);
if (i == N-1) b = sz(C);
}
for (i = 1; i*a <= M; ++i)
{
j = M-i*a;
if (j%b) continue;
j /= b;
A = N&1 ? S.substr(0, i) : S.substr(j, i);
B = N&1 ? S.substr(i, j) : S.substr(0, j);
if (!works(A.c_str(), B.c_str())) continue;
if (bstA == "" || bstA > A)
bstA = A, bstB = B;
}
printf("%s\n%s\n", bstA.c_str(), bstB.c_str());
return 0;
}