Pagini recente » Cod sursa (job #2643888) | Cod sursa (job #79820) | Cod sursa (job #1415173) | Cod sursa (job #626989) | Cod sursa (job #800370)
Cod sursa(job #800370)
#include<fstream>
using namespace std;
ifstream f("dame.in");
ofstream g("dame.out");
int n,i,c[1010],a[] = {0, 1, 4, 5, 6, 7, 11};
void swap(int a,int b)
{
int e;
e=a;
a=b;
b=a;
}
int main()
{f>>n;
for(i=2; i<=n; i+=2) c[i/2]=i;
for(i=1; i<=n; i+=2) c[n/2+i/2+1]=i;
if(n == 1 || n == 2)
g<<"1"<<'\n'<<"2"<<" "<<"1";
else if(n == 3)
g<<"2"<<'\n'<<"1"<<" "<<"1"<<'\n'<<"2"<<" "<<"3";
if(n%12 == 3 || n%12 == 9)
{
for(i=1; i<=n/2; ++i)
c[i]=c[i+1];
c[n/2]=2;
}
if(n%12 == 3 || n%12 == 9)
{
for(i=n/2+1; i<n-1; ++i)
c[i]=c[i+2];
c[n-1]=1;
c[n]=3;
}
else if(n%12 == 2)
{
c[n/2+1]=3;
c[n/2+2]=1;
for(i=n/2+3; i<n; i++)
c[i]=c[i+1];
c[n]=5;
}
else if(n%12 == 8)
{
for(i=1; i<=n; i++)
swap(c[i],c[i+1]);
}
for(i=1; i<=n; i++)
{
if(n%12 == a[i]) {g<<n<<'\n';
for(i=1; i<=n; i++) g<<i<<" "<<c[i]<<'\n';}
}
g<<n<<'\n';
for(i=1; i<=n; i++) g<<i<<" "<<c[i]<<'\n';
return 0;
}