Pagini recente » Istoria paginii runda/preoji2016sim | Cod sursa (job #3169035) | Cod sursa (job #1687706) | Cod sursa (job #2871737) | Cod sursa (job #630446)
Cod sursa(job #630446)
Utilizator |
Ionut Bogdanescu swift90 |
Data |
5 noiembrie 2011 16:18:09 |
Problema |
Tm |
Scor |
Ascuns |
Compilator |
cpp |
Status |
done |
Runda |
|
Marime |
0.58 kb |
#include<cstdio>
using namespace std;
int N;
char S[1010];
void solve(){
int a,b,c,i;
a=b=c=0;
for(N=0;'a'<=S[N] && S[N]<='c';)
++N;
for(i=0;S[i]=='a';++i)
++a;
for(;S[i]=='b';++i)
++b;
for(;S[i]=='c';++i)
++c;
if(i<N){
printf("NU\n");
return;
}
if(a==b || b==c){
printf("DA\n");
return;
}
printf("NU\n");
}
int main(){
freopen("tm.in","r",stdin);
freopen("tm.out","w",stdout);
int T;
scanf("%d",&T);
fgets(S,10,stdin);
for(;T;--T){
fgets(S,1010,stdin);
solve();
}
fclose(stdin);
fclose(stdout);
return 0;
}