Cod sursa(job #2204981)
| Utilizator | Data | 17 mai 2018 15:00:53 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n, k;
f>>n>>k;
long long db=n;
while((n-db)*(n-db-1)<2*k and db>0) db--;
//if(db>0)
for(int i=1; i<=db; i++) g<<i<<" ";
//cout<<endl;
int maradt=n-db-1;
int plusz=k-(maradt-1)*maradt/2;
//cout<<(maradt-1)*maradt/2<<endl;
g<<db+plusz+1<<" ";
for(int i=n; i>db; i--) if(i!=db+plusz+1) g<<i<<" ";
g<<endl;
//else for(int i=n; i>=)
return 0;
}
