Submission #1213010

---

Source Code Expand

#include <bits/stdc++.h>

#define FI(i,a,b) for(int i=(a);i<=(b);i++)
#define FD(i,a,b) for(int i=(a);i>=(b);i--)

#define LL long long
#define Ldouble long double
#define PI 3.1415926535897932384626

#define PII pair<int,int>
#define PLL pair<LL,LL>
#define mp make_pair
#define fi first
#define se second

using namespace std;

int n, l, r;
char s[10005][25];

struct name{
	char t[25];
	int id;
	bool operator<(const name & k) const{
		if(!strcmp(t, k.t)) return id < k.id;
		else return strcmp(t, k.t) < 0;
	}
};

name u[10005];

int main(){
	scanf("%d", &n);
	FI(i, 1, n + 1) scanf(" %s", s[i]);
	//first
	FI(i, 1, n){
		int len = strlen(s[i]);
		FI(j, 0, len - 1){
			if(s[i][j] == '?') u[i].t[j] = 'z';
			else u[i].t[j] = s[i][j];
		}
		u[i].id = i;
	}
	strcpy(u[n + 1].t, s[n + 1]);
	u[n + 1].id = 0;
	sort(u + 1, u + n + 2);
	FI(i, 1, n + 1) if(u[i].id == 0){
		l = i;
		break;
	}
	//last
	FI(i, 1, n){
		int len = strlen(s[i]);
		FI(j, 0, len - 1){
			if(s[i][j] == '?') u[i].t[j] = 'a';
			else u[i].t[j] = s[i][j];
		}
		u[i].id = i;
	}
	strcpy(u[n + 1].t, s[n + 1]);
	u[n + 1].id = n + 1;
	sort(u + 1, u + n + 2);
	FI(i, 1, n + 1) if(u[i].id == n + 1){
		r = i;
		break;
	}
	FI(i, l, r) printf("%d%c", i, i == r ? '\n':' ');
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:34:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  FI(i, 1, n + 1) scanf(" %s", s[i]);
                                    ^

Judge Result