Cod sursa(job #1089230)
Utilizator | Data | 21 ianuarie 2014 16:32:14 | |
---|---|---|---|
Problema | Loto | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("aparitii.in");
ofstream g("aparitii.out");
int v[100001],n,k,t,i,j;
int main()
{f>>n>>k;
for(i=1;i<=n;i++){
f>>v[i];}
for(i=1;i<=n;i++){
if(v[i]!=0){
t=1;
for(j=i+1;j<=n;j++){
if(v[j]==v[i]){
t++;
v[j]=0;}}
if(t%k!=0){
g<<v[i];
break;}
v[i]=0;}}
return 0;
}