Rezultati

Up. imeNalogaJezikRezultatČas oddaje
koklja-2017 Hierarhija C++ 100/100OK 11. maj '17 @ 16:42

Test Točke Porabljen spomin Porabljen čas Status
#1 10/10 3,273 MiB 0,004 s OK
#2 10/10 3,273 MiB 0,004 s OK
#3 10/10 3,273 MiB 0,004 s OK
#4 10/10 3,109 MiB 0,004 s OK
#5 10/10 3,109 MiB 0,004 s OK
#6 10/10 3,273 MiB 0,004 s OK
#7 10/10 3,273 MiB 0,004 s OK
#8 10/10 3,109 MiB 0,004 s OK
#9 10/10 3,109 MiB 0,004 s OK
#10 10/10 3,270 MiB 0,004 s OK

Ocenjevani program (hierarhija.cpp):
#include <iostream>
#include <complex>
#include <iomanip>
#include <climits>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>

#define FOR(i,n) for(int i=0,_n=n;i<_n;i++)
#define FORR(i,s,n) for(int i=s,_n=n;i<_n;i++)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define fs first
#define sec second
#define fi first
#define se second
#define INF (1LL<<50LL)

#define maxn 100000

using namespace std;
typedef long long ll;

const ll MOD = 1000000007LL;

int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	FOR(i,n-m)printf("%d%c",i+1,i==n-2?'\n':' ');
	FORR(i,n-m,n-1)printf("%d%c",n-m,i==n-2?'\n':' ');
	return 0;
}