Cod sursa(job #91088)
| Utilizator | Data | 11 octombrie 2007 16:33:38 | |
|---|---|---|---|
| Problema | Energii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
/*
MioRiTA
*/
#define N_MAX 100
#include <iostream>
using namespace std;
char v[N_MAX],ch,b[N_MAX];
int k;
void main()
{
while((ch = cin.get()) != '\n')
{
if(ch >= 'a' && ch <= 'z')
b[++k] = ch - ('a' - 'A'); //lower to upper
else
if(ch >= 'A' && ch <= 'Z')
b[++k] = ch + ('a' - 'A');
}
for(int i = 1; i <= k; ++i)
cout << b[i] ;
cout << endl;
}
