#include <iostream>
using namespace std;
int main (){
int n,j,i;
cin >> n;
for(i=1;i<=n;i++){
for(j=1;j<=n-i;j++){
cout <<" ";
}
cout << "/";
for(j=1;j<=2*(i-1);j++){
cout << "_";
}
cout << "\\" << endl;
}
}
#include<iostream>
using namespace std;
#define MAX 100000
int main()
{
int n,c = 0,s,j;
int sum[MAX] = { 1,1 };
cin >> n;
for (int i = 1; i <= n; i++) {
for (j = 1; j < MAX; j++) {
s = sum[j] * i + c;
sum[j] = s % 10;
c = s / 10;
}
}
for (j = MAX-1; j > 0; j--) {
if (sum[j])
break;
}
sum[0] = j;
while (j) {
cout << sum[j--];
}
cout << endl;
return 0;
}
#include <iostream>
#include<cmath>
using namespace std;
int main()
{
int a,n=0;
cin>>a;
for(int i=1;i<=sqrt(a);i++){
if(!(a%i)) n=a/i;
}
cout << n << endl;
return 0;
}
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int time(char a){
int times;
switch(a){
case 'a':
case 'd':
case 'g':
case 'j':
case 'm':
case 'p':
case 't':
case 'w':
case ' ':
times = 1;break;
case 'b':
case 'e':
case 'h':
case 'k':
case 'n':
case 'q':
case 'u':
case 'x':
times = 2;break;
case 'c':
case 'f':
case 'i':
case 'l':
case 'o':
case 'r':
case 'v':
case 'y':
times = 3;break;
case 's':
case 'z':
times =4;break;
}
return times;
}
int main(){
char a[1000];
gets(a);
int length,ans=0;
length = strlen(a);
for(int i=0;i<length;i++){
ans+=time(a[i]);
}
cout << ans << endl;
return 0;
}
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
string a[300];
bool cmp(string s1,string s2){
int l1=s1.size();
int l2=s2.size();
if(l1<l2)
return 1;
if(l1==l2&&s1<s2)
return 1;
return 0;
}
main()
{
int n,i;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+n+1,cmp);
for(i=1;i<=n;i++)
cout << a[i] << endl;
}
#include <cstdio>
char a[1000];
using namespace std;
int main()
{
gets(a);
puts(a);
}
#include <iostream>
#include <cstring>
using namespace std;
char a[1000];
int main(){
while(cin>>a)
cout << strlen(a) << endl;
}
using namespace std;
int main (){
int n,j,i;
cin >> n;
for(i=1;i<=n;i++){
for(j=1;j<=n-i;j++){
cout <<" ";
}
cout << "/";
for(j=1;j<=2*(i-1);j++){
cout << "_";
}
cout << "\\" << endl;
}
}
#include<iostream>
using namespace std;
#define MAX 100000
int main()
{
int n,c = 0,s,j;
int sum[MAX] = { 1,1 };
cin >> n;
for (int i = 1; i <= n; i++) {
for (j = 1; j < MAX; j++) {
s = sum[j] * i + c;
sum[j] = s % 10;
c = s / 10;
}
}
for (j = MAX-1; j > 0; j--) {
if (sum[j])
break;
}
sum[0] = j;
while (j) {
cout << sum[j--];
}
cout << endl;
return 0;
}
#include <iostream>
#include<cmath>
using namespace std;
int main()
{
int a,n=0;
cin>>a;
for(int i=1;i<=sqrt(a);i++){
if(!(a%i)) n=a/i;
}
cout << n << endl;
return 0;
}
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int time(char a){
int times;
switch(a){
case 'a':
case 'd':
case 'g':
case 'j':
case 'm':
case 'p':
case 't':
case 'w':
case ' ':
times = 1;break;
case 'b':
case 'e':
case 'h':
case 'k':
case 'n':
case 'q':
case 'u':
case 'x':
times = 2;break;
case 'c':
case 'f':
case 'i':
case 'l':
case 'o':
case 'r':
case 'v':
case 'y':
times = 3;break;
case 's':
case 'z':
times =4;break;
}
return times;
}
int main(){
char a[1000];
gets(a);
int length,ans=0;
length = strlen(a);
for(int i=0;i<length;i++){
ans+=time(a[i]);
}
cout << ans << endl;
return 0;
}
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
string a[300];
bool cmp(string s1,string s2){
int l1=s1.size();
int l2=s2.size();
if(l1<l2)
return 1;
if(l1==l2&&s1<s2)
return 1;
return 0;
}
main()
{
int n,i;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+n+1,cmp);
for(i=1;i<=n;i++)
cout << a[i] << endl;
}
#include <cstdio>
char a[1000];
using namespace std;
int main()
{
gets(a);
puts(a);
}
#include <iostream>
#include <cstring>
using namespace std;
char a[1000];
int main(){
while(cin>>a)
cout << strlen(a) << endl;
}