Pagini recente » Cod sursa (job #1889254) | Cod sursa (job #621657) | Cod sursa (job #1031094) | Cod sursa (job #2789271) | Cod sursa (job #1559489)
#include<cstdio>
#include<bitset>
#define MOD 104659
#define DIM 1001
using namespace std;
int M, N, sol;
int w[DIM][26];
char X, Y,a, b;
//bitset <26> v[26];
int v[26][26];
char S[5];
int main()
{
freopen("an.in","r",stdin);
freopen("an.out","w",stdout);
scanf("%d%d", &N, &M);
int A, B;
int K;
for (int i = 1; i <= 5; i++)
{
scanf("%d%d", &A, &B);
printf("%d %d\n", A, B);
}
/*for (int i = 1; i <= M; i++)
{
//scanf("%c %c\n", &X, &Y);
gets(S); X = S[0], Y = S[2];
printf("%d %d\n", X, Y);
v[X - 'a'][Y - 'a'] = 1;
v[Y - 'a'][X - 'a'] = 1;
//scanf("%c", &X);
}
/*for (int i = 0; i < 26; i++)
{
for (int j = 0; j < 26; j++)
printf("%d ", v[i][j]);
printf("\n");
}
/*for (int i = 0; i < 26; i++)
v[0][i] = 1;
for (int i = 1; i < N; i++)
for (int j = 0; j < 26; j++)
for (int k = 0; k < 26; k++)
if (!v[k][j])
w[i][j] = (w[i][j] + w[i - 1][k]) % MOD;
for (int i = 0; i < 26; i++)
sol = (sol + w[N - 1][i]) % MOD;
printf("%d\n", sol);*/
}