Cod sursa(job #2108443)
| Utilizator | Data | 18 ianuarie 2018 12:44:16 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
#define n_Max 100000
ifstream f("farfurii.in");
ofstream g("farfurii.out");
bool ap[n_Max+5];
int main(){
unsigned long long n,k,l,i;
f>>n>>k;
l=n;
for(i=1;i<=n;i++){
l--;
if(l*(l-1)/2<=k)
break;
g<<i<<" ";
ap[i]=1;
}
unsigned long long val;
val=l*(l-1)/2;
for(int j=i;j<=n;j++){
if(val+j-i==k){
g<<j<<" ";
ap[j]=1;
break;
}
}
for(int j=n;j>=1;j--)
if(ap[j]==0)
g<<j<<" ";
}
