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 / uva 10591 happy number solution in C
Created April 30, 2015 02:22
uva 10591 happy number solution in C
/// Author :Shohanur Rahaman
/// UVA 10591
#include<stdio.h>
#include<math.h>
int main()
{
@shohan4556
shohan4556 / URI Online Judge | 1566 (Height) Solution in C++.cpp
Last active February 14, 2017 18:52
URI Online Judge | 1566 (Height) Solution in C++
/// Author : shohanur Rahaman
///Problem level : easy
/// URI : 1566
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
@shohan4556
shohan4556 / age sort - 11426 solution in C
Created April 18, 2015 19:01
age sort - 11426 solution in C
/// Author : Shohan
// Uva : 11462
#include<stdio.h>
#include<stdlib.h>
int compair(const void *i, const void *j);
int main()
{
@shohan4556
shohan4556 / UVA : 11727 - Cost Cutting
Created April 17, 2015 18:31
UVA : 11727 - Cost Cutting solution in C
/// Author: Shohanur Rahaman
// UVA : 11727
#include<stdio.h>
void sort(int array_size,int array[]);
int salary[3];
int main()
{
@shohan4556
shohan4556 / UVA 11332 (summing digit ) solution in C
Created April 16, 2015 18:52
UVA 11332 (summing digit ) solution in C
///Author : Shohanur Rahaman
//Problem level : Easy
//UVA : 11332 (Summing Digits)
#include <stdio.h>
int main()
{
int t;
long long int n;
package notepad;
import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
import java.util.Scanner;
import java.io.*;
public class Notepad extends JFrame implements ActionListener {
private TextArea textArea = new TextArea("", 0,0, TextArea.SCROLLBARS_VERTICAL_ONLY);
// Author : Md.Shohanur Rahaman
import java.util.Scanner;
import java.lang.StringBuffer;
public class Main {
public static void main(String args[]){
Scanner input=new Scanner(System.in);
String str;
@shohan4556
shohan4556 / URI OJ : 1267 (Pascal Library) solution
Last active August 29, 2015 14:17
URI OJ : 1267 (Pascal Library) solution
/// URI OJ : 1267 (Pascal Library)
/// Author : Shohanur Rahaman
/// Probem Type : Ad-Hoc
#include<stdio.h>
int main()
{
int i,j,tmp,ck;
int ara[500][500];
int d,n;
@shohan4556
shohan4556 / UVA -- 10104 solution
Created March 16, 2015 18:20
UVA -- 10104 solution
#include<stdio.h>
int extends_euclid(int a,int b,int &x,int &y);
int main()
{
int a,b,x,y;
int d;
while(scanf("%d %d",&a,&b)==2){
@shohan4556
shohan4556 / Codechef -- Ambiguous Permutations
Created March 14, 2015 04:40
Codechef -- Ambiguous Permutations
#include<stdio.h>
int ara[1000005];
int invara[1000005];
int main()
{
int n,i,count;
while(scanf("%d",&n)==1){