Pagini recente » Cod sursa (job #2085907) | Cod sursa (job #2242763) | Cod sursa (job #1789712) | Cod sursa (job #2853093) | Cod sursa (job #2209492)
#include<iostream>
using namespace std;
int ap[100001], m1[10001], m2[10001];
int main()
{
int n, s=0, l1=0, l2=0, s1=0, s2=0, x, i;
cin>>n;
x=n;
s=n*(n+1)/2;
if(s%2==0)
{
while(s1!=s/2)
{
if(ap[x]==0 && s1+x<=s/2)
{
ap[x]=1;
l1++;
s1+=x;
m1[l1]=x;
}
x--;
}
for(i=1; i<=n; i++)
{
if(ap[i]==0)
{
l2++;
m2[l2]=i;
}
}
}
else
{
while(s1!=s/2){
if(ap[x]==0 && s1+x<=s/2)
{
ap[x]=1;
s1+=x;
l1++;
m1[l1]=x;
}
x--;
}
for(i=1;i<=n;i++)
if(ap[i]==0)
{
l2++;
m2[l2]=i;
}
}
cout<<l1;
for(i=1; i<=l1; i++)
cout<<m1[i]<<" ";
cout<<endl;
cout<<l2;
for(i=1; i<=l2; i++)
cout<<m2[i]<<" ";
return 0;
}