- JollyJumpers/황재선 . . . . 22 matches
=== JollyJumpers.java ===
public class JollyJumpers {
public boolean isJolly() {
JollyJumpers j = new JollyJumpers();
if (j.isJolly()) v.add("Jolly");
else v.add("Not jolly");
=== JollyJumpers.java ===
public class JollyJumpers {
public boolean isJolly(TreeSet set) {
JollyJumpers j = new JollyJumpers();
if (j.isJolly(set))
list.add("Jolly");
list.add("Not jolly");
=== TestJollyJumpers.java ===
public class TestJollyJumpers extends TestCase {
JollyJumpers j;
j = new JollyJumpers();
j = new JollyJumpers();
public void testIsJolly() {
assertEquals(false, j.isJolly(j.computeGaps()));
- JollyJumpers/Leonardong . . . . 19 matches
class JollyJumper:
if self.checkJolly( aSet = self.getSetOfDiffence( aSeries[1:] ),
return "Jolly"
return "Not Jolly"
def checkJolly( self, aSet, aN ):
print JollyJumper().statementForSeries( seriesInt )
class JollyJumperTestCase(unittest.TestCase):
self.jj = JollyJumper()
self.assertEquals("Jolly",
self.assertEquals("Not Jolly",
def testCheckJolly(self):
self.jj.checkJolly(
self.jj.checkJolly(
self.assertEquals("Jolly", self.jj.statementForSeries( series ) )
self.assertEquals("Jolly", self.jj.statementForSeries( series ) )
self.assertEquals("Not Jolly", self.jj.statementForSeries( series ) )
JollyJumper.run()
처음에 리스트에 차를 집어넣은 후 정렬하려 했다가 집합 개념이 떠올라 그 쪽으로 해결했다. statementForSeries메서드 부분에 있던 CheckJolly메서드를 따로 테스트하면서 ExtractMethod를 하게 되었고, 차가 음수인 경우도 테스트를 통해 알게되었다. 보폭이 아직 좁지만 술술 진행한 문제이다.
[JollyJumpers], [AOI]
- JollyJumpers/임인택 . . . . 14 matches
public class JollyJumpers {
return (count == size-1)?"Jolly":"NotJolly";
JollyJumpers jj = new JollyJumpers();
private JollyJumpers2 jj;
jj = new JollyJumpers2();
public void testJollyJumpers() {
assertEquals("Jolly", jj.testify());
assertEquals("NotJolly", jj.testify());
public class JollyJumpers2 {
return (offCnt==array.length-1)?"Jolly":"NotJolly";
JollyJumpers
- JollyJumpers/iruril . . . . 9 matches
=== JollyJumpers.java ===
public class JollyJumpers {
boolean jolly;
public boolean checkJolly()
jolly = true;
jolly = false;
if(jolly)
System.out.println("Jolly");
System.out.println("Not Jolly");
return jolly;
JollyJumpers jj = new JollyJumpers();
jj.checkJolly();
[JollyJumpers]
- JollyJumpers/곽세환 . . . . 7 matches
JollyJumpers 문제풀이
bool isJolly;
isJolly = true;
isJolly = false;
if (isJolly == true)
cout << "Jolly\n";
cout << "Not jolly\n";
[JollyJumpers]
- Jolly Jumpers/정진경 . . . . 3 matches
#title Jolly Jumpers/정진경
Describe [Jolly Jumpers/정진경] here
n,a,b,k,c[3000];main(){for(;scanf("%d%d",&n,&a)+1;puts(k-1?"Not jolly":"Jolly"))for(memset(c,0,n*4),k=n;--n;a=b){scanf("%d",&b);a=abs(a-b);if(!c[a])c[a]=1,k--;}}
- JollyJumpers/강소현 . . . . 3 matches
if(isJolly(arr, size)){ //졸리점퍼 체크
System.out.println("Jolly");
System.out.println("Not jolly");
public static boolean isJolly(int [] arr, int size){
int [] jollyNum = new int [size];
jollyNum[Math.abs(arr[i+1]-arr[i])]++;
if(jollyNum[i] == 0)//1~n-1 중 하나라도 포함 안하면 not jolly
- JollyJumpers/허아영 . . . . 3 matches
bool jolly = false;
jolly = true;
jolly = false;
cout << "Jolly" << endl;
else if (jolly)
cout << "Jolly" << endl;
cout << "Not jolly" << endl;
[JollyJumpers]
- Celfin's ACM training . . . . 2 matches
|| 21 || 2 || 110201/10038 || Jolly Jumpers || 30 mins || [JollyJumpers/Celfin] ||
- JollyJumpers/김태진 . . . . 2 matches
int jolly(int A[], int val, int B[]);
printf("Jolly\n");
result=jolly(a,val,b);
if(result==val-2) printf("Jolly\n");
else printf("Not jolly\n");
int jolly(int A[], int val, int B[])
- JollyJumpers/정진경 . . . . 2 matches
Describe JollyJumpers/정진경 here
c[3000];main(n,a,b,k){for(;scanf("%d%d",&n,&a)+1;puts(k-1?"Not jolly":"Jolly"))for(memset(c,0,n*4),k=n;--n;a=b)scanf("%d",&b),c[abs(a-b)]++?0:k--;}
- AOI/2004 . . . . 1 match
|| [JollyJumpers] || O || O || O || O || O || O || O || O ||
- JollyJumpers/서지혜 . . . . 1 match
goto JOLLY;
goto NOT_JOLLY;
goto NOT_JOLLY;
if(i==count-1) goto JOLLY;
goto JOLLY;
NOT_JOLLY:
printf("Not jolly\n");
JOLLY:
printf("jolly\n");
puts(F?"Jolly":"Not jolly");
- 임다찬 . . . . 1 match
나중에 [JollyJumpers] - dynamic programming 사용하나요???
Found 14 matching pages out of 7557 total pages (2220 pages are searched)
You can also click here to search title.
