Submission #1231022

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()

#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++)
#define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define SZ(x) (int)(x).size()
#define BE(x) (x).begin(), (x).end()
#define SORT(x) sort(BE(x))
#define _1 first
#define _2 second

#define x1 gray_cat_x1
#define y1 gray_cat_y1

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

#define file "cycle"

const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const ll MOD = 1e9 + 7;

const int MAXN = 1e5 + 5;

int cnt[MAXN];

void solve(){
	int n, a, mx, mn;
	scanf("%d", &n);
	mx = 0;
	mn = INF;
	REP(i, 0, n){
		scanf("%d", &a);
		cnt[a]++;
		mx = max(mx, a);
		mn = min(mn, a);
	}
	if (cnt[mx] == 1){
		printf("Impossible\n");
		return;
	}
	if (mn * 2 < mx || mn * 2 > mx + 1){
		printf("Impossible\n");
		return;
	}
	if (mn * 2 == mx && (cnt[mn] != 1 || cnt[mn + 1] == 1)){
		printf("Impossible\n");
		return;
	}
	if (mn * 2 == mx + 1 && cnt[mn] != 2){
		printf("Impossible\n");
		return;
	}
	for(int i = mx - 1; i > mn; i--){
		if (cnt[i] <= 1){
			printf("Impossible\n");
			return;
		}
	}
	printf("Possible\n");
}	

int main(){

	//freopen(file".in", "r", stdin); freopen(file".out", "w", stdout);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();	
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:40:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:44:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a);
                  ^

Judge Result