Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> void Ps(int a[], int b[], int k, int l); void printArr(int a[], int b[], int k, int l); int main(){ int a[] = {1, 2}; int b[] = {8, 9}; Ps(a, b, 2, 2); }
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int t,j; scanf("%d",&t); for(j=0;j<t;j++) { int nummoves = 0; int i,n; scanf("%d",&n);
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<stdio.h> #include<string> using namespace std; void solve(); int main() {
...
-
1 2 3 4 5 6 7 8 9
<?php $var = array( 'Categories', 'Guides', 'Users', 'Images', 'Operating systems', 'Languages', 'Network',
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; class CalDifference{ public static void main(String[] k){ int n, sumOfSq, sqOfSums, diff; int[] num; int[] numSq;
...
-
1 2 3 4
for(int i=1;i<10;i++){ for(int j=1;j<10;j++){ System.out.println(i,"x",j); }}
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { long long a1,cnt=0; int k,n,i=0; scanf("%lld",&a1); scanf("%d",&n); scanf("%d",&k); int a[k];
...
-
1 2 3 4 5 6 7 8 9
<?php var = array( 'Categories', 'Guides', 'Users', 'Images', 'Operating systems', 'Languages', 'Network',
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int t,j; scanf("%d",&t); for(j=0;j<t;j++) { int nummoves = 0; int i,n; scanf("%d",&n);
...
-
1 2 3 4 5 6 7 8 9
var = array( 'Categories', 'Guides', 'Users', 'Images', 'Operating systems', 'Languages', 'Network', 'Reports',
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<stdio.h> #include<string> using namespace std; void solve(); int main() {
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; class CalDifference{ public static void main(String[] k){ int n, sumOfSq, sqOfSums, diff; int[] num; int[] numSq;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int n,c,t=0; scanf("%d",&n); c=n&~7; printf("%d",c); if(c==n) printf("divisible");
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { long long a1,cnt=0; int k,n,i=0; scanf("%lld",&a1); scanf("%d",&n); scanf("%d",&k); int a[k];
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int n,c,t=0; scanf("%d",&n); c=n&~7; printf("%d",c); if(c==n) printf("divisible");
...
-
1 2 3 4 5 6 7 8 9
class supcon1 { private int a,b; supcon1(supcon1 sobj) { System.out.println("Base class constructor with object"); a=sobj.a; b=sobj.b; }
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<stdio.h> #include<string> using namespace std; void solve(); int main() {
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<stdio.h> #include<string> using namespace std; void solve(); int main() {
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int n,c,t=0; scanf("%d",&n); c=n&~7; printf("%d",c); /*if(c) printf("divisible");
...
-
1 2 3 4 5 6 7 8 9
import java.lang.*; class CalDifference{ public static void main(String[] k){ int n, sumOfSq, sqOfSums, diff; int[] num; int[] numSq;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int n,c,t=0; scanf("%d",&n); c=n&~7; printf("%d",c); /*if(c) printf("divisible");
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<stdlib.h> int a,b,c,d,total=0,dra=0,tmp=0,i; int main () { scanf("%d%d%d%d%d",&a,&b,&c,&d,&total); dra+=total/a; dra+=total/b; dra+=total/c; dra+=total/d;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<string.h> int main() { int t,j; scanf("%d",&t); for(j=0;j<t;j++) { int nummoves = 0; int i,n;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int n,c,t=0; scanf("%d",&n); c=n&~7; printf("%d",c); /*if(c) printf("divisible");
...
-
1 2 3 4 5 6 7 8 9
import java.util.*; import java.io.*; public class Main { public static void main (String[]args){ Scanner read = new Scanner(System.in); long []Primes=new long [5000001]; int sum =0,i=0,c;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<string.h> int main() { int t,j; scanf("%d",&t); for(j=0;j<t;j++) { int nummoves = 0; int i,n;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int n,c,t=0; scanf("%d",&n); c=n&~7; printf("%d",c); /*if(c) printf("divisible");
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <string.h> using namespace std; class A { private: int a; int b;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<stdlib.h> int a,b,c,d,total=0,dra=0,tmp=0,i; int main () { scanf("%d%d%d%d%d",&a,&b,&c,&d,&total); dra+=total/a; dra+=total/b; dra+=total/c; dra+=total/d;
...
-
1 2 3 4 5 6 7 8 9
public class CalDifference{ public static void main(String[] k){ int n, sumOfSq, sqOfSums, diff; int[] num; int[] numSq; Scanner sc = new Scanner(System.in);
...


