Search found 10 matches

by Devil_Bird
Thu Nov 14, 2013 3:46 pm
Forum: Volume 106 (10600-10699)
Topic: 10653 - Bombs! NO they are Mines!!
Replies: 36
Views: 24223

Re: 10653 - Bombs! NO they are Mines!!

thanks briyanfry you're awesome!!! :D
by Devil_Bird
Wed Nov 13, 2013 6:06 pm
Forum: Volume 106 (10600-10699)
Topic: 10653 - Bombs! NO they are Mines!!
Replies: 36
Views: 24223

Re: 10653 - Bombs! NO they are Mines!!

Can anyone give some testcase this is my code that gets WA!!!!

Code: Select all

AC
by Devil_Bird
Fri Apr 05, 2013 2:06 pm
Forum: Volume 121 (12100-12199)
Topic: 12148 - Electricity
Replies: 7
Views: 11782

12148 - Electricity

actually I used the simplest algorithm but It gets WA help plz
#include<iostream>
using namespace std;

struct data{
int d;
int m;
int y;
long long int c;
}MI[1009];
int main()
{
int N;
while(cin>>N && N!=0)
{
for(int i=0;i<N;i++)
cin>>MI[i].d>>MI[i].m>>MI[i].y>>MI[i].c;
int res=0,cd=0 ...
by Devil_Bird
Fri Apr 05, 2013 1:31 pm
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 124793

Re: 10189 - Minesweeper

thanks a lot brianfry713 ur the best :)
by Devil_Bird
Fri Apr 05, 2013 1:13 pm
Forum: Volume 122 (12200-12299)
Topic: 12247 - Jollo
Replies: 11
Views: 6507

Re: 12247 - Jollo

its killing me new code is http://ideone.com/MFaQWf#ul_inouterr
but still wrong answer help plz :cry:
by Devil_Bird
Wed Apr 03, 2013 12:53 am
Forum: Volume 122 (12200-12299)
Topic: 12247 - Jollo
Replies: 11
Views: 6507

Re: 12247 - Jollo

can u believe it? my program answers all your inputs correctly but I still get WA
http://ideone.com/lECjLS
(actually I change that a little for equal cards)
by Devil_Bird
Wed Apr 03, 2013 12:19 am
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 124793

Re: 10189 - Minesweeper

exscuse me Im gettin WA too whit this code:
#include<iostream>
#include <stdio.h>
using namespace std;
int main()
{
int n,m;
char a[200][200],b[200][200];

int count=0;
while(cin>>n>>m && ++count)
{
if(n==0 && m==0)
return 0;

for(int j=0;j<m+2;++j)
a[0][j]='a';
for(int i=0;i<n+2;++i ...
by Devil_Bird
Sat Mar 30, 2013 5:28 pm
Forum: Volume 122 (12200-12299)
Topic: 12247 - Jollo
Replies: 11
Views: 6507

12247 - Jollo

hi all
can anyone help me with some test cases I'm getting WA by this code:
http://ideone.com/Xn4GeO
Thanks in advance
by Devil_Bird
Fri Mar 22, 2013 4:43 pm
Forum: Volume 113 (11300-11399)
Topic: 11308 - Bankrupt Baker
Replies: 17
Views: 11247

Re: 11308 - Bankrupt Baker

Thank you very much I finally get acc.
:-* to brianfry713 :D
by Devil_Bird
Thu Mar 21, 2013 7:57 pm
Forum: Volume 113 (11300-11399)
Topic: 11308 - Bankrupt Baker
Replies: 17
Views: 11247

Re: 11308 - Bankrupt Baker

I Dont Know why I get WA can any one give me some test cases?
Thanks In Advance #include<iostream>
#include<map>
#include<string>
#include<set>
#include<stack>
using namespace std;

int main()
{
map<string,int> ing;
map<string,int> sum;
multimap<int,string> sort;
map<string,int>::iterator it ...

Go to advanced search