OJ Board

EDIT: I made a stupid mistake, sorry

thank you so much!!!!!

thank you!!! and I don't want to be annoying but I have just one more question how can I distinguish between a new line in an input like this: "w1 w2 w3 w4 w5 w6 w7 ww1 ww2 ww3 ww4 ww5 ww6 ww7" In case that this represents different tests. I mean, I need to know when a newLine alone appear...

thanks for your reply... but how can I know when a line ends... I mean, if in the input I have this: "word1 word2 word3 word4 word5 word6 word7" I want to make something whit word1 word2 and word3, and then do it again with word4, word5, word6 and word7 If I make like you say with stringst...

Hi... I need help to do the following: I want to take from standard input a line like this " word1 word2 word3 wordn" and get all the words in differents strings (strings from <string> of course) does someone know an easy way to do it?? is it any other way (easier) to manage the words in a...

Hi, I would like to know if someone can help me with this problem: http://acm.tju.edu.cn/toj/showp2171.html This is what I tought until now: I can go from first character to last character and sum S %2006 To know the S of every character I know that S[0]=1 S = i/k | min k (S[i-k]=(i-k)/k && ...

Hi! the problem I was trying to solve is 3564 - Bipartite Numbers http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=3564 I just think in generating bipartite numbers and then return the minimum that is valid...but maybe the solution can be bigger than long long numbers, in this case ...

HI!
I want to practice dfs/bfs problems. I would appreciate if someone knows which problems can be solved with this.
thx

Hi ! I did this problem in 2 ways but none of these works I always get WA!! :cry: here are my codes: #include <stdio.h> #include <stdlib.h> #include <string.h> #define MIN(a,b) a<b?a:b char loc[101][22]; int d[101][101],dist[102],antecesor[102]; bool visited[101]; char init[22],end[22],name[32]; int...

I use %I64d when I am on windows
and %lld for linux
so, remember always to put to the codes that you send to the online judge %lld instead of %I64d

thanks...I think I understand my error
I really apreciate your help!

hi, I have difficulty with this problem I think it in this way: from 0..9 I have one 0 from 0..99 I have ten 0's so I think it in this way: cant representes amount of 0's from 0..(10^i - 1) so I have cant[1]=1 cant[2]=10 for(i=3;i<11;i++) cant =9*(cant[i-1]+pow(10,i-2)) + cant[i-1]; I though this: s...

thanks for your help!
I made the problem of compute a^n with order log(n)...but I think it's easier.

Hi ! I am having troubles in doing an implementation of a very common problem. I have a matrix A and I want to get the matrix A^n. As far as I know the best way to do this is to make something like: A^(n/2)*A^(n/2) if n mod 2==0 A^(n-1)*A if n mod 2 !=0 I get the idea of the recursive algorithm, but...

I need help to prove a problem about complexity. Let a Function defined by: F(0) = 3 F(n+1) = 3 * F(n) + h(n), where h ∈ θ(n) Prove that F ∈ O(3^n) I get that the function is O(n*3^n), but I don't know if I did it wrong or how to do it Please ask me if the problem is not clear enough. thanks for rea...