Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
ახარისხება~ფინალური
#include <iostream> #include <bits/stdc++.h> #include <algorithm> #include <stdio.h> #include <stdlib.h> #include <fstream> #include <stack> #include <vector> #include <math.h> #include <cmath> using namespace std; int main() { int s,n,b; cin >> s; int numbers[s]; for (int i=0;i<s; ++i){ cin >> n>> b; numbers[i]=pow(n,b); } sort(numbers,numbers+s); for(int i=0;i<s;++i){ cout<<numbers[i]<<endl; } }
run
|
edit
|
history
|
help
0
kickstartd
Complex Number Class
Kth smallest element
Second program
Samosa
Menu Combination Sum
break.cpp
Random Vector Generator
lab17feb22x4B.cpp
map::swap()_30-Seconds-of-C++