Cod sursa(job #350387)
| Utilizator | Data | 23 septembrie 2009 19:03:42 | |
|---|---|---|---|
| Problema | Tricouri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | info.conc.sept.2 | Marime | 0.37 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
#define MAX_N 300010
int n, k, p, t, l, x;
int p[32][32], ind[32][5];
void prec
int main() {
freopen("tricouri.in", "r", stdin);
freopen("tricouri.out", "w", stdout);
scanf("%d %d", &n, &t);
for (int i = 1; i <= n; i++)
scanf("%d", &x);
prec();
while (t--) {
scanf("%d %d", &k, &p);
}
return 0;
}
