GitHub - hunterx99/CodeForces: CodeForces Algorithms

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2,974 Commits
Sorry, we had to truncate this directory to 1,000 files. 3 entries were omitted from the list.
001-099		001-099
100-199		100-199
200-299		200-299
300-399		300-399
400-499		400-499
500-599		500-599
600-699		600-699
700-799		700-799
800-899		800-899
CodeforcesEDU		CodeforcesEDU
.gitignore		.gitignore
1000A-CodehorsesTshirts.cpp		1000A-CodehorsesTshirts.cpp
1000B-LightItUp.cpp		1000B-LightItUp.cpp
1000C-CoveredPointsCount.cpp		1000C-CoveredPointsCount.cpp
1003A-PolycarpsPockets.cpp		1003A-PolycarpsPockets.cpp
1003B-BinaryStringConstructing.cpp		1003B-BinaryStringConstructing.cpp
1003C-IntenseHeat.cpp		1003C-IntenseHeat.cpp
1003D-CoinsAndQueries.cpp		1003D-CoinsAndQueries.cpp
1004A-SonyaAndHotels.cpp		1004A-SonyaAndHotels.cpp
1004B-SonyaAndExhibition.cpp		1004B-SonyaAndExhibition.cpp
1004C-SonyaAndRobots.cpp		1004C-SonyaAndRobots.cpp
1005A-TanyaAndStairways.cpp		1005A-TanyaAndStairways.cpp
1005B-DeleteFromTheLeft.cpp		1005B-DeleteFromTheLeft.cpp
1005C-SummarizeToThePowerOfTwo.cpp		1005C-SummarizeToThePowerOfTwo.cpp
1005D-PolycarpAndDiv3.cpp		1005D-PolycarpAndDiv3.cpp
1006A-AdjacentReplacements.cpp		1006A-AdjacentReplacements.cpp
1006B-PolycarpsPractice.cpp		1006B-PolycarpsPractice.cpp
1006C-ThreePartsOfTheArray.cpp		1006C-ThreePartsOfTheArray.cpp
1006E-MilitaryProblem-OLD.cpp		1006E-MilitaryProblem-OLD.cpp
1006E-MilitaryProblem.cpp		1006E-MilitaryProblem.cpp
1007A-ReorderTheArray.cpp		1007A-ReorderTheArray.cpp
1008A-Romaji.cpp		1008A-Romaji.cpp
1008B-TurnTheRectangles.cpp		1008B-TurnTheRectangles.cpp
1009A-GameShopping.cpp		1009A-GameShopping.cpp
1009B-MinimumTernaryString.cpp		1009B-MinimumTernaryString.cpp
1009D-RelativelyPrimeGraph.cpp		1009D-RelativelyPrimeGraph.cpp
1010A-Fly.cpp		1010A-Fly.cpp
1011A-Stages.cpp		1011A-Stages.cpp
1011B-PlanningTheExpedition.cpp		1011B-PlanningTheExpedition.cpp
1013A-PilesWithStones.cpp		1013A-PilesWithStones.cpp
1013B-And.cpp		1013B-And.cpp
1015A-PointsInSegments.cpp		1015A-PointsInSegments.cpp
1015B-ObtainingTheString.cpp		1015B-ObtainingTheString.cpp
1015C-SongsCompression.cpp		1015C-SongsCompression.cpp
1015D-WalkingBetweenHouses.cpp		1015D-WalkingBetweenHouses.cpp
1016A-DeathNote.cpp		1016A-DeathNote.cpp
1016B-SegmentOccurences.cpp		1016B-SegmentOccurences.cpp
1017A-TheRank.cpp		1017A-TheRank.cpp
1017B-TheBits.cpp		1017B-TheBits.cpp
1017C-ThePhoneNumber.cpp		1017C-ThePhoneNumber.cpp
1020A-NewBuildingForSIS.cpp		1020A-NewBuildingForSIS.cpp
1020B-Badge.cpp		1020B-Badge.cpp
1023A-SingleWildcardPatternMatching.cpp		1023A-SingleWildcardPatternMatching.cpp
1023B-PairOfToys.cpp		1023B-PairOfToys.cpp
1023C-BracketSubsequence.cpp		1023C-BracketSubsequence.cpp
1025A-DoggoRecoloring.cpp		1025A-DoggoRecoloring.cpp
1025B-WeakenedCommonDivisor.cpp		1025B-WeakenedCommonDivisor.cpp
1027A-PalindromicTwist.cpp		1027A-PalindromicTwist.cpp
1027B-NumbersOnTheChessboard.cpp		1027B-NumbersOnTheChessboard.cpp
1027C-MinimumValueRectangle.cpp		1027C-MinimumValueRectangle.cpp
1027D-MouseHunt.cpp		1027D-MouseHunt.cpp
1028A-FindSquare.cpp		1028A-FindSquare.cpp
1028B-UnnaturalConditions.cpp		1028B-UnnaturalConditions.cpp
1029A-ManyEqualSubstrings.cpp		1029A-ManyEqualSubstrings.cpp
1029B-CreatingTheContest.cpp		1029B-CreatingTheContest.cpp
1030A-InSearchOfAnEasyProblem.cpp		1030A-InSearchOfAnEasyProblem.cpp
1030B-VasyaAndCornfield.cpp		1030B-VasyaAndCornfield.cpp
1030C-VasyaAndGoldenTicket.cpp		1030C-VasyaAndGoldenTicket.cpp
1030D-VasyaAndTriangle.cpp		1030D-VasyaAndTriangle.cpp
1031A-GoldenPlate.cpp		1031A-GoldenPlate.cpp
1031B-CuriosityHasNoLimits.cpp		1031B-CuriosityHasNoLimits.cpp
1032A-KitchenUtensils.cpp		1032A-KitchenUtensils.cpp
1032B-PersonalizedCup.cpp		1032B-PersonalizedCup.cpp
1033A-KingEscape.cpp		1033A-KingEscape.cpp
1033B-SquareDifference.cpp		1033B-SquareDifference.cpp
1036A-FunctionHeight.cpp		1036A-FunctionHeight.cpp
1036D-VasyaAndArrays.cpp		1036D-VasyaAndArrays.cpp
1037A-Packets.cpp		1037A-Packets.cpp
1037B-ReachMedian.cpp		1037B-ReachMedian.cpp
1037C-Equalize.cpp		1037C-Equalize.cpp
1038A-Equality.cpp		1038A-Equality.cpp
1038B-NonCoprimePartition.cpp		1038B-NonCoprimePartition.cpp
1038C-Gambling.cpp		1038C-Gambling.cpp
1040A-PalindromeDance.cpp		1040A-PalindromeDance.cpp
1040B-ShashlikCooking.cpp		1040B-ShashlikCooking.cpp
1041A-Heist.cpp		1041A-Heist.cpp
1041B-BuyingATVSet.cpp		1041B-BuyingATVSet.cpp
1042A-Benches.cpp		1042A-Benches.cpp
1042B-Vitamins.cpp		1042B-Vitamins.cpp
1043A-Elections.cpp		1043A-Elections.cpp
1043B-LostArray.cpp		1043B-LostArray.cpp
1043C-SmallestWord.cpp		1043C-SmallestWord.cpp
1046C-SpaceFormula.cpp		1046C-SpaceFormula.cpp
1046F-SplittingMoney.cpp		1046F-SplittingMoney.cpp
1047A-LittleCLoves3I.cpp		1047A-LittleCLoves3I.cpp
1047B-CoverPoints.cpp		1047B-CoverPoints.cpp
1051A-VasyaAndPassword.cpp		1051A-VasyaAndPassword.cpp
1051B-RelativelyPrimePairs.cpp		1051B-RelativelyPrimePairs.cpp
1051C-VasyaAndMultisets.cpp		1051C-VasyaAndMultisets.cpp
1054A-ElevatorOrStairs.cpp		1054A-ElevatorOrStairs.cpp

Repository files navigation

#include <cstdio>

int main(){

    long n; scanf("%ld", &n);
    for(long p = 0; p < n; p++){long x; scanf("%ld", &x); printf("%ld ", (n + 1 - x));}
    puts("");

    return 0;
}