eolymp
bolt
Try our new interface for solving problems
published at 2/12/24, 7:55:24 pm

include <iostream>

include <cmath>

include <algorithm>

include <string>

include <vector>

include <set>

using namespace std;

define ll long long

define pb push_back

define in insert

define sorts sort(s.begin(), s.end())

define sortv sort(v.begin(), v.end())

define forin for(int i=0; i<n; i++)

define forjm for(int j=0; j<m; j++)

define fors for(int i=0; i<s.size(); i++)

define forv for(int i=0; i<v.size(); i++)

define forset for(auto i=s.begin(); i!=s.end(); i++)

define b() "begin()"

define e() "end()"

int main() { ll n; cin>>n; for(int i=0; i<n; i++) { cout<<"#"; } }

//This Code Is Made By ZeydReshaddanPro

published at 2/18/24, 3:57:42 pm

include <iostream>

include <cmath>

using namespace std; int main () { int a, b, c , n, a1, a2, a3, a4; cin >> a;

for(int i;i<a;i++) { cout<<"#";

}

return 0;

} //made by TheBestOne

published at 2/18/24, 3:57:43 pm

include <iostream>

include <cmath>

using namespace std; int main () { int a, b, c , n, a1, a2, a3, a4; cin >> a;

for(int i;i<a;i++) { cout<<"#";

}

return 0;

} //made by TheBestOne

published at 2/18/24, 3:58:00 pm

ZEYD NOOOOBUMDU //made by TheBestOne

published at 2/18/24, 3:58:00 pm

ZEYD NOOOOBUMDU //made by TheBestOne