Search found 18 matches

by mintae71
Wed Mar 16, 2011 12:52 pm
Forum: Volume 119 (11900-11999)
Topic: 11917 - Do Your Own Homework
Replies: 21
Views: 2980

Re: 11917 - Do Your Own Homework

Please Help me OTL....... #include <iostream> #include <string> using namespace std; string bigeo1[101]; int Dbigeo1[101]; int main() { int testcases, cntofbigeo1; int Dbigeo2; string bigeo2; int i, j; int Cases = 0; bool last; cin >> testcases; while (testcases--){ Cases++; last = false; for (i = 0...
by mintae71
Sun Dec 26, 2010 8:24 am
Forum: Off topic (General chit-chat)
Topic: ablity survey
Replies: 0
Views: 31104

ablity survey

First, Sorry for my bad english.

Actually, I registered here since last year, and I want to know your ablities.

please pick one~


1. I'm bad!!
2. I'm soso!!
3. I'm good!!
4. I'm an fantastic programmer~~

Please quote~~
by mintae71
Sat Oct 09, 2010 11:54 am
Forum: Bugs and suggestions
Topic: The service is not available. Please try again later.
Replies: 0
Views: 1615

The service is not available. Please try again later.

Oh my Gods Sake!! The Contest started before almost 1 hour and it says 'The service is not available. Please try again later.' O my God!! :oops: :oops: :oops: :oops: :oops: :oops: :oops: :oops: :oops: :oops: :oops: :oops: :oops: :P :P :P :P :P :P :P :P :x :x :x :x :x :x :x :x :x :x :x :x :x :x :evil...
by mintae71
Thu Oct 07, 2010 11:02 am
Forum: Volume 112 (11200-11299)
Topic: 11254 - Consecutive Integers
Replies: 24
Views: 11701

Re: 11254 - Consecutive Integers

Input

Code: Select all

65220
684
772
5
124
888
9431
55575
88888
91124
Output

Code: Select all

65220 = 484 + ... + 603
684 = 17 + ... + 40
772 = 93 + ... + 100
5 = 2 + ... + 3
124 = 12 + ... + 19
888 = 6 + ... + 42
9431 = 4715 + ... + 4716
55575 = 9 + ... + 333
88888 = 193 + ... + 463
91124 = 332 + ... + 540
Hope it helps
by mintae71
Thu Oct 07, 2010 10:58 am
Forum: Volume 112 (11200-11299)
Topic: 11254 - Consecutive Integers
Replies: 24
Views: 11701

Re: 11254 - Consecutive Integers

Actually, I got AC with O(sqrt(n)). But Super dizzy. I precaculated all the test case. if (x%2 == 1){ if (!a){ if (y >= (x-1)/2){ if (y - (x-1)/2 == 0){ if (mxcnt < x-1){ sta = 1; end = y + (x-1)/2; mxcnt = x-1; } } else { if (mxcnt < x){ mxcnt = x; sta = y - (x-1)/2; end = y + (x-1)/2; } } } } } if...
by mintae71
Sat Sep 25, 2010 10:12 am
Forum: Volume 110 (11000-11099)
Topic: 11077 - Find the Permutations
Replies: 14
Views: 7092

Re: 11077 - Find the Permutations

Plz give me correct output of this input....

input

Code: Select all

1 0
2 0
2 1
3 0
3 1
3 2
4 0
4 1
4 2
4 3
5 0
5 1
5 2
5 3
5 4
6 0
6 1
6 2
6 3
6 4
6 5
7 0
7 1
7 2
7 3
7 4
7 5
7 6
:D
by mintae71
Thu Sep 09, 2010 10:56 am
Forum: Volume 114 (11400-11499)
Topic: 11470 - Square Sums
Replies: 9
Views: 3918

Re: 11470-Square Sums

sazzadcsedu, I changed my code and It works...... :D

But why OJ says NO........ :cry: :cry: :cry: :cry: :cry: :cry: :cry:

Can you please help one more time?

Thank you~
:lol: :lol:

Code: Select all

Thank you sazzadcsedu, I got AC.
by mintae71
Wed Sep 08, 2010 12:53 pm
Forum: Volume 4 (400-499)
Topic: 441 - Lotto
Replies: 13
Views: 6578

Re: 441 - Plz help me.....

I tried 10 more test data and it was all right. But Bad OJ(Sorry :roll: :roll: :roll: :roll: :roll: :roll: :roll: ) says it's WA I don't no why it is :cry: :cry: :cry: :cry: :cry: :cry: :cry: :cry: Please help me..... Please give some critical inputs...... Or hint from code. Sorry, But I'm using C++...
by mintae71
Sat Sep 04, 2010 9:28 am
Forum: Volume 114 (11400-11499)
Topic: 11470 - Square Sums
Replies: 9
Views: 3918

11470-Square Sums

:cry: :cry:

I tried almost 20 or more test data and it was all right!

but Judge says it's wrong!!

please give me some critical test data.

Sorry about my bad english.


and here is my code....

Code: Select all

Thank you sazzadcsedu, I got AC.
by mintae71
Sat May 15, 2010 1:42 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 183051

Thanks fpnc.

Thanks fpnc. I've got AC~~ :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol: :lol:
by mintae71
Wed Mar 10, 2010 10:09 am
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 67225

Why WA?

Hello.
First, I'm sorry of my bad english.....
ok, then, lets start.
I don't know why this is WA...
I think because of newline part.
Plz help..........

Code: Select all

Removed after AC
by mintae71
Thu Feb 04, 2010 10:38 am
Forum: Volume 102 (10200-10299)
Topic: 10222 - Decode the Mad man
Replies: 30
Views: 9159

10222 - Decode the Mad Man

What's wrong in my code?

Code: Select all

removed after AC. I'm very sorry.
pls help me :cry: :cry: :cry: :cry: :cry: :cry:
by mintae71
Thu Jan 21, 2010 12:47 pm
Forum: Volume 100 (10000-10099)
Topic: 10079 - Pizza Cutting
Replies: 44
Views: 10150

Re: 10079 Pizza Cutting - I want to know the proof.

It's a very easy problem, and I solved it within 10 min. In my intuition, I can see that answer makes following arithmetic progression a(n) = 1 + (n(n+1))/2; However, I want to know why pizza cutting makes this expression. Anyone tell me the proof of this expression? I am sorry but I think your cod...
by mintae71
Thu Jan 21, 2010 11:11 am
Forum: Volume 100 (10000-10099)
Topic: 10079 - Pizza Cutting
Replies: 44
Views: 10150

Re: 10079

:P Hi, I am trying to solve problem 10079, and got failed. I use this method : for n=an, MAX = bn n=0 , MAX = 0 n=1, MAX = 2 n=2, MAX = 4 (2 + 2 ) n=3, MAX = 7 (4 + 3 ) n=4, MAX = 11 (7 + 4) n=5, MAX=16 (11 + 5) n=6, MAX=22 (b(n-1) + an) n=7, MAX=29 n=8, MAX=37 n=9, MAX=46 n=10, MAX=56 ... and so f...
by mintae71
Thu Jan 21, 2010 10:17 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 183051

Re: Same problem here-- Don't know why I am getting RuntimeError

Please tell me, anything wrong with this code. /* 3n+1 problem */ #include<stdio.h> int main() { unsigned long i,j,m,n,temp; /* i and j used to store the inputs,m and n is used in for loops */ unsigned long cycles = 1; /* To store no of cycles , initialized to 1 so that it includes last one*/ unsig...

Go to advanced search