code stringlengths 1 2.01M | repo_name stringlengths 3 62 | path stringlengths 1 267 | language stringclasses 231
values | license stringclasses 13
values | size int64 1 2.01M |
|---|---|---|---|---|---|
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="java.sql.*,java.util.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<link href="style.css" rel="stylesheet" type="tex... | 135-grad-admissions | trunk/data-source-realm/students/6_DegreeLocation.jsp | Java Server Pages | mit | 4,865 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="java.util.*, java.sql.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html... | 135-grad-admissions | trunk/data-source-realm/students/12_SaveData.jsp | Java Server Pages | mit | 3,439 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="java.util.*, java.sql.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<link href="style.css" rel="stylesheet" type="te... | 135-grad-admissions | trunk/data-source-realm/students/2_Citizenship.jsp | Java Server Pages | mit | 2,619 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="java.util.*, java.sql.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<link href="style.css" rel="stylesheet" type="te... | 135-grad-admissions | trunk/data-source-realm/students/9_moreDegrees.jsp | Java Server Pages | mit | 4,295 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="java.util.*, java.sql.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<link href="style.css" rel="stylesheet" type="te... | 135-grad-admissions | trunk/data-source-realm/students/3_Resident.jsp | Java Server Pages | mit | 2,520 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="java.util.*, java.sql.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<link href="style.css" rel="stylesheet" type="te... | 135-grad-admissions | trunk/data-source-realm/students/4_Address.jsp | Java Server Pages | mit | 2,375 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="java.sql.*, java.util.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<link href="style.css" rel="stylesheet" type="te... | 135-grad-admissions | trunk/data-source-realm/students/7_DegreeUniversity.jsp | Java Server Pages | mit | 3,951 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="support.*, java.util.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<link href="style.css" rel="stylesheet" type="tex... | 135-grad-admissions | trunk/data-source-realm/students/5_Residency.jsp | Java Server Pages | mit | 2,295 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="support.*, java.util.*, java.sql.*" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<meta http-equiv="Content-Type" conten... | 135-grad-admissions | trunk/data-source-realm/students/10_Specialization.jsp | Java Server Pages | mit | 2,866 |
<%@page import="support.*, java.util.*" %>
<HTML>
<HEAD> <TITLE> Support Example</TITLE> </HEAD>
<BODY>
<%
support s = new support();
String path1 = config.getServletContext().getRealPath("countries.txt");
String path2 = config.getServletContext().getRealPath("universities.txt");
... | 135-grad-admissions | trunk/data-source-realm/support.jsp | Java Server Pages | mit | 2,172 |
<%
session.invalidate();
response.sendRedirect(application.getContextPath()+"/login.jsp");
%>
| 135-grad-admissions | trunk/data-source-realm/invalidate.jsp | Java Server Pages | mit | 100 |
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@page import="java.util.*, java.sql.*" %>
<%
String userNameParam = request.getParameter("username");
String passwordParam = request.getParameter("password");
String passwordVerifyParam = request.getParamet... | 135-grad-admissions | trunk/data-source-realm/RegisterUser.jsp | Java Server Pages | mit | 3,328 |
package binarytree;
class Main {
public static void main(String[] args) {
binarytree<Integer> b= new binarytree<Integer>();
b.add(5);
b.add(3);
b.add(2);
b.add(4);
b.add(7);
b.add(6);
b.getLeaves();
System.out.println("/n");
b.show();
}
}
| 12pi-algs | trunk/OksanaDoronina/BeenaryTree/src/binarytree/Main.java | Java | mit | 283 |
package knight;
import java.util.ArrayList;
public class program2knight {
static int N = 8;
static int[][] board = new int[N][N];
static int[][] boardMove = new int[N][N];
public static void main(String[] args) {
int c=0;
int x=0;
int y=0;
boardMove[0][0]=c;
board[0][0]=99;
while(... | 12pi-algs | trunk/OksanaDoronina/program2/src/knight/program2knight.java | Java | mit | 2,610 |
package Fibonachi;
public class program3 {
public static void main(String[] args) {
int n0 = 1, n1 = 1, n2;
System.out.print(n0+" "+n1+" ");
for(int i = 0; i < 18; i++){
n2=n0+n1;
System.out.print(n2+" ");
n0=n1;
n1=n2;
}
... | 12pi-algs | trunk/OksanaDoronina/program3/src/Fibonachi/program3.java | Java | mit | 357 |
package factorial;
import java.util.Scanner;
class Factorial
{
public static void main(String args[])
{
int n, c, fact = 1;
System.out.println("Enter an integer to calculate it's factorial");
Scanner in = new Scanner(System.in);
n = in.nextInt();
if ( n < 0 )
... | 12pi-algs | trunk/OksanaDoronina/program5/src/factorial/factorial.java | Java | mit | 556 |
package multiplucation;
public class multiplication {
static long x = 1234567890;
static long y = 2121212121;
static int counter1=0;
static int counter2=0;
static long[] mar1 = new long[100];
static long[][] mar2 = new long[100][100];
public static void multi(long x, long y)
{
int count=0;
i... | 12pi-algs | trunk/OksanaDoronina/multiplication/src/multiplucation/multiplication.java | Java | mit | 1,002 |
package slojenie;
public class slojenie {
public static int[] mar1;
public static int[] mar2;
public static int[] mar3;
public static int shirina=5;
public static int n=0;
public static void create()
{
for(int i=1;i<shirina;i++)
{
mar1[i]=(int) (Math.random() * 9);
}
for(int i=0;i<shiri... | 12pi-algs | trunk/OksanaDoronina/multiplication/src/slojenie/slojenie.java | Java | mit | 1,081 |
import java.util.Random;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Random;
public class main {
public static void main(String[] args) {
bubble_sort q = new bubble_sort();
bubble_sort w = new bubble_sort();
long time_start = 0;
... | 12pi-algs | trunk/DaryaBorovkova/bubble sort/src/main.java | Java | mit | 1,164 |
public class bubble_sort {
public void Bubble_sort(int array[], int n)
{
for (int i = 0; i < n; i++)
for (int j = n - 1; j > 0; j--)
if (array[j - 1] > array[j]) {
int tmp = array[j - 1];
array[j - 1] = array[j];
array[j] = tmp;
}
}
public void my_Bubble_sort(int array[], int n)
... | 12pi-algs | trunk/DaryaBorovkova/bubble sort/src/bubble_sort.java | Java | mit | 555 |
package bin_search;
public class search {
public int bin_search (int array[], int n, int x)
{
int first = 0;
int last = n;
int mid = (last - first) / 2;
if (last == 0)
{
return 0;
}
else if (array[0] > x)
{
return 0;
}
else if (array[n-1] < x)
{
return 0;
}
whi... | 12pi-algs | trunk/DaryaBorovkova/bin_search/src/bin_search/search.java | Java | mit | 651 |
package bin_search;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Random;
public class main {
public static void main(String[] args) {
search w = new search();
long time_start = 0;
int max = 15;
int x =7;
int[] array = new in... | 12pi-algs | trunk/DaryaBorovkova/bin_search/src/bin_search/main.java | Java | mit | 978 |
public class fib {
public static int fibonachi(int n)
{
if (n < 2) return 1;
main.oper +=1;
return fibonachi(n-1) + fibonachi(n-2);
}
public static int fib_cycle(int n)
{
int i = 2;
int fib_sum = 0;
int fib1 = 1;
int fib2 = 1;
while (i < n)
{
fib_sum = fib2 + fib1;
... | 12pi-algs | trunk/DaryaBorovkova/Fibonachi/src/fib.java | Java | mit | 434 |
public class nod {
public long evklid_func (long a, long b)
{
while (b !=0)
{
long tmp = a % b;
a = b;
b = tmp;
}
return a;
}
public long my_func (long a, long b)
{
long c = 1;
long nod = 0;
if (a < b) c = a;
else c = b;
for (int i = 1; i<=c; i++)
... | 12pi-algs | trunk/DaryaBorovkova/NOD/src/nod.java | Java | mit | 393 |
package factorial;
public class fact {
public static long fact(long n)
{
main.oper +=1;
if (n==1) return 1;
return (n*fact(n-1));
}
}
| 12pi-algs | trunk/DaryaBorovkova/factorial/src/factorial/fact.java | Java | mit | 154 |
package merge_sort;
public class quick {
void Quick_sort (int[] array, int start, int end) {
int pivot;
if ( start >= end ) {
return;
}
int marker = start;
for ( int i = start; i <= end; i++ ) {
if ( array[i] <= array[end] ) {
int t... | 12pi-algs | trunk/DaryaBorovkova/merge_and_quick_sorts/src/merge_sort/quick.java | Java | mit | 597 |
package merge_sort;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Random;
public class main {
public static void main(String[] args) {
quick q = new quick();
long time_start = 0;
int max = 500000;
System.out.printf("Merge\n");
f... | 12pi-algs | trunk/DaryaBorovkova/merge_and_quick_sorts/src/merge_sort/main.java | Java | mit | 1,105 |
package merge_sort;
public class merge {
static int[] Merge_Sort(int[] massive)
{
if (massive.length <= 1)
return massive;
int mid_point = massive.length / 2;
return Merge(Merge_Sort(java.util.Arrays.copyOfRange(massive, 0, mid_point-1)), Merge_Sort(java.util.Arrays.cop... | 12pi-algs | trunk/DaryaBorovkova/merge_and_quick_sorts/src/merge_sort/merge.java | Java | mit | 1,041 |
package horse;
public class horse {
int level;
int stor;
int count = 0;
int horse(int w, int h, int[][] mass, int level)
{
//проверка ходов
mass[w][h] = level;
int flag = 1;
if (level == stor*stor ) {count = count+1; printArr(mass, stor, stor);}
if((0 <= h+2) && (h+2 < stor) && (0 <= w+1)... | 12pi-algs | trunk/DaryaBorovkova/horse/src/horse/horse.java | Java | mit | 1,638 |
package horse;
public class main {
public static void main(String[] args) {
horse horse = new horse();
int imax = 5;
int jmax = 5;
int [][] array = new int[imax][jmax];
horse.stor=5;
for (int i = 0; i < horse.stor; i++)
{
for(int j = 0; j < horse.stor; j++)
{
horse.horse(i, j, ... | 12pi-algs | trunk/DaryaBorovkova/horse/src/horse/main.java | Java | mit | 408 |
package algorithms;
import java.io.File;
public class Tree {
}
| 12pi-algs | trunk/IlyaErokhin/Tree/src/algorithms/Tree.java | Java | mit | 73 |
package algorithms;
public class Tree {
public Element head = null;
public Element min(){
Element current = head;
while(current.left!=null){
current = current.left;
}
return current;
}
public Element max(){
Element current = head;
while(current.right!=null){
current = current.... | 12pi-algs | trunk/IlyaErokhin/BinaryTree/src/algorithms/Tree.java | Java | mit | 3,632 |
package algorithms;
public class Element {
public Element right;
public Element left;
public Element parent;
public int key;
public char value;
Element(int Key, char Value){
value = Value;
key = Key;
}
}
| 12pi-algs | trunk/IlyaErokhin/BinaryTree/src/algorithms/Element.java | Java | mit | 234 |
package algorithms;
public class Element {
public Element next;
public int ch;
public Element(int ch){
this.ch = ch;
}
}
| 12pi-algs | trunk/IlyaErokhin/Работа со списками 2/List/src/algorithms/Element.java | Java | mit | 140 |
package algorithms;
public class Element {
public Element next;
public String key;
public String value;
public Element(String key, String value){
this.key = key;
this.value = value;
}
}
| 12pi-algs | trunk/IlyaErokhin/Map/src/algorithms/Element.java | Java | mit | 210 |
package algorithms;
public class Map {
public Element head = null;
public void Key_list(){
if(head == null){
System.out.println("Error: Map is empty!");
}else{
Element cur = head;
System.out.print("Key list: ");
while(cur.next!=null){
System.out.print(cur.key+" ");
cur = cur.ne... | 12pi-algs | trunk/IlyaErokhin/Map/src/algorithms/Map.java | Java | mit | 3,406 |
package algorithms;
public class Element {
public Element next;
public int ch;
public Element(int ch){
this.ch = ch;
}
}
| 12pi-algs | trunk/IlyaErokhin/Работа со списками/List/src/algorithms/Element.java | Java | mit | 140 |
package algorithms;
public class TestCalendar {
public static void main(String[] args) {
Calendar c = new Calendar();
System.out.println(c.GetDay(new Day(31,4,2008)));
}
}
| 12pi-algs | trunk/IlyaErokhin/День недели/Calendar/src/algorithms/TestCalendar.java | Java | mit | 199 |
package algorithms;
public class Day {
public int Number;
public int Mounth;
public int Year;
public Day(int Number, int Mounth, int Year){
this.Number = Number;
this.Mounth = Mounth;
this.Year = Year;
}
}
| 12pi-algs | trunk/IlyaErokhin/День недели/Calendar/src/algorithms/Day.java | Java | mit | 237 |
package algorithms;
public class Element {
public int key;
public String value;
Element(int Key,String Value){
key=Key;
value=Value;
}
}
| 12pi-algs | trunk/IlyaErokhin/Priority Queue/src/algorithms/Element.java | Java | mit | 159 |
package algorithms;
public class Peak {
public String [] next;
public String c;
public Peak(String c){
this.c = c;
}
}
| 12pi-algs | trunk/IlyaErokhin/Graph (однонаправленный)/src/algorithms/Peak.java | Java | mit | 138 |
package algorithms;
public class TestGraph {
public static void main(String[] args) {
Graph graph = new Graph();
String [] Peaks1 = {"B","G",null};
graph.Add_Peak(new Peak("A"),Peaks1);
String [] Peaks2 = {"C","D", null};
graph.Add_Peak(new Peak("B"),Peaks2);
String [] Peaks3 = {"E", null};... | 12pi-algs | trunk/IlyaErokhin/Graph (однонаправленный)/src/algorithms/TestGraph.java | Java | mit | 859 |
package algorithms;
public class Element {
public Element next;
public String key;
public Peak value;
public Element(Peak value){
this.key = value.c;
this.value = value;
}
}
| 12pi-algs | trunk/IlyaErokhin/Graph (однонаправленный)/src/algorithms/Element.java | Java | mit | 198 |
package algorithms;
public class Element {
public Element next;
public int ch;
public Element(int ch){
this.ch = ch;
}
}
| 12pi-algs | trunk/IlyaErokhin/Stack/src/algorithms/Element.java | Java | mit | 140 |
package algorithms;
public class Stack {
public Element head = null;
public void PUSH(Element elem){
if(head == null){
head = elem;
return;
}
if(head != null){
elem.next = head;
head = elem;
return;
}
}
public Element POP(){
Element cur = head;
head = head.next;
... | 12pi-algs | trunk/IlyaErokhin/Stack/src/algorithms/Stack.java | Java | mit | 602 |
package algorithms;
public class Element {
public Element next;
public Element previous;
public int ch;
public Element(int ch){
this.ch = ch;
}
public Element(){
this.next=this;
this.previous=this;
}
}
| 12pi-algs | trunk/IlyaErokhin/Double List/src/algorithms/Element.java | Java | mit | 233 |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class bisearch {
@SuppressWarnings("resource")
public static void main(String[] args) {
int num=10;
ArrayList<Integer> list = new ArrayList<Integer>(num);
for(int i=0;i<num;i++){
list.add(i);
}
... | 12pi-algs | trunk/AlisaMartirosyan/бинарный поиск/bisearch.java | Java | mit | 1,075 |
package fgd;
public class SpisokTest {
public static void main(String[] args)
{
Spisok s= new Spisok();
Spisok sp= new Spisok();
int []mas = new int[10];
for( int i=0; i<mas.length;i++)
{
mas[i] = (int)Math.round(Math.random()*(-10));
s.add(new Element(mas[i]));
s.add_end(new E... | 12pi-algs | trunk/AlisaMartirosyan/список/SpisokTest.java | Java | mit | 676 |
package fgd;
public class Spisok {
Element head = null;
public void add(Element elem){
if(head == null)
{
head = elem;
}
else{
Element current = head;
while (current.next != null)
{
current = current.next;
}
current.next = elem;
}
}
public void add_begin(E... | 12pi-algs | trunk/AlisaMartirosyan/список/Spisok.java | Java | mit | 1,590 |
package fgd;
public class Element
{
public int i;
public Element next = null;
public Element(int i){
this.i=i;
}
}
| 12pi-algs | trunk/AlisaMartirosyan/список/Element.java | Java | mit | 139 |
// programma hod konem!
import java.util.Scanner;
public class knight
{
static int lenght = 5;
static int arr[][];
public static void main(String[] args)
{
Scanner cin = new Scanner(System.in);
System.out.print("Input the size of the board: ");
lenght = cin.nextInt();
arr = new int[lenght][leng... | 12pi-algs | trunk/AlisaMartirosyan/ход конем/knight.java | Java | mit | 1,754 |
public class list {
public element head = new element();
public void add_end(element elem){
if(head.next == head){
head.next=elem;
head.prev=elem;
elem.next=head;
elem.prev=head;
}else{
element cur = head;
while(cur.next!=head){
cur = cur.next;
}
cur.... | 12pi-algs | trunk/AlisaMartirosyan/двусвязный список/spisok.java | Java | mit | 983 |
public class element {
public element next;
public element prev;
public int i;
public element(int i){
this.i = i;
}
public element(){
this.next=this;
this.prev=this;
}
}
| 12pi-algs | trunk/AlisaMartirosyan/двусвязный список/element.java | Java | mit | 212 |
public class binarytree
{
public class Element
{
int num;
Element left;
Element right;
public Element parent;
public Element(int num, Element parent)
{
this.num = num;
this.left = null;
this.right = null;
this.parent = parent;
}
}
Element root;
int lenght;
pub... | 12pi-algs | trunk/AlisaMartirosyan/бинарное дерево/binarytree.java | Java | mit | 1,710 |
public class multiplication {
static long x = 1234567890;
static long y = 2123456789;
static int counter1=0;
static int counter2=0;
static long[] arr1 = new long[100];
static long[][] arr2 = new long[100][100];
public static void multi(long x, long y)
{
int count=0;
int c1=0,c2=0;
while(y!=0... | 12pi-algs | trunk/AlisaMartirosyan/сложение и умножение/multiplication.java | Java | mit | 968 |
package stolbik;
public class slojenie {
public static int[] arr1;
public static int[] arr2;
public static int[] arr3;
public static int length=5;
public static int n=0;
public static void create()
{
for(int i=1;i<length;i++)
{
arr1[i]=(int) (Math.random() * 9);
}
for(int i=0;i<lengt... | 12pi-algs | trunk/AlisaMartirosyan/сложение и умножение/slojenie.java | Java | mit | 1,069 |
import java.util.Random;
public class numberone
{
public static int num = 5;
public static int crutch = 0;
public static int howmuch(int x,int y,int arr [][])
{
int count = 0;
if(x+1<num && y+2<num && arr[y+2][x+1] == 0){count++;}
if(x+2<num && y+1<num && arr[y+1][x+2] == 0){count++;}
if(y-2>... | 12pi-algs | trunk/ValeriyFrolov/StepOfKnight/src/numberone.java | Java | mit | 3,394 |
public class algs03 {
public static int Mult(int max, int min, int t,int mult){
if(t>=min)
{
return mult;
}
else
{
mult = mult + max;
return Mult(max,min,t+1,mult);
}
// return mult;
}
public static void main(String[] args) {
int a = 2222;
int b = 11;
int mult = 0;... | 12pi-algs | trunk/ValeriyFrolov/SU/src/algs03.java | Java | mit | 406 |
public class algs02 {
public static long searchN(long x){
long N = 1;
while(N < x)
N = N * 10;
if(N > 1)
N = N / 10;
return N;
}
public static long searchT(long x){
long T = 0;
for(int N = 1; N < x; N=N*10){
T++;
}
return T;
}
public static void main(String[] args) ... | 12pi-algs | trunk/ValeriyFrolov/SU/src/algs02.java | Java | mit | 718 |
public class algs04 {
public static int searchT(int x){
int T = 0;
for(int N = 1; N < x; N=N*10){
T++;
}
return T;
}
public static int xtn(int x,int n){
int a = x;
for(int iter = 1; iter < n; iter++)
a = a * x;
return a;
}
public static void main(String[] args) {
int a = 2222... | 12pi-algs | trunk/ValeriyFrolov/SU/src/algs04.java | Java | mit | 783 |
public class algs01 {
public static int searchN(int x){
int N = 10;
while(N < x)
N = N * 10;
N = N / 10;
return N;
}
public static int searchT(int x){
int T = 0;
for(int N = 1; N < x; N=N*10){
T++;
}
return T;
}
public static void main(String[] args) {
int x = 123456789... | 12pi-algs | trunk/ValeriyFrolov/SU/src/algs01.java | Java | mit | 760 |
public class Fib {
static int count = 0;
public static int fibo_native(int N){
if(N < 2)
return N;
count++;
//System.out.print(" " + N);
return fibo_native(N - 2) + fibo_native(N - 1);
}
public static void main(String[] args) {
long start = System.nanoTime();
System.out.println(fibo_na... | 12pi-algs | trunk/ValeriyFrolov/alds02/src/Fib.java | Java | mit | 459 |
import java.util.ArrayList;
import java.util.Collections;
public class bublesort {
public static int num = 10;
public static ArrayList<Integer> list = new ArrayList<Integer> (num);
public static ArrayList<Integer> justbubsor(){
int t = num - 1;
for(int j = 0;j < t; j++){
for(int i = 0;i < t; i+... | 12pi-algs | trunk/ValeriyFrolov/alds02/src/bublesort.java | Java | mit | 1,235 |
public class NOD {
public static int del(int n,int m){
int count;
int exit;
if(n < m){
count = m % n;
if(count != 0)
return del(n,m % n);
else
exit = n;
}
else{
count = n % m;
if(count != 0)
return del(n % m,m);
else
exit = m;
}
return exit;
... | 12pi-algs | trunk/ValeriyFrolov/alds02/src/NOD.java | Java | mit | 1,110 |
public class factorial {
public static void main(String[] args){
int x = 12;
int fac = 1;
for(int i = 1;i <= 12;i++){
fac = fac * i;
System.out.println(fac);
}
}
}
| 12pi-algs | trunk/ValeriyFrolov/alds02/src/factorial.java | Java | mit | 194 |
import java.util.Random;
public class numberone
{
public static int num = 5;
public static int crutch = 0;
public static int howmuch(int x,int y,int arr [][])
{
int count = 0;
if(x+1<num && y+2<num && arr[y+2][x+1] == 0){count++;}
if(x+2<num && y+1<num && arr[y+1][x+2] == 0){count++;}
if(y-2>... | 12pi-algs | trunk/ValeriyFrolov/Knight/src/numberone.java | Java | mit | 3,394 |
package Algorithms;
import java.util.ArrayList;
public class BS {
public static int num = 10;
public static ArrayList<Integer> list = new ArrayList<Integer> (num);
public static int bs(int x){
int l = list.get(0);
int i = num - 1;
int r = list.get(i);
while(x != list.get(i)){
i = (l+r)/... | 12pi-algs | trunk/ValeriyFrolov/New practic/src/Algorithms/BS.java | Java | mit | 596 |
public class test
{
public static void main(String[] args)
{
map director = new map();
mkv test = new mkv();
director.create(test, 6);
director.add(test,"Name","Aleks");
director.add(test,"Sirname","Stown");
director.add(test,"Age","37");
director.printmap(test);
director.justsearc(tes... | 12pi-algs | trunk/ValeriyFrolov/13112013/src/test.java | Java | mit | 474 |
import java.util.ArrayList;
public class mkv
{
public ArrayList<String> key = new ArrayList<String>();
public ArrayList<String> value = new ArrayList<String>();
}
| 12pi-algs | trunk/ValeriyFrolov/13112013/src/mkv.java | Java | mit | 173 |
public class map
{
public void create(mkv MapArr,int size)
{
for(int i = 0;i < size;i++)
{
MapArr.key.add(null);
MapArr.value.add(null);
}
}
public void add(mkv MapArr,String Key,String Value)
{
int check = 0;
int size = MapArr.key.size();
for(int i = 0;i < size;i++)
{
i... | 12pi-algs | trunk/ValeriyFrolov/13112013/src/map.java | Java | mit | 1,786 |
import java.util.ArrayList;
import java.util.Collections;
public class Merge
{
public static int num = 8;
public static ArrayList<Integer> list = new ArrayList<Integer> (num);
public static ArrayList<Integer> mergesort(ArrayList<Integer> arr)
{
int x = arr.size();
ArrayList<Integer> left = new Ar... | 12pi-algs | trunk/ValeriyFrolov/Merge/src/Merge.java | Java | mit | 1,956 |
public class spisok {
public element head = null;
public void delbeg(element elem)
{
if(head == null)
{
head = elem;
}
else
{
head=null;
elem=null;
}
}
public void delend(element elem){
if(head == null)
{
head = elem;
}
else
{
... | 12pi-algs | trunk/ValeriyFrolov/Plist/src/spisok.java | Java | mit | 2,014 |
public class element
{
public element next;
public int i;
public element(int i)
{
this.i = i;
}
}
| 12pi-algs | trunk/ValeriyFrolov/Plist/src/element.java | Java | mit | 125 |
public class AlgEv {
}
| 12pi-algs | trunk/ValeriyFrolov/AlgEv/src/AlgEv.java | Java | mit | 29 |
public class lists
{
Element head = null;
public void addend (Element elem)
{
if (head == null)
{
head = elem;
}
else
{
Element cur = head;
while (cur.next != null)
{
cur = cur.next;
}
cur.next = elem;
}
}
public void addbeg (Element elem)
{
elem.... | 12pi-algs | trunk/ElizavetaBurdaeva/List/lists.java | Java | mit | 1,912 |
public class Element
{
public Element next = null;
public int i;
Element (int i)
{
this.i=i;
}
}
| 12pi-algs | trunk/ElizavetaBurdaeva/List/Element.java | Java | mit | 116 |
import java.util.Scanner;
public class DateOfBirth
{
public static void Data(int day, int month, int year)
{
int wd=0;
if(month <= 2)
{
year=year-1;
day=day+3;
}
wd = (1 + (day + year + year/4 - year/100 + year/400 + (31*month + 10)/12))%7;
switch (wd)
{
case 0: {Syst... | 12pi-algs | trunk/ElizavetaBurdaeva/DateOfBirth.java | Java | mit | 1,161 |
class Element
{
public Element next = null;
public int i;
Element (int i)
{
this.i=i;
}
}
public class StackOnLists
{
Element head = null;
public String toString()
{
StringBuffer sb = new StringBuffer();
sb.append("{ ");
Element current = head;
while (current != null)
{
s... | 12pi-algs | trunk/ElizavetaBurdaeva/StackOnLists.java | Java | mit | 1,037 |
package pack;
public class fibo
{
public static void main(String[] args)
{
long start;
start = System.nanoTime();
System.out.println(fibo(7));
System.out.println("Time of running: "+(System.nanoTime()-start)+" nanosec");
start = System.nanoTime();
System.out.println(fibo_re... | 12pi-algs | trunk/NikitaMukhin/src/pack/fibo.java | Java | mit | 822 |
package pack;
public class BinaryTree
{
public class Node
{
int num;
Node left;
Node right;
Node iam;
Node parent;
public Node(int num, Node parent)
{
this.num = num;
this.left = null;
this.right = null;
this.iam = this;
this.parent = parent;
}
}
Node root;... | 12pi-algs | trunk/NikitaMukhin/src/pack/BinaryTree.java | Java | mit | 4,861 |
package pack;
import java.util.Scanner;
public class searchs
{
public static void randomArr(int arr[])
{
for(int k = 0; k < arr.length; k++)
arr[k] = (int)(Math.random()*arr.length);
}
public static void printArr(int arr[])
{
for(int k = 0; k < arr.length; k++)
System.out.print(arr[k] + ... | 12pi-algs | trunk/NikitaMukhin/src/pack/searchs.java | Java | mit | 1,298 |
package pack;
public class nod
{
public static void main(String[] args)
{
int a = 300000;
int b = 1701;
long start;
start = System.nanoTime();
System.out.println("Nod: " + nod(a, b));
System.out.println("Time of running: "+(System.nanoTime()-start)+" nanosec");
start = System.... | 12pi-algs | trunk/NikitaMukhin/src/pack/nod.java | Java | mit | 814 |
package pack;
public class TreeHeap
{
int arr[];
public TreeHeap()
{
// int mass[] = {0,2,3,2,4,5,7,9,6,8,9,11,8,9};
arr = new int[11];
}
private int getLeft(int i)
{
if(0 < 2*i && 2*i < arr.length)
return arr[2*i];
return 0;
}
private int getRight(int i)
{
if(0 < 2*i+1... | 12pi-algs | trunk/NikitaMukhin/src/pack/TreeHeap.java | Java | mit | 2,141 |
package pack;
public class TwoThreeFourTree
{
public class Node
{
int type;
int nodes;
int num1;
int num2;
int num3;
Node node1;
Node node2;
Node node3;
Node node4;
Node parent;
public Node(int num)
{
this.type = 1;
this.nodes = 0;
this.num1 = num;
this.pare... | 12pi-algs | trunk/NikitaMukhin/src/pack/TwoThreeFourTree.java | Java | mit | 7,222 |
package pack;
class ElementStack
{
int num;
ElementStack next;
public ElementStack(int num)
{
this.num = num;
next = null;
}
}
public class Stack
{
ElementStack head = null;
int lenght = 0;
public Stack()
{
this.head = null;
lenght = 0;
}
private String toStr()
{
St... | 12pi-algs | trunk/NikitaMukhin/src/pack/Stack.java | Java | mit | 1,304 |
package pack;
class ElementCycled
{
int num;
ElementCycled next;
ElementCycled prev;
public ElementCycled(int num)
{
this.num = num;
next = this;
prev = this;
}
}
public class CycledList
{
ElementCycled sentry = null;
int lenght = 0;
public CycledList()
{
sentry = new Element... | 12pi-algs | trunk/NikitaMukhin/src/pack/CycledList.java | Java | mit | 2,156 |
package pack;
import java.awt.List;
import java.io.File;
import java.util.Vector;
class Trunk
{
String path;
int iByte;
Vector<Trunk> sons;
public Trunk(String path)
{
this.path = path;
this.iByte = 0;
sons = new Vector<Trunk>();
}
}
public class TreeForDirectory
{
Trunk root;
... | 12pi-algs | trunk/NikitaMukhin/src/pack/TreeForDirectory.java | Java | mit | 1,365 |
package pack;
public class factor
{
public static void main(String[] args)
{
long start;
start = System.nanoTime();
System.out.println(factorial(5));
System.out.println("Time of running: "+(System.nanoTime()-start)+" nanosec");
start = System.nanoTime();
System.out.println(... | 12pi-algs | trunk/NikitaMukhin/src/pack/factor.java | Java | mit | 718 |
package pack;
import java.math.BigInteger;
import java.util.Random;
public class Karatsuba
{
public static BigInteger karatsuba(BigInteger x, BigInteger y)
{
int N = Math.max(x.bitLength(), y.bitLength());
if (N <= 2000) return x.multiply(y);
N = (N / 2) + (N % 2);
BigInteger b = x.shif... | 12pi-algs | trunk/NikitaMukhin/src/pack/Karatsuba.java | Java | mit | 1,549 |
package pack;
import java.io.File;
public class ShowDirectoryAndSize
{
public ShowDirectoryAndSize(String path)
{
File root = new File(path);
printDirectory(root.getPath(), 0);
}
public long printDirectory(String path, int level)
{
long sizeByte = 0;
File tmp = new File(path);
fo... | 12pi-algs | trunk/NikitaMukhin/src/pack/ShowDirectoryAndSize.java | Java | mit | 886 |
package Algo;
public class Summ {
private Summ ()
{
}
static int [] summ (int [] a, int[] b)
{
if (a.length>b.length)
return summ_iter (a, b);
else
return summ_iter (b, a);
}
static int [] summ_iter (int [] max, int [] min)
{
int res [] = new int [max.length + 1];
in... | 12pi-algs | trunk/AnnaAnfilova/sum/Summ.java | Java | mit | 1,290 |
package Algo;
import java.io.File;
public class Node
{
File file;
Node father = null;
Node son = null;
Node brother = null;
public Node (File name)
{
this.file = name;
}
}
| 12pi-algs | trunk/AnnaAnfilova/Tree/Node.java | Java | mit | 203 |
public class Factorial {
public Factorial()
{
}
private double factorial(double n)
{
if (n==1)
return 1;
else
return n*factorial(n-1);
}
public static void main(String[] args) {
Factorial f = new Factorial();
double m;
for (int i=5; i<170; i+=5)
{
long before = System.n... | 12pi-algs | trunk/AnnaAnfilova/Factorial/Factorial.java | Java | mit | 491 |
package Algo;
public class BH
{
static int arr[];
static int level = 0;
public BH (int [] mass)
{
arr = mass;
}
public static int get_left (int i)
{
if (2*i>=arr.length)
return 0;
return arr[2*i];
}
public static int get_right (int i)
{
if (2*i+1>=arr.length)
return 0;
... | 12pi-algs | trunk/AnnaAnfilova/Binary Tree (Heap)/BH.java | Java | mit | 2,489 |
public class algo {
public static void nod ()
{
int i, min, max, a, b, temp, iter=0;
max=(int)(Math.random()*2000000000);
min=(int)(Math.random()*2000000000);
System.out.printf("%d \t", max);
System.out.printf("%d \t", min);
long before = System.currentTimeMillis();
if ((min==1) || (max==1)... | 12pi-algs | trunk/AnnaAnfilova/NOD/src/algo.java | Java | mit | 1,122 |
package Algo;
public class Element
{
int num;
Element next=null;
public Element (int num)
{
this.num=num;
this.next=null;
}
}
| 12pi-algs | trunk/AnnaAnfilova/Circular_List/Element.java | Java | mit | 154 |
package Algo;
public class Element
{
int num;
Element next=null;
public Element (int num)
{
this.num=num;
this.next=null;
}
}
| 12pi-algs | trunk/AnnaAnfilova/List/Element.java | Java | mit | 154 |
package horse;
public class horse
{
int razmer=5;
static void print_mass(int [][]mass, int a, int b)
{
for (int i=0; i<a; i++)
{
for (int j=0; j<b; j++)
System.out.print(mass[i][j] + "\t");
System.out.print("\n");
}
System.out.print("\n");
}
static int count=0;
private void horse_move (int ... | 12pi-algs | trunk/AnnaAnfilova/horse/src/horse/horse.java | Java | mit | 2,020 |
package ru.java2e;
public class Bullet
{
int x, y;
int rx, ry;
Tank sender;
public Bullet(int x, int y, int rx, int ry)
{
this.x = x;
this.y = y;
this.rx = rx;
this.ry = ry;
}
public void moveB()
{
x += rx;
y += ry;
}
public void... | 12pi-algs | trunk/MaximChugunov/Курсовая/BattleCity/src/ru/java2e/Bullet.java | Java | mit | 428 |
package ru.java2e;
import java.awt.*;
//import java.awt.event.KeyEvent;
import java.util.Vector;
//import javax.swing.ImageIcon;
//import javax.swing.JFrame;
import javax.swing.JPanel;
enum Direction
{
Up, Right, Down, Left;
}
enum UnitGroup
{
NoneGroup, PlayerGroup, BotGroup;
}
public clas... | 12pi-algs | trunk/MaximChugunov/Курсовая/BattleCity/src/ru/java2e/Tank.java | Java | mit | 4,484 |