Articole

@int n, p, ic = 1, ac = 1, bc = 1;

// aici vine citire de siruri crescatoare

// interclasarea while(ac <= n && bc <= p) { if(a[ac] < b[bc]) c[ic++] = a[ac++]; else c[ic++] = b[bc++]; }

eu traiesc!

#include <fstream>
#include <climits>
using namespace std;
ifstream fin (“mouse.in”);
ofstream fout (“mouse.out”);

const int nMAX = 100;
const int mMAX = 100;

int n, m;
int mat[nMAX + 1][mMAX + 1];

int main()
{ fin >> n >> m;

HHHAH HAH HAH HAH HAH HAAAAAAAA WELCUME TU JOEKER’S KITCHERS

TODAY, WEE ARR MAEKYNG JIINT HAMBURGAR

Hoors meet! slap

Red hout chili papparz.

ggrrrrRRRRRRASssss of det.

Oyl from Irák,

Cheese from Sao Paulo, frrom bbruhzil!

aAaAaaaaAAaah. Bred maed in turkay,

Furst put, Red, hout chili papparz.

Nao put oil, cuts bread with axe Uhhuhuhuhuhuhhuuu…

thats alot of cheese Very very horribul spicy.

hhHHHorribul horribul spicy..

UT IZ JOKAR HAMBURGAR! AHH HAH HAH HAH HAH HAH HAH HA-

Kuuk on tauzand degreaz.

meat cooks

Kuling daun hors meet! OHHAHAHAHAHAH HAH HAH HAH HA-

It iz Jokerz big hamburgaerz. OHAHAHAHAHA

Ai’m going to eet isz hamburgaer.

smellllllllllllllllllllllllll mmwaAAAHH HA HA HAA Mmmmmmmm….

Dit iz horribell…. … KRRAAAEZY HAMBURGAR

KRRAAAEZY HAMBURGAR

DIS IS HORRIBAL

KRRAAAEZY HAMBURGAR

KRRAAAEZY HAMBURGAR

KRRAAAEZY HAMBURGaaaaaaa cries

throws it into a river

.

@long long sumdiv(long long n)
{ long long d = 2, s = 1; while(n > 1) { if(n % d 0) { long long e = d; while(n % d 0) e *= d, n /= d; s *= (e-1)/(d-1); } else d++;

@int cate_cifre(long long a, int c)
{ int ap = 0; while(a) { if(a % 10 == c) ap++; a /= 10; } return ap;
}

bool e_permutare(long long a, long long b)
{ for(int c = 0; c <= 9; c++) { if(cate_cifre(a,c) != cate_cifre(b,c)) return false; } return true;
}@

@long long indicator_euler(long long n)
{ long long d = 2, e=n; while(n > 1) { if(n % d 0) { e = e * (d-1)/d; while(n % d 0) n = n / d; } else d++;

@long long divizori(long long n)
{ long long div = 1, d = 2; while(n > 1) { if(n % d 0) { // cautam exponentul lui d long long e = 0; while(n % d 0) n /= d, e++; div *= e+1; } else d++;

#include <fstream>
using namespace std;

ifstream cin(“qtsume.in”);
ofstream cout(“qtsume.out”);

long long s¹⁰⁰⁰⁰¹, q, a, b, n, x¹⁰⁰⁰⁰¹, s1¹⁰⁰⁰⁰¹;

int main(){ cin >> n; for(int i = 1; i <= n; i++) cin >> x[i]; s¹ = x¹; s1¹ = x¹; for(int i = 2; i <= n; i++){ s[i] = s[i – 1] + i * x[i]; s1[i]= s1[i – 1] + x[i]; } cin >> q; while(q—){ cin >> a >> b; long long s2 = s1[b] – s1[a – 1]; long long s3 = s[b] – s[a – 1]; cout << s3 – s2 * (a – 1) << ‘\n’; } return 0;
}