1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int node[10100];
int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    int result = 0;
    while(m--){
        int u,v;
        scanf("%d%d",&u,&v);
        node[u]++;
        node[v]++;
        if(node[u] & 0x1 && node[v] & 0x1) result += 2;
        else if(!(node[u] & 0x1) && !(node[v] & 0x1)) result -= 2;
    }
    if(result <= 2) printf("Full\n");
    else printf("Part\n");
    return 0;
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX