| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 67873 | ekrem | Binary Subsequences (info1cup17_binary) | C++98 | 102 ms | 4788 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1000005
using namespace std;
int t, n;
int coz(int n){
	for(int i = sqrt(n) + 1; i >= 1; i--)
		if(n%i == 0)
			return i;
	return 1;
}
int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		n++;
		int cvp = coz(n);
		int ans = n/cvp;
		cvp--;
		ans--;
		printf("-1\n");
		for(int i = 1; i <= cvp; i++)
			printf("0 ");
		for(int i = 1; i <= ans; i++)
			printf("1 ");
		puts("");
	}
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
