hiho week 49 register

Ended

Participants:509

Verdict:Accepted
Score:100 / 100
Submitted:2015-06-08 22:48:23

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 <iostream>
#include <cstring>
using namespace std;
int main()
{
    int m,n;
    int du[10010];
    cin>>n>>m;
    int i;
    int a,b;
    memset(du,0,sizeof(du));
    for (i=0;i<m;i++)
    {
        cin>>a>>b;
        du[a]++;
        du[b]++;
    }
    int leap=1,p=0;
    for (i=1;i<=n&&leap;i++)
    {
        if (du[i]==0) leap=0;
    }
    for (i=1;i<=n&&leap;i++)
    {
        if (du[i]%2) p++;
    }
    if (p!=2&&p!=0) leap=0;
    if (leap) cout<<"Full"<<endl;
    else cout<<"Part"<<endl;
    return 0;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX