Search found 7 matches
- Sun Jul 29, 2007 1:42 pm
- Forum: Volume 9 (900-999)
- Topic: 927 - Integer Sequences from Addition of Terms
- Replies: 4
- Views: 8217
Donte: If an=n^2, and d=3 then the first terms of bm are: 1, 1, 1, 4, 4, 4, 4, 4, 4, 9, 9, 9, 9, 9, 9, 9, 9 , 9, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 25, 25, ... For k=1 you have to print 1. For k=2 you have to print 1. For k=3 you have to print 1. For k=4 you have to print 4. For k=9 you...
- Fri Jun 29, 2007 3:26 am
- Forum: Volume 108 (10800-10899)
- Topic: 10855 - Rotated square
- Replies: 12
- Views: 12685
n<=100
N<=100
- Tue Oct 10, 2006 5:54 am
- Forum: Volume 111 (11100-11199)
- Topic: 11113 - Continuous Fractions
- Replies: 16
- Views: 13835
- Tue Jun 27, 2006 1:17 am
- Forum: Volume 106 (10600-10699)
- Topic: 10650 - Determinate Prime
- Replies: 67
- Views: 36114
- Fri Dec 16, 2005 8:42 am
- Forum: Volume 101 (10100-10199)
- Topic: 10178 - Count the Faces.
- Replies: 12
- Views: 5930
Re: 10178 Count the faces WA???
I only used r=1+e-n+k, (k=number connected components of the graph).
Maybe you forgot that it is case sensitive
Input
2 0
2 1
A a
3 1
A a
3 3
a c
c A
a c
2 2
a a
A A
Output
1
1
1
2
3
Maybe you forgot that it is case sensitive
Input
2 0
2 1
A a
3 1
A a
3 3
a c
c A
a c
2 2
a a
A A
Output
1
1
1
2
3
- Sat Jun 18, 2005 5:41 am
- Forum: Volume 5 (500-599)
- Topic: 548 - Tree
- Replies: 23
- Views: 13831
- Thu Jun 16, 2005 8:23 am
- Forum: Volume 5 (500-599)
- Topic: 548 - Tree
- Replies: 23
- Views: 13831
548 Tree WA
Can anybody send some test cases or tell me what is wrong in my program? This is my code: const lim=10005; type arbol=record i,d:integer; q:longint; end; var arb:array[0..lim] of arbol; ino, post:array[0..lim] of longint; j,cont,cant:integer; min,quien:longint; procedure arma(ini,fin,n:longint); var...