Cod sursa(job #469297)

Utilizator bugyBogdan Vlad bugy Data 7 iulie 2010 13:29:50
Problema Multimi2 Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.32 kb
#include <stdio.h>
using namespace std;
#define dim 500010
int m1[dim], m2[dim],n,n1,n2,x,d;

int main()
{
	       
FILE *f=fopen("multimi2.in","r"), *g=fopen("multimi2.out","w");          
    

	fscanf(f,"%d",&n);
	int i;
	x=n % 4;
	switch (x)
	{
	case 0: 
		{
			for (i=1; i<n/2; i+=2)
			{
				m1[i] = i;		 m1[i + 1] = n - i + 1;
				m2[i] = i + 1;	 m2[i + 1] = n - i;
			}
			d = 0;
			n1 = n2 = n/2;		
			break;
		}
	case 1:
		{
			for (i=1; i<n/2; i+=2)
			{
				m1[i] = i + 1; 	 m1[i + 1] = n - i + 1;
				m2[i] = i + 2;	 m2[i + 1] = n - i ;
			}
			d = 1;
			n1 = n2 = n/2;			
			m1[++n1] = 1;
			break;
		}
	case 2:
		{
			for (i=1; i<n/2; i+=2)
			{
				m1[i] = i + 2; 	 m1[i + 1] = n - i + 1;
				m2[i] = i + 3; 	 m2[i + 1] = n - i ;
			}
			d = 1;
			n1 = n2 = n/2 - 1;			
			m1[++n1] = 1;
			m2[++n2] = 2;
			break;
		}
	case 3:
		{
			for (i=1; i<n/2; i+=2)
			{
				m1[i] = i + 3;	 m1[i + 1] = n - i + 1;
				m2[i] = i + 4; 	 m2[i + 1] = n - i ;
			}
			d = 0;
			n1 = n2 = n/2 - 1;			
			m1[++n1] = 1; 
			m1[++n1] = 2;
			m2[++n2] = 3;
			break;
		}
	}

	fprintf(g,"%d\n",d);
	
	fprintf(g,"%d\n",n1);
	for (i = 1; i <= n1; i++) fprintf(g,"%d ",m1[i]);
	fprintf(g,"\n%d\n",n2);
	for (i = 1; i <= n2; i++) fprintf(g,"%d ",m2[i]);
	fprintf(g,"\n");
	return 0;
}