Hi!
Actually, there is a special case : when you don't move (you updated position is the same than your last position), the area should not change.
Regards.
Search found 11 matches
- Mon Jun 13, 2011 12:18 am
- Forum: Volume 100 (10000-10099)
- Topic: 10084 - Hotter Colder
- Replies: 2
- Views: 2205
- Tue Jun 17, 2008 6:13 pm
- Forum: Volume 1 (100-199)
- Topic: 195 - Anagram
- Replies: 242
- Views: 26682
Re: 195: anagram, wrong answer
Hi,
I didn't checked your code, but did you test input with 'z' and 'Z' ?
I've got the same problem and solved it like that ...
Regards,
Brainless
I didn't checked your code, but did you test input with 'z' and 'Z' ?
I've got the same problem and solved it like that ...
Regards,
Brainless
- Fri Mar 14, 2008 5:38 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11401 - Triangle Counting
- Replies: 19
- Views: 10291
- Fri Mar 14, 2008 5:29 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11401 - Triangle Counting
- Replies: 19
- Views: 10291
- Fri Mar 14, 2008 5:18 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11401 - Triangle Counting
- Replies: 19
- Views: 10291
Hi, I think that my algorithm is correct, but I still get WA. Here is my source code : #include <iostream> #include <map> using namespace std; typedef unsigned long ul; typedef unsigned long long ull; typedef long double ld; int main() { map<ul, ld> S; //ld S[1000001]; ld R; S[3] = 0; S[4] = 1; ul b...
- Fri Mar 14, 2008 5:12 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11317 - GCD+LCM
- Replies: 16
- Views: 5971
- Sun Mar 09, 2008 12:33 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11317 - GCD+LCM
- Replies: 16
- Views: 5971
Hello, I've got the right output for the simple input, but the result of submission is WA. Can you tell me what is your output with this input ? Input: 49872 1000000 197324 230 523789 2 998243 0 My output: Case 1: 3076170 102967095 Case 2: 602381204 3515044760 Case 3: 48180480 1844487282 Case 4: 61 ...
- Mon Feb 04, 2008 6:33 pm
- Forum: Volume 1 (100-199)
- Topic: 125 - Numbering Paths
- Replies: 56
- Views: 5725
- Mon Feb 04, 2008 6:18 pm
- Forum: Volume 1 (100-199)
- Topic: 101 - The Blocks Problem
- Replies: 635
- Views: 38810
Hello,
Can someone help me for understanding the problem ?
make this output :
So why in the sample output below the first 3 lines are :
Thanks !
Can someone help me for understanding the problem ?
Code: Select all
input :
3
move 1 onto 0
move 0 onto 1
move 0 onto 2
move 2 onto 1
Code: Select all
0: 1 2
1:
2: 0
Code: Select all
0: 0
1: 1 2
2:
- Mon Dec 31, 2007 12:13 am
- Forum: Volume 1 (100-199)
- Topic: 160 - Factors and Factorials
- Replies: 205
- Views: 24729
- Sun Dec 30, 2007 11:48 pm
- Forum: Volume 1 (100-199)
- Topic: 160 - Factors and Factorials
- Replies: 205
- Views: 24729
Desperate WA
Hi, I heve followed your suggestions, but I still get WA. My code : #include <iostream> #include <vector> #include <map> #include <iomanip> #include <list> using namespace std; void get_prime_factors(const int& n, vector<int>& v) { int k(n); for(int i=2; k!=1; ++i) { while(k%i == 0) { v.push_back(i)...