Submission #1370997

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <string>
#define pb push_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define INF (1100000099)
#define INFLL (1100000000000000099ll)
#define MOD (1000000007)
#define MAXN (55)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;

string S;
char str[MAXN][55];
int cnt[MAXN][26];
int N;

int main() {
	scanf("%d", &N);
	for(int i = 1; i <= N; i++) scanf(" %s", str[i]);
	for(int i = 1; i <= N; i++) for(int j = 0; str[i][j]; j++)
		cnt[i][str[i][j] - 'a']++;
	for(int i = 2; i <= N; i++) for(int j = 0; j < 26; j++)
		upmin(cnt[1][j], cnt[i][j]);
	for(int i = 0; i < 26; i++) for(int j = 0; j < cnt[1][i]; j++)
		S += ('a' + i);
	if(S.empty()) { putchar(' '); return 0; }
	puts(S.c_str());
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:45:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:46:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= N; i++) scanf(" %s", str[i]);
                                                  ^

Judge Result