1
2
3
4
5
6
7
8
9
<?php
 
class LinkedListObject {
 
 public $previous;
 public $next;
 public $data;
 
 /* Initialization of linked list object */
 ...

1
2
3
4
5
6
7
8
9
/*   < Joanie Decopain >                                    
          < Program 2>       
        < january 3, 2012>     */                  
 
#include <iostream> 
using namespace std; 
 
int main() 
{ 
 ...

1
2
3
4
5
<?php
 
foreach (array(5, 63, 66, 96) as $num) {
        printf("%d: %s\n" , $num, base_convert($num, 10, 5));
}

1
2
3
4
a=['at','','','','ball','','','','car']
b=raw_input()#accept string to be found
s=a.index(b)
print s

1
2
3
4
5
6
7
8
9
#include <stdio.h>
#include <stdlib.h>
 
int main()
{
    int n,i,x=1900,j,y=0;
    int d[7]={1,0,0,0,0,0,0};
    int m[12]={31,28,31,30,31,30,31,31,30,31,30,31};
    scanf("%d",&n);
 ...

1
2
3
4
5
<?php
 
foreach (array(5, 63, 66, 96) as $num) {
        printf("%d: %d" , $num, base_convert($num, 10, 5));
}

1
2
3
4
5
6
7
#include <iostream>
using namespace std;
int main()
{
cout<<"Amit";
return 0;
}

1
2
3
4
5
6
7
8
9
/*   < Joanie Decopain >                                    
          < Program 2>       
        < january 3, 2012>     */                  
 
#include <iostream> 
using namespace std; 
 
int main() 
{ 
 ...

1
2
3
4
5
public class Hello {
  public static void main(String[] args) {
    System.out.println("Hola mundo");
  }
}

1
2
3
4
5
6
7
8
9
/*   < Joanie Decopain >                                    
          < Program 2>       
        < january 3, 2012>     */                  
 
#include <iostream> 
using namespace std; 
 
int main() 
{ 
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
using namespace std;
int main()
{
        int n,m;
        cin>>n;
        if(n%n==0)
                m=n/2;
        else
 ...

1
2
3
4
5
6
7
8
9
with Ada.Text_Io; use Ada.Text_Io;
procedure Nest is
   X : Integer := 4;
   function F (Y: Integer) return Integer is
   begin return X + Y; end F;
   function G (X : Integer) return Integer is
   begin return F(3 * X); end G;
begin Put_Line (Integer'Image (G(5)));
end Nest;

1
2
3
4
5
6
7
8
9
#include<stdio.h>
void main()
{
int i;
int n;
int fact;
fact=1;
printf("ENTER A NUMBER WHOSE FACTOTIAL TO BE FIND");
scanf("%d",&n);
 ...

1
2
3
4
5
6
7
8
9
# Made by disKret
import sys
from net.sf.l2j.gameserver.model.quest import State
from net.sf.l2j.gameserver.model.quest import QuestState
from net.sf.l2j.gameserver.model.quest.jython import QuestJython as JQuest
 
qn = "247_PossessorOfAPreciousSoul_4"
 
#NPC
 ...

1
2
3
4
5
6
7
8
9
<?php
 
class LinkedListObject {
 
 public $previous;
 public $next;
 public $data;
 
 /* Initialization of linked list object */
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
        int t,i,j;
        cin>>t;
        while(t--)
        {
 ...

1
2
3
4
5
6
7
8
9
/*   < Joanie Decopain >                                    
          < Program 2>       
        < january 3, 2012>     */                  
 
#include <iostream> 
using namespace std; 
 
int main() 
{ 
 ...

1
2
3
4
5
#include <iostream>
void main()
{
cout<<"Amit";
}

1
2
3
4
5
6
7
8
9
.globl main ;
main: ;
enter $0x30, $0 ;
pushl $s ;
call system ;
add $4, %esp ;
xorl %eax, %eax ;
pushl %eax ;
leave ;
 ...

1
2
3
4
5
6
7
8
9
<?php
 
class LinkedListObject {
 
 public $previous;
 public $next;
 public $data;
 
 /* Initialization of linked list object */
 ...

1
2
3
4
5
6
struct A;
 
int f(...);
 
extern A &a;
decltype(f(a)) foo;

1
vart = input("test")

1
2
3
4
5
#include<iostream>
void main()
{
cout<<"Amit";
}

1
2
3
4
5
#include<iostream.h>
void main()
{
cout<<"Amit";
}

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
unsigned remove_dumped_memory(unsigned *array, unsigned nItem);
 
int main(){
        unsigned size = 10;
        unsigned a[10] = {1,1,2,2,2,3,5,8,8,9};
        size = remove_dumped_memory(a, size);
        printf("%d\n" size);
 ...

1
2
3
4
5
6
7
8
9
<?php
 
class test{
 public $a;
 
}
 
function p($b)
{
 ...

1
2
3
4
5
6
7
8
9
<?php
 
class test() {
 public $a;
 
}
 
function p($b)
{
 ...

1
2
3
4
5
6
7
8
9
def gcd(a, b):
    if a == 0:
        return b
    while b != 0:
        if a > b:
            a -= b
        elif b > a:
            b -= a
    return a
 ...

1
2
3
4
5
6
7
8
9
program prime;
var
t, a, b: integer;
n: longint;
p : array [1..10000] of boolean;
i, j : array [1..10] of longint;
procedure sieve(x:longint);
var c, d: longint;
begin
 ...

1
2
3
4
5
#include<iostream.h>
void main()
{
cout<<"Amit";
}