1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<math.h>
int main(){
int i,j,l,a,k,rev=0,t,r[7];
scanf("%d\n",&t);
i=0;
while(i<t)A
{ scanf("%d\n",&k);
    if(k<=1000000)
 ...

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=2;
int sum=0;
 
sum=sum+(~0&~(~0<<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
import java.util.*;
import java.lang.*;
 
class Main
{
        public static void main (String[] args) throws java.lang.Exception
        {
                int a; int b = (a = 5) + (a = 6);
                System.out.println(a);
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int marks,s;
float n;
scanf("%d",&marks);
n=marks/10;
s=n+1;
switch(s)
 ...

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>
int main()
{
int marks,s;
float n;
scanf("%d",&marks);
n=marks/10;
s=n+1;
switch(s)
 ...

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);
 ...

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 <cstring>
#include <algorithm>
 
using namespace std;
 
int c[6102][6102];
int lcs( char *x ) 
{
 ...

1
2
3
4
5
6
7
8
#include <stdio.h>
void Ps(int a[], int b[], int k, int l);
 
int main(){
 int a[] = {1, 2, 3, 4};
 int b[] = {8, 9};
 Ps(a, b, 4, 2);
}
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <cstring>
#include <algorithm>
 
using namespace std;
 
int c[6102][6102];
int lcs( char *x ) 
{
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int marks,s;
float n;
scanf("%d",&marks);
n=marks/10;
s=n+1;
switch(s)
 ...

1
2
3
4
5
6
7
8
#include <stdio.h>
void Ps(int a[], int b[], int k, int l);
 
int main(){
 int a[] = {1, 2, 3, 4};
 int b[] = {8, 9};
 Ps(a, b, 4, 2);
}
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<string.h>
char str[20000];
int extract(int a)
{
 int len=0;
 while(str[a]!=' ') len++;
 return len;
}
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int marks,s;
float n;
scanf("%d",&marks);
n=marks/10;
s=n+1;
switch(s)
 ...

1
2
3
4
5
6
7
8
#include <stdio.h>
void Ps(int a[], int b[], int k, int l);
 
int main(){
 int a[] = {1, 2, 3, 4};
 int b[] = {8, 9};
 Ps(a, b, 4, 2);
}
 ...

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>
using namespace std;
 
int main() {
        string a, b, c;
        int na, nb, r;
        cin >> a;
        na = a.size();
 ...

1
2
3
4
5
6
7
8
#include <stdio.h>
void Ps(int a[], int b[], int k, int l);
 
int main(){
 int a[] = {1, 2, 3, 4};
 int b[] = {8, 9};
 Ps(a, b, 4, 2);
}
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int marks,s;
float n;
scanf("%d",&marks);
n=marks/10;
s=ceil(n);
switch(s)
 ...

1
2
3
4
5
6
7
8
9
//This is an example for problem id FCTRL2 in SPOJ..
import java.math.BigInteger;
import java.io.*;
import java.util.Arrays;
class FCTRL2
{
 
public static int multiplicity(int n, int p) {
    int q = n, m = 0;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <math.h>
using namespace std;
int main(){cout.precision(12);
    double a,c;
    int b,x=0,n;
    //cin>>a;
    a=0.123456789;
    do{a=a*10;b=a;;x++;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
    long double r,p;
    long int i,w;
    float a,b,c,d;
    a=1000;
    b=37;
    r=(a/b);
 ...

1
2
3
4
5
6
7
8
9
#include<cstdlib>
#include<iostream>
using namespace std;
long int k=1000000;
//int *y=(int*)malloc(sizeof(int)*1000000);
short int y[1000000000];
int main()
 
{
 ...

1
2
3
4
5
6
7
8
#include <stdio.h>
void Ps(int a[], int b[], int k, int l);
 
int main(){
 int a[] = {1, 2, 3, 4};
 int b[] = {8, 9};
 Ps(a, b, 4, 2);
}
 ...

1
2
3
4
5
6
#include <stdio.h>
char*s="char*s=%c%s%c;main(){printf(s,34,s,34);}";
int main(){
printf(s,34,s,34);
return 0;
}

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int i=1;
int j;
while(i<=4)
{
 
for(j=0;j<=i;j++)
 ...

1
2
3
4
5
6
7
8
9
//This is an example for problem id FCTRL2 in SPOJ..
import java.math.BigInteger;
import java.io.*;
import java.util.Arrays;
class FCTRL2
{
 
public static int multiplicity(int n, int p) {
    int q = n, m = 0;
 ...