Tadabbur Ayat #2

Minggu yang memenatkan, ok, setiap minggu penat actually. With all those assignments, works, college projects and a lot of things to be done. Ugh.. But still I keep thinking positively, because all those things actually make me be better than before...  Today has programming competition and it is a kind of hard competition I think. Haha.. kadang-kadang rasa macam nak give up.. but when I think about it I’ll look back for what I have done for these previous years..  studied hard to enter this university back after my foundation and further my study in this course (Software Engineering). Every time people ask me what course did you take? And when I answered their question they seem to be shock. Yes..  study for programming is hard if you don’t have any interest in this subject.. but it become fun if you can actually develop your own application based on that programming.. haha..

Setiap kali rasa macam nak putus asa, rasa macam aku ni tak pandai... orang lain lagi pandai... then I will look at this words...

Janganlah kamu bersikap lemah dan janganlah kamu bersedih hati, padahal kamu orang yang paling tinggi darjatnya jika kamu orang yang beriman.
[Surah Al-‘Imran ayat 139]

So keep thinking positively, there is nothing that can beat your place beside Allah if you are the one that put Him in the first place instead of other things in this world.. what ever problem that you face there will always be a solution.. insyaAllah...

12 a.m

programming code for armstrong number

package armstrong;
import java.util.Scanner;

public class Armstrong {

    public static void main(String[] args) {
        Scanner value = new Scanner (System.in);
        int a, b=0 ;
        System.out.println("enter the number : ");
        int n=value.nextInt();
        int c=n;
              a=n%10;  n=n/10;  b=b+(a*a*a);
              System.out.println(a+"  "+n+"  "+b);  // to see the logic
    if(c==b)  System.out.println("Armstrong number");
    else      System.out.println(" Not Armstrong number");

programming code for prime number

Feel free to use it.. just wanna share this code if you really need it..


package prime.number;

import java.util.Scanner;

public class PrimeNumber {

    public static void main(String[] args) {
        Scanner num = new Scanner (System.in);
        int value,calc;
        boolean prime=true;
        System.out.println("enter the number : ");
        if (value==1)
            System.out.println("not a prime number");
        for(int i=2;i<=value/2;i++)
  System.out.println(value + " is a prime number");
  System.out.println(value + " is not a prime number");


Wish me luck and can do my programming question tomorrow in Programming League !!

Segmen review blog : Irsalina Lovely

Asslamualaikum dan hai ...

Bismillah... ni first time ada request untuk review blog, so hari ni InsyaAllah nak review satu blog ni yang diberi nama Irsalina Lovely. Blog yang comel je Miss tengok...with that flower petals keep falling from above.. comel je.. Blog ni sebenarnya menyediakan khidmat untuk review blog, produk dan juga movie... If ada dekat luar sana teringin nak traffic blog korang naik ke or nak tambah follower ke.. nak berniaga secara online ke.. boleh la request review dekat admin blog ni.. mana nak tahu lepas review follower naik mendadak ke.. hah..

Cara nak tempah review boleh je tengok dekat navigation bar :

kalau nak tempah boleh 

Follow blog.
Emel: mianasrin@ymail.com

Whatsapp: 0195686331

Senarai review :

Contoh review produk :

produk yang di review memang akan dicuba dahulu oleh admin nak kemudian direview.. so, untuk tahu berhasil ke tak produk tu based on pengalaman admin.. 

Testimoni customer : 

antara customer yang berpuas hati dan dah tempah 2 kali.. 2 kali.. memang service terbaik la...

So jom ramai-ramai support bisnes rakan blogger kita ni.. miss doakan Irsalina sentiasa murah rezeki.. amiin.. apa lagi... jom terjah blog dia !!!

dan doakan Miss berjaya untuk programming league esok !! amiin...

Java programming code for euclidean method

Just want to share the code for those than learn programming on how to write a program than can calculate Greatest Common Divisor using euclidean method. Feel free to use it :

 public static void main(String[] args) {
        Scanner kb =new Scanner(System.in);
        int a,b,d,e,f;
        System.out.println("enter first integer :");
        System.out.println("enter second integer :");
        d=euclidean (a,b);
        System.out.println("gcd of ("+a+","+b+") is "+d);  
    public static int euclidean (int a,int b){
        int c,n1,n2;
        if (a>b)
                if (c==0){
        return n2;