Pagini recente » Cod sursa (job #3338086) | Cod sursa (job #3312737) | Cod sursa (job #3349408) | Cod sursa (job #3322472) | Cod sursa (job #3335815)
#include <fstream>
using namespace std;
ifstream in( "tablete.in" );
ofstream out( "tablete.out" );
#define MAXN 1000
int answ[ MAXN + 1 ][ MAXN + 1 ];
int n, k;
void solve( )
{
in >> n >> k;
if( k % 2 == 0 )
{
for( int i = 1; i <= n; i++ )
{
for( int j = 1; j <= n; j++ )
{
answ[ i ][ j ] = ( i - 1 ) * n + j;
}
}
}
// else
// {
//
// }
for( int i = 1; i <= n; i++ )
{
for( int j = 1; j <= n; j++ )
{
out << answ[ i ][ j ] << " ";
}
out << '\n';
}
}
int main( )
{
solve( );
return 0;
}