Cod sursa(job #466230)
| Utilizator | Data | 26 iunie 2010 12:22:54 | |
|---|---|---|---|
| Problema | Permutari2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Stelele Informaticii 2010, gimnaziu si clasa a IX-a, Ziua 2 | Marime | 0.54 kb |
#include<stdio.h>
int main(){
freopen ("permutari2.in", "r", stdin);
freopen ("permutari2.out", "w", stdout);
int k, n;
scanf("%d %d ", &n, &k);
printf("531");
return 0;
}
/*for(j=1; j<n; j++){
scanf("%d %d ", &u[j].a, &u[j].b);
e[u[j].a]++; e[u[j].b]++;
}
for(j=1; j<n; j++){
if(e[j]>=max){
max=e[j];
}
}*/
/*if(max==n-1){
perm(1);
}
else{
m=n;
n=max+1;
perm(1);
for(j=1; j<=n; j++){
if(e[j]!=max && e[j]>1){
p*=e[j];
}
}
}
printf("%d ", p);
return 0;
}*/