plz help me
i had tried all input from UVA OJ discussion board and get correct anwer
but in uva online judge i got wrong answer why ?
plz help me
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int sa[256];
for(int i=48;i<=57;i++)
{
sa[i]=i-48;
}
sa[int('X')]=10;
char ...
Search found 4 matches
- Mon Apr 20, 2015 8:11 pm
- Forum: Volume 5 (500-599)
- Topic: 584 - Bowling
- Replies: 10
- Views: 8561
- Mon Mar 02, 2015 6:29 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10082 - WERTYU
- Replies: 57
- Views: 16635
Re: 10082 - WERTYU
I challenge everybody find where my answer is wrong ? if u find plz help me. :(
I got five times WA. :(
#include<cstdio>
#include<iostream>
#include<map>
#include<string>
using namespace std;
map<char,char> k;
int main()
{
int i;
char key[]={'`','1','2','3','4','5','6','7','8','9','0 ...
I got five times WA. :(
#include<cstdio>
#include<iostream>
#include<map>
#include<string>
using namespace std;
map<char,char> k;
int main()
{
int i;
char key[]={'`','1','2','3','4','5','6','7','8','9','0 ...
- Wed Feb 25, 2015 12:23 pm
- Forum: Volume 122 (12200-12299)
- Topic: 12247 - Jollo
- Replies: 11
- Views: 6527
Re: 12247 - Jollo
After changing in line 14 to
while(cin>>g[0]>>g[1]>>g[2]>>b[0]>>b[1] && g[0] && g[1] && g[2] && b[1] && b[2])
I got accepted thanks to BRIANFRY(guru)
while(cin>>g[0]>>g[1]>>g[2]>>b[0]>>b[1] && g[0] && g[1] && g[2] && b[1] && b[2])
I got accepted thanks to BRIANFRY(guru)

- Tue Feb 24, 2015 1:01 pm
- Forum: Volume 122 (12200-12299)
- Topic: 12247 - Jollo
- Replies: 11
- Views: 6527
Re: 12247 - Jollo
#include <iostream>
#include <algorithm>
using namespace std;
void shift(int c[],int j,int t)
{
for(int i=j+1;i<t;i++)
{
c[i-1]=c[i];
}
}
int main() {
int g[3],b[2],z[5];
while(cin>>g[0]>>g[1]>>g[2]>>b[0]>>b[1] && ((g[0]+g[1]+g[2]+b[1]+b[2])!=0))
{
sort(g,g+3);
sort(b,b+2);
merge(g,g+3,b ...
#include <algorithm>
using namespace std;
void shift(int c[],int j,int t)
{
for(int i=j+1;i<t;i++)
{
c[i-1]=c[i];
}
}
int main() {
int g[3],b[2],z[5];
while(cin>>g[0]>>g[1]>>g[2]>>b[0]>>b[1] && ((g[0]+g[1]+g[2]+b[1]+b[2])!=0))
{
sort(g,g+3);
sort(b,b+2);
merge(g,g+3,b ...