Jump to content

Terchea

Members
  • Posts

    16
  • Joined

  • Last visited

About Terchea

  • Birthday 09/08/1997

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

Terchea's Achievements

Newbie

Newbie (1/14)

10

Reputation

  1. asa cum reiese si din titlu, am nevoie de cat mai multe idei cum as putea face bani atat din domeniul it, *i`m beginner* dar sunt dispus sa invat.
  2. salut, ma poate ajuta cineva va rog frumos cu un root? multumesc anticipat!
  3. Sunt un impatimit al serialelor si m-ar ajuta mult un cont pe Filelist. As fi recunoscator pentru acea invitatie! Id-ul meu este: m.roxannes@yahoo.com Multumesc! // Sent
  4. salut, poti sa ma ajuti te rog cu un cont de minecraft?

  5. m.roxannes@yahoo.com mersi anticipat!
  6. parolele la yahoo in ce sunt cryptate? eJxjZGBguNAz9z6j6EXBniqGA/6Hpr9mBIqZfs22v7zxucfMvrevZrQIlQKFGJhABINAGpAAKlEAUnUyL5pl4gKP/yvPesfWf0ehrSFkpoCfrXjNAQvuKXuCHoDU8zVAtILURxyOMjLP/ye4kGWBTe7lG/rbfGcEqdtN2la/2fy/1der7gFANU7LFLZOsnrz/mFh0uk397p020M+CETY5FjmlJUk/3s/8bmTwexbPsYvl/5e7em0VyH9n/qdxOc
  7. #include<fstream> using namespace std; ifstream f("spirala.in"); ofstream g("spirala.out"); int a[101][101],n,m,x[10201],nrt; void cit(int a[101][101],int &n, int&m) { f>>n>>m; for(i=1;i<=n;i++) for(j=1;j<=m;j++) f>>a[j]; } void fv(int n, int m) { if(n<m)nrt=n/2; else nrt=m/2; } int rez(int a[][],int n, int m) { int i ,j, r=a[1][2]-a[1][1],t,Ok=1; for(t=1;t>=n-t+1&&Ok;t++) { for(j=t;j<=m-t+1;j++) if(a[t][j+1]-a[t][j]!=r) Ok=0; for(i=t;i<=n-t+1;i++) if(a[i+1][t]-a[t]!=r) Ok=0; for(j=m-t+1;j>=t;j--) if(a[n-t+1][j+1]-a[n-t+1][j]!=r) Ok=0; for(i=n-t+1;i>=t;i--) if(a[i+1][m-t+1]-a[m-t+1]!=r) Ok=0; } if(Ok) return a[nrt][n-t+1]; else return Nu; } int main() { cit(a[][],n,m); fv(n,m); rez(a[][],n,m); return 0; }
  8. salut, ma poate ajuta cineva va rog frumos cu problema asta? Spirala
  9. de ce nu imi da si restul datelor?
×
×
  • Create New...