int main()
{
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
init.t[i][j] = in.t[i][j] = 1;
init.t[0][0] = 2, in.t[1][1] = 0;
int n;
while(scanf("%d", &n) == 1){
if(n <= 2) puts("1");
else if(n == 3) puts("2");
else printf("%d\n", (Ans(n-3)-Ans(n-4)/2+100019)%100019);
}
return 0;
}
main ()
{
while ( scanf ( "%d" , &C ) , C ) {
scanf ( "%d%d" , &N , &M );
printf ( "%.3f\n" , Ans () );
}
}
std::vector < std::complex < Type > > Merge_vectors_to_complex(const std::vector < Type > &X, const std::vector < Type > &Y) {
assert(X.size() == Y.size());
std::vector < std::complex < Type > > Ans(X.size());
for (size_t i = 0; i < Ans.size(); i++)
Ans[i] = std::complex < Type >(X[i], Y[i]);
return Ans;
}
std::vector < std::complex < Type > > Vector_real_real_to_complex(const std::vector < Type > &R, const std::vector < Type > &I) {
assert(R.size() == I.size());
std::vector < std::complex < Type > > Ans(R.size());
for (size_t i = 0; i < Ans.size(); i++)
Ans[i] = std::complex < Type >(R[i], I[i]);
return Ans;
}
main ()
{
int total , n , m;
for ( scanf ( "%d" , &total ); total; total -- ) {
scanf ( "%d%d" , &n , &m );
printf ( "%d\n" , Ans ( n , m ));
}
}
main ()
{
int total;
for ( scanf ( "%d" , &total ); total; total -- ) {
init ();
printf ( "%d\n" , Ans () );
}
}
int main(int argc, char* argv[])
{
freopen ( "p.in" , "r" , stdin );
while ( init () )
printf ( "%d\n" , N - Ans ());
return 0;
}
main ()
{
int total;
for ( scanf ( "%d" , &total ); total; total -- ) {
scanf ( "%d%lf" , &N , &High );
printf ( "%.2lf\n" , Ans () );
if ( total > 1 ) printf ( "\n" );
}
}
int solve() {
finalans.clear();
ans = 0;
init();
for(int i = 0 ;i < n;i++) {
memset(exist,false,sizeof(exist));
dfs(i,0,true,0);
}
cout << ans << endl;
Ans();
return ans;
}
int main(){
while(cin >> n){
int a , b;
chu();
cin >> m >> d;
for(int i = 0 ; i < m; i++){
cin >> a >> b;
con[a][b] = 1;
con[b][a] = 1;
}
for(int i = 0; i < n; i++)
cin >> t[i][0] >> t[i][1];
if(false == solve())
cout << "No solution" << endl;
else
Ans();
cout << endl;
}
return 0;
}
main ()
{
for ( int i = 0; i < 100; i ++ ) Answer [i] = -1;
while ( scanf ( "%d" , &N ) != EOF )
printf ( "%.4lf\n" , Ans ());
}
std::vector < std::complex < Type > > Vector_real_to_complex(const std::vector < Type > &V) {
std::vector < std::complex < Type > > Ans(V.size());
for (size_t i = 0; i < V.size(); i++)
Ans[i] = std::complex < Type >(V[i]);
return Ans;
}
