Sereja and Bottles-水题有点坑爹

CodeForces - 315A
Time Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u

 Status

Description

Sereja and his friends went to a picnic. The guys had n soda bottles just for it. Sereja forgot the bottle opener as usual, so the guys had to come up with another way to open bottles.

Sereja knows that the i-th bottle is from brand ai, besides, you can use it to open other bottles of brand bi. You can use one bottle to open multiple other bottles. Sereja can open bottle with opened bottle or closed bottle.

Knowing this, Sereja wants to find out the number of bottles they've got that they won't be able to open in any way. Help him and find this number.

Input

The first line contains integer n(1 ≤ n ≤ 100) — the number of bottles. The next n lines contain the bottles' description. The i-th line contains two integers ai, bi(1 ≤ ai, bi ≤ 1000)— the description of the i-th bottle.

Output

In a single line print a single integer — the answer to the problem.

Sample Input

Input
4
1 1
2 2
3 3
4 4
Output
4
Input
4
1 2
2 3
3 4
4 1
Output

0

理解题意即可

/*
Author: 2486
Memory: 812 KB		Time: 60 MS
Language: GNU G++ 4.9.2		Result: Accepted
Public:		No Yes
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=1000+5;
bool vd[maxn][maxn];
struct fs{
    int a,b;
}fss[maxn];
int main() {
    int b,n;
    scanf("%d",&n);
    memset(vd,false,sizeof(vd));
    for(int i=1; i<=n; i++) {
        scanf("%d%d",&fss[i].a,&fss[i].b);
        vd[fss[i].b][fss[i].a]=true;
    }
    bool flag=true;
    int cnt=0;
    for(int i=1; i<=n; i++) {
        flag=false;
        for(int j=1; j<=n; j++) {
            if(i==j)continue;
            if(fss[i].a==fss[j].b) {
                flag=true;
                break;
            }
        }
        if(flag)cnt++;
    }
    printf("%d\n",n-cnt);
    return 0;
}


评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值