Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- I.
- 1.b
- 2.c
- 3.a
- 4.c
- 5.d
- II.
- 1.a.110
- b.119,2 ; 3 118
- c.
- #include <bits/stdc++.h>
- using namespace std;
- int main()
- {
- int a,b,n,x;
- cin>>a>>b;
- x=0;
- do
- {x=x*10+a%10+b%10;
- a/=10;
- b/=10;}while(a!=0||b!=0);
- n=0;
- do
- {n=n*10+x/10%10;
- x/=100;}while(x!=0);
- cout<<n;
- return 0;
- }
- d.
- 2.
- int ok=0;
- for(i=1;i<=30;i++)
- cin>>x[i].nr_mat>>x[i].data.zi>>x[i].data.luna>>x[i].data.an;
- for(i=30;i>=1;i--)
- if(x[i].data.an%2==0)
- {cout<<i;
- ok=1;}
- if(ok==0)
- cout<<"nu exista";
- 3.
- for(i=1;i<=7;i++)
- for(j=1;j<=7;j++)
- if(i==j || i+j==n+1)
- a[i][j]="!";
- else
- if(i<j && i+j<n+1)||(j>i && i+j>n+1)
- a[i][j]="#"
- else
- a[i][j]="?"
- III.
- 1.
- int v[1001];
- void radical(int n,int k,int &a,int &b)
- {int d=2,maxi=0,p,i;
- a=1;
- b=1;
- while(n>1)
- {p=0;
- while(n%d==0)
- {n=n/d;
- p++;}
- maxi=max(d,maxi);
- v[d]=p;
- d++;
- if(n>1 && d*d>n)
- d=n;
- }
- for(i=1;i<=maxi;i++)
- {while(v[i]>=k)
- {a=a*i;
- v[i]=v[i]-k;}
- while(v[i])
- {b=b*i;
- v[i]--;}
- }
- }
- 2.
- #include <bits/stdc++.h>
- using namespace std;
- int main()
- {char s[200];
- int i,j,c1,c2,cc,cv,ok=0;
- cin.getline(s,201);
- for(i=0;i<=strlen(s);i++)
- {
- if(s[i]>='a' && s[i]<='z' && ok==0)
- {ok=1;
- c1=i;
- if(strchr("aeiou",s[i])!=0)
- cv++;
- else
- cc++;}
- else
- if(s[i]>='a' && s[i]<='z' && ok==1)
- {c2=i;
- if(ok==1)
- if(strchr("aeiou",s[i])!=0)
- cv++;
- else
- cc++;}
- else
- if(s[i]==' ')
- {ok=0;
- if(cc==cv)
- for(j=c1;j<=c2;j++)
- s[j]=(char)'z'-s[j]+'a';
- cv=0;
- cc=0;}
- }
- cout<<s;
- return 0;
- }
- 3.
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("cifre.in");
- int ap[11];
- int main()
- {int n,cn,r=0,cc,cv,i,c=0;
- fin>>n;
- cn=n;
- while(cn)
- {ap[cn%10]++;
- cn/=10;}
- for(i=0;i<=9;i++)
- if(ap[i]%2==1)
- {c++;
- cv=i;}
- if(c>1)
- cout<<"IMPOSIBIL";
- else
- {for(i=9;i>=0;i--)
- {cc=ap[i]/2;
- while(cc)
- {r=r*10+i;
- cc--;
- }}
- r=r*10+cv;
- for(i=9;i>=0;i--)
- {cc=ap[i]/2;
- while(cc)
- {r=r*10+i;
- cc--;
- }}
- cout<<r;}
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement