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

Ended

Participants:164

Verdict:Accepted
Score:100 / 100
Submitted:2016-10-26 15:49:14

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
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<cmath>
#include<deque>
#include<functional>
#include<iterator>
#include<set>
#include<utility>
#include<stack>
#include<queue>
#include<bitset>
#define maxn 101000
#define inf 1500000007
using namespace std;
typedef long long LL;
int main()
{
    int a[5];
    while(~scanf("%d%d%d%d",&a[0],&a[1],&a[2],&a[3])){
        int ans=-1;
        for(int i=0;i<4;++i){
            for(int j=0;j<4;++j){
                if(i == j)  continue;
                for(int k=0;k<4;++k){
                    if(i == k || j == k)    continue;
                    for(int p=0;p<4;++p){
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX