OJ Board

I don't think this problem even need to use prime factorization.

brianfry713 wrote:I solved this by simulating a standard int queue, priority_queue, and stack. Why are you using deques and vectors instead?

I used vector for queue since I could use it for comparison without popping it out one by one first.

I got WA testing all the test cases mentioned. Is there anything left out in this code?

#include<cstdio>
int problem[12];
int use[12];
int main()
{
int ready;
int count = 1;
problem[12] = 0;
scanf("%d",&ready);
while(ready>0)
{
for(int i = 0; i<12; i++) scanf("%d",&problem[i]);
for(int i ...

Got RTE, don't know where it came from.

The sample output in the UVA page is quite misleading, make sure that you put newline '\n' on each test case. I screwed up quite a few times before getting AC. (I hope judge should REALLY fix this.)

I got TLE with this one
does it is because the algorithm is too slow or the improper input handling (and the program stuck in the loop)?

The whole thing seems correct, but still got WA

#include <iostream>
#include <queue>
#include <cstring>
#include <string>
long mp[100][100];
std::pair<int,int> horseMove[8] = {std::make_pair(1,2),std::make_pair(2,1),std::make_pair(-1,2),std::make_pair(-2,1),std::make_pair(1,-2),std::make_pair(2,-1 ...

Zerch wrote:is there a problem with this excersice? 929 - Number Maze ... I only get submition error... plz... help me

Very likely, I saw more than 50 recent submissions (including mine) got (consecutively) SEs.

I tried many different inputs, but still WA

#include <cstring>
#include <queue>
#include <utility>
#include <iostream>
#include <sstream>
#include <string>

int mp[1000][1000];
int main()
{
int c,r,b;

int bomr,bomc;

int startr,startc;
int endr,endc;


std::cin>>r>>c;
while(r|c)
{
memset ...

Here is my wrong code


#include <iostream>
#include <map>
int main()
{
int tc,tsc,s,ps,mxsize,cursize;
std::cin>>tc;
while(tc--)
{
mxsize = cursize = 0;
std::map<int,int> snf;
std::map<int,int>::iterator it;
std::cin>>tsc;
while(tsc>0)
{
std::cin>>s;
it = snf.find(s);
if(it == snf ...

brianfry713 wrote:input:

Code: Select all

01
0

output should be

Code: Select all

01 is not a multiple of 11.

AC'd

Thanks.

import java.util.*;
import java.math.*;
class Main
{
public static void main(String[] args)
{
BigInteger a,b;
Scanner sc = new Scanner(System.in);
a = sc.nextBigInteger();
while(!a.equals(BigInteger.ZERO))
{
b =a.mod(BigInteger.valueOf(11));
if(b.equals(BigInteger.ZERO)) System.out ...