1339A - Filling Diamonds - CodeForces Solution


brute force dp implementation math *900

Please click on ads to support us..

Python Code:

t = int(input())
for _ in range(t):
    n = int(input())
    print(n)

C++ Code:

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;
#define ll long long int
#define forn for (int i = 0; i < n; i++)
#define form for (int i = 0; i < m; i++)

void solve()
{
    ll n;
    cin >> n;
    cout << n << endl;
}

int main()
{
    int tc;
    cin >> tc;
    while (tc--)
    {
        solve();
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

1189A - Keanu Reeves
678A - Johny Likes Numbers
1699C - The Third Problem
1697D - Guess The String
754B - Ilya and tic-tac-toe game
760A - Petr and a calendar
1573A - Countdown
166A - Rank List
1631B - Fun with Even Subarrays
727A - Transformation from A to B
822B - Crossword solving
1623A - Robot Cleaner
884B - Japanese Crosswords Strike Back
862B - Mahmoud and Ehab and the bipartiteness
429A - Xor-tree
1675C - Detective Task
950A - Left-handers Right-handers and Ambidexters
672B - Different is Good
1C - Ancient Berland Circus
721A - One-dimensional Japanese Crossword
1715B - Beautiful Array
60B - Serial Time
453A - Little Pony and Expected Maximum
1715A - Crossmarket
1715C - Monoblock
1512C - A-B Palindrome
1679B - Stone Age Problem
402A - Nuts
792A - New Bus Route
221A - Little Elephant and Function