This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test Suite
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
m=zeros(5,2);N=8;
NNexp=7;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 2 | Pass |
m=zeros(3,5);N=14;
NNexp=18;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 3 | Pass |
m=zeros(1,16);N=1;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 4 | Pass |
m=zeros(3,5);N=1;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 5 | Pass |
m=zeros(8,2);N=12;
NNexp=10;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 6 | Pass |
m=zeros(16,1);N=1;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 7 | Pass |
m=zeros(3,3);N=6;
NNexp=3;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 8 | Pass |
m=zeros(2,6);N=12;
NNexp=16;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 9 | Pass |
m=zeros(15,1);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 10 | Pass |
m=zeros(5,3);N=7;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 11 | Pass |
m=zeros(4,3);N=5;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 12 | Pass |
m=zeros(3,5);N=11;
NNexp=8;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 13 | Pass |
m=zeros(7,2);N=13;
NNexp=16;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 14 | Pass |
m=zeros(15,1);N=6;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 15 | Pass |
m=zeros(15,1);N=15;
NNexp=14;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 16 | Pass |
m=zeros(4,4);N=9;
NNexp=2;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 17 | Pass |
m=zeros(5,3);N=8;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 18 | Pass |
m=zeros(3,5);N=6;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 19 | Pass |
m=zeros(16,1);N=7;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 20 | Pass |
m=zeros(1,15);N=7;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 21 | Pass |
m=zeros(4,3);N=12;
NNexp=17;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 22 | Pass |
m=zeros(5,3);N=13;
NNexp=14;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 23 | Pass |
m=zeros(2,4);N=5;
NNexp=2;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 24 | Pass |
m=zeros(5,3);N=5;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 25 | Pass |
m=zeros(16,1);N=16;
NNexp=15;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 26 | Pass |
m=zeros(2,5);N=8;
NNexp=7;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 27 | Pass |
m=zeros(5,3);N=4;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 28 | Pass |
m=zeros(5,3);N=10;
NNexp=6;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 29 | Pass |
m=zeros(4,4);N=7;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 30 | Pass |
m=zeros(3,5);N=9;
NNexp=3;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 31 | Pass |
m=zeros(4,2);N=2;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 32 | Pass |
m=zeros(4,4);N=15;
NNexp=20;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 33 | Pass |
m=zeros(2,2);N=4;
NNexp=4;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 34 | Pass |
m=zeros(5,3);N=11;
NNexp=8;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 35 | Pass |
m=zeros(4,4);N=8;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 36 | Pass |
m=zeros(1,16);N=9;
NNexp=1;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 37 | Pass |
m=zeros(4,4);N=16;
NNexp=24;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 38 | Pass |
m=zeros(1,15);N=6;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 39 | Pass |
m=zeros(15,1);N=8;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 40 | Pass |
m=zeros(5,3);N=6;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 41 | Pass |
m=zeros(16,1);N=9;
NNexp=1;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 42 | Pass |
m=zeros(3,5);N=15;
NNexp=22;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 43 | Pass |
m=zeros(1,15);N=1;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 44 | Pass |
m=zeros(1,15);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 45 | Pass |
m=zeros(2,5);N=9;
NNexp=10;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 46 | Pass |
m=zeros(3,5);N=10;
NNexp=6;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 47 | Pass |
m=zeros(1,15);N=15;
NNexp=14;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 48 | Pass |
m=zeros(3,2);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 49 | Pass |
m=zeros(5,3);N=2;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 50 | Pass |
m=zeros(5,3);N=1;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 51 | Pass |
m=zeros(5,2);N=4;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 52 | Pass |
m=zeros(3,5);N=4;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 53 | Pass |
m=zeros(2,7);N=13;
NNexp=16;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 54 | Pass |
m=zeros(3,3);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 55 | Pass |
m=zeros(7,2);N=11;
NNexp=10;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 56 | Pass |
m=zeros(4,4);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 57 | Pass |
m=zeros(1,1);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 58 | Pass |
m=zeros(2,6);N=9;
NNexp=7;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 59 | Pass |
m=zeros(3,5);N=3;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 60 | Pass |
m=zeros(5,3);N=15;
NNexp=22;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 61 | Pass |
m=zeros(5,2);N=6;
NNexp=2;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 62 | Pass |
m=zeros(3,4);N=12;
NNexp=17;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 63 | Pass |
m=zeros(2,3);N=6;
NNexp=7;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 64 | Pass |
m=zeros(1,1);N=1;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 65 | Pass |
m=zeros(15,1);N=1;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 66 | Pass |
m=zeros(1,16);N=16;
NNexp=15;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 67 | Pass |
m=zeros(2,2);N=2;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 68 | Pass |
m=zeros(3,3);N=9;
NNexp=12;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 69 | Pass |
m=zeros(16,1);N=8;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 70 | Pass |
m=zeros(9,1);N=6;
NNexp=2;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 71 | Pass |
m=zeros(5,3);N=12;
NNexp=11;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 72 | Pass |
m=zeros(2,2);N=3;
NNexp=2;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 73 | Pass |
m=zeros(3,5);N=7;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 74 | Pass |
m=zeros(7,2);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 75 | Pass |
m=zeros(4,3);N=6;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 76 | Pass |
m=zeros(2,3);N=4;
NNexp=2;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 77 | Pass |
m=zeros(1,15);N=8;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 78 | Pass |
m=zeros(16,1);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 79 | Pass |
m=zeros(5,3);N=9;
NNexp=3;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 80 | Pass |
m=zeros(15,1);N=7;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 81 | Pass |
m=zeros(2,4);N=6;
NNexp=4;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 82 | Pass |
m=zeros(1,16);N=7;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 83 | Pass |
m=zeros(3,5);N=12;
NNexp=11;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 84 | Pass |
m=zeros(1,16);N=8;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 85 | Pass |
m=zeros(4,4);N=1;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 86 | Pass |
m=zeros(3,5);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 87 | Pass |
m=zeros(3,5);N=8;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 88 | Pass |
m=zeros(1,16);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 89 | Pass |
m=zeros(5,3);N=3;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 90 | Pass |
m=zeros(5,3);N=0;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 91 | Pass |
m=zeros(1,13);N=9;
NNexp=4;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 92 | Pass |
m=zeros(3,5);N=2;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 93 | Pass |
m=zeros(1,9);N=6;
NNexp=2;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 94 | Pass |
m=zeros(6,2);N=12;
NNexp=16;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 95 | Pass |
m=zeros(4,3);N=8;
NNexp=4;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 96 | Pass |
m=zeros(3,5);N=5;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 97 | Pass |
m=zeros(5,3);N=14;
NNexp=18;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 98 | Pass |
m=zeros(4,3);N=7;
NNexp=2;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 99 | Pass |
m=zeros(6,2);N=4;
NNexp=0;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 100 | Pass |
m=zeros(3,5);N=13;
NNexp=14;
NN=Noisy_Neighbors(m,N);
assert(isequal(NNexp,NN))
|
| 101 | Pass |
toc
Elapsed time is 18.679884 seconds.
|
| 102 | Pass |
% function GJam_Rd1B_2015b
% fn='B-small-practice.in';
% [data] = read_file(fn); %
% fidG = fopen('B-small-practice.out', 'w');
%
% tic
% for i=1:size(data,2) % Cell array has N cols of cases
% NN = Noisy_Neighbors(data{i});
% fprintf(fidG,'Case #%i: %i\n',i,NN);
%
% fprintf('Case #%i: %i\n',i,NN);
% end
% toc
% fclose(fidG);
% end
%
% function val=Noisy_Neighbors(v)
% r=v(1);c=v(2);N=v(3);
% m=zeros(r,c);
% if N==0
% val=0;
% return;
% end
%
% ptrset=find(m==0);
%
% val=Inf;
% tlocs=nchoosek(ptrset,N);
% for i=1:size(tlocs,1)
% m=m*0;
% tlocv=tlocs(i,:);
% m(tlocv)=1;
% vchk=nnz(conv2(m,[1 1])==2)+nnz(conv2(m,[1;1])==2);
%
% if vchk<val
% val=vchk;
% end
% if val==0,break;end;
% end
%
% end
%
% function [d] = read_file(fn)
% d={};
% fid=fopen(fn);
% fgetl(fid); % Total Count ignore
% ptr=0;
% while ~feof(fid)
% ptr=ptr+1;
% v=str2num(fgetl(fid)); % r,c,N
%
% d{ptr}=v;
%
% end % feof
% fclose(fid);
%
% end % read_file
|
| 103 | Pass |
toc
Elapsed time is 18.710108 seconds.
|
Suggested Problems
-
106 Solvers
-
44 Solvers
-
366 Solvers
-
Find nearest prime number less than input number
148 Solvers
-
96 Solvers
More from this Author276
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)