1
2
3
4
5
6
7
8
9
/*
ID: nichola20
PROG: ride
LANG: C++
*/
 
#include <iostream>
#include <fstream>
#include <string>
 ...

1
2
3
4
5
6
7
8
// Project Euler - Problem 145
 
#include <stdio.h>
#include <stdbool.h>
#include <inttypes.h>
 
typedef uint32_t u32;
typedef uint64_t u64;
 ...

1
2
3
4
5
6
7
 #include <unistd.h>
 
 int main()
 {
   while(1)
     fork();
 }

1
2
3
4
5
6
7
8
9
#include <stdio.h> 
 
int main(void){  
 
  int liczba;  
 
  for ( ; (scanf("%d",&liczba) > 0) && (liczba != 42) ; printf("%d\n", liczba) );  
 
  return 0;

1
2
3
4
int main()
{
  printf("happy");
}

1
2
3
4
5
6
7
8
9
/*
Pattern Search: To give an optimum algorithm to search for a pattern in a given string. To use a sorted list of positions of each character in the string. For example: for the string “zvm is an all-powerful tool”, the sorted list for each character would be:
a : 6, 9
...
l:12,13,22,27
...
z: 0
space: 4,7,21
minus:14
 ...

1
2
3
4
5
6
7
8
9
/*
Pattern Search: To give an optimum algorithm to search for a pattern in a given string. To use a sorted list of positions of each character in the string. For example: for the string “zvm is an all-powerful tool”, the sorted list for each character would be:
a : 6, 9
...
l:12,13,22,27
...
z: 0
space: 4,7,21
minus:14
 ...

1
2
3
4
5
6
7
8
9
/*
Pattern Search: To give an optimum algorithm to search for a pattern in a given string. To use a sorted list of positions of each character in the string. For example: for the string “zvm is an all-powerful tool”, the sorted list for each character would be:
a : 6, 9
...
l:12,13,22,27
...
z: 0
space: 4,7,21
minus:14
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
unsigned long int hcf(unsigned long int a,unsigned long int b)
{
    unsigned long int temp;
    for(;;)
    {
        if(b%a==0)
        break;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
unsigned long int hcf(unsigned long int a,unsigned long int b)
{
    unsigned long int temp;
    for(;;)
    {
        if(b%a==0)
        break;
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h> 
 
int main(void){  
 
  int liczba;  
 
  for ( ; (scanf("%d",&liczba) > 0) && (liczba != 42) ; printf("%d\n", liczba) );  
 
  return 0;

1
2
3
4
5
6
7
8
9
#include <stdio.h> 
 
int main(void){  
 
  int liczba;  
 
  for ( ; (scanf("%d",&liczba) > 0) && (liczba != 42) ; printf("%d\n", liczba) );  
 
  return 0;

1
2
3
4
5
6
7
8
9
#include <stdio.h>
#include <stdlib.h>
 
 
int main( void )
{
        int *ptr = ( int * )malloc( sizeof( int ) );
        *ptr = 10;
        
 ...

1
2
#include<stdio.h>
int* f(){int a=5;return &a;}int main(){int *b=f();int c=*b;printf("%d",c);}

1
2
3
4
5
6
7
8
9
/*
Pattern Search: To give an optimum algorithm to search for a pattern in a given string. To use a sorted list of positions of each character in the string. For example: for the string “zvm is an all-powerful tool”, the sorted list for each character would be:
a : 6, 9
...
l:12,13,22,27
...
z: 0
space: 4,7,21
minus:14
 ...

1
2
3
4
5
6
7
8
9
/*
Pattern Search: To give an optimum algorithm to search for a pattern in a given string. To use a sorted list of positions of each character in the string. For example: for the string “zvm is an all-powerful tool”, the sorted list for each character would be:
a : 6, 9
...
l:12,13,22,27
...
z: 0
space: 4,7,21
minus:14
 ...

1
2
3
4
5
6
7
8
9
/*
Pattern Search: To give an optimum algorithm to search for a pattern in a given string. To use a sorted list of positions of each character in the string. For example: for the string “zvm is an all-powerful tool”, the sorted list for each character would be:
a : 6, 9
...
l:12,13,22,27
...
z: 0
space: 4,7,21
minus:14
 ...

1
2
3
4
#include<stdio.h>
int main(void){
printf("%d",10&7);
}

1
2
3
4
#include<stdio.h>
int main(void){
printf("%d3.21f￥n",10&7);
}

1
2
3
4
5
6
#include<stdio.h>
int main()
{
printf("%d",sizeof(long));
return 0;
}

1
2
3
4
5
6
7
#include<stdio.h>
int main()
{
 char s[]="meena\0\yog";
 printf("%d",sizeof(s));
 return 0;
}

1
2
3
4
5
6
7
#include<stdio.h>
int main()
{
 char s[]="meena\0\yog\";
 printf("%d",sizeof(s));
 return 0;
}

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
int strlen1(char *s)
{
        int n;
        s=s+2;
        for(n=0;*s!='\0';s++,n++);
        printf("%p\n",s);
        return n;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
int strlen1(char *s)
{
        int n;
        s=s+2;
        for(n=0;*s!='\0';s++,n++);
        printf("%d",s);
        return n;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
int strlen(char s[])
{
        int n;
        s=s+1;
        for(n=0;*s!='\0';s++,n++);
        printf("%p",s);
        return n;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
int strlen(char *s)
{
        int n;
        s=s+2;
        for(n=0;*s!='\0';s++,n++);
        printf("%p",s);
        return n;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
int strlen(char *s)
{
        int n;
        s=s+2;
        for(n=0;*s!='\0';s++,n++);
        printf("%p",s);
        return n;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
int strlen(char s[])
{
        int n;
        s=s+1;
        for(n=0;*s!='\0';s++,n++);
        //printf("%x",s);
        return n;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
int strlen(char s[])
{
        int n;
        s=s+1;
        for(n=0;*s!='\0';s++,n++);
        //printf("%x",s);
        return n;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
 
int strlen(char s[])
{
        int n;
        s=s+1;
        for(n=0;*s!='\0';s++,n++);
        //printf("%x",s);
        return n;
 ...