Pagini recente » Cod sursa (job #2612366) | Cod sursa (job #3030293) | Cod sursa (job #1137267) | Cod sursa (job #3156419) | Cod sursa (job #825809)
Cod sursa(job #825809)
#include <iostream.h>
#include <fstream.h>
using namespace std;
int n, j=0, i, m, v[1000], k=0, aux, lmin=0;
ifstream f("lacate.in");
ofstream g("lacate.out");
int main(){
f>>n;
m=n;
for(i=n; i>=1; i--){
j++;
v[j]=i; }
for(i=n-1; i>=1; i--){
m=m+1;
v[m+k]=i;}
for(i=1; i<m; i++){
for(j=i+1; j<=m; j++)
if(v[j]>v[i]){
aux=v[j];
v[j]=v[i];
v[i]=aux;
}
}
for(i=0; i<=m; i++){
k++;
if(k==2){ k=0; lmin+=1; }
}
m=m+1; v[m]=v[1]; k=1;
int chei=i;
g << lmin << " " << chei << "\n";
for(i=1; i<=m; i++) {
g << v[i] << " ";
j++;
if(j%2==0){g << "\n"; } }
return 0; }