Skip to content

Instantly share code, notes, and snippets.

View anuradhawick's full-sized avatar
:octocat:
Hello there :)

Anuradha anuradhawick

:octocat:
Hello there :)
View GitHub Profile
@anuradhawick
anuradhawick / recursiveClearer.c
Last active August 29, 2015 14:08
Program to clear an object(shape) by recursion
#include <stdio.h>
int spc[5][5]={{1,0,0,0,0},{1,1,0,0,0},{0,1,1,0,0},{0,0,0,0,0},{0,0,1,1,1}};
int rs=5,cs=5;
int main(){
int i;
int rc[2];
printArr(spc,rs,cs);
printf("Enter the row number and column number\n");
for(i=0;i<2;i++){
scanf("%d",&rc[i]);
@anuradhawick
anuradhawick / Euler 1.c
Created November 13, 2014 10:48
Euler 1
#include <stdio.h>
void main(){
int i = 0,sum=0;
for(i=1;i<1000;i++){
if(i%3==0 | i%5==0){
sum += i;
}
}
printf("%d\n",sum);
}
@anuradhawick
anuradhawick / Euler2.c
Created November 13, 2014 11:04
Euler 2
#include <stdio.h>
void main(){
int a=1,b=1,c=2,i,sum=0;
for(i=0;i<50000;i++){
c=a+b;
a=b;
b=c;
if(c>4000000){
break;
@anuradhawick
anuradhawick / Euler3.c
Last active August 29, 2015 14:09
Euler 3
#include <stdio.h>
#include <math.h>
typedef int bool;
#define true 1
#define false 0
void main(){
long long int i,n=600851475143;
for(i=1;i<(int)sqrt(n)+1;i++){
if(n%i==0 && prime(i)==1){
printf("%d\n",i);
@anuradhawick
anuradhawick / prime(sieve).c
Created November 13, 2014 11:24
Prime number tester
typedef int bool;
#define true 1
#define false 0
bool prime(long long int n){
long long int i;
if(n<=0 || n==1 || (n%2==0 && n!=2)){
return false;
}
else if(n==2 || n==3){
return true;
@anuradhawick
anuradhawick / counter.c
Created November 13, 2014 12:47
Char array lengthcounter
int length(char * array){
int len=0,i=0;
while(1){
if(array[i]=='\0') return len;
len++;
i++;
}
}
@anuradhawick
anuradhawick / revert.c
Created November 13, 2014 12:49
Reversing an array of characters in C
void reverse(char * array,int size){
int i;
char a,b;
for(i=0;i<=size/2;i++){
a = array[i];
array[i] = array[size-i-1];
array[size-i-1] = a;
}
}
@anuradhawick
anuradhawick / Euler4.c
Created November 13, 2014 13:10
Euler4
#include <stdio.h>
typedef int bool;
#define true 1
#define false 0
void main(){
char a[7];
int i,j,p,m=100;
for(i=100;i<1000;i++){
for(j=100;j<1000;j++){
p = i*j;
@anuradhawick
anuradhawick / gcd.c
Created November 13, 2014 13:22
GCD/ HCF/ highest common factor for two numbers recursive
int gcd(int a,int b){
if (a>b){
if(b==0){
return a;
}
else{
return gcd(b,a%b);
}
}
else{
@anuradhawick
anuradhawick / Euler5.c
Created November 13, 2014 13:29
Euler 5
#include <stdio.h>
typedef int bool;
#define true 1
#define false 0
void main(){
long long int i,p=1,t,t2;
for(i=2;i<=20;i++){
p = (p*i)/gcd(p,i);
}