UVA 13108 Solution

- 
#include<cstdio>
#include<cmath>
using namespace std;

int main()
{
    int t,n;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d",&n);
        int ans=n*(n-1)/2+n*(n-1)*(n-2)*(n-3)/24+1;
        printf("%d\n",ans);
    }
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Codeforces 698A - Vacations

-
# include < cstdio > using namespace std ; int main ( ) { int n ; scanf ( " %d " , & n ) ; int a [ n ] ; for ( int i = 0 ; i < n ; i + + ) scanf ( " %d " , & a [ i ] ) ; int rest = 0 ; int p = 0 ; for ( int i = 0 ; i < n ; i + + ) { if ( a [ i ] = = 0 ) { rest + + ; p = 0 ; } else if ( ! p ) { p = a [ i ] ; } else if ( p = = 3 ) { p = a [ i ] ; } else if ( p = = 2 & & a [ i ] ! = 2 ) { p = 1 ; } else if ( p = = 2 & & a [ i ] = = 2 ) { p = 0 ; rest + + ; } else if ( p = = 1 & & a [ i ] ! = 1 ) { p = 2 ; } else if ( p = = 1 & & a [ i ] = = 1 ) { p = 0 ; rest + + ; } } p...
Read more

UVA 11364: Parking -Solution

-
# include < stdio.h > int main ( ) { int t , n , p , i , max , min , d ; scanf ( " %d " , & t ) ; while ( t - - ) { scanf ( " %d " , & n ) ; max = 0 ; min = 50000 ; for ( i = 0 ; i < n ; i + + ) { scanf ( " %d " , & p ) ; if ( max < p ) max = p ; if ( min > p ) min = p ; } d = ( max - min ) * 2 ; printf ( " %d \n " , d ) ; } return 0 ; }
Read more

UVA 10550 - Combination Lock : Solution

-
# include < stdio.h > int main ( ) { int i , a , b , c , deg , temp ; while ( scanf ( " %d %d %d %d " , & i , & a , & b , & c ) = = 4 ) { if ( i = = 0 & & a = = 0 & & b = = 0 & & c = = 0 ) break ; deg = 1080 ; temp = i - a ; if ( temp < 0 ) temp = temp + 40 ; deg + = temp * 9 ; temp = b - a ; if ( temp < 0 ) temp = temp + 40 ; deg + = temp * 9 ; temp = b - c ; if ( temp < 0 ) temp = temp + 40 ; deg + = temp * 9 ; printf ( " %d \n " , deg ) ; } return 0 ; }
Read more