Cod sursa(job #1329586)
Utilizator | Data | 29 ianuarie 2015 17:54:29 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
#include <vector>
#define x first
#define y second
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int i,j,s,r,l,n,k;
int main()
{
f>>n>>k;
while(k>0)
{
i++;
k-=i;
}
for(j=1;j<n-i;j++)
g<<j<<" ";
r=n+k;
g<<r<<" ";
for(i=n;i>=j;i--)
if(i!=r)
g<<i<<" ";
return 0;
}