Search found 10 matches

by amine.hamdaoui
Thu Oct 28, 2010 7:02 pm
Forum: Volume 116 (11600-11699)
Topic: 11689 - Soda Surpler
Replies: 11
Views: 5863

Re: 11689 Soda Surpler wrong answer

Can you please help, any idea, special case?
by amine.hamdaoui
Thu Oct 28, 2010 5:12 pm
Forum: Volume 116 (11600-11699)
Topic: 11629 - Ballot evaluation
Replies: 8
Views: 4615

11629 - Ballot evaluation

Hello Solver, I try to solve the problem 11629, but i'm getting WA and I can't discover my fault. Can you help me? #include <map> #include <iostream> #include <string> #include <iterator> #include <sstream> using namespace std; int main() { map<string,float> parties; map<string,float>::iterator it; ...
by amine.hamdaoui
Wed Oct 20, 2010 1:13 am
Forum: Volume 116 (11600-11699)
Topic: 11689 - Soda Surpler
Replies: 11
Views: 5863

Re: 11689 Soda Surpler wrong answer

Hello, I'm getting WA, I tried many case but I can't find the problem? #include <iostream> using namespace std; int main() { int nbcas,e,f,c,botle, sum, modulo; cin>>nbcas; for(int i=0 ; i<nbcas;i++) { cin>>e>>f>>c; botle = e+f; sum = 0; modulo = botle%c; botle = botle/c; sum += botle; while(true) {...
by amine.hamdaoui
Mon Sep 14, 2009 3:42 pm
Forum: Volume 102 (10200-10299)
Topic: 10245 - The Closest Pair Problem
Replies: 92
Views: 13302

Re: 10245 - The Closest Pair Problem

Can some one tell me what is wrong in this code, i use Brute Force, but it gives me WA? #include <stdio.h> #include <math.h> int main() { int i,j,N; float X[10000],Y[10000],dist,d; do { scanf("%d",&N); if(N==0) break; dist = 10001; for(i=0 ; i<N ; i++) { scanf("%f%f",&X[i],&Y[i]); for(j=0 ; j<i ; j+...
by amine.hamdaoui
Wed Jul 22, 2009 11:53 pm
Forum: Volume 4 (400-499)
Topic: 444 - Encoder and Decoder
Replies: 155
Views: 24437

Re: Why #444 WA?

I tried a lot of test cases! All possibilities i know, but it gives me WA since 2 years! Can some one find the bug? #include <iostream> #include <string> #include <sstream> #include <algorithm> using namespace std; int main() { int i, a, size; string line, inv; while (getline(cin, line)) { size = li...
by amine.hamdaoui
Wed Dec 12, 2007 9:00 pm
Forum: Volume 8 (800-899)
Topic: 850 - Crypt Kicker II
Replies: 77
Views: 38102

850 - Crypt Kicker II

Could you tell me what's wrong in my code? #include <iostream> #include <string> #include <sstream> using namespace std; string ss="the quick brown fox jumps over the lazy dog"; char code[200]; bool check(string line) { int i,size; string mot; for(i='a'; i<='z'; i++) code[i]='0'; size = line.size();...
by amine.hamdaoui
Tue Oct 23, 2007 5:58 pm
Forum: Volume 5 (500-599)
Topic: 545 - Heads
Replies: 67
Views: 45000

I did it, but it still doesn't work WA. Do you have any others ideas?
by amine.hamdaoui
Fri Oct 19, 2007 7:30 pm
Forum: Volume 5 (500-599)
Topic: 545 - Heads
Replies: 67
Views: 45000

Why do i get WA. I use exact calculation. I have tested my code for all the tests in this topic, and it match!!!! #include <stdio.h> #include <stdlib.h> int main() { int i,j,r,n,*y,a; double *x; y = (int *) malloc(sizeof(int )*1000001); x = (double *) malloc(sizeof(double)*1000001); x[0] = 1; y[0] =...
by amine.hamdaoui
Thu Oct 11, 2007 2:54 am
Forum: Volume 103 (10300-10399)
Topic: 10300 - Ecological Premium
Replies: 22
Views: 8616

10300 - WA why?

I think i have solved the 10300 problem, but why do i get the famous Wrong Answer ? there is my C++ code : #include <iostream> using namespace std; int main() { long nb_case,nb_farmers,sum,farmsize,nb_animal,friendliness,i,j; cin>>nb_case; for(i=0 ; i<nb_case ; i++) { sum=0; cin>>nb_farmers; for(j=0...
by amine.hamdaoui
Thu Aug 09, 2007 6:36 pm
Forum: Volume 109 (10900-10999)
Topic: 10929 - You can say 11
Replies: 69
Views: 27801

Output Limit exceeded

Why do i have Output Limit exceeded?!!!!
[codeIt was accepted[/code]

Go to advanced search