Pagini recente » Cod sursa (job #1809874) | Cod sursa (job #207103) | Cod sursa (job #1746018) | Cod sursa (job #350942) | Cod sursa (job #1438403)
#include <fstream>
using namespace std;
int main(){
ifstream f("tablete.in");
ofstream g("tablete.out");
int n = 0, k = 0;
f >> n >> k;
int i, jos, sus, sarit;
if(n%2 == 1 && k%2 == 1){
for(int i = 1; i <= k-1; ++i){
g << i << ' '; }
g << (k+1) << ' ' << (n*k) << ' ';
for(int i = n*k+2; i <= n*k + (n-k); ++i){
g << i << ' '; }
jos = k+2;
sus = n*k + (n-k);
sarit = k;
i = 1;
g << '\n'; }
else{
i = 0;
jos = 1;
sus = n*k+1;
sarit = -1; }
for(; i < n; ++i){
if(sarit != -1){
g << sarit << ' ';
sarit = -1; }
else{
sarit = -1;
g << (jos++) << ' '; }
for(int j = 2; j < k; ++j){
g << (jos++) << ' '; }
if(jos % 2 == 1){
sarit = jos++;
g << (jos++) << ' '; }
else{
sarit = -1;
g << (jos++) << ' '; }
for(int j = k; j < n; ++j){
g << (sus++) << ' '; }
g << '\n'; }
return 0; }