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
- Java7
- 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> int main(){ int N,W; scanf("%d %d",&W,&N); int val[N]; int wt[N]; for(int i=0;i<N;i++) { scanf("%d %d",&wt[i],&val[i]);
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> # include <cstdlib> using namespace std; string array[101]; int edit(){ for (int j = 100; j >= 0; j --) { for(int i=0;i<=200;i++){ array[j][i] += '0';
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<stdlib.h> using namespace std; int main(){ bool m=false;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main(){ int N,W; scanf("%d %d",&W,&N); int val[N]; int wt[N]; for(int i=0;i<N;i++) { scanf("%d %d",&wt[i],&val[i]);
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> # include <cstdlib> using namespace std; string array[101]; int edit(){ for (int j = 100; j >= 0; j --) { for(int i=0;i<=200;i++){ array[j][i] += '0';
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> using namespace std; int main() { long long int n; cin>>n; long long int fib(long long int a); cout<<fib(n);
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> # include <cstdlib> using namespace std; string array[101]; int edit(){ for (int j = 100; j >= 0; j --) { for(int i=0;i<=200;i++){ array[j][i] += '0';
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main(){ int N,W; scanf("%d %d",&W,&N); int val[N]; int wt[N]; for(int i=0;i<N;i++) { scanf("%d %d",&wt[i],&val[i]);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main(){ int n; scanf("%d", &n); int* a; int* b; a = (int*)malloc(n*sizeof(int));
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main(){ int count; cin >> count; for(int i = 0; i<count; i++){ cout << i << endl; }
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main(){ int n; scanf("%d", &n); int* a; int* b; a = (int*)malloc(n*sizeof(int));
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main(){ int N,W; scanf("%d %d",&W,&N); int val[N]; int wt[N]; for(int i=0;i<N;i++) { scanf("%d %d",&wt[i],&val[i]);
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<string> #include<bitset> using namespace std; string mytoString(bitset<int> b) { return b.template to_string<char, char_traits<char>, allocator<char> >(); }
...
-
1 2 3 4 5 6 7 8
#include"stdio.h" int main() { int a,b; scanf("%d%d",&a,&b); printf("%d",a+b); return 0; }
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <string> #include <cstdlib> #include <sstream> using namespace std; string fact[101]; string myitoa(int n){ string s; stringstream ss; ss<<n;ss>>s; return s; }
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> using namespace std; string array[101]; int edit(){ for (int j = 100; j >= 0; j --) { for(int i=0;i<=200;i++){ array[j][i] += '0'; }
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main(){ int n; scanf("%d", &n); int* a; int* b; a = (int*)malloc(n*sizeof(int));
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> using namespace std; long div(int n) { int c=0,k=0; for(long i=1;;i++) { for(long j=1;j<=i;j++) {
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> using namespace std; long div(int n) { int c=0,k=0; for(long i=1;;i++) { for(long j=1;j<=i;j++) {
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main(){ int N,W; scanf("%d %d",&W,&N); int val[N]; int wt[N]; for(int i=0;i<N;i++) { scanf("%d %d",&wt[i],&val[i]);
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main(){ int N,W; scanf("%d %d",&W,&N); int val[N]; int wt[N]; for(int i=0;i<N;i++) { scanf("%d %d",&wt[i],&val[i]);
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<string> #include<bitset> using namespace std; string mytoString(bitset<unsigned int> b) { return b.to_string<char, char_traits<char>, allocator<char> >(); }
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main(){ int a=3791, w=0; while(w==0){ a=a+45; if(a%3==1){ if(a%5==1){ if(a%9==3){
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main(){ int n; scanf("%d", &n); int* a; int* b; a = (int*)malloc(n*sizeof(int));
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> using namespace std; string array[101]; int print(int x){ int i=0; while(array[x][i]==0){ i++; } for (; i <= 200; i += 1)
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<string> #include<bitset> using namespace std; string toString(bitset<unsigned int> b) { return b.to_string<char, char_traits<char>, allocator<char> >(); }
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> using namespace std; int div(long n) { int c=0,k=0; for(int i=1;;i++) { for(int j=1;j<=i;j++) {
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> using namespace std; int div(long n) { int c=0,k=0; for(int i=1;;i++) { for(int j=1;j<=i;j++) {
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<string> #include<bitset> using namespace std; string toString(bitset<unsigned int>& b) { return b.to_string<char, char_traits<char>, allocator<char> >(); }
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> using namespace std; int div(long n) { int c=0,k=0; for(int i=1;;i++) { for(int j=1;j<=i;j++) {
...


