UVa OJ Board

Why WA?????? #include<cstdio> #include<cstdlib> #include<iostream> #include<sstream> #include<cmath> #include<string> #include<cstring> #include<cctype> #include<algorithm> #include<vector> #include<bitset> #include<queue> #include<stack> #include<utility> #include<list> #include<set> #include<map> ...

i search it in the internet but i can´t find it!!!, so please can you send it to my email????....kavic1@hotmail.com


Thanks

Solved!!!
I use binary search...
The worse error that i had was the "I consider all the nums as fibonaccis", you have to check if it's a fibo...

I think that my solution it's fine but i get WA!!!...this is a stupid problem, have a bad description!!!...very bad!!!! #include<stdio.h> #include<cstring> #include<cctype> #include<algorithm> #include<vector> #include<iostream> #define max 109 using namespace std; int main() { long long int fibo[ma...

why TLE???? #include<stdio.h> #include<string> #include<cstring> #include<iostream> #include<vector> #include<algorithm> #include<sstream> using namespace std; vector<string>vec1,vec2; int path[5000][5000]; int a,b; void print(int i,int j) { if(i==0 || j==0){return;} if(path[i][j]==1){ print(i-1,j-1...

jejeje, i was trying to use a sieve, but that was stupid, 2^31 it´s a bg num....so i do this version...but iget WA....why???? #include<stdio.h> int main() { long long int num; long long int i,var; while(scanf("%lld",&num)==1 && num!=0){ int bandera=1; printf("%lld =",num); var=num; if(num<0){ printf...

I think that my code it´s fine!!!, but i get WA!!!, can you give me special cases???,,please!!! #include<stdio.h> #include<bitset> #include<vector> #include<map> #define L1 1000009 #define L2 1009 using namespace std; vector<long long int>primos; map<long long int,long long int>factores; bitset<L1>c...

This code,,,it's linear!!! n= number of elements maxsum=-INF; INF=it's the element minimum of all posibles cases sum=0; for(int i=0;i<n;i++){ scanf("%d",&element); if(sum>0){ sum+=element; } else{ sum=element; } if(sum>maxsum){maxsum=sum;} } maxsum it's the maximum sum!!! There is a algorithm of n²,...

Always use double!!!

try with pow(p,1/n)

libreiries...you need "string.h" to memset,,,too "stdio.h"

i did first the problem 562 with the knapsack....then a read the problem tug of war,,,but this problem it's totally diferent!!!...i tried with bactracking,,,,but i get TLE,,,so i trying with DP...but i don't see the recurrences...

I need help,,,my problem is that i don't know how to carry the index!!! In the case: 4 1 -1 1 my program return "from 3 to 4 "...and the solution is "from 1 to 4"...my problem is "If more than one segment is maximally nice, choose the one with the longest cycle ride (largest j-i)." #include<stdio.h>...

firts i think in the snakpsack,,,but the problem say "numbersTeamA-numbersTeamB<=1 "...how i can chance to algorithm of snapsack???

This problem it's easy, i used a little hash because i am training problems with hash,,,
You have to read the problem, and see, that YOU FIRTS HAVE TO GENARATE A SEED WITH L, then you can start to cont,,,