Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- I.
- 1.c
- 2.a
- 3.b
- 4.d
- 5.c
- II.
- 1.
- a. 15
- b. 10000 18888
- c.
- #include <bits/stdc++.h>
- using namespace std;
- int main()
- {int n,k,p,c;
- cin>>n>>k;
- p=1;
- while(n)
- {c=n%10;
- if(k>0)
- if(c%2==1)
- p=p*c;
- n/=10;
- k--;
- }
- cout<<p;
- }
- d.
- 2.
- struct{int gramaj;
- strct{int zi;
- int luna;
- int an;
- }datae;
- }c;
- 3.
- 9sntTEA
- III.
- 1.
- int divizor(int n)
- {int i,nr=1;
- for(i=2;i*i<=n;i++)
- if(n%i==0)
- {nr++;
- if(i*i<n)
- nr++;}
- return nr;
- }
- 2.
- #include <bits/stdc++.h>
- using namespace std;
- int main()
- {int a[101][101],i,j,n,m,maxi;
- cin>>m>>n;
- for(i=1;i<=m;i++)
- {maxi=-1;
- for(j=1;j<=n;j++)
- {cin>>a[i][j];
- if(a[i][j]<21 && maxi<a[i][j])
- maxi=a[i][j];
- }
- if(maxi==-1)
- cout<<"nu exista"<<"\n";
- else
- cout<<maxi<<"\n";}
- return 0;
- }
- 3.
- #include <bits/stdc++.h>
- using namespace std;
- ifstream vin("bac1.txt");
- ifstream gin("bac2.txt");
- int main()
- {int n,m,c1,c2,i,j;
- vin>>n;
- gin>>m;
- vin>>c1;
- gin>>c2;
- i=1;
- j=1;
- while(i<=n && j<=m)
- {if(c1<c2)
- {i++;
- if(c1%5==0)
- cout<<c1<<" ";
- vin>>c1;
- }
- else
- if(c1==c2)
- {i++;
- j++;
- vin>>c1;
- gin>>c2;}
- else
- if(c1>c2)
- {j++;
- if(c2%5==0)
- cout<<c2<<" ";
- gin>>c2;
- }
- }
- if(i<=n)
- for(int k=i;k<=n;k++)
- {vin>>c1;
- if(c1%5==0)
- cout<<c1<<" ";}
- else
- if(j<=m)
- for(int k=j;k<=m;k++)
- {gin>>c2;
- if(c2%5==0)
- cout<<c2<<" ";}
- return 0;
- }
Add Comment
Please, Sign In to add comment