Posts

Showing posts from April, 2020

492A. Vanya and Cubes

#include <iostream> using namespace std ; int main () { int n ; int s = 0 ; int sum = 0 ; int cube = 0 ; cin >> n ; for ( int j = 1 ; j <= n ; j ++) { sum = sum + j ; s = sum + s ; if ( s > n ) break ; cube ++; } cout << cube ; }

749A. Bachgold Problem Solution

#include <iostream> using namespace std ; int main () { int n ; int q = 2 ; int c = 0 ; cin >> n ; if ( n % 2 == 0 ) { int p = n / 2 ; cout << p << endl ; for ( int i = 0 ; i < p ; i ++) cout << 2 << " " ; }   else {   q = n / 2 - 1 ; cout << q + 1 << endl ; for ( int j = 0 ; j < q ; j ++) cout << 2 << " " ;     } if ( n % 2 != 0 ) cout << 3 ;   return 0 ; }  

118A. String Task Solution

#include <iostream> #include < bits / stdc ++. h > using namespace std ; int main (){ int i ; char ch [ 100 ]; cin >> ch ;     int size = std :: strlen ( ch );   ////cout<<size<<endl;   for ( i = 0 ; i < size ; i ++) { if ( ch [ i ]== 'a' || ch [ i ]== 'e' || ch [ i ]== 'i' || ch [ i ]== 'o' || ch [ i ]== 'u' || ch [ i ]== 'y' || ch [ i ]== 'A' || ch [ i ]== 'E' || ch [ i ]== 'I' || ch [ i ]== 'O' || ch [ i ]== 'U' || ch [ i ]== 'Y' ) continue ; cout << "." ; if ( ch [ i ]>= 'A' && ch [ i ]<= 'Z' ) cout <<( char ) tolower ( ch [ i ]); else cout << ch [ i ];       }   return 0 ;   }

71A. Way Too Long Words

#include <iostream> #include <string> using namespace std ; int main () { int t ; string str ; int i , ln ; cin >> t ; for ( i = 0 ; i < t ; i ++) { cin >> str ; ln = str . length (); if ( ln > 10 ) { cout << str . at ( 0 )<< ln - 2 << str . at ( ln - 1 )<< endl ; } else cout << str << endl ; } return 0 ;

263A A Beautiful Matrix

#include<iostream> using namespace std; int main(){ int arr[5][5]; int j,i=0; int loc; for(i=0;i< 5;i++){  for(j=0;j<5;j++) cin>>arr[i][j];} for(i=0;i< 5;i++){  for(j=0;j<5;j++)  if(arr[i][j]==1) cout<<abs(2-i)+abs(2-j);  } }

1A. Theatre Square solution

#include <iostream> #include <cmath> using namespace std ;   int main () { long double a , n , m , temp ;   cout . precision ( 22 ); cin >> n >> m >> a ; if ( m < n ) { temp = m ; m = n ; n = temp ; }   if ( a >= m ) { cout << ceil ( n / a ) << endl ; } else { cout << ceil ( m / a )* ceil ( n / a ) << endl ; } return 0 ; }

4A Watermelon solution

#include <iostream> using namespace std ; int main () { int w ; cin >> w ; if ( w != 2 && w % 2 == 0 ) cout << "YES" << endl ; else cout << "NO" << endl ; return 0 ; }

703A. Mishka and Game Solution Codeoforces

#include <iostream> using namespace std ; int main () { int cm = 0 , cn = 0 ; int n = 0 , m = 0 , c = 0 ; int sum = 0 , sumM = 0 , sumN = 0 ; cin >> n ; ///round int i ; for ( i = 0 ; i < n ; i ++){ cin >> m >> c ;   if ( m == c ) continue ; if ( m > c ) cm ++; if ( m < c ) cn ++; } //cout<<cm<<" " <<cn; if ( cm == cn ) cout << "Friendship is magic!^^\n" ; if ( cm > cn ) cout << "Mishka\n" ; if ( cm < cn ) cout << "Chris\n" ; return 0 ; }

1097A. Gennady and a Card Game solution

#include <iostream> using namespace std ; int main () { string table ; string hand , s = "" ; int i ; bool yes = false ; cin >> table ; for ( int j = 0 ; j < 5 ; j ++) { cin >> hand ; if ( hand [ 0 ]== table [ 0 ] or hand [ 1 ]== table [ 1 ] or hand [ 1 ]== table [ 0 ] or hand [ 0 ]== table [ 1 ]) { yes = 1 ;   break ;}   } if ( yes == 1 ) cout << "YES" ; else cout << "NO" ; return 0 ; }

723A. The New Year: Meeting Friends Solution

#include <iostream> #include <algorithm> using namespace std ; int main () { int arr [ 3 ]; cin >> arr [ 0 ]>> arr [ 1 ]>> arr [ 2 ]; sort ( arr , arr + 3 ); cout << arr [ 1 ]- arr [ 0 ]+ abs ( arr [ 1 ]- arr [ 2 ]); }

509A Maximum in Table

#include <iostream> using namespace std ; int a , arr [ 10 ][ 10 ]; int main () { cin >> a ; for ( int i = 0 ; i < a ; i ++) { for ( int j = 0 ; j < a ; j ++) { if ( i == 0 ) { arr [ i ][ j ] = 1 ; } else if ( j == 0 ) { arr [ i ][ j ] = 1 ; } else { arr [ i ][ j ] = arr [ i - 1 ][ j ] + arr [ i ][ j - 1 ];   } } } cout << arr [ a - 1 ][ a - 1 ]; }

1343 A candies Solution

#include <iostream> using namespace std ; int main () { long n , k = 1 , x , i ; int t ; cin >> t ; while ( t --){ cin >> n ; for ( i = 0 ; i <= n ; i ++) { k = 1 + 2 * k ; if ( n % k == 0 ){ x = n / k ; cout << x << endl ; k = 1 ; break ;}     }   }   }

935 A. Fafa and his Company solution

#include <iostream> using namespace std ; int main () { int n ; cin >> n ; int ans = 0 , em = 0 , lr = 0 , i ; for ( i = 1 ; i < n ; i ++) { lr = i ; em = n - i ; if ( lr + em == n and em % lr == 0 ) ans ++; }   cout << ans ; return 0 ; }

490 A. Team Olympiad Solution

#include<iostream> using namespace std; int main() { int n; cin>>n; int arr[n]; int t1=0,t2=0,t3=0; int ans= 0; long p1[10000],p2[10000],p3[10000]; for(int j ;j<n;j++) cin>>arr[j]; int i; int a=0,b=0,c=0; for(i=0;i<n;i++) { if(arr[i]==1 ) {t1++; p1[a]=i;a++; } else if(arr[i]==2 ){ t2++; p2[b]=i;b++;} else if(arr[i]==3  ){ t3++; p3[c]=i; c++;} ans = min(t1,min(t2,t3)); } cout<<ans<<endl;; t1=0,t2=0,t3=0; int k=0; for(i=0;i<n;i++) { if(ans>=1) cout<<p1[i]+1<<" "<<p2[i]+1<<" " <<p3[i]+1<<" "<<endl;  k++; if(k==ans)break; } return 0; }