509A - Maximum in Table - CodeForces Solution


brute force implementation *800

Please click on ads to support us..

Python Code:

a = input()
dic = {'1':1,'2':2,'3':6,'4':20,'5':70,'6':252,'7':924,'8':3432,'9':12870,'10':48620}
print(dic[a])

C++ Code:

#include<bits/stdc++.h> 
#define endl "\n" 
#define Om25r cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); 
using namespace std; 
typedef long long ll;



int main()
{
	Om25r
	int n; cin>>n;
    int arr[n][n];
    
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            arr[i][j]=1;
        }
    }


    for(int i=1; i<n; i++){
        for(int j=1; j<n; j++){
            arr[i][j] = arr[i-1][j] + arr[i][j-1];
        }
    }

    cout<<arr[n-1][n-1]<<endl;
	return 0;
}


Comments

Submit
0 Comments
More Questions

1711A - Perfect Permutation
1701B - Permutation
1692A - Marathon
1066A - Vova and Train
169B - Replacing Digits
171D - Broken checker
380C - Sereja and Brackets
1281B - Azamon Web Services
1702A - Round Down the Price
1681C - Double Sort
12A - Super Agent
1709A - Three Doors
1680C - Binary String
1684B - Z mod X = C
1003A - Polycarp's Pockets
1691B - Shoe Shuffling
1706A - Another String Minimization Problem
1695B - Circle Game
1702B - Polycarp Writes a String from Memory
1701A - Grass Field
489C - Given Length and Sum of Digits
886B - Vlad and Cafes
915A - Garden
356A - Knight Tournament
1330A - Dreamoon and Ranking Collection
1692B - All Distinct
1156C - Match Points
1675A - Food for Animals
1328C - Ternary XOR
1689A - Lex String