Looking for an inspiration? Below you will find public programs submitted by other users.

Filter by: All Bash C C# C++ 4.8.1 C++11 Haskell Java Java7 Objective-C Pascal (fpc) Pascal (gpc) Perl PHP Python Python 3 Ruby SQL VB.NET Ada Assembler Assembler AWK (gawk) AWK (mawk) bc Brainf**k C++ 4.3.2 C99 strict CLIPS Clojure COBOL COBOL 85 Common Lisp (clisp) D (dmd) Erlang F# Factor Falcon Forth Fortran Go Groovy Icon Intercal JavaScript (rhino) JavaScript (spidermonkey) Lua Nemerle Nice Nimrod Node.js Ocaml Octave Oz PARI/GP Perl 6 Pike Prolog (gnu) Prolog (swi) R Scala Scheme (guile) Smalltalk Tcl Text Unlambda Whitespace

#fTBpUo C++ 4.8.1 5 hours ago
Compilation error
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3.  
  4. /* Link list node */
  5. struct node
  6. {
  7. int data;
  8. struct node* next;
  9. };
#IFlKSd C++ 4.8.1 5 hours ago
Success
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. //static int count=0;
  5.  
  6. void f(int a[][8],int n,int m,int x,int y,int z,int fx,int fy, int &count){
  7. if(x==fx && y==fy && z==(n*m-1) && a[x][y]==1) {count++; return;}
  8. /*
  9.   if( (x-1)>=0 && a[x-1][y]!=0 ) { int zb=z; int b[8][8]=a; if(--b[x][y]==0) zb++ ; f(b,n,m,x-1,y,zb,fx,fy,count);};
#67MSlk C++ 4.8.1 5 hours ago
Success
  1. #include<stdio.h>
  2. int main(){printf ("123");}
#P8VEak C++ 4.8.1 5 hours ago
Success
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. #include<string.h>
  4. #include<vector>
  5. #include<algorithm>
  6. #include<queue>
  7. #include<stack>
  8. using namespace std;
#v0DrPE C++ 4.8.1 5 hours ago
Compilation error
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main()
  5. {
  6. register int i = 10;
  7. int *a = &i;
  8. printf("%d", *a);
  9. getchar();
#fq1KE0 C++ 4.8.1 5 hours ago
Compilation error
  1. int main(){printf ("123");}
#Gr9pEv C++ 4.8.1 5 hours ago
Success
  1. #include <stdio.h>
  2.  
  3. // Returns true if there is a subset of set[] with sun equal to given sum
  4. bool isSubsetSum(int set[], int n, int sum)
  5. {
  6. // Base Cases
  7. if (sum == 0)
  8. return true;
  9. if(sum<0)
#DDBKDg C++ 4.8.1 5 hours ago
Success
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int smallest(int a[],int l,int r)
  5. {
  6. if(l>r)
  7. return r+1;
  8. if(l!=a[l])
  9. return l;
#rrMM5J C++ 4.8.1 5 hours ago
Time limit exceeded
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. int i,j,l;
  6. char str[]="my name is aditya";
  7. char str2[]="aditya";
  8. for( l=0; str2[l]!=NULL; l++);
  9. for(i=0,j=0 ; str[i]!=NULL && str2[j]!=NULL;)
#1B5yqi C++ 4.8.1 5 hours ago
Success
  1. #include <stdio.h>
  2.  
  3. // Returns true if there is a subset of set[] with sun equal to given sum
  4. bool isSubsetSum(int set[], int n, int sum)
  5. {
  6. // Base Cases
  7. if (sum == 0)
  8. return true;
  9. if(sum<0)
#rhmy1s C++ 4.8.1 5 hours ago
Compilation error
  1. printf ("123");
#1ZYrEV C++ 4.8.1 5 hours ago
Success
  1. #include<stdio.h>
  2. int main()
  3. {
  4. int arr[10],i;
  5. arr[5]=10;
  6. printf("%d %d", arr[0],arr[5]);
  7. for(i=0;i<10;i++)
  8. {printf(" \t %d",arr[i]);}
#Xb2ksc C++ 4.8.1 5 hours ago
Compilation error
  1. #include <stdio.h>
  2. #include <iostream>
  3. using namespace std;
  4. class DLLElement {
  5. public:
  6. DLLElement( void *itemPtr, int sortKey ) // initialize a list element
  7. {
  8. item = itemPtr;
  9. key = sortKey;
#1s3PL6 C++ 4.8.1 4 hours ago
Runtime error
  1. #include <stdio.h>
  2. #include <iostream>
  3. using namespace std;
  4. #include <string.h>
  5. void permute(char *arr);
  6. int main() {
  7. // your code goes here
  8. char s[1000];
  9. memset(s,'\0',1000);
#V6bSCx C++ 4.8.1 5 hours ago
Success
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7. int grade;
  8. cout << "Please enter the marks to find the grade" << endl;
  9. cin >> grade;
#SUBLxm C++ 4.8.1 5 hours ago
Compilation error
  1. #include <iostream>
  2. using namespace std::placeholders;
  3.  
  4. int main() {
  5. auto f = _1 + _2;
  6. return f(2, 3);
  7. }
#hyWjfB C++ 4.8.1 5 hours ago
Runtime error
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. //static int count=0;
  5.  
  6. void f(int a[][8],int n,int m,int x,int y,int z,int fx,int fy, int &count){
  7. if(x==fx && y==fy && z==(n*m-1) && a[x][y]==1) {count++; return;}
  8. /*
  9.   if( (x-1)>=0 && a[x-1][y]!=0 ) { int zb=z; int b[8][8]=a; if(--b[x][y]==0) zb++ ; f(b,n,m,x-1,y,zb,fx,fy,count);};
#f8gKIk C++ 4.8.1 5 hours ago
Compilation error
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. //static int count=0;
  5.  
  6. void f(int a[][8],int n,int m,int x,int y,int z,int fx,int fy, int &count){
  7. if(x==fx && y==fy && z==(n*m-1) && a[x][y]==1) {count++; return;}
  8. /*
  9.   if( (x-1)>=0 && a[x-1][y]!=0 ) { int zb=z; int b[8][8]=a; if(--b[x][y]==0) zb++ ; f(b,n,m,x-1,y,zb,fx,fy,count);};
#UOouwH C++ 4.8.1 4 hours ago
Success
  1. #include <iostream>
  2. #include <algorithm>
  3. using namespace std;
  4.  
  5.  
  6. int main()
  7. {
  8. int a[] = {1,2,3,4,5,6,7,8,9,10};
#RGFQ59 C++ 4.8.1 5 hours ago
Success
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. cout<<"137=2(2(2)+2+2(0))+2(2+2(0))+2(0)"<<endl;
  6. cout<<"1315=2(2(2+2(0))+2)+2(2(2+2(0)))+2(2(2)+2(0))+2+2(0)"<<endl;
  7. cout<<"73=2(2(2)+2)+2(2+2(0))+2(0)"<<endl;
  8. cout<<"136=2(2(2)+2+2(0))+2(2+2(0))"<<endl;
  9. cout<<"255=2(2(2)+2+2(0))+2(2(2)+2)+2(2(2)+2(0))+2(2(2))+2(2+2(0))+2(2)+2+2(0)"<<endl;
#n1UxcK C++ 4.8.1 5 hours ago
Success
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. typedef struct point
  5. {
  6. int x;
  7. int y;
  8. }Point;
#iDwVrV C++ 4.8.1 4 hours ago
Success
  1.  
  2. #include <iostream>
  3. #include <vector>
  4. #include <string>
  5. #include <sstream>
  6.  
  7.  
  8. using namespace std;
#mXnxxV C++ 4.8.1 5 hours ago
Success
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. typedef struct point
  5. {
  6. int x;
  7. int y;
  8. }Point;
#meCkHz C++ 4.8.1 5 hours ago
Success
  1. #include<stdio.h>
  2. #include<algorithm> //for using sort function
  3. using namespace std;
  4. int main()
  5. {
  6. int t;
  7. scanf("%d",&t);
  8. while(t--)
  9. {
#2lBXKc C++ 4.8.1 5 hours ago
Success
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. typedef struct point
  5. {
  6. int x;
  7. int y;
  8. }Point;
#RGRnw9 C++ 4.8.1 5 hours ago
Success
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. // your code goes here
  6. return 0;
  7. }
#MNG6bM C++ 4.8.1 5 hours ago
Success
  1. #include <iostream>
  2. #include <vector>
  3. #include <algorithm>
  4.  
  5. using namespace std;
  6.  
  7. class Compare
  8. {
  9. public:
#7WExDU C++ 4.8.1 5 hours ago
Success
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. typedef struct point
  5. {
  6. int x;
  7. int y;
  8. }Point;
#z4ccir C++ 4.8.1 4 hours ago
Success
  1. #include<iostream>
  2. #include<math.h>
  3. using namespace std;
  4. int main()
  5. {
  6. long long int a=pow(2,80);
  7. cout<<a;
  8. }
#u6RQzh C++ 4.8.1 5 hours ago
Success
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. typedef unsigned long long ll;
  4.  
  5. string s;
  6. ll dp[65][65][2];
  7. ll solve(int i, int ones, bool state){
  8. if(i==s.size())
  9. return ones==4||ones==7||ones==44||ones==47;