Pagini recente » Cod sursa (job #262297) | Cod sursa (job #2471161) | Cod sursa (job #2701367) | Cod sursa (job #1527573) | Cod sursa (job #1333603)
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
#include<set>
#include<map>
#include<cmath>
using namespace std ;
vector<int> A, B ;
int N, sol ;
int main()
{
std::ios_base::sync_with_stdio(false) ;
freopen("multimi2.in", "r", stdin);
freopen("multimi2.out", "w", stdout);
cin >> N ;
int act ;
for(act = N; act >= 4; act -= 4)
{
A.push_back(act) ;
A.push_back(act - 3) ;
B.push_back(act - 1) ;
B.push_back(act - 2) ;
}
if(act == 3)
{
sol = 0 ;
A.push_back(1) ;
A.push_back(2) ;
B.push_back(3) ;
}
if(act == 2)
{
sol = 1 ;
A.push_back(1) ;
B.push_back(2) ;
}
if(act == 1)
{
sol = 1 ;
A.push_back(1) ;
}
cout << sol << "\n" << A.size() << "\n" ;
for(vector<int>::iterator it = A.begin(); it != A.end(); ++it)
cout << *it << " " ;
cout << "\n" << B.size() << "\n" ;
for(vector<int>::iterator it = B.begin(); it != B.end(); ++it)
cout << *it << " " ;
return 0 ;
}