fork download 
  1. #include <iostream>
  2. using namespace std;
  3. /*
  4. int pary(string s){ 
  5. 	int d=s.size(), ile=0; 
  6. 	for (int i=1; i<d; ++i){ 
  7. 		if (s[i]==s[i-1]) ile++; 
  8. 	} 
  9. 	return ile; 
  10. } 
  11. int main() { 
  12. 	string t; 
  13. 	cin >> t; 
  14. 	cout << pary(t); 
  15. 	return 0; 
  16. }
  17.  
  18. //Zadanie 2
  19. string ta(string s){ 
  20. 	int d=s.size(); 
  21. 	for (int i=0; i<d; ++i){ 
  22. 		if (s[i]=='C' or s[i]=='G' or s[i]=='T') s[i]='*'; 
  23. 	} 
  24. 	return s; 
  25. } 
  26. int main() { 
  27. 	string t; 
  28. 	cin >> t; 
  29. 	cout << ta(t); 
  30. 	return 0; 
  31. }
  32.  
  33. //Zadanie 3
  34. int hamming(string s, string t){ 
  35.  int d=s.size(), ile=0; 
  36.  for (int i=0; i<d; ++i){ 
  37.   if (s[i]!=t[i]) ile++; 
  38.  } 
  39.  return ile; 
  40. } 
  41. int main() { 
  42.  string t, s; 
  43.  cin >> t >> s; 
  44.  cout << hamming(s,t); 
  45.  return 0; 
  46. } 
  47.  
  48. //Zadanie 4
  49. int main(){
  50. 	string s;
  51. 	cin>>s;
  52. 	int d=s.size();
  53. 	for(int i; i<d; i+=2)
  54. 		cout<<s[i]<<"";
  55. 	return 0;
  56. }
  57. */
  58. //Zadanie 5
  59. int main() {
  60.     string kolor, najdluzszy;
  61.     for (int i = 0; i < 10; i++) {
  62.         cin >> kolor;
  63.         if (kolor.size() >= najdluzszy.size())
  64.             najdluzszy = kolor;
  65.     }
  66. 	cout << najdluzszy;
  67.     return 0;
  68. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin 
TTAT
stdout 
TTAT
https://ideone.com/xksWw5
language:
C++ (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!