chermehdi

Portlets

definition de portlets :

• un composant web unitaire integré dans un conteneur (portail).
• une specification du Java EE (jsr-168 - 2003) * grande similarité entre les portlets et les servlets .

definition de portails.:

• c’est un conteneur fournissant au portlets un environement d’execution .

chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**

chermehdi

import java.util.LinkedHashMap;
import java.util.Map;

/**
 * @author MaxHeap
 */
public class Main {
    public static Map<Long, Integer> factorize(long n) {
        Map<Long, Integer> factors = new LinkedHashMap<>();
        for (long d = 2; n > 1; ) {

chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.Arrays;
import java.util.Random;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.io.File;

chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.io.File;
import java.util.StringTokenizer;
import java.io.Writer;

chermehdi

import java.util.Arrays;
import java.util.Random;

public class SegmentTree {

	int modifyOperation(int x, int y) {
		return x + y;
	}

	// query (or combine) operation

chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.io.File;
import java.util.StringTokenizer;
import java.io.Writer;

chermehdi

#include <iostream>
#include <string>
#include <math.h>
#include <set>
#include <utility>
#include <vector>

using namespace std;
const int N = 1e5;
int a[N];

chermehdi

#include <string.h>
#include <stdio.h>
#include <iostream>
#include <map>
using namespace std;
const int N = 1e6;

int main(){
  int arr[3]; 
  for(int i = 0; i < 3; i++) cin >> arr[i];

chermehdi

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <queue>

using namespace std;

const int N = 500;