Skip to content

Instantly share code, notes, and snippets.

View shohan4556's full-sized avatar
πŸ’»
Making things that does not Exists !!

Shohanur Rahaman shohan4556

πŸ’»
Making things that does not Exists !!
View GitHub Profile
@shohan4556
shohan4556 / URI --1761 (Christmas Decorations)
Last active August 29, 2015 14:14
URI --1761 (Christmas Decorations)
/// Author : Md.Shohanur Rahaman
/// URI --1761 (Christmas Decorations)
/// Easy Problem
#include<stdio.h>
#include<math.h>
#define PI 3.141592654
int main()
{
@shohan4556
shohan4556 / I am not satisfied for the program (Demo database)
Created January 30, 2015 20:36
I am not satisfied for the program (Demo database)
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package edu_database;
import java.util.*;
/**
@shohan4556
shohan4556 / URI 1016
Last active August 29, 2015 14:14
URI 1016
#include<stdio.h>
int main()
{
int n=0,ans=0;
while(scanf("%d",&n)==1){
ans=(60*n)/30;
printf("%d minutos\n",ans); // formula : time= (input*60)/(Y-X)
}
return 0;
}
@shohan4556
shohan4556 / project euler 16 solution
Created January 29, 2015 14:04
project euler 16 solution
package projecteuler; // replace
import java.math.BigInteger;
/**
*
* @author Shohan
*/
public class euler16 {
@shohan4556
shohan4556 / Uva 10394 (Twin prime)
Created January 28, 2015 17:56
Uva 10394 (Twin prime)
/// Author : Shohan
/// Uva 10394 (Twin prime)
#include<stdio.h>
#include<math.h>
#include<string.h>
#define N 20000000
char p[N];
unsigned long long int tp[N];
@shohan4556
shohan4556 / URI 1582 solution in C
Created January 26, 2015 14:47
URI 1582 solution in C
/// Author : Shohan
// URI - 1582
#include<stdio.h>
int ckpytha(int a,int b,int c);
int gcd(int a,int b);
int main()
{
@shohan4556
shohan4556 / uva 11172
Created January 23, 2015 16:23
uva 11172
/// Author : Md. Shohanur Rahaman
/// Uva --11171
#include<stdio.h>
int main()
{
int long tc,a,b;
scanf("%ld",&tc);
while(tc--){
scanf("%ld %ld",&a,&b);
@shohan4556
shohan4556 / uva 374.c
Last active February 14, 2017 19:00
uva 374
/// Author : Md. Shohanur Rahamana
// Uva - 374
// Problem Type : Same as Problem Name (Big Mod)
#include<stdio.h>
int long long bigmod(int long long a,int long long p,int long long m);
int main()
{
int long long a,p,m,res;
@shohan4556
shohan4556 / factorial using java
Created January 22, 2015 20:28
factorial using java
import java.math.BigInteger;
/**
*
* @author Shohan
*/
public class Factorial {
public static void main(String args[]){
int n=99;
String fact= calculateFactorial(n);
@shohan4556
shohan4556 / count factorial
Created January 22, 2015 20:16
count factorial
/// Author : Md. shohanur Rahaman
#include<stdio.h>
#include<string.h>
#define N 250
#define B 10
int main()
{
int fact[N],i,j,n,size=0,carry=0,tmp=0,a;