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

#eiWHB1 C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. #include<algorithm>
  3. #include<string>
  4. #include<cstring>
  5. using namespace std;
  6.  
  7. int main() {
  8. int length;
  9. int test[2][500];
#4atiew C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. #include <stdlib.h>
  3. #include <bitset>
  4. #include <vector>
  5. #include <string>
  6. #include <sstream>
  7. #include <fstream>
  8. #include <streambuf>
  9. #include <iterator>
#JNJJOM C++ 4.8.1 10 hours ago
Time limit exceeded
  1. #include<iostream>
  2. using namespace std;
  3. int main()
  4. {
  5. int a[2];
  6. int t[10];
  7. int v;
  8. cin>>v;
  9. for(int q=0;q<v;q++)
#9Y4ZaS C++ 4.8.1 10 hours ago
Compilation error
  1. #include<iostream>
  2. using namespace std;
  3. void main()
  4. {
  5. int a[2];
  6. int t[10];
  7. int v;
  8. cin>>v;
  9. for(int q=0;q<v;q++)
#n6SvfL C++ 4.8.1 10 hours ago
Compilation error
  1. #include <cstdio>
  2. main() {
  3. int t;scanf("%d",&t);
  4. while (t--) {
  5. int n,m;scanf("%d%d",&n,&m);
  6. int a[n],i,l,p;
  7. long long sum = 0;
  8. for (i = 0; i < n; i++) {
  9. scanf("%d",&a[i]);
#IESwe4 C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main()
  5. {
  6. int n,i,x[100001],y[100001],a[100001],b[100001],cnt[100001];
  7. cin>>n;
  8. for(i=1;i<=n;i++)
  9. cin>>x[i]>>y[i];
#dofOQv C++ 4.8.1 10 hours ago
Success
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5. int t;
  6. scanf("%d",&t);
  7. while(t--) {
  8. int n,x,i,j;
  9. scanf("%d%d",&n,&x);
#2zYlWp C++ 4.8.1 9 hours ago
Success
  1. #include <iostream>
  2. #include <cstring>
  3.  
  4. using namespace std;
  5.  
  6. int main( )
  7. {
  8. char str[] = "Unable to read....";
  9. int l = strlen(str);
#GMcvRE C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. // your code goes here
  6. return 0;
  7. }
#xVDjBI C++ 4.8.1 10 hours ago
Compilation error
  1. #include<iostream.h>
  2.  
  3. void main()
  4. {
  5. int a[2];
  6. int t[10];
  7. int v;
  8. cin>>v;
  9. for(int q=0;q<v;q++)
#ANQ7FA C++ 4.8.1 10 hours ago
Success
  1.  
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. #define ll long long int
  5. int main()
  6. {
  7. int t;
  8. cin>>t;
  9. ll n,m,j;
#9Toza1 C++ 4.8.1 10 hours ago
Compilation error
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. int num,i;
  6. printf("enter num");
  7. scanf("%d",&i);
  8. printf("%d",i);
  9. return 0;
#5GWCNy C++ 4.8.1 10 hours ago
Compilation error
  1. #include<stdio.h>
  2. #include<string.h>
  3. #include<stdlib.h>
  4. int flag=0;
  5. void search(char *pat, char *txt, int q)
  6. {
  7. int M = strlen(pat);
  8. int N = strlen(txt);
  9. int i, j;
#zF7o6n C++ 4.8.1 10 hours ago
Success
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3.  
  4. /* A binary tree node has data, pointer to left child
  5.   and a pointer to right child */
  6. struct node
  7. {
  8. int data;
  9. struct node* left;
#gBgDsB C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. #include<algorithm>
  3. #include<string>
  4. #include<cstring>
  5. using namespace std;
  6.  
  7. int main() {
  8. int length;
  9. int test[2][500];
#fyN2kV C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. #include <sstream>
  3. #include <cstdio>
  4. #include <cstdlib>
  5. #include <cmath>
  6. #include <string.h>
  7. #include <vector>
  8. #include <list>
  9. #include <queue>
#AwXeZh C++ 4.8.1 10 hours ago
Success
  1. #include <vector>
  2. #include <list>
  3. #include <map>
  4. #include <set>
  5. #include <queue>
  6. #include <deque>
  7. #include <stack>
  8. #include <bitset>
  9. #include <algorithm>
#Q3sUWZ C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. #include <algorithm>
  3. #include <vector>
  4. #include <cstdio>
  5. using namespace std;
  6.  
  7. int main() {
  8. int t;
  9. scanf("%d",&t);
#06BSRt C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5.  
  6. int t;
  7. cin >> t;
  8. while (t-- >0) {
  9. long long candies;
#5YOl3v C++ 4.8.1 10 hours ago
Success
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3.  
  4. /* A binary tree node has data, pointer to left child
  5.   and a pointer to right child */
  6. struct node
  7. {
  8. int data;
  9. struct node* left;
#EK8PxQ C++ 4.8.1 10 hours ago
Success
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. int &fun()
  5. {
  6. int x = 10;
  7. return x;
  8. }
  9. int main()
#a6Fpth C++ 4.8.1 10 hours ago
Success
  1. #include<iostream>
  2. using namespace std;
  3. int main()
  4. {
  5. int m,n,t,j,i;
  6. cout<<"enter your limit";
  7. cin>>t;
  8. for(i=0;i<t;i++)
  9. {
#0ICZjz C++ 4.8.1 10 hours ago
Success
  1.  
  2. #include <iostream>
  3. #include <string>
  4. using namespace std;
  5.  
  6. int main ()
  7. {
  8. int t;
  9. cin>>t;
#MBtgdC C++ 4.8.1 10 hours ago
Success
  1. #include<stdio.h>
  2.  
  3. int main()
  4. {
  5. int i = 5;
  6. i = 5;
  7. while(i-- >= 0)
  8.  
  9. printf("%d,", i);
#dxQXuu C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. #define v 4
  6. #define INF 9999
  7.  
  8.  
  9. int floydWarshell(int graph[v][v])
#cnBtUR C++ 4.8.1 10 hours ago
Runtime error
  1. #include<iostream>
  2. #include<stdio.h>
  3. #include<cstring>
  4. using namespace std;
  5. int main()
  6. {
  7. while(true){
  8. char str[1100],p,str1[1100];
  9. int x=0,t=0;
#kqWBTU C++ 4.8.1 10 hours ago
Success
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. cout<<5;
  6. return 0;
  7. }
#wYoNwu C++ 4.8.1 10 hours ago
Success
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int hcf(int num1,int num2){
  4. int hcf;
  5. for(int i=1; i<=num1 || i<=num2; ++i)
  6. {
  7. if(num1%i==0 && num2%i==0) /* Checking whether i is a factor of both number */
  8. hcf=i;
  9. }
#3H9qXY C++ 4.8.1 10 hours ago
Time limit exceeded
  1. #include <iostream>
  2. #include <set>
  3. using namespace std;
  4.  
  5. int main() {
  6. set<int> mySet;
  7. mySet.erase(mySet.end());
  8. // your code goes here
  9. return 0;
#48vJKv C++ 4.8.1 10 hours ago
Runtime error
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3.  
  4. /* A binary tree node has data, pointer to left child
  5.   and a pointer to right child */
  6. struct node
  7. {
  8. int data;
  9. struct node* left;