hihoCoder太阁最新面经算法竞赛18 register

Ended

Participants:65

Verdict:Accepted
Score:100 / 100
Submitted:2016-12-12 14:07:51

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
              #include<bits/stdc++.h>     
              using namespace std;  
              typedef long long  ll;
              typedef pair<ll,ll> pll;  
              #define pb(x) push_back(x)   
              #define ss(x) scanf("%s",x)
              #define sd(x) scanf("%d",&x) 
              #define sll(x) scanf("lld",&x)
              typedef unsigned long long  ull;     
              #define mem(A, X) memset(A, X, sizeof A)
              #define ford(i,l,u) for(ll (i)=(ll)(l);(i)>=(ll)(u);--(i))
              #define foreach(e,x) for(__typeof(x.begin()) e=x.begin();e!=x.end();++e)
              #define fori(i,l,u) for(ll (i)=(ll)(l);(i)<=(ll)(u);++(i))
              #define delete_this freopen("in.txt","r",stdin)
              #define sd2(x,y) scanf("%d%d",&x,&y)
              #define slf(x) scanf("%lf",&x)
              #define sc(x) scanf("%c",&x)
              typedef pair<int,int> pii;
              #define sec second
              #define fir first  
            
              const ll mod=1e9+7; 
              const ll maxn=1e5+10; 
              map<int,int> m;
              int main()
              { 
                   int tc;
                   while(cin>>tc)
                   {     
                      fori(kase,1,tc)
                      { 
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX