Cod sursa(job #1043244)
Utilizator | Data | 28 noiembrie 2013 10:21:04 | |
---|---|---|---|
Problema | Order | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
int i,k,n,c,v[30000];
ifstream f("order.in");
ofstream g("order.out");
f>>n;
cin>>k; c=1;
for(i=0;i<n;i++)
v[i]=i;
while(v[i]!=0)
{while(v[i+k-1]==0)
i++;
v[i+k-1]=0; c++;
i+=k-1;
g<<v[i]<<" ";
do
{ if(c<n)
i++;
else break;}
while(v[i]==0);
}
f.close();
g.close();
}