jesper203 2015-9-23 01:13
:verygood: :verygood: :verygood:
kbgo 2015-9-23 01:20
[隱藏廣告]
Thank s for sharing
skhsaps 2015-9-23 22:27
Great!Thanks and support!
mankomarry 2015-9-23 22:40
!!!!!!!!!!
marscheng 2015-9-23 23:20
thanks for your sharing
melco1963 2015-9-23 23:25
:verygood:
Foradultlove 2015-9-24 06:07
thanks a lot
lee2136k 2015-9-25 01:48
回復 1# 的帖子
thanks for sharing
【白風】 2015-9-25 11:10
:loveliness: :loveliness: :loveliness:
GKLxyz 2015-9-25 11:30
Good. She sure is honry.
Thanks for sharing...
yumikowmy 2015-9-28 16:29
:loveeyes: :loveeyes:
Ricks 2015-10-30 12:19
Great and thanks for sharing
gemini88 2015-10-30 12:21
ggggggggggggg
tripfinder 2015-10-30 12:25
:verygood:
eddie3838 2015-10-30 12:37
:verygood: :verygood:
philio 2015-10-30 15:12
thank you very much............
siu-pui 2015-10-30 23:19
bbbbbbbbbbbbbbbbbbbbbbbbbbb
天之杯 2015-10-31 00:08
:loveliness: :loveliness: :loveliness: :loveliness: :loveliness: :loveliness: :loveliness:
ajileungben 2015-10-31 00:14
Thanks for sharing
19380112 2015-11-4 11:31
thanks for sharing :loveeyes:
naughtyboy 2015-11-17 18:04
多謝分享,多謝分享。
judy19600610 2015-11-17 23:07
謝謝大大!!^_^
lzt2002 2015-11-22 21:56
/*
Name:
Copyright: lzt2002
Author: lzt2002
Date: 20/08/15 22:18
Description:
*/
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
#define havetxt 0
#define shuru "input.txt"
#define shuchu "output.txt"
#define inf 0x7fffffff
#define esp 1e-9
#define mod 1000000007
typedef long long ll;
int u[22222],s[22222],v[22222],mark;
vector<int> adj[22222],G[22222];
int n,m,c;
int nin[22222],nout[22222];
void dfs1(int x)
{
u[x]=1;
for(int i=0;i<G[x].size();i++)
{
if(!u[G[x][i]]) dfs1(G[x][i]);
}
s[c++]=x;
}
void dfs2(int x)
{
if(u[x]!=0) return;
u[x]=mark;
for(int i=0;i<adj[x].size();i++)
{
if(!u[adj[x][i]]) dfs2(adj[x][i]);
}
}
int main()
{
int T;
cin>>T;
while(T--)
{
memset(u,0,sizeof(u));
memset(G,0,sizeof(G));
memset(adj,0,sizeof(adj));
mark=0;
c=0;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a,b;
cin>>a>>b;
G[a].push_back(b);
adj[b].push_back(a);
}
for(int i=1;i<=n;i++)
{
if(!u[i]) dfs1(i);
}
memset(u,0,sizeof(u));
for(int i=n-1;i>=0;i--)
{
if(!u[s[i]])
{
++mark;
dfs2(s[i]);
}
}
if(mark==1)
{
cout<<0<<endl;
continue;
}
memset(nin,0,sizeof(nin));
memset(nout,0,sizeof(nout));
for(int i=1;i<=n;i++)
{
for(int j=0;j<G[i].size();j++)
{
if(u[i]!=u[G[i][j]])
{
nin[u[G[i][j]]]++;
nout[u[i]]++;
}
}
}
int nin0=0,nout0=0;
for(int i=1;i<=mark;i++)
{
if(nin[i]==0)
{
nin0++;
}
else if(nout[i]==0)
{
nout0++;
}
}
cout<<max(nin0,nout0)<<endl;
}
return 0;
}
wiwi0306 2015-11-22 22:49
優質艷人妻 SUE LING