Articolele lui Casian Filimon (eUREWREQRLIQ)

cashaajj

#include <iostream>
#include <vector>

bool estePrim(int numar) { if (numar < 2) { return false; } for (int i = 2; i * i <= numar; i++) { if (numar % i == 0) { return false; } } return true;
}

int main() { int n; std::cout << “Introduceti numarul de elemente: “; std::cin >> n;

std::vector<int> numere(n); std::cout << “Introduceti numerele: “; for (int i = 0; i < n; i++) { std::cin >> numere[i]; } int ultimaPozitie = -1; for (int i = 0; i < n; i++) { if (estePrim(numere[i])) { ultimaPozitie = i; } } if (ultimaPozitie != -1) { std::cout << “Ultima pozitie a ultimului numar prim este: “ << ultimaPozitie + 1 << std::endl; } else { std::cout << “Nu exista numere prime in lista data.” << std::endl; } return 0; }

#include <fstream>
using namespace std;
ifstream fin (“numere.in”);
ofstream fout(“numere.out”);
int main()
{int n,x,maxcif=0-1; fin>>n; for (int i=1;i<=n;i++) { fin>>x; while (x) {if (maxcif<x%10) maxcif=x%10; if (maxcif==9) break; x/=10;} fout<<maxcif<<’ ‘; } return 0;
}

Dacă vrei să scapi de acest program, trebuie să restartezi calculatorul. ™

#include<fstream>
using namespace std;

ifstream f(“numerus.in”);
ofstream g(“numerus.out”);
long n,i,k,a,b,l,c;

int main()
{ f>>k>>n; a=5*(k-1)+1;b=5*k; if(k%2==1){for(i=a;i<=b;i++) g<<i<<’ ‘; g<<b; } else{ g<<b<<’ ‘; for(i=b;i>=a;i—) g<<i<<’ ‘; } g<<’\n’; l=n/5; if(n%5!=0)l++; g<<l<<’\n’; if(n%5==0) if(l%2==0) g<<‘A’<<’ ‘<<‘B’; else g<<‘E’<<’ ‘<<‘F’; else if(l%2==1) {char c=‘A’+n%5-1;g<<c;} else{char c=‘F’-n%5+1;g<<c;} g<<’\n’; f.close(); g.close(); return 0;
}

#include <fstream>
using namespace std;

ifstream f(“magic.in”);
ofstream g(“magic.out”);
int n,i;
char c;
int x¹⁰;

int main()
{ f>>n; for(i=1;i<=n;i++) { f>>c; if(c>=‘a’ && c<=‘z’) g<<(char)(c-32); else x[c-48]=1; } g<<’\n’; if(x⁰!=0) { i=1; while(x[i]==0 && i<=9)i++; } if(i<=9){g<<i;x[i]=0;} for(i=0;i<=9;i++) if(x[i]) g<<i; f.close(); g.close(); return 0;
}

100 puncte: #BDFF7C
90 puncte: #DFF38C
80 puncte: #DFF38C
70 puncte: #FD0000
60 puncte: #FD0000
50 puncte: #FD0000
40 puncte: #B2D9FB
30 puncte: #B2D9FB
20 puncte: #B2D9FB
10 puncte: #F8BD96
0 puncte: #FF8279
Eroare de compilare: #FD9696

int main()
{ fin>>n>>x; for (int i=1; i<n; i++) { fin>>y; cx=x; cy=y; for (int j=0; j<=9; j++) frx[j]=fry[j]=0; while (cx) { frx[crx%10]=1; cx/=10; while (cy) { fry[cry%10]=1; cy/=10; } } for (j=0; j<=9; j++) { if(frx[j]==1 and fry [j]==1) { fout<<x<<’ ‘<<y<<’\n’; break; } }
}
x=y;
}

#include <fstream>
using namespace std;
ifstream fin (“ceas.in”);
ofstream fout (“ceas.out”);
int main()
{ long long int a,b,c,d,e; cin>>a>>b>>c>>d; e=60*c+d; if(a==12) a=0; while(e>0) { if (5*a==b) { e-=6; if(e>=0) b=b+1; } else { e—; b=b+1; }

if (b==60) { a=(a+1)%12; b=0; } } if(a==0) a=12; cout<<a<<” “<<b;

}

#include <fstream>
using namespace std;
ifstream fin (“ceas.in”);
ofstream fout (“ceas.out”);
int main()
{ long long int a,b,c,d,e; cin>>a>>b>>c>>d; e=60*c+d; if(a==12) a=0; while(e>0) { if (5*a==b) { e-=6; if(e>=0) b=b+1; } else { e—; b=b+1; }

if (b==60) { a=(a+1)%12; b=0; } } if(a==0) a=12; cout<<a<<” “<<b;

}