Submission #1367998

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
typedef pair<int,int> P;
 
int main() {
  string s;
  getline(cin,s);
  set<string> ans;
  string t="";
  bool ck=false;
  rep(i,s.size()) {
    if(s[i]=='@') {
      if(t.size()) ans.insert(t);
      ck=true;
      t="";
      continue;
    } else if(!isalpha(s[i])) {
      if(t.size()) ans.insert(t);
      ck=false;
      t="";
      continue;
    }
    if(ck && isalpha(s[i])) t+=s[i];
  }
  if(t.size()) ans.insert(t);
  tr(it,ans) pr(*it);
  return 0;
}

Submission Info

Judge Result