Cod sursa(job #1077685)
Utilizator | Data | 11 ianuarie 2014 16:11:58 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int main()
{
int N, i, p;
long long K, s=1;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f>>N>>K;
while(s*(s+1)/2<=K)
s++;
for(i=1; i<N-s; i++)
g<<i<<" ";
p = N - (s*(s+1)/2 - K);
g<<p<<" ";
for(i=N; i>=N-s; i--)
if(i!=p)
g<<i<<" ";
f.close();
}