Codeforces solution 734A Anton and Danik
Posts
Uva solution 12626 I ā¤ Pizza
#include<bits/stdc++.h> using namespace std; int main() { int n,c1=0,c2=0,c3=0,c4=0,c5=0,c6=0,c=0,d; char ch[1000]; cin>>n; cin.ignore(); for(int j=1; j<=n; j++) { cin.getline(ch,1000); c=0,c1=0,c2=0,c3=0,c4=0,c5=0,c6=0,d=0; d=strlen(ch); for(int i=0; i<d; i++) { if(ch[i]=='M') { c1++; } else if(ch[i]=='A') { c2++; } else if(...
Uva solution 10696 f91
#include<bits/stdc++.h> using namespace std; int f91(int n) { int d; if(n<=100) { return f91(f91(n + 11)); } else if(n>=101) { return n-10; } } int main() { int n,m; while(1) { cin>>n; if(n==0) { return 0; } m=f91(n); cout<<"f91("<<n<<") = "<<m<<endl; } return 0; }
Uva solution 10323 Factorial! You Must be Kidding!!!
#include<stdio.h> long long int f(long long int n) { if(n==0) { return 1; } else { return n*f(n-1); } } int main() { long long int M,N,a,b,sum; while(scanf("%lld",&M)!=EOF) { sum=0; a=f(M); sum=a; if(sum > 6227020800) { printf("Overflow! %d\n",sum); } if(sum < 10000) { printf("Underflow! %d\n",sum); } else { printf("%lld\n",sum);...
Codeforces solution 281A Word Capitalization
#include < bits / stdc ++. h > using namespace std ; int main () { int d , c = 0 , n ; char ch [ 1000 ]; cin . getline ( ch , 1000 ); d = strlen ( ch ); for ( int i = 0 ; i < 1 ; i ++) { if ( ch [ 0 ]>= 97 && ch [ 0 ]<= 122 ) { n = ch [ 0 ]- 32 ; printf ( "%c" , n ); break ; } else { cout << ch [ 0 ]; break ; } } for ( int i = 1 ; i < d ; i ++) { cout << ch [ i ]; } cout << endl ; return 0 ; }
Codeforces solution 118A String Task
#include < bits / stdc ++. h > using namespace std ; int main () { int d ; char ch [ 1000 ]; cin . getline ( ch , 1000 ); d = strlen ( ch ); for ( int i = 0 ; i < d ; i ++) { if ( ch [ i ]!= 'a' && ch [ i ]!= 'y' && ch [ i ]!= 'e' && ch [ i ]!= 'i' && ch [ i ]!= 'o' && ch [ i ]!= 'u' && ch [ i ]!= 'A' && ch [ i ]!= 'E' && ch [ i ]!= 'I' && ch [ i ]!= 'Y' && ch [ i ]!= 'O' && ch [ i ]!= 'U' ) { if ( ch [ i ]>= 'A' && ch [ i ]<= 'Z' ) { ch [ i ]= ch [ i ]+ 32 ; } cout << "." << ch [ i ]; } } cout << endl ; return 0 ; }
Codeforces solution 133A HQ9+
#include < bits / stdc ++. h > using namespace std ; int main () { int d ; char ch [ 150 ]; cin . getline ( ch , 150 ); d = strlen ( ch ); for ( int i = 0 ; i < d ; i ++) { if ( ch [ i ]== 'H' ) { cout << "YES" << endl ; return 0 ; } if ( ch [ i ]== 'Q' ) { cout << "YES" << endl ; return 0 ; } if ( ch [ i ]== '9' ) { cout << "YES" << endl ; return 0 ; } } cout << "NO" << endl ; return 0 ; }
Codeforces slution 282A Bit++
#include < bits / stdc ++. h > using namespace std ; int main () { string x ; int n , c = 0 ; cin >> n ; for ( int i = 1 ; i <= n ; i ++) { cin >> x ; if ( x == "X++" ) { c ++; } else if ( x == "++X" ) { c ++; } else if ( x == "X--" ) { c --; } else if ( x == "--X" ) { c --; } } cout << c << endl ; return 0 ; }
Codeforces solution 236A Boy or Girl
#include < bits / stdc ++. h > using namespace std ; int main () { set < int > s ; int d , c = 0 , n ; char ch [ 1000 ]; cin . getline ( ch , 1000 ); d = strlen ( ch ); for ( int i = 0 ; i < d ; i ++) { s . insert ( ch [ i ]); } d = s . size (); if ( d % 2 == 0 ) cout << "CHAT WITH HER!" << endl ; else cout << "IGNORE HIM!" << endl ; return 0 ;
Codeforces solution 486A Calculating Function
#include < bits / stdc ++. h > using namespace std ; int main () { long long int n , d , e ; cin >> n ; if ( n % 2 == 0 ) { cout << n / 2 << endl ; } else { d = n / 2 ; e =( d + 1 )*(- 1 ); cout << e << endl ; } return 0 ; }
Codeforces solution 705A Hulk
#include < bits / stdc ++. h > using namespace std ; int main () { int n , d , c = 0 , e ; cin >> n ; if ( n % 2 == 0 ) { d = n / 2 ; for ( int i = 1 ; i < n ; i ++) { cout << "I hate that" << " " ; c ++; if ( c == d ) { break ; } cout << "I love that" << " " ; } cout << "I love it" << endl ; } else { e = n / 2 ; for ( int i = 1 ; i <= e ; i ++) { cout << "I hate that" << " " ; cout << "I love that" << " " ; } cout << "I hate it" << endl ; } return 0 ; }
Codeforces solution 110A Nearly Lucky Number
#include < bits / stdc ++. h > using namespace std ; int main () { long long int i , n , r = 0 , c = 0 , c1 = 0 , reverse = 0 , num ; cin >> num ; while ( num > 0 ) { r =( num % 10 ); reverse = ( reverse * 10 )+ r ; num /= 10 ; if ( r == 7 || r == 4 ) { c1 ++; //cout<<c1<<endl; } } //cout<<reverse<<endl; if ( c1 == 7 || c1 == 4 || c1 == 47 || c1 == 744 ) { cout << "YES" << endl ; } else { cout << "NO" << endl ; } return 0 ; }
Codeforces solution 469A I Wanna Be the Guy
#include < bits / stdc ++. h > using namespace std ; int main () { set <int> myset ; int i , j , x , y , lvl ; cin >> lvl ; for ( j = 1 ; j <= 2 ; j ++) { cin >> x ; for ( i = 1 ; i <= x ; i ++) { cin >> y ; myset . insert ( y ); } } if ( myset . size ()== lvl ) cout << "I become the guy." << endl ; else cout << "Oh, my keyboard!" << endl ; return 0 ; }
Codeforces solution 785A Anton and Polyhedrons
#include < bits / stdc ++. h > using namespace std ; int main () { int n , c = 0 ; string name ; cin >> n ; for ( int i = 1 ; i <= n ; i ++) { cin >> name ; if ( name == "Tetrahedron" ) { c += 4 ; } else if ( name == "Cube" ) { c += 6 ; } else if ( name == "Octahedron" ) { c += 8 ; } else if ( name == "Dodecahedron" ) { c += 12 ; } else if ( name == "Icosahedron" ) { c += 20 ; } } cout << c << endl ; return 0 ; }
Codeforces solution 977A Wrong Subtraction
#include <stdio.h> int main () { int n , x , i , last ; scanf ( "%d %d" ,& n ,& x ); for ( i = 1 ; i <= x ; i ++) { last = n % 10 ; if ( last != 0 ) { n = n - 1 ; } else { n = n / 10 ; } } printf ( "%d\n" , n ); return 0 ; }
Codeforces solution 630A Again Twenty Five!
#include < bits / stdc ++. h > using namespace std ; int main () { long long int n ; cin >> n ; cout << 25 << endl ; return 0 ; }
Codeforces solution 71A Way Too Long Words
#include <stdio.h> #include <string.h> int main () { int d , n , i ; char ch [ 101 ]; scanf ( "%d" ,& n ); gets ( ch ); for ( i = 1 ; i <= n ; i ++) { gets ( ch ); d = strlen ( ch ); if ( d > 10 ) { printf ( "%c" , ch [ 0 ]); printf ( "%d" , d - 2 ); printf ( "%c\n" , ch [ d - 1 ]); } else { puts ( ch ); } } return 0 ; }
Codeforces solution 122A Lucky Division
#include <stdio.h> int main () { int n , k = 0 , num , r = 0 ; scanf ( "%d" ,& num ); n = num ; while ( n != 0 ) { r = n % 10 ; n = n / 10 ; //printf("%d\n",r); if ( r != 4 && r != 7 ) { if ( num % 4 == 0 || num % 7 == 0 || num % 47 == 0 || num % 74 == 0 ) { printf ( "YES\n" ); } else { printf ( "NO\n" ); } k = 1 ; break ; } } if ( k == 0 ) { printf ( "YES\n" ); } return 0 ; }