Submission #2077592


Source Code Expand


#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
#define inf 100000000/*10^8*/



////////////////////////////////////////



int main(){
    int n;cin>>n;
    char s[55][55];for(int i=0;i<=n-1;i++)cin>>s[i];
    int a[55][30];memset(a,0,sizeof(a));
    for(int i=0;i<=n-1;i++){
        int len=strlen(s[i]);
        for(int j=0;j<len;j++){
            a[i][s[i][j]-'a']++;
        }
    }
    for(int i=0;i<=25;i++){
        int min=inf;
        for(int j=0;j<=n-1;j++){
            if(a[j][i]<min)min=a[j][i];
        }
        a[54][i]=min;
    }
    for(int i=0;i<=25;i++){
        while(a[54][i]--){
            cout<<char('a'+i);
        }
    }cout<<endl;
    
    return 0;
}

Submission Info

Submission Time
Task C - Dubious Document
User sugarrr
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1139 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 10
Set Name Test Cases
Sample 0_000.txt, 0_001.txt
All 0_000.txt, 0_001.txt, dec_half.txt, hand.txt, max.txt, max_10.txt, max_5.txt, maxx.txt, rnd.txt, single.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
dec_half.txt AC 1 ms 256 KB
hand.txt AC 1 ms 256 KB
max.txt AC 1 ms 256 KB
max_10.txt AC 1 ms 256 KB
max_5.txt AC 1 ms 256 KB
maxx.txt AC 1 ms 256 KB
rnd.txt AC 1 ms 256 KB
single.txt AC 1 ms 256 KB