adityasuseno

Keybase proof

I hereby claim:

• I am adityasuseno on github.
• I am suseno (https://keybase.io/suseno) on keybase.
• I have a public key whose fingerprint is 7B7E 843C F938 58C6 6DA3 BC86 1E5E B99E 56E0 22ED

To claim this, I am signing this object:

adityasuseno

public class UserID_Parser
{
    public static void main(String[] args)
    {
        System.out.println(isValidUserID(args[0]));
    }
    public static boolean isValidUserID(String str)
    {
        boolean q = false;
        int len = str.length();

adityasuseno

#!/usr/bin/env python3

#Simple program to check whether a number is prime or not
def isPrime(n):
	if n < 2:
		return False
	elif n == 2:
		return True
	else:
		for i in range(2, n):

adityasuseno

#!/usr/bin/env python3
def isPrime(n):
#	if n < 2:
#		return False
#	elif n == 2:
#		return True
#	else:
		for i in range(2, n):
			p = n % i
			if p == 0:

adityasuseno

#include<stdio.h>

int isPrime(int n)
{
	if (n < 2)
		return 0;
	else if (n == 2)
		return 1;
	else
	{

adityasuseno

print("Enter a number: ")
n = parse(UInt8, readline())
for c = 1:n
    for i = 1:c
        print(i, " ")
    end
    println(" ")
end

adityasuseno

function isPrime(n)
    if n < 2
        return false
    elseif n == 2
        return true
    else
        for i in 2:n-1
            p = n % i
            if p == 0
                return false

adityasuseno

use std::io;

fn factorial(i: u64) -> u64 {
    let mut acc = 1;
    for num in 2..=i {
        acc *= num;
    }
    acc
}

adityasuseno

use std::io;
use std::cmp::Ordering;
use rand::Rng;

fn main() {
    println!("Guess the number!");

    let secret_number = rand::thread_rng().gen_range(1, 101);

    /*println!("The secret number is: {}", secret_number);*/

adityasuseno

use std::io;

fn is_prime(n: i32) -> bool
{
    for i in 2..n
    {
        let p = n % i;
        if p == 0
        {
            return false;