Cod sursa(job #2287865)
Utilizator | Data | 22 noiembrie 2018 16:36:26 | |
---|---|---|---|
Problema | Order | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("order.in");
ofstream fo("order.out");
int k=1,t=1,n,nn,l;
bool a[30000];
int main()
{
fi >> n;
nn=n;
while(nn)
{
l=t;
while(l)
{
k++;
if(k>n) k%=n;
while(a[k]==1)
{
k++;
if(k>n) k%=n;
}
l--;
}
t++;
a[k]=1;
fo << k << " ";
nn--;
}
}